IJCSIS Papers by Nashwan Alromema
Modeling temporal database over relational database using 1NF model is considered the most popula... more Modeling temporal database over relational database using 1NF model is considered the most popular approach. This is because of the easy implementation as well as the modeling and querying power of 1NF model. In this paper, we compare a new approach for representing valid-time temporal database (in terms of structure and performance) to the main models in literature with attribute and tuple timestamping. The measurement of the performance is represented by the processing time to get the required temporal data as well as the size of the whole stored temporal data. A test has been performed by running sample queries for the same data in the represented models. Based on the tests, we have found that the new proposed model required less time and used less disk space. Therefore, it is more appropriate for modeling 1NF with interval-based timestamping in relational data model.
Papers by Nashwan Alromema
Recently, image encryption has taken an importance especially after the dramatic evolution of the... more Recently, image encryption has taken an importance especially after the dramatic evolution of the internet and network communication. The importance of securing the images contents is due to the simplicity of capturing and transferring of digital images in various communication media. Although there are many approaches for image encryptions, chaos-based image encryption approach is considered one of the most appropriate approaches because of its simplicity, security, and sensitivity to the input parameter. This research paper presents a new technique for encrypting RGB image components using nonlinear chaotic function and DNA sequence. A new image with the same dimensions of the plain-image is used as a key for confusions and diffusion process for each RGB components of plain-image. Experimental results show the efficiency of the proposed technique, simplicity, and high level of resistant against several cryptanalyst. Keywords—Chaos-based; image encryption; confusion; diffusion; col...
Applied Sciences
University education has become an integral and basic part of most people preparing for working l... more University education has become an integral and basic part of most people preparing for working life. However, placement of students into the appropriate university, college, or discipline is of paramount importance for university education to perform its role. In this study, various explainable machine learning approaches (Decision Tree [DT], Extra tree classifiers [ETC], Random forest [RF] classifiers, Gradient boosting classifiers [GBC], and Support Vector Machine [SVM]) were tested to predict students’ right undergraduate major (field of specialization) before admission at the undergraduate level based on the current job markets and experience. The DT classifier predicts the target class based on simple decision rules. ETC is an ensemble learning technique that builds prediction models by using unpruned decision trees. RF is also an ensemble technique that uses many individual DTs to solve complex problems. GBC classifiers and produce strong prediction models. SVM predicts the t...
International Journal of Advanced Computer Science and Applications
In the last four decades several dozens of representing time-oriented data/knowledge bases have b... more In the last four decades several dozens of representing time-oriented data/knowledge bases have been presented. Some of these representations violate First Normal Form (1NF) by using Non-First Normal Form (N1NF) prototypes and temporal nested representations, while others simulated the concepts of temporal data with relational data representation without violating 1NF. In this article, a new interval-based knowledge representational data model with an optimized retrieval techniques are employed for modeling and optimality retrieve a biomedical time-varying data (factors/observations that affect the diabetes). The used time-related data model is more compact to represent time-varying data with less memory (capacity) storage with respect to the main representations in the literature, but which is as expressive as those representations (a transformation algorithms show that data represented in this model can be transferred to/from the representations in the literature with zero percent loss of information). A new data structure is defined with the optimal retrieval techniques to prove some basic properties of the used time-model and to ensure that the time-model is an extension and reduction of the main representations in the literature, namely TQuel and BCDM. The expressive power, reducibility, and easy implementation of the proposed model, especially for the legacy systems, are considered as advantages of the proposed model.
Attaching Date and Time to varying data plays a definite role in representing a dynamic domain an... more Attaching Date and Time to varying data plays a definite role in representing a dynamic domain and resources on the database systems. The conventional database stores current data and can only represent the knowledge in static sense, whereas Time-varying database represents the knowledge in dynamic sense. This paper focuses on incorporating intervalbased timestamping in First Normal Form (1NF) data model. 1NF approach has been chosen for the easily implementation in relational framework as well as to provide the temporal data representation with the modeling and querying power of relational data model. Simulation results revealed that the proposed approach substantially improved the performance of temporal data representation in terms of required memory storage and queries processing time.
Computer Science and Engineering, 2012
The widely use of data digit ization leads to the necessity of hiding the content of a message wh... more The widely use of data digit ization leads to the necessity of hiding the content of a message when it enters an insecure channel. The message prepared by the sender is encrypted before transmission. The encryption process requires an encryption algorith m and a key. In image cryptography, recently numbers of effective chaos-based image encryption schemes have been proposed. This paper presents a novel image encryption scheme which encrypts the pixels' RGB component instead of the pixels itself, where every pixel in the image will be ext racted to its RGB triple, encrypted, and prepared to be transmitted. In the encryption process we use another image as a key, this image should be larger than or of the same size of the plain image that we intend to encrypt. The image encryption scheme introduced is based on chaotic systems. Simu lation results show that the proposed image encryption scheme achieves high level of security, and reduces the encryption and the decryption time of image data.
Problem statement: Many existing database applications manage time-varying data. These database a... more Problem statement: Many existing database applications manage time-varying data. These database applications are referred to as temporal databases or time-oriented database applications that are considered as repositories of time-dependent data. Many proposals have been introduced for developing time-oriented database applications, some of which suggest building support for Temporal Database Management Systems (TDBMS) on top of existing non-temporal DBMSs, while others suggest modifying the models of exiting DBMSs or building TDBMS from scratch. Approach: This study addressed several issues concerning developing a technique that enables database designers to understand the way in which time-varying behavior can be modeled and mapped into tabular form. Results: Conventional DBMSs do not have the capability to record and process time-varying aspects of the real world. With growing sophistication of DBMS applications, the lack of temporal support in conventional DBMS raises serious pro...
Problem statement: In the field of database technology, Recoding time related data are referred t... more Problem statement: In the field of database technology, Recoding time related data are referred to as temporal databases. Conventional relational databases are queried using the underlying constructs of SQL which are translated into Relational Algebra (RA). Relational Algebra (RA) is the writing of logical expressions that uses a set of relational operators to perform operations on specific relation(s) and returns results as relation. RA operations are not applied on querying temporal database, because temporal database holds a sequence of snapshot relations. Approach: This study focuses on the retrieval of temporal database, by extending RA to TRA. TRA is involved to help querying temporal database that is modeled using Tuple Timestamp Historical Relation (TTHR) Model. Results: A technique for querying temporal database modeled by TTHR is the topic of this study. We examine the current issues and problems in temporal database and propose data retrieval optimization technique for temporal database. Conclusion: We proposed a data retrieval optimization technique for querying temporal database; this technique applies for the temporal database applications that are modeled by TTHR.
Uploads
IJCSIS Papers by Nashwan Alromema
Papers by Nashwan Alromema