Статьи журнала - International Journal of Modern Education and Computer Science
Все статьи: 1064
Статья научная
At present trillion of bytes of information is being created by projects particularly in web. To accomplish the best choice for business benefits, access to that information in a very much arranged and intuitive way is dependably a fantasy of business administrators and chiefs. Information warehouse is the main feasible arrangement that can bring the fantasy into reality. The upgrade of future attempts to settle on choices relies on upon the accessibility of right data that depends on nature of information basic. The quality information must be created by cleaning information preceding stacking into information distribution center following the information gathered from diverse sources will be grimy. Once the information have been pre-prepared and purified then it produces exact results on applying the information mining question. There are numerous cases where the data is sparse in nature. To get accurate results with sparse data is hard. In this paper the main goal is to fill the missing values in acquired data which is sparse in nature. Precisely caution must be taken to choose minimum number of text pieces to fill the holes for which we have used Jaccard Dissimilarity function for clustering the data which is frequent in nature.
Бесплатно
Статья научная
According to the survey of World Health Organization (WHO), the number of people getting affected by glaucoma eye disease in worldwide will be 79.11 million by the year 2020. Glaucoma is a dangerous eye disease, which can lead to permanent vision loss if not provided proper treatment at the right time. Currently ophthalmologists detect the glaucoma disease based on estimation of cup to disk ratio, but this method suffers from accurate segmentation of regions like optic disk and optic cup. However, this introduces errors in the diagnosis. Therefore in this paper, Hausdrop Fractal Dimension (HFD) technique is adopted for identification of the glaucoma eye disease. Here, Optic disk perimeter parameter is used in HFD technique for classification of healthy or glaucomatous retinas. Average fractal dimension is calculated for a set of healthy optic disks and the fractal dimension is found to be 0.998, whereas for glaucomatous optic disks obtained average fractal dimension value 1.342.
Бесплатно
A Novel Approach for Optimization Auto-Scaling in Cloud Computing Environment
Статья научная
In recent years, applications of cloud services have been increasingly expanded. Cloud services, are distributed infrastructures which develop the communication and services. Auto scaling is one of the most important features of cloud services which dedicates and retakes the allocated dynamic resource in proportion to the volume of requests. Scaling tries to utilize maximum power of the available resources also to use idle resources, in order to maximize the efficiency or shut down unnecessary resources to reduce the cost of running requests. In this paper, we have suggested an approach based on learning automata auto- scaling, in order to manage and optimize factors like cost, rate of violations of user-level agreements (SLA Violation) as well as stability in the presence of traffic workload. Results of simulation show that proposed approach has been able to optimize cost and rate of SLA violation in order to manage their trade off. Also, it decreases number of operation needed for scaling to increase stability of system compared to the other approaches.
Бесплатно
Статья научная
In this paper, a hybrid classifier using fuzzy clustering and several neural networks has been proposed. With using the fuzzy C-means algorithm, training samples will be clustered and the inappropriate data will be detected and moved to another dataset (Removed-Dataset) and used differently in the classification phase. Also, in the proposed method using the membership degree of samples to the clusters, the class of samples will be changed to the fuzzy class. Thus, for example in KDD cup99 dataset, any sample will have 5 membership degrees to classes DoS, Probe, Normal, U2R, and R2L. Afterwards, the neural networks will be trained by new labels then using a combination of regression and classification methods, the hybrid classifier will be created. Also to classify the outlier data, a fuzzy ARTMAP neural network is employed which is a part of the hybrid classifier. Evaluation of the proposed method is performed by KDDCup99 dataset for intrusion detection and Cambridge datasets for traffic classification problems. Our experimental results indicate that the proposed system has performed better than the previous works in the case of precision, recall and f-value also detection and false alarm rate. Also, ROC curve analysis shows that the proposed hybrid classifier has been better than the famous non-hybrid classifiers.
Бесплатно
A Novel Hybrid Flower Pollination Algorithm with Chaotic Harmony Search for Solving Sudoku Puzzles
Статья научная
Flower Pollination algorithm (FPA) is a new nature-inspired algorithm, based on the characteristics of flowering plants.In this paper, a new hybrid optimization method called improved Flower Pollination Algorithm with Chaotic Harmony Search (FPCHS) is proposed. The method combines the standard Flower Pollination algorithm (FPA) with the chaotic Harmony Search (HS) algorithm to improve the searching accuracy. The FPCHS algorithm is used to solve Sudoku puzzles. Numerical results show that the FPCHS is accurate and efficient in comparison with standard Harmony Search, (HS) algorithm.
Бесплатно
A Novel Image Encryption Scheme Based on Multi-orbit Hybrid of Discrete Dynamical System
Статья научная
A multi-orbit hybrid image encryption scheme based on discrete chaotic dynamical systems is proposed. One generalized Arnold map is adopted to generate three orbits for three initial conditions. Another chaotic dynamical system, tent map, is applied to generate one pseudo-random sequence to determine the hybrid orbit points from which one of the three orbits of generalized Arnold map. The hybrid orbit sequence is then utilized to shuffle the pixels' positions of plain-image so as to get one permuted image. To enhance the encryption security, two rounds of pixel gray values' diffusion is employed as well. The proposed encryption scheme is simple and easy to manipulate. The security and performance of the proposed image encryption have been analyzed, including histograms, correlation coefficients, information entropy, key sensitivity analysis, key space analysis, differential analysis, etc. All the experimental results suggest that the proposed image encryption scheme is robust and secure and can be used for secure image and video communication applications.
Бесплатно
A Novel Minimized Computational Time Based Encryption and Authentication Using ECDSA
Статья научная
Providing the security on the basis of encryption standards is considered as key challenges for achieving the integrity & confidentiality. There are three main public-key cryptosystem contenders. Each has a variable key size that can be increased to achieve higher security at the cost of slower cryptographic operations. The best attack known on each public-key cryptosystem requires an amount of computation determined by a security parameter which is related to the key size. The secondary factor is confidentiality i.e. ensuring that adversaries gain no intelligence from a transmitted message. There are two major techniques for achieving confidentiality: This work proposes a novel prototype ECDSA which provides the security where there is not complete trust between documents' sender and receiver & something more than authentication is needed. The signature is formed by taking the hash of the message and encrypting the message with the creator's private key. It guarantees the source and integrity of the message. Then a suitable digital signature algorithm will be picked out as a result of comparing and analyzing three main digital signature algorithms in this paper. Finally, a scheme of digital signature in electronic government will be proposed in order to settle some specific problems such as spilling out the secret, forging or denial and so on. Besides, a brief analysis regarding security will be given for this scheme.
Бесплатно
A Novel Mutual RFID Authentication Protocol with Low Complexity and High Security
Статья научная
Radio Frequency Identification (RFID) is a method for automated identifying objects. One of the problems of this technology is its security. RFID tags include resource limitation; therefore, the system designers cannot implement complex circuits to enhance their security. Usually the symmetric and asymmetric encryption methods increase resources and cost. Because it is believed to increasing security is inconsistent with the simplicity, the researchers mostly use one-way encryption methods. In this paper, we propose a mutual authentication protocol based on public key cryptography. The used encryption method includes high security and low complexity. This protocol performs in few steps and is suitable for portable devices with power limitation. In terms of security, the proposed protocol is robust against known attacks. In addition, we prove the protocol is secure by an analytical method.
Бесплатно
A Novel Quaternary Full Adder Cell Based on Nanotechnology
Статья научная
Binary logic circuits are limited by the requirement of interconnections. A feasible solution is to transmit more information over a signal line and utilizing multiple-valued logic (MVL). This paper presents a novel high performance quaternary full adder cell based on carbon nanotube field effect transistor (CNTFET). The proposed Quaternary full adder is designed in multiple valued voltage mode. CNTFET is a promising candidate for replacing MOSFET with some useful properties, such as the capability of having the desired threshold voltage by regulating the diameters of the nanotubes, which make them very appropriate for voltage mode multiple threshold circuits design. The proposed circuit is examined, using Synopsys HSPICE with the standard 32 nm CNTFET technology with different temperatures and supply voltages.
Бесплатно
A Novel Radiation Hardened Parallel IO Port for Highly Reliable Digital IC Design
Статья научная
This article proposes a radiation hardened parallel IO port capable of tolerating radiation induced soft errors including single event upsets (SEUs) as well as single event transients (SETs). To investigate the soft error tolerance capability of the proposed design, we simulated it using the Cadence tool and showed its offered advantages. Comparing with the conventional and well-known TMR IO port, the proposed architecture results in less hardware redundancy and design cost. Through an analytical analysis, we also showed that, our design has lower failure probability than the TMR approach. It also is notable that, among the considered previous counterparts, our proposed design is the only one that is capable of tolerating both the SEUs and SETs.
Бесплатно
A Novel Reduced-Precision Fault-Tolerant Floating-Point Multiplier
Статья научная
This paper presents a new fault-tolerant architecture for floating-point multipliers in which the fault-tolerance capability is achieved at the cost of output precision reduction. In this approach, to achieve the fault-tolerant floating-point multiplier, the hardware cost of the primary design is reduced by output precision reduction. Then, the appropriate redundancy is utilized to provide error detection/correction in such a way that the overall required hardware becomes almost the same as the primary multiplier. The proposed multiplier can tolerate a variety of permanent and transient faults regarding the acceptable reduced precisions in many applications. The implementation results reveal that the 17-bit and 14-bit mantissas are enough to obtain a floating-point multiplier with error detection or error correction, respectively, instead of the 23-bit mantissa in the IEEE-754 standard-based multiplier with a few percent area and power overheads.
Бесплатно
A Novel Technique for Copyright Protection of Images Using Hybrid Encryption Model
Статья научная
In this paper, we present a robust and novel strategic invisible watermarking scheme which can be used in the field of copyright protection. The novelty of our algorithm lies in the creation of a compound watermark image using the target image and the key image, where both of them are self encrypted. The self encryption concept adds an extra level of data security along with the security supported by the watermarking technique. Again, our method results a single invisible watermarked image which will be sent to the recipient and from that image, both the key and the target image can be extracted with no distortion using only the proposed extraction algorithm. Results of exhaustive experimentation using standard input color images demonstrate the robustness and efficiency of our approach.
Бесплатно
A Novel Testing Model for SOA based Services
Статья научная
SOA (Service-Oriented Architecture) filled the gap between software and commercial enterprise. SOA integrates multiple web services. We bear to secure the caliber of web services that gives guarantee about what network services work and their output results. There is close to work has to be performed for an automatic test case generation for SOA based services. But, full coverage of XML elements is missing. To the best of our knowledge this all works do not attempt to cover all possible elements of the XML schema presents in the WSDL file. There is also a need to apply different assertions on each service operation for generating the test cases. To overcome this problem we proposed a novel testing model for SOA based application. This new testing model helps us to get the automatic test cases of SOA based application. We build up our new test model with the aid of our proposed test case generation algorithm and test case selection algorithm. In the end, we generate the test suite execution results and find the coverage of XML schema elements present in the WSDL file.
Бесплатно
A Novel Web Page Change Detection Approach using Sql Server
Статья научная
The WWW is very dynamic in nature and is basically used for the exchange of information or data, the content of web page is added, changed or deleted continuously, which makes Web crawlers very challenging to keep refresh the page with the current version. The web page is frequently changes its content hence it becomes essential to develop an effective system which could detect these types of changes efficiently in the lowest browsing time to achieve this changes. In this chapter we compare the old web page hash value with the new web page hash value if hash value is changed that means web page content changed. The changes in web page can be detected by calculating the hash value which is unique.
Бесплатно
A Novel framework for Strategic Alliance of Knowledge Management Systems
Статья научная
Knowledge is the primary strategic resource of many organizations. Knowledge management system (KMS) is a process of knowledge extraction, storage, transformation, analysis, distribution and deployment. Strategic alliance plays an increasing role to a global scale in technology business competition. Organizations are able to use alliances to respond to new technology and deliver new products more efficiently. The relationship between knowledge management and strategic alliance is identified. Knowledge transfer and selecting suitable partner are critical factors in the success of strategic alliance of an organization. In this paper, a novel framework is proposed for KMS strategic alliance. By applying this framework, strategic alliance will be highly achievable in corporate companies.
Бесплатно
A Performance Analysis of the Impact of Prior-Knowledge on Computational Thinking
Статья научная
Previously acquired knowledge plays a significant role to learn new knowledge and skills. Previously acquired knowledge consists of Short-term memory and Long-term memory. Though it is a well-accepted learning phenomenon, it is challenging to empirically analyse the impact of prior knowledge on learning. In this paper, we use two systems models for human thinking proposed by Nobel Laureate Prof. Daniel Kahneman. This is a model for human cognition which uses two systems of thinking—the first being quick and intuitively known as fast thinking and the second being slow and tedious known as slow thinking. While slow thinking uses long-term memory, fast thinking uses short-term memory. The impact of prior knowledge of programming language is analyzed to learn a new programming language. We assigned a learning task to two different groups with one having learnt a programming language i.e. senior students and the second group without any prior knowledge of programming language i.e. freshers. The impact of prior knowledge is measured and compared against the time taken to answer quizzes.
Бесплатно
Статья научная
Clustering is one of the primary functions in data mining explorations and statistical data analysis which widely used in various fields. There are two types of the clustering algorithms which try to optimize certain objective function, i.e. the hierarchical and partitional clustering. This study focuses on the achievement of the best cluster results of the hard and soft clustering (K-Mean, FCM, and SOM clustering). The validation index called GOS (Global Optimum Solution) used to evaluate the cluster results. GOS index defined as a ratio of the distance variance within a cluster to the distance variance between clusters. The aim of this study is to produce the best GOS index through the use of the proposed method called the scattered averaging technique based on datasets for the cluster center initialization. The cluster results of each algorithm are also compared to determine the best GOS index between them. By using the annual rainfall data as the dataset, the results of this study showed that the proposed method significantly improved K-Mean clustering ability to achieve the global optimum solution with a performance ratio of 69.05% of the total performance of the three algorithms. The next best clustering algorithm is SOM clustering (24.65%) followed by FCM clustering (6.30%). In addition, the results of this study also showed that the three clustering algorithms achieve their best global optimum solution at the number of even clusters.
Бесплатно
Статья научная
Inertial measurement units based on microelectromechanical systems are perspectives for motion capture applications due to their numerous advantages. A motion trajectory is restored using a well-known navigation algorithm, which assumes integration of the signals from accelerometers and gyroscopes. Readings of both sensors contain errors, which quickly accumulate due to integration. The applicability of an inertial measurement unit for motion capture depends on the trajectory being tracked and can be predicted due to the simulation of signals from inertial sensors. The first simulation step is prescribing a motion trajectory and corresponding velocities. The existing simulation software provides no user-friendly graphical tools for the completion of this step. This work introduces an algorithm for the simulation of accelerometer signals upon a two-dimensional trajectory drawn with a computer mouse and then vectorized. We propose a modification of the Potrace algorithm for tracing motion trajectories. Thus, a trajectory and velocities can be set simultaneously. The obtained results form a basis for simulating three-dimensional motion trajectories since the latter can be represented by three mutually orthogonal two-dimensional projections.
Бесплатно
A Proposal for Improving Behavioral Adaptation of Web Services Integration
Статья научная
Reuse of existing software components is the main goal of Component-Based Software Engineering. Different organizations designed different web-services as the most famous type of component. Adaptation is a critical issue when building new applications by reusing existing services. How to adapt these services to work correctly is the main goal of most of the proposed models and techniques in software component filed. Behavioral mismatches are one of the adaptation problems. Different solutions have been written to address this problem like adapter and some other techniques. Most of the papers focused on how to create the adapter to overcome the incompatibility problem. In this paper, the authors provide a simple integrated tool that can solves ordering mismatching. The results are concluded using a survey from thirty one respondents. The proposed solution needs further validation by conducting a case study.
Бесплатно
A Proposed Algorithm for Assessing and Grading Automatically Student UML Diagrams
Статья научная
Digital technologies and innovative methods have shown a significant impact on educational systems, and have made work easier for both learners and teachers. Additionally, they have improved the quality and the capability to digitize the assessment of student work produced during a learning process. Assessing and scoring students’ UML diagrams has become a challenging task for teachers, especially with the growing number of students, as well as the necessity to better manage their time. Consequently, there will be a necessity to automate the assessment of these learners. This paper presents an approach for assessing and grading automatically the student’s UML diagrams. The approach uses an algorithm implemented in Java, which takes the tutor's and student's solution diagrams as input, then provides the student's scores and identifies differences and errors made. Our algorithm was tested and evaluated in a real case within a web platform, and the results obtained demonstrate the effectiveness of our solution.
Бесплатно
