Home > Archives > Latest issue

 

International Review on Computers and Software - March 2008 - Papers

 

   

 

 

 

International Review on Computers and Software - Papers

 

go to top    Comparative Study of Growing Hierarchical SOM Variants Case Study: Phoneme Classification
        by C. Jlassi, N. Arous, N. Ellouze

 

Abstract - Speech recognition is an essential component of any human computer interaction. Many models based on different techniques for speech recognition have been proposed and implemented. Artificial neural networks have been applied successfully in speech recognition applications including multi-layer perceptions, radial basis functions and self-organizing maps (SOM). The Growing Hierarchical Self-Organizing Map (GHSOM) is a neural network architecture combining the advantages of two principal extensions of the self-organizing map, dynamic growth and hierarchical structure. In this paper, we propose new variants of GHSOM in order to improve phoneme classification accuracy. The proposed GHSOM variants show good robustness and high phoneme classification rates.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Artificial neural network, Growing hierarchical self-organizing map, Neighborhood radii, Multiple prototype vectors, Phoneme recognition.

 


 

go to top    Functional Test and Dynamic to Validate Methods in OO Data Base

        by S. Layachi_badri, N. Ghoualmi-Zine, H. F. Merouani

 

Abstract - In this study we extend our previous work that concerns structural test which is static test. So, in this paper we propose a verification method to test functional aspect of the data base and dynamic. Our work is based on UML diagrams and consists to explore these diagrams such sequence diagram and class diagram. The result is to generate a set of functional test in the objective to validate the function aspect of our method implemented in each class. In next stage the execution of the method permits us to verify dynamic aspect of classes: new object created.
Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Test, Functional Test, Oriented Object Data Base, Dynamic Test, Unified Modeling Language and Diagrams.

 


 

go to top    A Multiple Aspect Data Model Design for Knowledge Discovery in Databases
        by  M. Sassi, A. Grissa Touzi, H. Ounelli

 

Abstract - The unifying goal of the KDD process is to extract knowledge from data in the context of large databases. Data mining lies at the heart of the process. It makes it possible to extract information from the data. There are a great many different methods of data mining (classification, decision trees, neural networks, genetic algorithms, Formal Concept Analysis etc.). The choice of which methods to use depends on the purpose of the building model. It can have one of the following aspects: organizational or hierarchical. In this article, we present a model design joining both the two aspects and permit to the user a multiple choices of deployment.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Data mining, Organizational model, Clustering, Hierarchical model, FCA, Fuzzy logic.

 


 

go to top    Validation of OPEN Process Activity Model Using OCL Framework
        by M. Darbari, B. Karan ,V. Kumar Singh

 

Abstract - Object oriented approach has been widely used as a concept for programming. There are various tools represent graphical format of object oriented programming link UML, OML etc. Over approach uses the concept of OML (OPEN) in combination with activity theory to develop and fully support OOP. In this paper we present an approach for validation of OML model using a tool known as OPAT. It first converts it into XMI format and later on into a formal languages OCL for well- formed rules.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: OPAT (Open Process Activity Model), OOP (Object Oriented Programming), OML, XMI.

 


 

go to top    Legacy Code Components Based Estimation Modeling

        by S. A. M. Rizvi, S. Ahamad

 

Abstract - During the initiation of any legacy evolution project one of the key challenges faced by project engineer is with respect to estimating the effort, cost and time required for execution and completion of the project. Especially in this highly competitive world of software renovation markets, the ability to come up with accurate estimate for the project is one of the most desired competencies from any project engineer. One of the major inputs for the project engineer in deciding the estimated effort and time, cost is the size of the work product and individual decomposed code components coming out of the project. The accuracy in the project’s estimation will depend on how accurately the size of components is estimated. One of the contributing factors for failure of software evolution projects is that, may projects get estimated based on personal working experience of project engineer. This paper presents components and size based effort estimation modeling that is beneficial in estimating a legacy code and components for evolution.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Legacy System, Modeling, Concurrency, Code, Project.

 


 

go to top    Virtual Collaboration Readiness Measurement a Case Study in the Automobile Industry

        by R. Khayami, K. Ziarati

 

Abstract - In end of the last century information and communication technology caused a veritable evolution in the world of business and commerce. Globalization has changed all the commerce equations and business plans. Old companies have to change their strategies if they want to survive after this technological revolution. A new form of collaboration between the distributed and networked organizations has emerged as the "Virtual Organization" paradigm. A company can not join a virtual organization before obtaining a virtual maturity. This maturity shows the readiness of the company to begin a virtual collaboration. In this paper, based on the coherent and formal definition of virtual organizations, the criteria for measuring the readiness of companies are proposed. Our criteria are confirmed, modified or combined by using the factor analysis method on a sufficient number of virtual companies in the automobile manufacturing industry.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Virtual Organization, Virtual collaboration, Network Collaboration, Factor Analysis, Virtual Business.

 


 

go to top    An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences

        by E. Parvinnia, M. Taheri, K. Ziarati

 

Abstract - The comparison of biological sequences is one of the oldest problems in computational biology. Global alignment is designed to search for highly similar regions in two DNA sequences, where appear in the same order and orientation. Longest Common Subsequence (LCS) is the most typical algorithm for global alignment that has optimal solution and independent to the shape of its input sequences. Since the space complexity of this algorithm is the multiplication of sequence lengths; it cannot be used for long sequences. In this paper, some rules are extracted to reduce amount of redundant information. Remained information is stacked to be used in backward iteration for finding the optimal path. As examined in the proposed algorithm, the stack size in comparison with space consumed by LCS algorithm is reduced about 10 times and the length of input DNA sequences in global alignment could be increased.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Longest Common Subsequence (LCS), global alignment.

 


 

go to top    Evaluation of the Disydent Co-design Flow for an MJPEG Case Study

        by K. Smiri, A. Jemai, A-C. Ammari

 

Abstract - Embedded multimedia applications on Multi Processor Systems on Chip (MPSoC) have to answer several performance constraints. This present work is structured on tow parts. First, we have exploited the design method of the framework Disydent using an example of multimedia application (MJPEG decoder) to find an optimal architecture, considering functional and non functional constraints. Second, we aimed to criticize Disydent which does not consider performance. So, we proposed a performance model based on the Kahn process network to enrich Disydent in term of temporal performance evaluation.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Disydent, performance model, Motion JPEG decoder, Co-design, MPSoC.

 


 

go to top    Intelligent Agents for a Semantic Mediation of Information Systems
        by S. Benharzallah, O. Kazar

 

Abstract - The objective of this paper is to propose a generic multi-agent architecture for the semantic mediation of the information systems. This solution combines two approaches (schema mediation and context mediation) in a progressive way and uses new technologies in order to ensure better advantages of the two approaches. Our solution makes it possible to solve the majority of the semantic conflicts in a dynamic way and respects the properties of interoperability (autonomy, scalability, evolutionarily...) by using the concept of intelligent agent.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Semantic mediation, multi-agent systems, OWL.

 


 

go to top    Ontology-based QoS Model for Appropriate Selection and Composition of Web Services
        by D. Çelik, A. Elçi

 

Abstract - Services publishing and discovery are essential issues for utilization of web services, however; the topic of service selection is not possible for current specifications of web services. Whereas service discovery is through using Universal Description, Discovery and Integration (UDDI) and Web Services Description Language (WSDL), however those technologies do not provide grounds for finding appropriate web services at the required accuracy and quality of service (QoS) by the consumer. This article discusses a Semantic Search Agent (SSA) approach that discovers appropriate web services according to their semantic description matching consumer requirements. The descriptions comprise of QoS requirements and input/output information obtained from the discovered Web Services. A study is considered involving a broker-cum-dispatcher model which consists of a QoS broker-based scheme by a multi-class queuing model. We propose a new system that is an extension to the SSA to find appropriate web services according to consumer request based on matching of input/output information and QoS information of web services; then compose them according to consumer requirements through semantic web and ontologies.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Dispatcher Model, Semantic Web Services, Semantic Search Agents and Queuing.

 


 

go to top    Cluster-based Self-Organization Scheme for Mobile Wireless Sensor Networks
        by M. Lehsaini, H. Guyennet, M. Feham

 

Abstract - One of the main challenges in Mobile Wireless Sensor Networks (MWSNs) is to maximize the amount of data received at the base station during the network lifetime. In this paper, we propose a Cluster-based Self-Organization Scheme (CSOS) for electing cluster-head nodes to evenly balance energy consumption in the overall network. In CSOS, each sensor calculates its weight based on k-density, residual energy and mobility and then broadcasts it to its 2-hop neighborhood with a fixed transmission range. The sensor with the greatest weight in its 2-hop neighborhood will become the cluster-head during a fixed period and its neighboring nodes will then join it. In our experiments, firstly we performed simulations to illustrate the impact of sensor mobility on LEACH and LEACH-C’s performance using the same simulated model presented in [1]-[2]. Unfortunately, the obtained results showed that sensor mobility had a significant impact on both protocols performance. Secondly, to prove substantial performance gains of CSOS scheme, we evaluated it with the same simulated model but with mobile sensors. Findings demonstrated that CSOS provided good results in terms of the amount of data received at the sink during the network lifetime when compared with LEACH and LEACH-C.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Cluster-based, k-density, MWSNs, Residual energy, Self-organization.

 


 

go to top    An Approach Design and Analysis of Resource Management Software for Multihoming In-Vehicle of IPv6 Network
        by S. D. Adeniji, S. Khatun, M. A. Borhanuddin, R. S. A. Raja Abdullah

 

Abstract - The resource management of Multihoming in nested mobile network raises new issues in the host mobility of ipv6 network.Multihoming facilitates the possibility of switching over to the network path offering better performance. However the key factor in attaining the benefit of multihoming is to ensure that the handoff switches over from one network interface to the other interface with minimal interruption. The aim of mobility support is to make mobile nodes keep connectivity without modification when roaming. The contribution of this paper is to simulate a policy based routing protocol framework that focuses on session preservation by redundancy and Load balancing by selecting the best available interface or enabling multiple interfaces simultaneously, since their management is critical for mobile communication. To manage these two critical resources, we identify the mobility characteristics and hardware configurations of in vehicle networks. The study then proposed a policy based routing protocol using two adaptive session preservation schemes in multihoming, which is refer to as best-connected MR selections based on location and path based type to support nested network of MIPV6 which was simulated using network simulator (NS2).

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Mobile IPV6, Multihoming, Policy based Routing Protocol, In-vehicle networks and Host mobility.

 


 

go to top    On Bandwidth Analysis of Fault-tolerant Multistage Interconnection Networks
        by R. Aggarwal, H. Aggarwal, L. Kaur

 

Abstract - In this paper regular and irregular MINs are analyzed and compared in terms of performance parameters namely Bandwidth, Cost and Bandwidth per unit Cost. Regular networks considered are Extra Stage Cube (ESC) and Augmented Shuffle Exchange (ASEN-2), and Irregular networks are Four Tree (FT) Network and Modified Four Tree Network (MFT).

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Multistage interconnection network, Bandwidth, Cost, Four Tree network, Modified Four Tree Network, Extra Stage Cube, Augmented Shuffle Exchange.

 


 

go to top    Performance Analysis of Ant Colony's Algorithm: Load-Balancing in QoS-based for Wireless Mesh Networks Routing
        by A. A. Moghanjoughi, S. Khatun, M. A. Borhanuddin, R. S. A. Raja Abdullah

 

Abstract - In this paper, a noble load balancing algorithm for Wireless Mesh Networks (WMNs) is presented. The design of the algorithm is based on: the specific self-organizing behavior of ant colonies, the shortest path discovery, and the related framework of ant colony optimization (ACO). WMNs that consist of static wireless routers, some of which called gateways, are directly connected to the wired infrastructure. This policy is based on Ant-Net method with moveable factors having operation similar to ant. The main point considered in this proposed method is capability of breeding of ants. This capability is continuation of route that is produced by the parent ants. By this capability, the target is to find an optimized route by creating a number of generations. In addition, it uses various generations, in a type of genetic algorithm to find optimized route. This can provide the required route with special goals. This method is able to prevent some of the difficulties which have not been seen in the colony algorithms of ants. The results show that, this new proposed method shows better operation in comparison to Ant-Net and other related methods. Also it can significantly increase the throughput and reduce the rate of delay in the network.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Load Balancing, QoS, Routing Algorithm, Ant Colony Optimization (ACO), Optimized Route, throughput.

 


go to top    Complementary Unipolar Duty Cycle Division Multiplexing (CUDCDM): A Novel and Economical Multiplexing Technique
        by M. K. Abdullah, A. Malekmohammadi, A. F. Abas, G. A. Mahdiraji, M.Mokhtar

 

Abstract - A new multiplexing technique based on duty cycle division is proposed, under the name: Complementary Unipolar Duty Cycle Division Multiplexing (CUDCDM). CUDCDM can be applied in both electrical and optical domains. The new technique allows for more efficient use of time slots as well as the spectrum taking advantage of both the conventional time division multiplexing TDM and FDM. The basic properties based on theoretical analysis as well as simulation studies have been done to evaluate the performance of this technique based on the signal energy and symbol error rate (SER). In this paper the performance of complementary unipolar duty cycle division multiplexing compared with multi level M-ary signaling as well as the conventional (TDM) technique. The simulation has been set for wireless transmission based on free space propagation model with adaptive white Gaussian noise (AWGN). PSK and QAM are used as modulation schemes to evaluate these techniques against data rate and number of users. The study shows that the energy per bit in CUDCDM, unlike that of TDM technique, increases with the number of users. The simulation results correspond with the theoretical study in which the CUDCDM technique has better SER than that of TDM, even in more distances.

Copyright © 2008 Praise Worthy Prize S.r.l. - All rights reserved

 

Keywords: Multiplexing technique, Duty cycle, Wireless systems.


Please send any questions about this web site to info@praiseworthyprize.it
Copyright © 2005-2014 Praise Worthy Prize