The Experts below are selected from a list of 315 Experts worldwide ranked by ideXlab platform
Bill P Buckles - One of the best experts on this subject based on the ideXlab platform.
-
extension of the relational Database and its algebra with rough set techniques
Computational Intelligence, 1995Co-Authors: Theresa Beaubouef, Frederick E Petry, Bill P BucklesAbstract:This paper describes a Database Model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational Database Model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational Database Model can more accurately Model an enterprise than does the standard relational Model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational Database. In addition, applications inherently rough could be more easily implemented and maintained in the rough relational Database.
Ebrahim Akhavan Bazofti - One of the best experts on this subject based on the ideXlab platform.
-
A New Secure Database Model Based on the Hash Algorithm and Cellular Automata
2016Co-Authors: V. Malakooti, Ebrahim Akhavan BazoftiAbstract:Abstract- In this paper, we have developed a robust encryption system for the Database tables based on the orthogonal transform to increase the security of its content. We also presented a secure Database Model based on the hash algorithm and a cellular automaton to turn on the attack alarm while the Database is unlocked and in active mode but it is accessed by illegal user. Our proposed encryption and decryption algorithm is categorized as symmetric cryptography in which a common key is used for both encryption and decryption processes as oppose to asymmetric one that two keys, private and public key, are required. We have used the property of orthogonal matrix to calculate the inverse of the transformation matri
-
a new secure Database Model based on the hash algorithm and cellular automata
International Conference on Electrical and Electronics Engineering, 2013Co-Authors: Mohammad V Malakooti, Ebrahim Akhavan BazoftiAbstract:In this paper, we have developed a robust encryption system for the Database tables based on the orthogonal transform to increase the security of its content. We also presented a secure Database Model based on the hash algorithm and a cellular automaton to turn on the attack alarm while the Database is unlocked and in active mode but it is accessed by illegal user. Our proposed encryption and decryption algorithm is categorized as symmetric cryptography in which a common key is used for both encryption and decryption processes as oppose to asymmetric one that two keys, private and public key, are required. We have used the property of orthogonal matrix to calculate the inverse of the transformation matrix based on its matrix transpose rather than direct calculation of its inverse during the decryption process to speed up the operations. We have generated a secret key sequence to apply the XOR operations on the data elements of all tables in the Database during the encryption and decryption processes. We used Malakooti Orthogonal Transform (M-T) and the internal rules of cellular automata to encrypt the data elements inside the Database through a proper method with a high degree of security. The Encrypted Database elements can only be displayed when the XOR operation is applied on these data elements and the secret keys generated by Malakooti Key Generator algorithm. Our algorithm is able to encrypt the data elements of each table inside the Database with a high degree of security. In addition, our proposed method can be applied to all data elements of the Database kept on servers as the backup and archive. Using orthogonal transformation (M-T) and proposed highly strong and irreversible hash algorithm, we have introduced a new secure Database Model to protect the vital information online and inside the Database servers from the illegal users and hackers.
-
a new secure Database Model based on the hash algorithm and
2013Co-Authors: Mohammad V Malakooti, Ebrahim Akhavan BazoftiAbstract:In this paper, we have developed a robust encryption system for the Database tables based on the orthogonal transform to increase the security of its content. We also presented a secure Database Model based on the hash algorithm and a cellular automaton to turn on the attack alarm while the Database is unlocked and in active mode but it is accessed by illegal user. Our proposed encryption and decryption algorithm is categorized as symmetric cryptography in which a common key is used for both encryption and decryption processes as oppose to asymmetric one that two keys, private and public key, are required. We have used the property of orthogonal matrix to calculate the inverse of the transformation matrix based on its matrix transpose rather than direct calculation of its inverse during the decryption process to speed up the operations. We have generated a secret key sequence to apply the XOR operations on the data elements of all tables in the Database during the encryption and decryption
Theresa Beaubouef - One of the best experts on this subject based on the ideXlab platform.
-
extension of the relational Database and its algebra with rough set techniques
Computational Intelligence, 1995Co-Authors: Theresa Beaubouef, Frederick E Petry, Bill P BucklesAbstract:This paper describes a Database Model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational Database Model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational Database Model can more accurately Model an enterprise than does the standard relational Model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational Database. In addition, applications inherently rough could be more easily implemented and maintained in the rough relational Database.
Kupsze Choi - One of the best experts on this subject based on the ideXlab platform.
-
alternatives to relational Database comparison of nosql and xml approaches for clinical data storage
Computer Methods and Programs in Biomedicine, 2013Co-Authors: Ken Kayin Lee, Waichoi Tang, Kupsze ChoiAbstract:Clinical data are dynamic in nature, often arranged hierarchically and stored as free text and numbers. Effective management of clinical data and the transformation of the data into structured format for data analysis are therefore challenging issues in electronic health records development. Despite the popularity of relational Databases, the scalability of the NoSQL Database Model and the document-centric data structure of XML Databases appear to be promising features for effective clinical data management. In this paper, three Database approaches - NoSQL, XML-enabled and native XML - are investigated to evaluate their suitability for structured clinical data. The Database query performance is reported, together with our experience in the Databases development. The results show that NoSQL Database is the best choice for query speed, whereas XML Databases are advantageous in terms of scalability, flexibility and extensibility, which are essential to cope with the characteristics of clinical data. While NoSQL and XML technologies are relatively new compared to the conventional relational Database, both of them demonstrate potential to become a key Database technology for clinical data management as the technology further advances.
P. Obložinský - One of the best experts on this subject based on the ideXlab platform.
-
evaluation of tungsten isotopes in the fast neutron range including cross section covariance estimation
INTERNATIONAL CONFERENCE ON NUCLEAR DATA FOR SCIENCE AND TECHNOLOGY 2007; NICE FRANCE; 20070422 through 20070427, 2007Co-Authors: Roberto Capote, Andrej Trkov, M Herman, B V Carlson, P. ObložinskýAbstract:New evaluations for the tungsten isotopes {sup 180,182,183,184,186}W in the neutron energy range up to 60 MeV were produced. In the resonance range only minor adjustments to the resonance parameters were made due to a lack of adequate experimental data. Evaluations in the fast energy region were based on nuclear Model calculations using the EMPIRE-2.19 code. Recently derived dispersive coupled-channel optical Model potentials for W and Ta isotopes were instrumental to achieve a very good description of the available microscopic cross-section Database. Model covariance data were generated with the Monte Carlo technique to produce a prior estimate for the covariance matrix. Experimental data were introduced through the GANDR system. The evaluated files were tested on selected fusion neutronics benchmarks and showed marked improvement compared to other existing evaluations.
-
evaluation of tungsten isotopes in the fast neutron range including cross section covariance estimation
INTERNATIONAL CONFERENCE ON NUCLEAR DATA FOR SCIENCE AND TECHNOLOGY 2007; NICE FRANCE; 20070422 through 20070427, 2007Co-Authors: Roberto Capote, Andrej Trkov, M Herman, B V Carlson, M Sin, P. ObložinskýAbstract:New evaluations for the tungsten isotopes {sup 180,182,183,184,186}W in the neutron energy range up to 60 MeV were produced. In the resonance range only minor adjustments to the resonance parameters were made due to a lack of adequate experimental data. Evaluations in the fast energy region were based on nuclear Model calculations using the EMPIRE-2.19 code. Recently derived dispersive coupled-channel optical Model potentials for W and Ta isotopes were instrumental to achieve a very good description of the available microscopic cross-section Database. Model covariance data were generated with the Monte Carlo technique to produce a prior estimate for the covariance matrix. Experimental data were introduced through the GANDR system. The evaluated files were tested on selected fusion neutronics benchmarks and showed marked improvement compared to other existing evaluations.
