Статьи журнала - International Journal of Modern Education and Computer Science

Все статьи: 968

A Novel Minimized Computational Time Based Encryption and Authentication Using ECDSA

A Novel Minimized Computational Time Based Encryption and Authentication Using ECDSA

Reenu Shukla, Rajat Bhandari

Статья научная

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

A Novel Mutual RFID Authentication Protocol with Low Complexity and High Security

Samad Rostampour, Mojtaba Eslamnezhad Namin, Mehdi Hosseinzadeh

Статья научная

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

A Novel Quaternary Full Adder Cell Based on Nanotechnology

Fazel Sharifi, Mohammad Hossein Moaiyeri, Keivan Navi

Статья научная

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

A Novel Radiation Hardened Parallel IO Port for Highly Reliable Digital IC Design

Nastaran Rajaei, Ramin Rajaei

Статья научная

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

A Novel Reduced-Precision Fault-Tolerant Floating-Point Multiplier

Maryam Mohajer, Mojtaba Valinataj

Статья научная

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

A Novel Technique for Copyright Protection of Images Using Hybrid Encryption Model

Swarnendu Mukherjee, Debashis Ganguly, Partha Mukherjee, Prasenjit Mitra

Статья научная

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

A Novel Testing Model for SOA based Services

Abhishek Kumar

Статья научная

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

A Novel Web Page Change Detection Approach using Sql Server

Abu Kausar, V. S. Dhaka, Sanjeev Kumar Singh

Статья научная

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

A Novel framework for Strategic Alliance of Knowledge Management Systems

Suzan Bandar Al-mutairi, M. Rizwan Jameel Qureshi

Статья научная

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 of the Scattered Averaging Technique based on the Dataset for the Cluster Center Initialization

A Performance of the Scattered Averaging Technique based on the Dataset for the Cluster Center Initialization

Arief Bramanto Wicaksono Putra, Achmad Fanany Onnilita Gaffar, Bedi Suprapty, Mulyanto

Статья научная

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.

Бесплатно

A Potrace-based Tracing Algorithm for Prescribing Two-dimensional Trajectories in Inertial Sensors Simulation Software

A Potrace-based Tracing Algorithm for Prescribing Two-dimensional Trajectories in Inertial Sensors Simulation Software

Bohdan R. Tsizh, Tetyana A. Marusenkova

Статья научная

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

A Proposal for Improving Behavioral Adaptation of Web Services Integration

M. Rizwan Jameel Qureshi, Alaa Ahmed Almarzuki

Статья научная

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 Model for IT Disaster Recovery Plan

A Proposed Model for IT Disaster Recovery Plan

Hossam Abdel Rahman Mohamed

Статья научная

IT disaster recovery planning is no longer an option. Reliable IT services have become an integral part of most business processes. To ensure the continued provision of information technology, firms must engage in IT disaster recovery planning. Surprisingly, there is little research on this topic. IT disaster recovery planning has not been fully conceptualized in mainstream IT research. A previously framework for assessing the degree of IT disaster recovery planning. Practitioners can use this study to guide IT disaster recovery planning. Our Disaster Recovery Plan is designed to ensure the continuation of vital business processes in the event that a disaster occurs. This plan will provide an effective solution that can be used to recover all vital business processes within the required time frame using vital records that are stored off-site. This Plan is just one of several plans that will provide procedures to handle emergency situations. These plans can be utilized individually but are designed to support one another. The first phase is a Functional Teams and Responsibilities the Crisis Management Plan. This phase allows the ability to handle high-level coordination activities surrounding any crisis situation. We will also discuss the development, finally maintenance and testing of the Disaster Recovery Plan.

Бесплатно

A Proposed Modification of K-Means Algorithm

A Proposed Modification of K-Means Algorithm

Sharfuddin Mahmood, Mohammad Saiedur Rahaman, Dip Nandi, Mashiour Rahman

Статья научная

K-means algorithm is one of the most popular algorithms for data clustering. With this algorithm, data of similar types are tried to be clustered together from a large data set with brute force strategy which is done by repeated calculations. As a result, the computational complexity of this algorithm is very high. Several researches have been carried out to minimize this complexity. This paper presents the result of our research, which proposes a modified version of k-means algorithm with an improved technique to divide the data set into specific numbers of clusters with the help of several check point values. It requires less computation and has enhanced accuracy than the traditional k-means algorithm as well as some modified variant of the traditional k-Means.

Бесплатно

A Pure EBMT Approach for English to Hindi Sentence Translation System

A Pure EBMT Approach for English to Hindi Sentence Translation System

Ruchika A. Sinhal, Kapil O. Gupta

Статья научная

The paper focuses on Example Based Machine Translation (EBMT) system that translates sentences from English to Hindi. It uses the parallel corpus for translating sentences. Development of a machine translation (MT) system typically demands a large volume of computational resources. Requirement of computational resources (for example, rules) is much less in respect of EBMT. This makes development of EBMT systems for English to Hindi translation feasible, where availability of large-scale computational resources is still scarce. Example based machine translation relies on the database for its translation. The frequency of word occurrence is important for translation in EBMT in the following research.

Бесплатно

A Quantitative Analysis of Postgraduate Programmes Admission of the Hong Kong Institute of Education

A Quantitative Analysis of Postgraduate Programmes Admission of the Hong Kong Institute of Education

Qing-Yun Li

Статья научная

This paper analyzed 8 years' student admission trend of Hong Kong Institute of Education (HKIEd) postgraduate programmes in 2 time slots. In the first time period, year 2007-2010, we use the waterfall and competing pattern model for the quantitative analysis of the postgraduate programmes in a holistic manner of HKIEd, and further study the general student admission trend of year 2011-2013, due to the sharp increase of mainland China students and the 3-3-4 Scheme Education System Reform in 2011 and 2012. In this paper, we utilize this rich collection of programmes to identify usable admission patterns by analyzing admission data of the past years for reinforcing the institute's strength and reputation, whose programme spectrum was expanded and enhanced quite drastically since 2005 with the introduction of 1st Master in Education cohort. In particular, this paper is focused to locate: 1) if there is any internal competition and how severe the competition is. 2) If there is any programme that can be utilized as strategic recruitment? and 3) the general student admission trend of the 8 years. With this study, management can better understand where the sources of applicants come from. New insight can be drawn and new strategy can be defined to recruit more quality students which are also aligned with our strategic move to transform the students. The methods used in this paper can be easily applied in other University for analyzing the admission issues, and can demonstrate to management how operation data can be utilized to form valuable insights and significant improvement can then be made based on these identified facts.

Бесплатно

A Real-time DBMS System for the Immigration Processing of Large Hajj Crowd

A Real-time DBMS System for the Immigration Processing of Large Hajj Crowd

Amir A. Khwaja

Статья научная

Hajj is an important Islamic ritual and one of the five pillars of Islam. The Hajj event occurs in the twelfth month of the Islamic lunar calendar and requires anywhere from two to three millions of Muslims from all over the world to make pilgrimage for 10-15 days to the Holy city of Makkah in the Kingdom of Saudi Arabia. Providing quality Hajj services to such large number of pilgrims has been a significant challenge for the Saudi Arabian authorities. Among other services, immigration processing of a large Hajj pilgrim crowd arriving simultaneously at various Saudi Arabian ports during the specific Hajj days has resulted in significant delays at these ports. Unique and technology based solutions must be explored to alleviate the various Hajj related pilgrim service problems and to improve overall quality of these services. This paper reports experience with the design and development of a prototype backend DBMS system to automate the immigration processing of the large Hajj crowd. A real-time DBMS is considered for meeting the processing requirements of such a large Hajj pilgrim crowd arriving simultaneously at various ports. The purpose of this prototype was to understand the challenges and the feasibility of implementation of the backend system using a real-time DBMS.

Бесплатно

A Recursive Binary Tree Method for Age Classification of Child Faces

A Recursive Binary Tree Method for Age Classification of Child Faces

Olufade F.W. Onifade, Joseph D. Akinyemi, Olashile S. Adebimpe

Статья научная

This paper proposes an intuitive approach to facial age classification on child faces – a recursive multi-class binary classification tree – using the texture information obtained from facial images. The face area is divided into small regions from which Local Binary Pattern (LBP) histograms were extracted and concatenated into a single vector efficiently representing a facial image. The classification is based on training a set of binary classifiers using Support Vector Machines (SVMs). Each classifier estimates whether the facial image belongs to a specified age range or not until the last level of the tree is reached where the age is finally determined. Our classification approach also includes an overlapping function that resolves overlaps and conflicts in the outputs of two mutually-exclusive classifiers at each level of the classification tree. Our proposed approach was experimented on a publicly available dataset (FG-NET) and our locally obtained dataset (FAGE) and the results obtained are at par with those of existing works.

Бесплатно

A Review of Fully Automated Techniques for Brain Tumor Detection From MR Images

A Review of Fully Automated Techniques for Brain Tumor Detection From MR Images

Anjum Hayat Gondal, Muhammad Naeem Ahmed Khan

Статья научная

Radiologists use medical images to diagnose diseases precisely. However, identification of brain tumor from medical images is still a critical and complicated job for a radiologist. Brain tumor identification form magnetic resonance imaging (MRI) consists of several stages. Segmentation is known to be an essential step in medical imaging classification and analysis. Performing the brain MR images segmentation manually is a difficult task as there are several challenges associated with it. Radiologist and medical experts spend plenty of time for manually segmenting brain MR images, and this is a non-repeatable task. In view of this, an automatic segmentation of brain MR images is needed to correctly segment White Matter (WM), Gray Matter (GM) and Cerebrospinal Fluid (CSF) tissues of brain in a shorter span of time. The accurate segmentation is crucial as otherwise the wrong identification of disease can lead to severe consequences. Taking into account the aforesaid challenges, this research is focused towards highlighting the strengths and limitations of the earlier proposed segmentation techniques discussed in the contemporary literature. Besides summarizing the literature, the paper also provides a critical evaluation of the surveyed literature which reveals new facets of research. However, articulating a new technique is beyond the scope of this paper.

Бесплатно

A Review of Interventions to Recruit and Retain ICT Students

A Review of Interventions to Recruit and Retain ICT Students

Leo A. Siiman, Margus Pedaste, Eno Tõnisson, Raivo Sell, Tomi Jaakkola, Dimitris Alimisis

Статья научная

This article reviews and analyses the educational research literature on interventions to increase the recruitment and retention of information and communications technology (ICT) students. The results show that three changes in computing pedagogy characterize successful interventions, and consequently offer promising ways to attract and prepare more people for careers in ICT. The most important selection criterion considered when choosing papers to review was that interventions had been tested in practice and their effectiveness measured. Interventions were arranged into two groups: recruitment and retention. Recruitment interventions described initiatives to motivate interest in computing among secondary schools students, whereas retention interventions described efforts to retain students in ICT majors at universities. The three pedagogical approaches that emerged from an analysis of the successful interventions were: (1) visual programming environments to teach introductory programming, (2) inquiry learning activities to engage students in computing, and (3) integration of interdisciplinary knowledge to attract students from diverse disciplines. This review draws attention to innovative teaching practices currently shaping computer science education. Wider adoption of these pedagogical strategies has the potential to significantly increase the number of qualified ICT professionals.

Бесплатно

Журнал