Latest issue

International Review on Computers and Software - November 2009 - Papers

A Novel Algorithm for Impulse Noise Classification in Digital Images
Spectral Clustering and Dimensionality Reduction Applied to Content Based Image Retrieval with Hybrid Descriptors
Tracking and Analyzing Human Motion in Video
An Intelligent Tree Based Clustering Method for Large Multi Dimensional Data
Spectral Interpretation of Sinusoidal Wave using Fractional Fourier Transfrom Based FIR window Functions
Practical Approach to Genetic Algorithm Cryptanalysis
Data Warehousing for Managing Health Care Organisations
Automated Complementary Association Learning from Web Documents
The Use of GPS for Measuring the Technical and Tactical Performances of Soccer Players
Ubiquitous Viruses Behavior Study at Mobile Internet Device Security
Hash Algorithms for Security on GSM System
A Real Time Distributed Approach for Data Placement in Mission Critical Wireless Sensor based applications
Gateway Discovery for Ad Hoc Nodes
States and Conceptual Modeling of Software Systems
Scheduling Hard Real-Time Tasks in Multicore General Purpose/ Special Purpose Processors Systems-on-a-Chip: an Energy-Aware Approach
Interval Cycle Time Estimation in a Semiconductor Manufacturing System with a Data-Mining Approach
Evaluation of Location/Allocation Methods in a Continuous Space Using Genetic Algorithm

International Review on Computers and Software - Papers

A Novel Algorithm for Impulse Noise Classification in Digital Images
by Hamed Vahdat-Nejad, Behrouz Tork-Ladani, Kamran Zamanifar, Nasser Nematbakhsh

Vol. 4. n. 6, pp. 627-632

Abstract - Noise reduction is a major concern in digital image processing systems, which have been investigated by several techniques. One kind of important noises in images is known as Salt & Pepper, which may have different causes. In this paper a new approach for eliminating this type of noise is presented. The approach is different from all previous works in this field, and is based on classification. More precisely, it tries to classify pixels of an image to one of two categories: noisy or not noisy. Afterward, it employs a median filter for pixels which have been classified as noisy, and remains others unchanged; hence, edges and other fine details are kept. Experimental results show this sustaining capability of the proposed scheme both in visual inspection and numerical measurement.
Copyright © 2009 Praise Worthy Prize S.r.l. - All rights reserved

Keywords: Image processing, Noise reduction, Pattern recognition, Salt & Pepper noise.

   Spectral Clustering and Dimensionality Reduction Applied to Content Based Image Retrieval with Hybrid Descriptors
         by K. Houari, Y. Chahir, M. K. Kholladi
        Vol. 4. n. 6, pp. 633-639

Abstract - The topic of research exposed in this paper concerns Content Based image retrieval in a heterogeneous high database. The increase of storage capacities and the evolution of compression techniques have generated an explosion of the digital information quantity. Their computerization opens a vast field of applications. In this setting we are interested more especially in the problem of the dimensionality reduction and spectral clustering of a heterogeneous database of images in order to image retrieval by the content. Our new gait described in this paper consists to: in first phase the description of the database images by a hybrid descriptor which are Interest SIFT points combined with texture descriptor given by the application of Wavelet transform. The descriptor is multi-dimensional, robust and invariant to changes and scales. In second phase the representation of the database images as a convex graph. In third phase the reduction of the space of representation by the application of an unsupervised spectral classification (The Spectral training uses information contained in the eigenvectors of the normalized matrix of transition to detect structures in data.) That will provide us classes of images that has shortcoming the Eigen-values calculated on the matrix of symmetry. As last phase, we use the Nyström theory that will permit us, not to recalculate the all Eigen-values, but only the lasts one.

Keywords: Image retrieval, Sift, Clustering, Texture, Nyström.

Tracking and Analyzing Human Motion in Video
by M. Abdellaoui, A. Douik, K. Besbes

Vol. 4. n. 6, pp. 640-647

Abstract - In this paper we present a new approach for tracking of human body in real video scenes, analyzing gestures and actions achieved by arms and legs and classifying global movements realized by the body. The detection and characterization of body in the different images of the sequence are achieved by using an image registration and a set of points of interest (POIs) issued from Harris corner detector. The tracking is achieved by template matching between POIs in a pair of consecutive frames in the sequence and is based on various distance calculation criteria. Gesture classification is done by the use of membership functions for angles realized by arms and legs. Movement analysis is made by an intelligent decision-making tool based on least squares method and model identification, able to estimate direction and orientation of body motion.

Keywords: Body tracking, Points of interest, Human motion analysis.

An Intelligent Tree Based Clustering Method for Large Multi Dimensional Data
by Sarwar Hadi, Rizwan Beg, Sheenu Rizvi

Vol. 4. n. 6, pp. 648-651

Abstract - This paper proposes a new index structure based on a forking technique in order to store legs. The idea is to visualize multi dimensional data with a class label such that their degree of impurity with respect to class membership can easily perceived by the user. The data is represented in heuristic tree leg (HTL) making use of filtering based index structure. We have developed a software which uses a decision tree to partition the data space into cluster and empty regions at different levels of Nodes. It dynamically generates legs based on classifications.

Keywords: Forking Index Structure, Cluster Generation, Leg Identification, Heuristic Tree Leg.

Spectral Interpretation of Sinusoidal Wave using Fractional Fourier Transfrom Based FIR window Functions

by P. V. Muralidhar, A. S. Srinivasa Rao, S. K. Nayak

Vol. 4. n. 6, pp. 652-657

Abstract - The Fractional Fourier transform (FRFT) is the generalization of the classical Fourier transform (FT). The FRFT was introduced about seven decades ago as literature reveals. It appears that is was remained largely unknown to the signal image processing community to which it may be potentially useful. In our paper an attempt has been made to evaluate these window functions in fractional Fourier transform domain. The parameters of windows which are used for the evaluation are Maximum side lobe level (MSLL), Selectivity or half Main lobe width (HMLW).In this paper have been compared the results of Fourier transform and fractional Fourier transform by applying each of the transform on the windows. Here, we have been considering different types of windows BLACKMAN WINDOW, HANNING WINDOW, RAISED COSINE WINDOW for implementation of fractional Fourier transform.And also interpreted using with different windows select finite segment from sinusoidal signal that continuous for all the type.

Keywords: Fractional Fourier Transform, Window.

Practical Approach to Genetic Algorithm Cryptanalysis

by Akram A. Moustafa, Ziad A. Alqadi, Majed Alduari, Saleh Alomar

Vol. 4. n. 6, pp. 658-663

Abstract - In this paper, differential attacks were described and the genetic algorithm was deployed in differential attacks. The attack on SPN and all points was taken into consideration and an implementation with MS visual C++ .Net. The idea behind using a native implementation instead of using a ready package for genetic algorithm is to reach an optimal implementation of the attack and to work on bit-level implementation whenever it is possible. The steps of the GA algorithm were described, tested, and implemented to get key bits of the last round; essentially the attack shall continue upward to get the entire key bits.

Keywords: Genetic algorithm (GA), Substitution Permutation network (SPN), Fitness, Attack, Sub-key, Differential probability.

Data Warehousing for Managing Health Care Organisations
by Rajesh Sharma, Gitesh K. Raikundalia, Christopher A. Bain

Vol. 4. n. 6, pp. 664-671

Abstract - Timely and detailed information is a crucial factor when it comes to efficient management of any organisation. Managers these days seek greater help of information systems to aid them in decision making. Organisations desire systems and technology that will efficiently gather data and disseminate information. The current need is a system that serves as the information power house of an organisation and provides a multidimensional view of data. This need is now being fulfilled by a technology known as Data Warehousing.
A Data Warehouse (DW) is fast becoming an important tool in many organisations. Like other organisations, Health Care Organisations (HCOs) are also exploiting the advantages of a DW in managing their organisation. HCOs are benefiting from application of technologies and systems tried and tested in other organisation like Wal-Mart, BMW etc. The aim of this paper is to investigate the usefulness of a DW in managing a HCO and to investigate the challenges faced in developing a DW for an HCO. Two important questions addressed by the research in this paper are: (1) How useful is a DW in managing HCOs? and (2) What are the challenges/barriers faced in developing a DW in HCOs?

Keywords: Data Warehousing, Health Care Organisations.

Automated Complementary Association Learning from Web Documents
by Zhila Nouri, Mohammad Ali Nematbakhsh, Mohammad Reza Khayyambashi

Vol. 4. n. 6, pp. 672-683

Abstract - In recent years, much effort has been put in finding semantic associations between items. One type of these associations is complementary association between items which determines an item that its usage is interrelated with the use of an associated or paired item such that a demand for one generates demand for the other. This association has many applications in the field of economics and marketing. This paper presents a novel contribution in this area, proposing an automatic and unsupervised method for acquiring complementary associations between products in a product catalog, framed in the context of domain ontology learning, using the Web as corpus. The paper also discusses how obtained associations can be automatically evaluated against WordNet and presents encouraging results for several categories of products.

Keywords: Semantic associations, Complementary products, Ontology learning from text.

The Use of GPS for Measuring the Technical and Tactical Performances of Soccer Players
by Imed Jabri, Tahar Battikh, Charni Yosser H.

Vol. 4. n. 6, pp. 684-687

Abstract - We experience in this paper a procedure which uses GPS for identifying the positions of football players during a test match. Four defenders were requests from this experiment. We have noted the positions of these players 10 times per second throughout a match. We were thus able to measure total and specific traveled distances. We could also trace the trajectories of the players and determine the velocity and acceleration in function of time. We got through this testing a database of the match which can be exploited in various ways: technical, physical, tactical and so on. .... Specific treatment may be developed according to the needs of the target population: coaches, players, managers etc...

Keywords: Sport, GPS, Soccer, Trajectory, Football, Distance traveled, Velocity.

Ubiquitous Viruses Behavior Study at Mobile Internet Device Security
by Ching-Chiang Chen , Dong-Her Shih , Hsiu-Sen Chiang

Vol. 4. n. 6, pp. 688-697

Abstract - The Mobile internet device virus has already become an important security topic which will produce huge impacts to enterprises and personal users. The Mobile internet device virus may cause the damage of the user's personal secrets revealing, cell-phone function, extra service expenses of production, and the worry had inconveniently and safely which the user uses. Therefore, this research plans to build Mobile internet device virus behavior ontology, based on the behavior among the virus and characteristic that can't be altered. The study applied on Web service concept and ontology project method to construct virus behavior ontology of the cell-phone one by one. Last but not the least, experiencing Web Service borderless ability strengthens the strong ability to express of knowledge of ontology and achieves the purpose that knowledge share through Web Service. In this study, we find that let more people know this behavior and potential danger of Mobile internet device virus is very important. Finally we hope ubiquitous protection mobile internet device security and detection viruses.

Keywords: Ubiquitous, Virus, Web service, Mobile internet device.

Hash Algorithms for Security on GSM System
by M. Al Rababaa, M. Al Kofahi, F. Al-Saqqar, “S. A.” AlRababah

Vol. 4. n. 6, pp. 698-703

Abstract - As it has strong security features, GSM (Global System for Mobile communications) becomes a popular system which is widely used in mobile communication. Hand held devices are not only used for delivering communication facilities, but also they are used in mobile commerce (m-commerce) transactions. As such, security concerns become more and more important when using mobile systems. This paper suggests using Hash algorithm within GSM to protect massage sending and receiving. Five famous Hash algorithms (MD5, SHA1, SHA 384, SHA256,SHA512) were tested with 128 Kbyte files to see which is the best algorithm to be used in mobile devices that supports GSM capabilities, depending on memory usage and power consumption.

Keywords: GSM system, Hash algorithms, Mobile system, M-commerce.

A Real Time Distributed Approach for Data Placement in Mission Critical Wireless Sensor based applications
by Sanjeev Gupta, Mayank Dave

Vol. 4. n. 6, pp. 704-713

Abstract - One of the main challenges in any real-world mission critical WSN based applications is to match the available resources with the needs, at the right time and to the right people. In such applications there may be a need to rapidly respond to sensor input. Moreover, the collected and delivered sensor data shall be valid at the time of action. Thus the issue of energy saving, enhanced availability and reliability are extremely important for taking effective decision. The existing approaches are quite unstructured in nature which results in poor resource management and hence inefficiency. Therefore there is a need for an application specific decentralized approach for managing data. In this paper the architecture for reliable and real time approach by using sensor clusters has been proposed for storage management. It is assumed that the sensor nodes are aware of their locations in their deployment area, and they are time synchronized. For data dissemination and action in the wireless sensor network the usage of Action and Relay Stations (ARS) has been proposed. In this paper, various design parameters pertaining to the architecture have been studied and analyzed in order to achieve the objective of reliable and efficient communication performance.

Keywords: Data Persistent; Reliability, Centralized Clustering, Base Station, Action and Relay Stations (ARS), Cellular.

Gateway Discovery for Ad Hoc Nodes
by K. Adel-Aissanou, D. Aissani

Vol. 4. n. 6, pp. 714-717

Abstract - Wireless networks are becoming ideals to get an internet connection for they are able to allow users the freedom of movement. But users seek more mobility. An alternative for wireless networks with infrastructures are Ad Hoc networks. Such a network consists of mobile units which use wireless interfaces without the assistance of a pre-existing infrastructure. If an ad hoc node has an Internet connection, it is interesting that this node offers the connection to others nodes which are not in the Internet field by becoming a gateway for its network. In this paper, we present and evaluate an algorithm for gateway discovery in multi-clusters Ad Hoc networks.
Our approach is different than the known ones in the solicitation procedure. To get an Internet access, a mobile node discovers a gateway to the wired network. The mobile node must ask its cluster-head and this one gives a solicitation message to the gateway. The performance of our algorithm in terms of number of solicitation messages received by a gateway node is compared to the well known methods using NS-2 simulations.

Keywords: Ad Hoc Networks, Gateway IP-Ad Hoc, Cluster-head, Algorithm Discovery.

States and Conceptual Modeling of Software Systems
by Sabah S. Al-Fedaghi

Vol. 4. n. 6, pp. 718-727

Abstract - Conceptual modeling provides a foundation for the development phases of software systems. UML has become one of the major conceptual modeling tools in Object-Oriented software engineering, used in a wide range of applications and domains; however, concerns have recently arisen regarding UML tools used in this area. In this paper, we scrutinize the concept of State utilized extensively in UML statecharts. We show that statecharts do not generally provide a clear definition of States when applied in the conceptual modeling of software systems. We also introduce a flow model as a viable alternative to statecharts in this type of application.

Keywords: Software conceptual modeling, Object-oriented software, UML, Statecharts.

Scheduling Hard Real-Time Tasks in Multicore General Purpose/ Special Purpose Processors Systems-on-a-Chip: an Energy-Aware Approach
by Rodrigo Santos, Jorge Santos, Javier Orozco, David Donari, Leo Ordinez

Vol. 4. n. 6, pp. 728-736

Abstract - In this paper an energy-aware scheduling algorithm for heterogeneous multicore general purpose/special purpose processors systems-on-a-chip is presented. The load consists in chains of precedence-related tasks. A systematic search method to find an optimal set of reduced frequencies that diminish the energy consumption is proposed. Evaluations were conducted by means of extensive simulations.

Keywords: Real-Time Systems, Scheduling, Multicore Systems-on-a-chip.

Interval Cycle Time Estimation in a Semiconductor Manufacturing System with a Data-Mining Approach
by Yu-Cheng Lin, Toly Chen

Vol. 4. n. 6, pp. 737-742

Abstract - A data-mining approach is proposed in this study for estimating the interval cycle time of each job in a semiconductor manufacturing system, which was seldom investigated in the past studies but is a critical task to the semiconductor manufacturing system. The proposed methodology applies the look-ahead SOM-FBPN approach to estimate the step cycle times of the beginning step and the ending step, and then derives the interval cycle time. For evaluating the effectiveness of the proposed methodology, production simulation is also applied in this study to generate some test data.

Keywords: Semiconductor Manufacturing System, Data Mining, Interval Cycle Time.

Evaluation of Location/Allocation Methods in a Continuous Space Using Genetic Algorithm
by N.Mohammadi, M. R. Malek, A. A. Alesheikh

Vol. 4. n. 6, pp. 743-748

Abstract - Facility location decisions are a critical element in strategic planning for a wide range of private and public firms. Several problems and methods exist for location facility centers. Each of these methods is appropriate for solving one type of problems according to the given constraints.
In the framework of this research, different location methods and problems are classified in four general distinct classes and each method is formulated as an optimization problem. Whereas these problems are NP-hard, a genetic algorithm as a robust and adaptive method is proposed to solve optimization problems. Our proposed genetic based method is an appropriate algorithm for continuous space that can choose anywhere in a region for facility centers without limitation. In order to evaluate the efficiency of genetic algorithm for solving location problems, a region with large amount of demand nodes and facility centers is considered as the sample region. Different methods are evaluated on this region. Results of implementation are compared quantitatively. In conclusion, application of each method is examined and presented based on the problem’s goal and purpose.

Keywords: Location problem, Genetic Algorithm (GA), Optimization, Continuous space.