007948   Al-Tahan Al-Nu'aimi A;Qahwaji R (School of Informatics, Bradford University, UK) : Robust self embedding watermarking technique in the DWT domain for digital colored images. J Digital Inf Mgmt 2007, 5(4), 211-19.

Robust watermarking algorithm is proposed for colored digital images. The 24 bits/pixel RGB images are converted to YCbCr color format, and the Y part is converted to Discrete Wavelet Transform (DWT). The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The watermark is another copy of the LL part and its pixels are, also, scrambled and each pixel is embedded in one of the scrambled blocks of the LL part. The algorithm takes into account the Human Visual System via relating the embedding process to the intensity of each block ofthe host image. We have used the average PSNR as a quality measure for the embedding stage. In all our experiments we got more than 68 dB which satisfies the PSNR bench mark. Also we got an average value of 0.15 for MAE, which is the robustness measure. This means that our algorithm is very robust and the watermark is still recognizable.

9 illus, 5 tables, 22 ref

006023   Rosa J L D L;Szymanski B K (NO, University of Girona, E17071 Girona, Catalonia, Email: peplluis@eia.udg.edu) : Citation auctions as a method to improve selection of scientific papers. J Digital Inf Mgmt 2008, 6(5), 414-20.

Describes the basis of citation auctions that are introduced as a new approach to selecting scientific papers for publication. Unlike the state of the art in paper selection that relies on peer reviews, our main idea is to use an auction in which bids consist of the number of citations that an author expects to receive if the paper is published. Hence, a citation auction is the selection process itself, and no reviewers are involved. The benefits of the proposed approach are two-fold. First, the cost of refereeing will be either totally eliminated or significantly reduced, because the process of citation auction does not need prior understanding of the paper's content to judge the quality of its contribution. Additionally, the method does not prejudge the content, so it will increase the openness of publications to new ideas. Second, scientists will be much more committed to the quality of their submitted papers, paying close attention to distributing and explaining their papers in detail to maximize the number of citations that the paper receives when published. Sample analyses of the number of citations collected via Google scholar for papers published in years 1999-2004 in a series of proceedings, and in years 2003-2005 in a series of conferences (in a totally different discipline) are provided. Finally, a simple simulation of an auction is given to outline the behaviour of the citation auction approach.

5 tables, 18 ref

006022   Kleiner C;Aliste A G (University of Applied Sciences and Arts, Faculty IV (Computer Science Dep), 30459 Hannover, Germany, Email: ckleiner@acm.org) : Classification of geographic web services for building an efficient geographic information system offering profitable value added services. J Digital Inf Mgmt 2008, 6(5), 396-404.

Best practices in implementing a geographic information system has been presented that may be used as a foundation for commercial geographic web services. On one hand explains important rules to be followed during the design of the information system itself, e.g. the data supplyment process. On the other hand introduces different categories for potential geographic web services and analyze these categories according to several properties. From some of those properties rules can be extracted on how well every kind of service is suited for commercial use and which technical context (e.g. security) has to be observed to be able to offer it. Based on a case study and prototype where implemented a geographic database and geographic web services from each of the different categories in the domain of hydrology.

3 illus, 4 tables, 28 ref

006021   Karanastasi A;Christodoulakis S (NO, Lab. of Distributed Multimedia Information Systems/Technical Univ of C, Kounoupidiana, Chania, Greece, Email: [allegra, stavros]@ced.tuc.gr) : OntoNL semantic relatedness measure for OWL ontologies. J Digital Inf Mgmt 2008, 6(5), 366-74.

Effect of the growing importance of the Semantic Web used for sharing knowledge over the Internet was the development and publishing of many ontologies in different domains. This led to the need of developing mechanisms for capturing the semantics of the ontologies. Introduces the OntoNL Semantic Relatedness Measure, a fully automated way of measuring, in an asymmetric way, semantic relatedness between concepts of domain ontologies. Developed metrics to guide the automation of the procedure by using feedback from an extensive evaluation with human subjects. Concludes with an application based evaluation using the OntoNL Framework as the application platform, a Natural Language Interface Generator for Knowledge Repositories.

4 illus, 9 tables, 17 ref

006020   Kamel M;Laborde R;Barrere F;Benzekri A (NO, , IRIT/SIERA - University Paul Sabatier, Email: {mkamel, laborde, barrere, benzekri}@irit.fr) : Trust-based virtual collaborative environment. J Digital Inf Mgmt 2008, 6(5), 405-13.

Concept of Virtual Organisation (VO) is a natural outcome of networks evolution and-collaborative work tools growth. In the VIVACE and TSCP projects, Studied the different issues when setting VOs up. Exposes requirements and characteristics of VOs through a use case, which was proposed by these two consortiums. Then, a secured collaborative environment, which combines attribute based access control models, privilege management infrastructure and identity federation, Deployed to deal with VO security constraints. This architecture allows organisations to externalise processes such as authenticating remote users to their partners (the users'home organisations). The establishment of such a decentralised management solution implies these organisations to be sufficiently mature to deal with such delegated tasks. We consider the maturity of the security practices deployed within each organisation to choose the trustee organisations between the potential partners. Provides a tool that helps organisations to evaluate their maturity.

6 illus, 20 ref

006019   Gupta D (Computer Science Dep, Kurukshetra Univ, Geeta Institute of Management and Technology, Kurukshetra, Haryana, Email: deepali_gupta2000@yahoo.com) : Software fault prediction based on machine learning techniques using software metrics. J Digital Inf Mgmt 2008, 6(5), 421-4.

Faults in software systems continue to be a major problem and many systems are delivered to users with excessive faults. This is been recognized that seeking out fault-prone parts of the system and targeting those parts for increased quality control and testing is an effective approach to fault reduction. Being able to estimate software faultiness before and during testing and analysis activities would greatly help software testing and analysis. Many systems are delivered to users with excessive faults. Prediction models based on software metrics, can estimate number of faults in software modules. In this paper different machine learning algorithms and neural network techniques on two different real-time software defect datasets are evaluated. The results show that when all the prediction techniques are evaluated then best algorithm for classification of the software components into faulty/fault-free systems is found to be Generalized Regression Neural Networks.

3 illus, 3 tables, 10 ref

006018   Fatto V D;Deufemia V;Paolino L (Dipartimento di Matematica e Informatica, Universita di Salerno, Via Ponte don Melillo, 84084 Fisciano(SA) Italy, Email: {vdelfatt,deufemia,Ipaolino}@unisa.it) : Map integrity constraint verfication by using visual language parsing. J Digital Inf Mgmt 2008, 6(5), 386-95.

In the last decade there has been an increasing interest in the use of tools for the creation of geographic maps. However, these tools include functionalities that allow users to insert information without verifying their consistency with the constraints defined by the designer. Proposes an approach based on visual language parsing for guaranteeing the integrity of data produced during the map editing process. According to approach, constraints are expressed by using high-level data model, such as OMT-G, and converted in a proper visual language grammar automatically. From such a grammar, a parser able to identify incorrect aggregation of spatial data input is generated. The grammar formalism also allows us to associate suitable semantic actions with productions in order to perform automatic corrections of inconsistent input data, error recognition and visualization, prompting actions for error recovery. A system prototype supporting the proposed process has been presented.

10 illus, 30 ref

006017   Baazaoui H;Aufaure M A;Soussi R (Riadi-GDL Laboratory, ENSI Campus Universitaire de la Manouba, Tunis, Tunisia, INRIA Paris-Rocquencourt-Domaine de Voluceau-78 153 Le Chesnay Cedex France, Email: Hajerbaazaouizghal@riadi.rnu.tn) : Towards an on-line semantic information retrieval system based on fuzzy ontologies. J Digital Inf Mgmt 2008, 6(5), 375-85.

Huge number of available documents on the Web makes finding relevant ones a challenge. Thus, searching for information becomes more and more complex because of the growing volume of data and of its lack of structure. The quality of results that traditional full-text search engines provide is still not optimal for many types of user queries. Especially, the ambiguities of natural languages and abstract concepts are handled inadequately by full-text search engines. Ontologies provide a solution to these problems. They can help a user to find documents related to a specific domain. Proposes a new retrieval system based on ontologies. This system integrates results from traditional full-text engines, and thus supports a gradual transition from classical full-text search engines to ontology-based ones.

11 illus, 14 ref

006016   Al-Tameem A A (Faculty of Computer and Information Sciences, Al-Imam Muhammad Ibn Saud Islamic Univ, Riyadh Saudi Arabia, Email: altameem@yahoo.com) : Technological capabilities in information technology sector. J Digital Inf Mgmt 2008, 6(5), 425-31.

Explores and explains the generic and technological specific managerial capital determinants of the Information Technology sectors. The exploratory part of the study examines whether and what are the social and generic factors influence the sector selection in information technology. In the explanatory part of the study, explain IT sector selection by testing on three determining variables: technological, social capital, and political capital. The former represents technological capabilities and absorptive capacity of the potential in IT sector, and the latter two represent the structural and instrumental influence of the social capital respectively. The findings suggest that only technological capabilities in the IT sector are the potential determinants in the information technology industry. The social dimensions are either non-significant or negatively associated. Furthermore, the technological capabilities vary across sectors. Life science sector provides elaborative conditions for technological knowledge to be an explanatory factor.

5 tables, 33 ref

005036   Umamakeswari A;Rajaraman A (Computer Science and Engineering Dep, School of Computing, SASTRA Univ, Thanjavur-613 402) : Attribute based object recognition models for dynamic media signals. Int J appl mathl Analysis Applic 2007, 2(1-2), 137-45.

The evolution of signals and data from simple analogue and text modes to media forms like images, audio, video and real time happenings has become a challenge in recent times for computing and communication. With increasing bandwidths and proliferation of cellular phones globally, it is now necessary to store, process, interpret and interact with these different forms of signals and data. Added to this is the time dependent nature of these signals in dynamic forms of input bringing in the necessity to process in a faster time to bring the content to the level of common user. One of the significant developments in recent times is the shift in computing paradigm from hard to soft computing, which tries to simulate human perceptions in computing like neural nets, fuzzy information processing and object oriented approaches. The present study gives details of a working model for static and dynamic forms of signals/images, so that conventional data processing is raised to the level of media processing. This is achieved by using Attribute Based Object Recognition and Tracking features of the image files and forms the focus of the paper here. The significant feature of this approach is the ability to handle incomplete, imprecise and inexact media forms.

8 illus, 9 ref

005035   Umamaheswari G;Srinath S;Siddorth R (ECE Dep, PSG College of Technology, Coimbatore-4, Email: gumabhaskar@yahoo.co.in) : Implementation and performance analysis keyed hash message authentication function and novel RC4 keystream generator using VHDL. Int J appl mathl Analysis Applic 2007, 2(1-2), 195-207.

In today's world security as such includes the triple objectives of confidentiality, integrity and authentication. In wireless networks these problems are aggravated because of the wireless medium and due to the fact that algorithms and protocols employed are still in the development stage. Further the wireless medium imposes several constraints on the nature of the algorithms and so the algorithms have to be modified accordingly. Thus there is an urgent need to conceive a model which ensures that these security issues are overcome. This paper is one such effort and aims to provide a solution to the above problems by identifying the functional weaknesses in the existing architectures used for encryption and authentication protocols in a mobile network and putting forth a new system to replace the same. In this paper area optimized FPGA implementation of the HMAC algorithm and performance enhancement of RC4 keystream generator are proposed. The critical path of the Hash Core block has been reduced by using the "On the Fly Round-Word Computation" method. This also reduces the number of registers required to store the working variables. The throughput is improved to 164.80 Mbps (a 38.26% increase) and the number of slices is decreased to 813(a 19.02% decrease) [4]. Two novel key stream generators are proposed and performance is analyzed using VHDL. The throughputs obtained for the first cipher is 608.4IMbps and for the second cipher is 486.35 Mbps.

10 ref

005034   Tyagi V;Tyagi V K (N.A.S. (PG) College, Meerut, Uttar Pradesh) : Virtual path resource allocation schemes in ATM networks. Bull pure appl Sci-Sect E 2008, 27(1), 75-80.

In B-ISDN environment, bandwidth allocation strategies require lot of attention due to the potential for improved utilization through statistical multiplexing of traffic sources. ATM network techniques have been actively researched and developed with the goal of realizing B-ISDN. ATM networks can transport signals of various services efficiently and economically and offer the benefit of enhanced flexibility, if the Virtual Path (VP) concept is adopted. There fore, the ATM networks will provide the infrastructure for B-ISDN. This paper discusses some resource allocation mechanism based on VP allocation, categorizing them as either dynamic or static.

17 ref

005033   Ramesh Babu B N;Nagabushan B S (NO, Rajarajeswari College of Engineering, Ramohali Cross, Bangalore-560 074, Email: bnrami@yahoo.com) : Organizing object-oriented extensible design patterns based scenario templates for testing embedded systems using single linkage clustering. Int J appl mathl Analysis Applic 2007, 2(1-2), 1-7.

Family of Embedded Systems and its software keeps on changing; testing must be keep on changing to test the modified system. New test cases must be developed to test new or modified features, and regression testing must be constantly applied to ensure that the system remains consistent after modification. Scenario Modeling has been widely used in system and software development to specify system requirements and Test Cases. Scenarios specified for testing are stored in Database, which has the potential of slowing down the disk access time significantly. Disk access frequency can be minimized by grouping together, which are close to one another with respect to proximity value in the database is known as "Clustering" on scenarios. In this paper, propose Single Linkage Clustering algorithm to group the scenarios to increase the efficiency of searching. The methodology of clustering reduces the disk accesses and database hits.

6 illus, 10 ref

005032   Ponnusamy S P (Computer Applications Dep, Adhiparasakthi Engineering College, Melmaruvathur-603 319) : Load balancing in file management using distributed computing over LAN nodes with partial support of server. Int J appl mathl Analysis Applic 2007, 2(1-2), 175-94.

In LAN architecture, hosts are connected with each other using various topologies, but, in most of the organization, star topology is used to avoid failure of network. In this, the clients and server are connected each other with individual point-to-point link through switches or routers. In the client-server architecture, the clients try to store their data into the server and later the clients request the server to fetch the file for process. This client-server architecture in LAN makes the server to be overloaded due to the several requests from the same machine's various processes and the same may happen from all other clients by storing and fetching large size files and applications. From the switch point of view, the line connected to the server is highly overloaded and the switch may be in contention. This is caused by all clients' requests and responses go in the same link. To avoid this problem, a different approach may be used with the partial support of server. This approach talks about the alternate way of file storage into various clients instead of storing into the server. This approach comes from the LAN nodes which are also having individual high storage medium when storage medium is not utilized properly for file and data in the client-server architecture. This is considered for this methodology that the files are stored into one or more clients (with or without splitting) and optionally in server from a client and latter the file may fetched from those clients (compilation may be used if splitting is done already) through the Log file stored in the server.

10 illus, 7 tables, 7 ref

005031   Mallapur J D;Manvi S S;Rao D H (NO, Basaveshwar Engineering College, Bagalkot, Email: bdmallapur@yahoo.co.in) : Fuzzy based bandwidth borrowing scheme for wireless multimedia networks. Int J appl mathl Analysis Applic 2007, 2(1-2), 83-98.

Presents a fuzzy based bandwidth borrowing scheme for wireless multimedia networks in the context of future generation cellular networks. In this scheme, borrowing factor is decided by three fuzzy parameters namely priority of application, age of application and bandwidth allocated during call admission. Based on the borrowing factor, bandwidth is borrowed by using fuzzy rules from each existing application such that none of the existing connections gives up more than their fair share of bandwidth. The extensive simulation results show that fuzzy based bandwidth allocation out performs the conventional scheme in terms of call dropping, call rejection and bandwidth utilization.

9 illus, 1 table, 17 ref

005030   Khanna Nehemiah H;Vijaya K;Kannan A;Sujatha M (Computer Science and Engineering Dep, Anna Univ, Chennai-600 025, Email: chandrakhanna@cs.annauniv.edu) : Fuzzy statistical reasoning approach for predicting the risk of cardio vascular diseases. Int J appl mathl Analysis Applic 2007, 2(1-2), 9-21.

Large collections of medical data are a valuable resource from which potentially new and useful knowledge can be discovered through data mining. In this work, another developed a system that will predict the risk of cardio vascular diseases. This system is built by combining the relative advantages of statistics and fuzzy logic. Statistical measure uses the chi-square test and correlation analysis to identify the best attribute (pattern) for classification based on maximum entropy partitioning. The pattern generated is used for the construction of the fuzzy inference system which classifies the unknown data by analyzing the training data with the trained data. It analyzes its own probability of success which helps in selecting the label correctly for a currently analyzed input data. This system is implemented by considering a real-world example application with the goal of identifying the risk of cardio vascular disease for the patients. It is performed using thirteen attributes along with the class label which is used to identify whether a person is "Healthy - H" or "Sick - S".

2 illus, 5 tables, 8 ref

005029   Gonzalez F F;Belanche L A (Languages and Information Syetems Dep, Polytechnic Univ of Catalonia, Barcelona, Spain, Email: fgonzalez, belanche@lsi.upc.edu) : Thermodynamical search algorithm for feature subset selection. Int J appl mathl Analysis Applic 2007, 2(1-2), 123-35.

This work tackles the problem of selecting a subset of features in an inductive learning setting, by introducing a novel Thermodynamic Feature Selection algorithm (TFS). Given a suitable objective function, the algorithm makes uses of a specially designed form of simulated annealing to find a subset of attributes that maximizes the objective function. The new algorithm is evaluated against one of the most widespread and reliable algorithms, the Sequential Forward Floating Search (SFFS). Our experimental results in classification tasks show that TFS achieves significant improvements over SFFS in the objective function with a notable reduction in subset size.

14 ref

005028   Chana I;Bawa S (Computer Science & Engineering Dep, Thapar Univ, Patiala, Email: inderveer@thapar.edu) : Self-managed resource model with resource provisioning capability for a grid environment. Int J appl mathl Analysis Applic 2007, 2(1-2), 229-41.

Grid facilitates the sharing and integration of large scale, heterogeneous resources and has been widely recognized as the future framework of distributed computing. The Resource Management System is central to the operation of a Grid. In traditional computing systems, resource management exists for computing environments and they are designed to operate under the assumption that they have complete control of a resource and thus can implement the mechanisms and policies needed for effective use of that resource in isolation. Unfortunately, this assumption does not apply to the Grid. Therefore, there is a need to develop self-managing and better resource utilization mechanisms for a Grid Environment as for future Grids, self-management and better resource provisioning is desired. This paper proposes a self-managed resource model having Resource provisioning facility in a grid environment. It also focuses on the lessons learnt which are essential and should be put to appropriate use for future applications and better resource management in a Grid Environment.

20 ref

005027   Anuradha G;Agarwal A;Raghavendra Rao C (Computer Science Dep, Vignan Institute of Technology & Science, Deshmukhi, Andhra Pradesh) : Novel approach to character recognition. Int J appl mathl Analysis Applic 2007, 2(1-2), 147-56.

Much of the research work so far in character recognition is done in selecting the feature set that describes the geometry of the characters, which is purely language dependent. This limits the usage of the system for a specific language for which it is designed. In this paper, a new approach for recognition of printed characters is proposed, which can be applied in the optical character recognition (OCR) of any language. The present work does not use any domain knowledge. This makes the proposed approach language-independent. Another salient feature of our work is in applying rough sets for the feature dimensionality reduction. In this paper, applicability of rough sets in English character recognition is demonstrated. As a supplement to our work, we also tested our method on font recognition. The promising experimental results prove the efficacy of the proposed approach.

12 ref

004045   Zhong P;Jinlin Chen (Computer Science Dep, Queens College, City University of New York, Email: jchen@cs.qc.edu) : Web information extractionusing web-specific features. J Digital Inf Mgmt 2008, 6(3), 235-43.

Several problems exist with traditional HMM based approaches for Web information extraction (IE) due to the lack of consideration on Web-specific features. A Generalized Hidden Markov Model (GHMM) has been presented that extends HMMs by making use of Web-specific information for Web IE. In GHMM based approach, Web content blocks instead of terms are used as basic extraction unit. Besides, instead of using the traditional sequential state transition order, GHMM decides the state transition order based on layout structure of the corresponding web page. Furthermore, GHMM uses multiple emission features derived from Web information instead of single emission feature. Experimental study shows that GHMM based approach can effectively improve Web IE comparing to traditional HMM based approaches.

10 illus, 6 tables, 24 ref

004044   Thammi Reddy K;Shashi M;Prathap Reddy L (Computer Science and Engineering Dep, GITAM, Visakhapatnam, Email: thammireddy@gitam.edu) : Hybrid clustering approach for term partitioning in document data sets. J Digital Inf Mgmt 2008, 6(3), 272-7.

Information retrieval is one of the major research areas due to accumulation of huge information in digital form. Various techniques of Information retrieval are based on the fact that terms contained in a document along with their frequency of occurrence signify the semantics of the document. Recent attempts to find the relevant document for a context represents documents in a vector space model as document-term vector containing term weights for every index term in that document. As there will be enormous number of index terms this leads to high dimensionality problem. Dimensionality based on the observation that groups of terms associated with related concepts occur together or do not occur in a document based on whether the document is relevant or not to that concept Such a group of terms is identified as an equivalence class and can be viewed as a single dimension in a Rough set based information retrieval system. A hybrid clustering approach has been presented for the formation of equivalence classes of terms associated with related concepts. It uses the outcome of hierarchical clustering to provide seed points for implementing Incremental K-means algorithm. Due to the sparsity of the term vector the cosine similarity estimate was found to be ineffective for term clustering. Another promising measure of proximity estimate used in information retrieval namely Euclidian distance has a drawback that it is biased towards changes in the term frequencies in larger documents when the term weights are represented by tf-idf estimates. Normalization for tf-idf estimates has been proposed while representing a term as a vector in a document space before clustering the terms.

4 illus, 4 tables, 14 ref

004043   Stamou S;Kozanidis L;Tzekou P;Zotos N (Computer Engineering and Informatics Dep, Patras University, 26500 Greece, Email: {stamous, kozanid, tzekou, zotosn}@ceid.upatras.gr) : Recommendation model based on site semantics and usage mining. J Digital Inf Mgmt 2008, 6(3), 244-55.

Explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization involves three great challenges (i) the accurate identification of the user interests in the sites content (ii) the detection of the user goals in their site visits and (iii) the encapsulation of the user interests and goals into the sites presentation and content. Study how can effectively identify the user interests and goals in their site visits and evaluate their correlation as this is exemplified in the users navigational patterns and the sites semantic content and structure. Based on our findings we propose a novel recommendation mechanism that employs web mining techniques for suggesting customized site views that satisfy both the user preferences and goals. Experimental evaluation shows that the user site interests and interaction goals can be accurately detected from the users navigational behavior and that our recommendation model, which uses the identified user preferences and goal yields significant improvements in the sites usability.

7 illus, 1 table, 34 ref

004042   Misbahuddin M;Premchand P;Govardhan A (Centre for Development of Advanced Computing, , #68, Electronic City, Bangalore, Email: mdmisbahuddin@yahoo.com) : Smart card based remote useder authentication scheme. J Digital Inf Mgmt 2008, 6(3), 256-61.

Password based authentication schemes are commonly used to authenticate remote users. Many schemes have been proposed both with and without smart cards but each have its own merits and demerªits. This paper analyzes the security of an enhanced Dynamic ID based remote user authentication scheme and shows that the enhanced scheme has major secuªrity weaknesses. The paper also presents a new scheme which overcomes the weaknesses and provides better security strength.

2 illus, 2 tables, 20 ref

004041   Kurian M;Bharath Kumar C;Susarla S;Niranjan T (NO, , Intuit Technology Services Pvt.Ltd, Bangalore, Email: merrin.kurian@gmail.com) : Archviz: a visual tool for analyzing storage architectures. J Coop Univ Res Ind Enterpr 2009, 1(4), 32-40.

Visualizing a system helps in understanding the system better. From a storage system point of view, there can be complex relationships among various resources including containment, usage and dataflow relationships. This paper describes a tool Archviz which visualizes such system architecture as a Directed Acyclic Graph (DAG) and provides the user, with functions to build and edit the architecture and see how workloads behave on it. Abstract away the elementary tasks of creating vertices and edges of the graph by providing templates, and with the user filling in the necessary information, the graph is built or modified on its own. This way the user can focus on issues related to architecting and modeling rather than visualization. Archviz is built in Java with the help of graph drawing tools/libraries and information visualization packages already available. The user can create and clone different graphs in multiple active workspaces and save them for later use. This is a powerful tool which visualizes the runtime behavior of storage architecture, supports all features supported by a Resource Model, which is a storage architecture simulation, while removing the tedious graph drawing tasks from the user.

5 illus, 6 ref

004040   Hidouchi W K;Ezegour D (NO, Institut National d'Informatique, (I.N.I), BP 68M Oued-Smar, Algiers (Algeria), Email: {hidouci,d-zegour}@ini.dz) : Actor like data model for a parallel DBMS. J Digital Inf Mgmt 2008, 6(3), 262-71.

New concept of "factor databases" (DB-Act) being studied at the INI institute (Act21 project) where developing a parallel main memory database system based on an actor like data model. To achieve data distribution we use a Scalable Distributed Data Structures (SODS) called distributed Compact Trie Hashing (CTH) currently in development at the same project. Transaction management and recovery techniques are adapted for the combination of actors and SODS in Act21. An adaptation of the nested transaction model to the actor paradigm is presented, as well as a recovery techniques using a fuzzy checkpointing tailored to the SDDS needs.

8 illus, 1 table, 22 ref

002997   Suri P K;Singh D;Chander R (Computer Sc & Applications Dep, Kurukshetra University, Kurukshetra, Haryana) : Simulator for the profitability of operating an ATM at a specifed location in banking industry. Libr Prog 2007, 27(1), 45-50.

Introduction of Automatic Teller Machines (ATMs) has changed the way the people operate their bank account. The location of A TMs affects the business of banks heavily. The aim of this paper is to assess the profitability of installing and operating an ATM at a specified place. The profitability of an ATM depends on the number of transactions demanded by the customer of (I) proprietary A TM and (2) non-proprietary ATM. An A TM system has been modeled by assuming a probability distribution of poison type for demanded transactions pattern. Each A TM transaction incurs the bank an operating and maintenance cost and also yields a specific profit. The overall economics of the simulated A TM has been used to take a decision "about the installation of an A TM at a particular Place'.

1 illus, 9 ref

002996   Singh B;Khanam S (Archaeological Survey of India, , 141 A/D, Green Belt Park, Gandhi Nagar Jammu) : Problems & prospects of automation in archaeological library at Jammu. Libr Prog 2007, 27(1), 65-71.

Study aim is at everlasting and analyzing the different problems faced during the process of automation and suggest way to the solution. It also aims at analyzing the benefits of automation in archaeological library.

8 ref

002995   Kalpana B;Nadarajan R (Computer Science Dep, Avinashilingam Univ for Women, Coimbatore-641 043) : Incorporating heuristics for efficient search space pruning in frequent itemset mining strategies. Curr Sci 2008, 94(1), 97-101.

Studies have shown an increasing thrust on the development of algorithms based on a lattice framework. Efficient pruning of the search space is an important factor which determines the performance of such algorithms. Presents certain lattice theoretical concepts relevant to work and propose two novel hybrid strategies for enumerating frequent itemsets. Inherent lattice properties along with intelligent heuristics make our algorithms outperform similar algorithms by reducing the search space by almost 50%. Proves theoretically and experimentally that intelligent heuristics applied optimally in alternating the top-down and bottom-up phases results in substantial reduction of the search space.

5 illus, 11 ref

002000   Varun Kumar;Ahmed M E;Dharminder Kumar;Singh R K (NO, Institute of Technology & Management, Gurgaon, Haryana) : Artificial neural network based intelligent decision support system model for health care management. VOYAGER 2008, 6(1), 23-7.

Authors proposed an artificial neural network based intelligent decision support system model for health care management. The healthcare environment is generally perceived as being `rich in information' yet having `knowledge poor'. There is a wealth of data available within the healthcare systems. However, there is a lack of effective analysis tools to discover hidden relationships and trends in data. Knowledge discovery and data mining have found numerous applications in business and scientific domain. Valuable knowledge can be discovered from application of data mining techniques in healthcare system. Examine the potential use of classification based data mining techniques such as Rule based, decision tree and Artificial Neural Network to massive volume of healthcare data. One of the original aims of artificial neural networks (ANN) was to understand and shape the functional characteristics and computational properties of the brain when it performs cognitive processes such as sensorial perception, concept categorization, concept associaton and learning.

2 illus, 13 ref

001999   Singh K;Lim H (Computer Engineering Dep, Graduate School of Design & IT, Dongseo University, Busan-617 716, Email: kulveer.singh, htlim}@dit.dongseo.ac.kr) : Internet based storage area network protocol for ATA device. VOYAGER 2008, 6(1), 42-5.

Introduces a data storage transport protocol inernet Advanced Technology Attachment (iATA) for ATA storage devices that can be accessed over (TCP/IP) networks. As the access speed of Advanced Technology attachment (ATA) type storage is increasing, the impotance of sharing the ATA type storages over internet is also increasing. Proposes a protocol in which authors have implemented the basic ATA command set to access the ATA type remote storage devices over the TCP/IP networks. Authors also give basic details of the protocol and discuss the existing storage protocols which are mainly used for accessing block storage like internet Small Computer System Interface (iSCSI) Hyper Small Computer System Interface (HyperSCSI) and ATA over Ethernet (AoE).

4 illus, 6 ref

001998   Sharma O P;Janyani V (ECE Dep, MNIT, Jaipur) : Improvement in performance of communication link by effective channel coding. VOYAGER 2008, 6(1), 69-72.

Performance of a communication link is analyzed by employing channel coding. A communication system model employing Bernoulli binary generator, Binary Phase Shift Keying (BPSK) modulation and Additive White Gaussian Noise (AWGN) channel has been implemented using MATLAB blockset. Simulation is carried out and bit error rate (BER) and total number of bits processed is evaluated for different signal to noise ratio. Analysis of the out put result shows a drastic improvement when cyclic channel coding is employed.

3 illus, 9 ref

001997   Mahajan S (CSE&IT Dep, ITM, Gurgaon) : EDGE technology an enhancement of GPRS/GSM networks. VOYAGER 2008, 6(1), 46-9.

GSM networks are provided by Enhanced Data rates for GSM Evolution (EDGE) technology. EDGE provides up to three times the data capacity of GPRS. Using EDGE, operators can handle three times more subscribers than GPRS; triple their data rate per subscriber, or add extra capacity to their voice communications. EDGE uses the same TDMA (Time Division Multiple access) frame structure, logic channel and 200kHz carrier bandwidth as today's GSM networks, which allows it to be overlaid directly onto an existing GSM network. For many existing GSM/GPRS networks, EDGE is simple software-upgrade. EDGE is simple software upgrade. EDGE allows the delivery of advanced mobile services such as the downloading of video and music clips, full multimedia messaging, and high-speed color Internet access. Due to the very small incremental cost of including EDGE capability in GSM network deployment, virtually all-new GSM infrastructure deployments are also EDGE capable and nearly all-new mid- to high-level GSM devices also include EDGE radio technology. The Global mobile Suppliers Association (GSA) states that, as of November 2006, there were 156 commercial GSM/EDGE networks in 92 countries, out of a total of 213 GSM/EDGE.

3 illus, 5 ref

001996   Kamboj P;Sharma A K (Computer Science & Information Technology Dep, ITM, Gurgaon-122 017) : Maodv-pr: a modified mobile ad hoc distance vector routing protocol with proactive route maintenance. VOYAGER 2008, 6(1), 35-41.

An Ad hoc network is a multihop wireless network formed by a collection of mobile nodes without the intervention of any centralized access point or fixed infrastructure. Limited wireless bandwidth, varying channel capacity and frequent topology changes require that routing protocols for ad hoc networks be simple, energy-conserving and robust. A new technique of local connectivity management is being proposed that attempts to improve the performance and reliability. It employs a proactive route reconfiguration to avoid the latency in case of link breakages.

4 illus, 12 ref

001995   Gupta P K (Computer Science & Engineering Dep, Institute of Technology & Management, Gurgaon, Haryana) : Investigative analysis of challenges related to gid computing. VOYAGER 2008, 6(1), 6-11.

Article brings out the relevance and significance, challenges of high end computing, along with its proposed solution in today's information based `globalised and liberalised' world. It discusses about concept and architecture of grid computing, international and national projects on grid computing, challenges that have come up because ofthe socio-economic forces of different societal structures in the world. Finally, it concludes with the roosed solution to the challenges related to grid computing and expected future directions in grid computing.

2 illus, 2 tables, 14 ref

001994   Gaur D;Shastri A;Biswas R (Computer Engineering Dep, Institute of Technology & Management, Gurgaon, Email: deepti_k_gau@yahoo.com) : Metagrapha new hierarchical data sructured as a dicision tree. VOYAGER 2008, 6(1), 1-5.

Concept of decision metagraphs is introduced. Decision graph are extension of popularly known decision trees. Similar to the decision tree a decision graph contains attributes and the decision nodes, where the attribute nodes contains some kind of test of attributes values and the decision nodes serves to predict the solution. Decision metagraph is graphical stucture in which every node is a set having one or more elements. It has all the properties of graphs, with few extended notation. In metagraph, there is set to set mapping in place of node to node as in a conventional graph structure. Each internal node also has rules associated it and leaf represents the possible value of the target variable. There is a path from source to the target variable from root to the leaf node.

6 illus, 10 ref

001993   Gandhi C;Upadhyay S (CSE &IT Dep, I.T.M, Gurgaon, Email: Er_charu@rediffmail.com) : Role of location information to achieve QOS route discovery in AD hoc networks. VOYAGER 2008, 6(1), 63-8.

In an Ad Hoc network, nodes move from one place to another. Thus, the topology of the network is dynamic and the existing routing protocols do not perform fairly well in such situations. Also the QoS service guarantees along with routing decisions become a challenging ask in such environment. Making routing decisions on the knowledge of the location of the nodes in the network helps in reducing routing overhead. Making routing decisions with the prior information about the location of the mobile nodes, makes the protocol more efficient for the real time and highly dynamic networks, where, reroutin due to route breakages and excessive routing overheads are undesirable. Authors review various routing techniques which make routing decisions based on the location information and study how these attempt to achieve the goal of efficient QoS routing in real time and highly dynamic networks.

^iia10 ref

001992   Dharmender Kumar;Dharminder Kumar;Saini A K (Dep of CSE, GJUS&T, Hisar, Email: dharm_india@yahoo.com) : Acceptability of E-banking among bank employees: a case study of Haryana. VOYAGER 2008, 6(1), 28-34.

Attemp has been made to find out the acceptance of e-banking among bank employees. For this a survey was conducted with the help of close ended questionnaire contains a number of questions. Data is gatherd from different places of Haryana. It has been observed in the findings that contextual and demographic variables influence the acceptance of e-banking among bank employees. Employees of urban area are feeling more confident than their rural counterpart in accepting the new technology; further young employees reveal more openness to change and more familiar with the technology. Majority of employees feel that the ICT is useful in the banking sector.

3 tables, 14 ref

001991   Chutani S;Singh L (Computer Science Dep, ITM, Gurgaon, Email: sumanch09@gmail.com) : Analysis of timing parameter in emotional speech-A cross language study. VOYAGER 2008, 6(1), 73-5.

Comparative study on basic emotions (anger, joy, sad) as well as neutral was carried out on speech samples of male/female speakers of Hindi, English and Punjabi. The focus of the study was on investigating the role of temporal properties like articulation rate in encoding these basic emotions. The results show that the ariability in gender and languages was more in articulation rate. Articulation rate is a better marker for emotions. The findings also suggest timing parameters play bigger role in these three languages. The present study has implications in emotion recognition, speech synthesis and text to speech conversion.

3 illus, 1 table, 8 ref

001990   Chandra P;Jain A;Gupta M K (USIT, Guru Gobind Singh INdraprastha University, Delhi) : Query optimization in oracle. VOYAGER 2008, 6(1), 18-22.

In database systems, user submits query and that query will be responded by the DBMS. Generally, there are a variety of methods for computing the response of the given query. It is the responsibility of the query processor to transform the query as entered by the user into an equivalent query that can be computed more efficiently. Query optimization is the process to find a good strategy or best query evaluation plan for processing a query. Discusses about the general query optimization techniques and the techniques used by the Oracle for optimizing the queries.

2 illus, 8 ref

001989   Chaba Y;Patel R B;Gargi R (CSE Dep, G.J.U. of Sc. & Tech., Hissar) : Analysis of mobility model for mobile adhoc network. VOYAGER 2008, 6(1), 50-5.

Ad hoc networks can operate without fixed infrastructure and can survive rapid changes in the network topology. They can be viewed as graphs in which the set of edges varies in time. The location of nodes determines whether any pair of nodes has a direct communication link and the location of each node is determined by movement. These links are used for creating routes between nodes that are not adjacent. When a link that is part of a route goes down, the route has to be rebuilt, which causes delays, packet loss and routing protocol overhead in the the network. Since not many MANETs are currently deployed, research in this area is mostly simulation based. Choosing mobility model that describes the movements of the nodes is one of the most important choices of simulation parameters. A rich set of parameterized mobility modoels are introduced in this paper including Random Waypoint, Group Mobility, city Section based Freeway and Manhattan models. The performance rankings of protocols may vary with the mobility models used.

3 illus, 9 ref

001988   Ahmed M E (Dep of CSE&IT, Institute of Technology & Management, Gurgaon-122 017, Email: ahmedezaz@rediffmail.com ) : Investigation of reliability management performance through knowledge based system. VOYAGER 2008, 6(1), 12-17.

Discusses some relevant knowledge-based systems developed during the last fifteen years for reliability management applications, among them, a fuzzy expert systems that developed for the implementation of reliability centered maintenance (RCM) in the initial design phases of industrial processes.

1 illus, 14 ref

001006   Waldschmidt M (Michel Waldschmidt, Universite Pierre et Marie, Curie-Paris 6, UMR 7586 IMJ, 175 rue du Chevaleret, Paris, F-75013 France) : Arithmetic and cryptography. Resonance 2008, 13(5), 440-55.

Among the unexpected features of recent developments in technology are the connections between classical arithmetic on the one hand, and new methods for reaching a better security of data transmission on the other. Illustrate this aspect of the subject by showing how modern cryptography is related to our knowledge of some properties of natural numbers. As an example, we-explain how prime numbers play a key role in the process which enables you to withdraw safely your money from your bank account using ATM (Automated Teller Machines) with your secret PIN (Personal Identification Number) code.

6 ref

000012   Natarajan A M;Premalatha K (NO, Kongu Engineering College, Perundurai-638 052, Email: principal@kongu.ac.in) : Three dimensional concept-based indexing for XML documents. Int J Syst Cybernetics Inf 2007, (Jul), 40-5.

In concept based indexing the documents are viewed as collection of concepts and indexed according to the meaning rather than terms. This will require construction of concept hierarchy which consists of collection of concepts and their interrelationships. The proposed system uses concept hierarchy to extract concepts from the XML document. The semantic importance of each term present in the concept is calculated and it is represented in 3D Lattice Cube. But this one is sparse and not efficient in terms of space and access time. To improve the performance of the information retrieval, K-Means clustering is employed to generate several smaller lattice cubes that are not sparse. Now the queries can be directed to appropriate cluster and also querying is faster in a smaller lattice cubes.

11 illus, 1 table, 15 ref