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

Все статьи: 1195

Novel Optimized Designs for QCA Serial Adders

Novel Optimized Designs for QCA Serial Adders

A. Mostafaee, A. Rezaei

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

Quantum-dot Cellular Automata (QCA) is a new and efficient technology to implement logic Gates and digital circuits at the nanoscale range. In comparison with the conventional CMOS technology, QCA has many attractive features such as: low-power, extremely dense and high speed structures. Adders are the most important part of an arithmetic logic unit (ALU). In this paper, four optimized designs of QCA serial adders are presented. One of the proposed designs is optimized in terms of the number of cells, area and delay without any wire crossing methods. Also, two new designs of QCA serial adders and a QCA layout equivalent to the internal circuit of TM4006 IC are presented. QCADesigner software is used to simulate the proposed designs. Finally, the proposed QCA designs are compared with the previous QCA, CNTFET-based and CMOS technologies.

Бесплатно

Novel Spectrum Handoff in Cognitive Radio Networks Using Fuzzy Logic

Novel Spectrum Handoff in Cognitive Radio Networks Using Fuzzy Logic

Nisar A. Lala, Moin Uddin, N.A. Sheikh

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

Cognitive radio is a technology initiated by many research organizations and academic institutions to raise the spectrum utilization of underutilized channels in order to alleviate spectrum scarcity problem to a larger extent. Spectrum handoff is initiated due to appearance of primary user (PU) on the channels occupied by the secondary user (SU) at that time and location or interference to the PU exceeds the certain threshold. In this paper, we propose a novel spectrum handoff algorithm using fuzzy logic based approach that does two important functions: 1) adjusts transmission power of SU intelligently in order to avoid handoff by reducing harmful interference to PUs and 2) takes handoff decisions intelligently in the light of new parameter such as expected holding time (HT) of the channel as one of its antecedent. Simulated results show impact analysis of selection of the channel in the light of HT information and the comparison with random selection algorithm demonstrates that there is considerable reduction in handoff rate of SU.

Бесплатно

Numerical Implementation of Nonlinear Implicit Iterative Method for Solving Ill-posed Problems

Numerical Implementation of Nonlinear Implicit Iterative Method for Solving Ill-posed Problems

Jianjun Liu, Zhe Wang, Guoqiang He, Chuangang Kang

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

Many nonlinear regularization methods may converge to local minima in numerical implementation for the complexity of nonlinear operator. Under some not very strict assumptions, we implement our proposed nonlinear implicit iterative method and have a global convergence results. Using the convexity property of the modified Tikhonov functional, it combines nonlinear implicit iterative method with a gradient method for solving ill-posed problems. Finally we present two numerical results for integral equation and parameter identification.

Бесплатно

Off-line sindhi handwritten character identification

Off-line sindhi handwritten character identification

Arsha Kumari, Din Muhammad Sangrasi, Sania Bhatti, Bhawani Shankar Chowdhry, Sapna Kumari

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

Handwritten Identification is an ability of the computer to receive and translate the intelligible handwritten text into machine-editable text. It is classified into two types based on the way input is given namely: off-line and online. In Off-line handwritten recognition, the input is given in the form of the image while in online input is entered on a touch screen device. The research on off-line and online handwritten Sindhi character identification is on its very initial stage in comparison to other languages. Sindhi is one of the subcontinent's oldest languages with extensive literature and rich culture. Therefore, this paper aims to identify off-line Sindhi handwritten characters. In the proposed work, major steps involve in characters identification are training and testing of the system. Training is performed using a feed-forward neural network based on the efficient accelerative technique, the Back Propagation (BP) learning algorithm with momentum term and adaptive learning rate. The dataset of 304 Sindhi handwritten characters is collected from 16 different Sindhi writers, each with 19 characters. The novelty of proposed work is the comparison of the recognition rate for the single character, two characters and three characters at a time. Results showed that the recognition rate achieved for a single character is more than the recognition rate of multiple characters at a time.

Бесплатно

Offline Handwriting Recognition Using Feedforward Neural Network

Offline Handwriting Recognition Using Feedforward Neural Network

Rosalina, R.B. Wahyu

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

Many business especially Banks’s services are expanding to include services directed not only to corporate customers but also to individual customer. Furthermore, by the increment of those services, many individual applications to be processed also increases as well. Facing an immense moment, in which requiring more improvements in how it should manage or maintain its applications, some systems or procedures must be improved to match currently increasing customers’ applications. Prior to the improvements, many application forms are filled, input to machine and even to be processed and approved manually. Until recently, application fulfillment processes consists of manual information filling by applicants in an application request paper and later to be re-input by electronic data processing staff which is actually redundant. Aware of such situation, this paper proposes and idea to reduce input processes in an integrated business system by utilizing character recognition system.

Бесплатно

Offline Handwritten Devanagari Script Recognition

Offline Handwritten Devanagari Script Recognition

Ved Prakash Agnihotri

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

Handwritten Devanagari script recognition system using neural network is presented in this paper. Diagonal based feature extraction is used for extracting features of the handwritten Devanagari script. After that these feature of each character image is converted into chromosome bit string of length 378. More than 1000 sample is used for training and testing purpose in this proposed work. It is attempted to use the power of genetic algorithm to recognize the character. In step-I preprocessing on the character image, then image suitable for feature extraction as here is used. Diagonal based feature extraction method to extract 54 features to each character. In the next step character recognize image in which extracted feature in converted into Chromosome bit string of size 378. In recognition step using fitness function in which find the Chromosome difference between unknown character and Chromosome which are store in data base.

Бесплатно

On Achievable QoS Bounds for Mobile IP through Rayleigh Channel in VANET

On Achievable QoS Bounds for Mobile IP through Rayleigh Channel in VANET

Richa Sharma, Jyoteesh Malhotra

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

Vehicular Ad Hoc network is a versatile mobile wireless Ad-Hoc network targeted to support traffic monitoring, vehicular safety and many more applications. For the robust and reliable services in the VANET there is need to investigate the performance under frequent handovers in Mobile IP to prevent packet loss. Mobile IP is an interface that helps to track the mobile nodes and deliver messages even if vehicles are out of the coverage area of home node. In order to find the achievable performance bounds in terms of throughput, packet drop, collision rate and packet broadcast rate, extensive simulations have been done. A realistic city scenario has been proposed here by using the Rayleigh channel simulator, mobile IP enabled IEEE 802.11p OBUs and RSUs. The transmission powers of RSUs and threshold power levels have been varied to obtain the optimum performance through realistic conditions. Simulations are performed using NCTUns6.0 (National Chiao Tung University Network Simulator) in mobile IP interface.

Бесплатно

On Approximate Equivalences of Multigranular Rough Sets and Approximate Reasoning

On Approximate Equivalences of Multigranular Rough Sets and Approximate Reasoning

B. K. Tripathy, Anirban Mitra

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

The notion of rough sets introduced by Pawlak has been a successful model to capture impreciseness in data and has numerous applications. Since then it has been extended in several ways. The basic rough set introduced by Pawlak is a single granulation model from the granular computing point of view. Recently, this has been extended to two types of multigranular rough set models. Pawlak and Novotny introduced the notions of rough set equalities which is called approximate equalities. These notions of equalities use the user knowledge to decide the equality of sets and hence generate approximate reasoning. However, it was shown by Tripathy et al, even these notions have limited applicability to incorporate user knowledge. So the notion of rough equivalence was introduced by them. The notion of rough equalities in the multigranulation context was introduced and studied. In this article, we introduce the concepts of multigranular rough equivalences and establish their properties. Also, the replacement properties, which are obtained by interchanging the bottom equivalences with the top equivalences, have been established. We provide a real life example for both types of multigranulation, compare the rough multigranular equalities with the rough multigranular equivalences and illustrate the interpretation of the rough equivalences through the example.

Бесплатно

On Construction of Gene-PDB Structure Mapping with Applications in Functional Annotation of Human Genes

On Construction of Gene-PDB Structure Mapping with Applications in Functional Annotation of Human Genes

Xi Chen, Hao Jiang, Wai-Ki Ching, Limin Li

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

Protein 3D structure is one of the key factors in recognizing gene functions. The availability of protein structure data in Protein Data Bank (PDB) enables us to conduct gene function analysis. However, the molecules in the PDB, whose structures have been determined, are always not corresponding to a unique gene. That is to say, the mapping from gene to PDB is not one-to-one. Thus this uncertain property complicates the analysis and increases the difficulty of gene function analysis. In this paper, we attempt to tackle this challenging issue and we study the problem of predicting gene function from protein structures based on the gene-PDB mapping. We first obtain the gene-PDB mapping, which is important in representing a gene by the structure set of all its corresponding PDB molecules. We then define a new gene-gene similarity measurement based on the structure similarity between PDB molecules. We further show that this new measurement matches with gene functional similarity nicely. This means that the measurement we introduced here can be useful for gene function prediction. Numerical examples are given to demonstrate our claim.

Бесплатно

On Transforming Business Patterns to Labeled Petri Nets Using Graph Grammars

On Transforming Business Patterns to Labeled Petri Nets Using Graph Grammars

Karima Mahdi, Raida Elmansouri, Allaoua Chaoui

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

In this work we present an approach and a tool for transforming business patterns to labelled Petri nets. This transformation is justified by the fact that Petri nets have efficient analysis techniques. We specify first, business patterns and labelled Petri nets Meta-Models in UML Class Diagram formalism with the Meta-Modelling tool Atom3, and then we generate visual modelling tools according to the proposed Meta-Models. Finally, we define a graph grammar which transforms Business Patterns models to Labelled Petri Nets model for analysis purposes. The approach is illustrated with examples.

Бесплатно

On the Quick Construction of the Edge-Balance Index Sets of a Classes of Nested Network Graph

On the Quick Construction of the Edge-Balance Index Sets of a Classes of Nested Network Graph

Hongjuan Tian, Yuge Zheng

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

The research of Boolean index sets of graphs is one of the important graph theory in the graph theory. Boolean index sets of graphs are to use the vertex sets and the edge sets of graphs to study the characteristics of various graphs and their inherent characteristics through corresponding the mapping function to Z_2. Its theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The edge-balance index set is an important issue in Boolean index set. In this paper, we defined edge-friendly labeling of the graph, edge-balance index set of the graph and the graph C_(n^m) × P_(m_n) (n=4,m≥2). We completely determine the edge-balance index sets of the graph C_(4^m) × P_(m_4) (m=0(mod3)) and solve formula proof and graphic tectonic methods.

Бесплатно

On the Selection of MAC Optimised Routing Protocol for VANET

On the Selection of MAC Optimised Routing Protocol for VANET

Kanu Priya, Jyoteesh Malhotra

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

In today's era of modernization, the concept of smart vehicles, smart cities and automated vehicles is trending day by day. VANET (Vehicular Adhoc Network) has also been emerging as a potential applicant to enable these smart applications. Though VANET is very much similar to MANET (Mobile Adhoc Network) but VANET has more severe challenges as compared to MANET due to hostile channel conditions and high degree of mobility. So lot of work related to MAC and Network Layer need attention from the network designers. In this paper MAC Layer has been optimised in terms of Queue Size by using QoS Parameters namely Packet Collision Rate, Packet Drop Rate, Throughput Rate and Broadcast Rate. In doing so, simulative investigations have been done to find out optimum queue size. For this purpose various routing protocols namely DSDV, AODV, ADV and GOD have been considered and optimum queue length for each of these have been obtained. Further the most efficient routing protocol has also been identified. Moreover this paper also compares the performance of most efficient Routing Protocols selected in terms of QoS parameters for different MAC Interfaces.

Бесплатно

On the Selection of Physical Layer Optimized Network Topologies for the Zigbee Network

On the Selection of Physical Layer Optimized Network Topologies for the Zigbee Network

Manpreet, Jyoteesh Malhotra

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

Zigbee standard has been designed for low data rate, low cost and limited power applications for short-range wireless communication. The successful implementation of Zigbee based network depends on the suitable selection of physical (PHY) layer and medium access control (MAC) layer parameters. In this work the PHY layer parameters have been optimized for star, tree and mesh topologies. The performance investigations have been carried out for different frequency band and data rate and different bandwidth (BW) in each of standard topologies. Through extensive simulations, QoS parameters like throughput, network load and delay have been evaluated to achieve optimal performance of physical layer.

Бесплатно

On the Two SAOR Iterative Formats for Solving Linear Complementarity Problems

On the Two SAOR Iterative Formats for Solving Linear Complementarity Problems

H.Saberi Najafi, S.A.Edalatpanah

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

Han et.al have applied two SAOR splitting formats for solving the linear complementarity problem. We improve them by introducing a class of preconditioners based on the SAOR methods. The convergences of the modified methods have been analyzed. We also show the applicability of the methods by numerical example.

Бесплатно

On the Use of Rough Set Theory for Mining Periodic Frequent Patterns

On the Use of Rough Set Theory for Mining Periodic Frequent Patterns

Manjeet Samoliya, Akhilesh Tiwari

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

This paper presents a new Apriori based approach for mining periodic frequent patterns from the temporal database. The proposed approach utilizes the concept of rough set theory for obtaining reduced representation of the initially considered temporal database. In order to consider only the relevant items for analyzing seasonal effects, a decision attribute festival has been considered. It has been observed that the proposed approach works fine for the analysis of the seasonal impact on buying behavior of customers. Considering the capability of approach for the analysis of seasonal profitability concern, decision making, and future marketing may use it for the important decision-making process for the uplifting of sell.

Бесплатно

On the technologies and systems for student attendance tracking

On the technologies and systems for student attendance tracking

Zoran Kotevski, Natasa Blazheska-Tabakovska, Andrijana Bocevska, Tome Dimovski

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

Manual student attendance tracking, by calling student names from a check list or taking students’ signs on a paper, has gone into history. Nowadays, modern technologies have already enabled the development of various automatized attendance tracking systems. These technologies include: Radio-Frequency Identification (RFID), Biometric (fingerprint, face or voice recognition), Barcode identification and Bluetooth communication technologies, that are implemented over an IP infrastructure as a platform. But, all these technologies perform in a different manner and exhibit certain functional limitations considering the given implementation. The main motivation for this research was to explore the possibilities for overcoming the issues of current systems for attendance tracking, considering the limitations of the technologies employed. Hence, the core contribution of this research can be considered as a fourfold, i.e. i) it presents the most frequently used technologies in the development of attendance tracking systems, ii) it reviews a range of existing student attendance tracking systems, iii) it defines criteria for performance evaluation of the technologies employed in student attendance tracking, from a perspective of educational institutions, and iv) it evaluates the mostly used technologies according to the predefined functional criteria. As a summary of the evaluation it provides directions for future development of a student attendance tracking system that would address the explored issues and functional limitations.

Бесплатно

One-bit Hard Combination Decision Scheme for Cooperative Spectrum Sensing in Cognitive Radio

One-bit Hard Combination Decision Scheme for Cooperative Spectrum Sensing in Cognitive Radio

Mohammed Mynuddin, Tania Khadem, Md. Ibrahim Abdullah, Md. Shamim Hossain, Mohammad Alamgir Hossain

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

The performance of one-bit hard combination decision scheme for cooperative spectrum sensing in cognitive radio has been studied in this paper. Energy detector model is used to observe the presence of primary user signal. Simulation result shows that the probability of missed detection is decreasing for both conventional hard combination and one-bit hard combination with OR rule according to the increasing of probability of false alarm. It also has demonstrated that one-bit hard combination decision scheme exhibits comparable performance with the conventional scheme and thus achieves a good tradeoff between performance and complexity.

Бесплатно

Onto-digital: an ontology-based model for digital transformation’s knowledge

Onto-digital: an ontology-based model for digital transformation’s knowledge

Fadwa Zaoui, Nissrine Souissi

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

The digital transformation of the company is a condition for the socio-economic development. Dealing with ICT integration in the enterprise, the paper’s aim is the identification of the digital transformation conceptual components, required for designing a knowledge model. To do this, a literature review is established to identify the dimensions, and their interrelations, to consider in the construction of a model, and which led to an ontology-driven model for digital transformation’s knowledge. In comparison with other models proposed in the literature, this ontology is exhaustive in terms of knowledge, adaptable to any sector of activity and scalable in terms of dimensions and relationships composing it.

Бесплатно

Ontologies as Building Blocks of Cloud Security

Ontologies as Building Blocks of Cloud Security

Naila Samad Shaikh, Affan Yasin, Rubia Fatima

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

Much like other processing domains, cloud computing is not surely safe. Security of cloud processing needs the same attention as any other aspect of cloud processing requires. Cyber world is shifting toward ontological technique and web 3.0 or web semantics for security. Cloud hosts servers demand more attention in context of security as number of resources and their access increases. Security measures have to be more extensive in cloud. Semantic web is usually new revolution inside the web science, which usually works upon base of ontologies. Ontologies are receiving great attention in the domain of computing and hence in the domain of security. This review paper examines different proposed “ontology centered techniques” and also provides a comprehensive analysis on these tactics. This research paper gives critical analysis of different models presented by different authors and researchers for ensuring security of a cloud based environment. This analysis helps different vendors of cloud technology to adapt one or all of these models to practically implement in their cloud machines whether they are offering IaaS, PaaS or SaaS. Any new security model using ontologies can also be proposed based on this study, as this paper gives a comprehensive comparison of the previously proposed ontologies for monitoring security state of cloud environment as safe or malicious.

Бесплатно

Ontology Based Framework to Configure the Organizational Goal Analysis and Decision-Making

Ontology Based Framework to Configure the Organizational Goal Analysis and Decision-Making

Tengku Adil Tengku Izhar

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

Organizational data is essential to assist domain experts and entrepreneurs for decision making process in relation to the organizational goals but the trustworthiness of organizational data in relation to achieving the organizational goals is often questioned because of the vast amount of organizational data available. This paper proposes a methodology to evaluate organizational data that relates to the organizational goals. This refers to the importance of assisting the organization to utilize relevance of organizational data from the vast amount of available data for decision making to the organizational goals. The aim of this paper is to identify dependency relationship of organizational data that match to the organizational goals and to define a metrics as an analysis approach to measure organizational data to be considered relevant to the organizational goals. The experiment is present to implement the propose methodology in the context of Australian economy. The contribution of this paper will serve as a first step in evaluation approach and analysis of organizational data that relates to the achievement of the organizational goals.

Бесплатно

Журнал