Cornelia Gyorodi

A comparative study: MongoDB vs. MySQL

In this paper we will try to present a comparative study of non-relational databases and relational databases. We mainly focus our presentation on one implementation of the NoSQL database technology, namely MongoDB, and make a comparison with another implementation of relational databases, namely MySQL, and thus justifying why MongoDB is more efficient than MySQL. We will also present the advantages of using a non-relational database compared to a relational database, integrated in a forum in the field of personal and professional development. The NoSQL database used to develop the forum is MongoDB, and was chosen from a variety of non-relational databases, thanks to some aspects that we will highlight in this article. The database integration in the framework will also be presented.

On Establishing and Fixing a Parallel Session Attack in a Security Protocol

Nowadays mobile and fixed networks are trusted with highly sensitive information, which must be protected by security protocols. However, security protocols are vulnerable to a host of subtle attacks, such as replay, parallel session and type-flaw attacks. Designing protocols to be impervious to these attacks has been proven to be extremely challenging and error prone.

Interpolative control algorithm applied on a 3D-mechatronic system

The study presented in the paper aims to investigate the control performances of an interpolative control algorithm applied on a complex nonlinear system. In the specified context, the study was made based on results obtained through simulations on a 3D-Crane. The results were compared with data obtained from a classical PID system that also incorporates the 3D-Crane.

AFOPT algorithm for multilevel databases

With the widespread computerization in business, government, and science, the efficient and effective discovery of interesting information from large databases becomes essential. Previous studies on data mining have been focused on the discovery of knowledge at single conceptual level, either at the primitive level or at a rather high conceptual level. This paper presents an algorithm based on the AFOPT algorithm for multilevel databases that uses the benefits of multileveled databases, by using the information gained by studying items from one concept level for the study of the items from the following concept levels.

A Comparative Study Between the Capabilities of MySQl Vs. MongoDB as a Back-End for an Online Platform

In this article we present a comparative study between the usage capabilities of MongoDB, a non-relational database, and MySQL’s usage capabilities, a relational database, as a back-end for an online platform. We will also present the advantages of using a non-relational database, namely MongoDB, compared to a relational database, namely MySQL, integrated in an online platform, which allows users to publish different articles, books, magazines and so on, and also gives them the possibility to share online their items with other people. Nowadays, most applications have thousands of users that perform operations simultaneously thus, it takes more than one operation to be executed at a time, to really see the differences between the two databases. This paper aims to highlight the differences between MySQL and MongoDB, integrated in an online platform, when various operations were executed in parallel by many users.

New method of detection and wiping of sensitive information

One of the biggest problems in sensitive data wiping is to determine if a file is sensitive or not. Data wiping applications have improved a lot, but they cannot determine by themselves if a file is sensitive. The method we propose tries to determine if a file is sensitive by using a pre-defined set of rules initially specified by the user. These rules can update themselves in time, by “learning” from data patterns in previous sensitive files. The hard drive is monitored continuously to detect new sensitive data. Also, our method replaces the standard delete function from Windows with a secure wiping algorithm (overwriting data several times with pre-defined passes), but only for files that are determined to be sensitive.

An improved hebbian neural network with dynamic neuronal life and relations

In the last years, artificial intelligence has been an important field as the environments in which human-made devices have to operate become more and more complex, and designing a new algorithm for each environment can be very time and resources consuming. Neural networks have been successful in a lot of applications, since the same basic implementation can be used in a virtually unlimited number of situations, by modifying the structure of the network and the tests that are used for constructing it. In this paper we present an improved hebbian neural network that has the capability of adding new neurons to it and can connect neurons using an association rule. Since the main problem in neural network design is the actual construction of the inter-neuronal relations, we try to solve this issue at least partially by allowing the network to modify itself depending on its response to different stimuli.

Applying a pattern length constraint on the FP-Growth algorithm

With the ever-growing database sizes, we have enormous quantities of data, but unfortunately we cannot use raw data in our day-to-day reasoning/decisions. We desperately need knowledge. This knowledge is in most cases in the gathered data, but the extraction of it is a very time and resources consuming operation. In this paper we propose an improvement of the FP-Growth algorithm that focuses on applying a pattern-length constraint on the FP-Growth algorithm. This is, mining only frequent patterns with their length belonging in an interval selected by the user. The algorithm with this constraint applied can be used when only patterns with specific lengths are interesting for the user. The main advantage of running the algorithm with the length limitation instead of the classic FP-Growth algorithm is that the running time of the former is smaller, thus, the required information can be obtained in a shorter time.

Redundancy method used in PLC related applications

PLC related applications are more complex as far as more components are involved. If some error occurs, diagnosis can take some time, but a logical procedure will shorten the time needed to locate the fault. The probability of failure of different parts of typical PLC systems shows [1] that 95% of PLC systems are external faults and occur on plant items such as: sensors, actuators, transducers, limit switchers, and others. The possibility of determining the validity of the data gathered from all transducers of the control system assures a way of short time fault detection. Consequently, a fault-tolerant control system must be implemented using redundant structures, representing an alternative for malfunctioning element detection. This paper presents a method used to design and implement a control system based on redundant structures. A case study for the geothermal power plant at the University of Oradea was developed. The redundant structure considered was simulated using MathLab/Simulink and analyzed using different scenarios. Finally, a possible implementation of resulting control system structure is done using a programmable logical controller (PLC).

Real Time Computation for Robotic Arm Motion upon a Linear or Circular Trajectory

The computation method proposed in this paper, named ADNIA (Analysis Differential Numeric Interpolate Algorithms), computes waypoints Cartesian coordinates for TCP (tool centre point) of a robotic arm, for a motion on an linear or circular imposed trajectories. At every sampling period of time, considering real-time software implementation of ADNIA, the location matrix of a robotic arm is computed. This computation method works with a well-defined value of motion speed; it results a maximum computation precision (for those motions).