Chandrasekar C;Krishnan A
009302 Chandrasekar C;Krishnan A (NO, K.S. Rangasamy College of Technology, Tiruchengode-637 209, Email: ccsekar@gmail.com) : An optimization of fourth generation mobile device for heterogeneous network. Int J Syst Cybernetics Inf 2006, (NULL), 61-66.
7 illus, 5 tables, 23 ref
Yadav H;Jain S;Sinha P R
008177 Yadav H;Jain S;Sinha P R (Animal Biochemistry Div, National Dairy Research Institute, Karnal-132 001) : Internet - implications for the future of probiotics and prebiotics research. Indian Dairyman 2006, 58(6), 48-60.
Modern information technologies and world wide communications through the internet play and significant role in probiotics and prebiotics research across the globe. The most important growth of internet usage is largely due to the success of the World Wide Web. Various useful databases on probiotics and pprebiotics are already in the `Net' and many more are being added constantly. The future of probiotics and prebiotics research is handling the existing information in proper way.
10 tables, 28 ref
Ram Kumar;Ashwani Kush
008176 Ram Kumar;Ashwani Kush (Department of Computer Science and Applications, Kurukshetra University, New Delhi, Email: rkc.kuk@gmail.com) : E-Learning emergence. DESIDOC Bull Inf Technol 2006, 26(2), 19-24.
Advancement of computers and networking has provided and is providing a new means to support learning in a more personalized, flexible, portable and on demand. In last decade the commercialization has occurred in the field of education, and knowledge-based economy has increased a lot. The innovative and new ways of delivering education have surfaced causing some dramatic changes in learning technology and organisations. E-learning or electronic learning is one such process that is gaining momentum at a very fast pace. Analysis has been done to find the positive and negative impacts of e-learning. The days of the traditional classroom are far from over; e-learning is going to become a powerful supplement to traditional teaching methods, not replace it entirely.
3 tables, 12 ref
Mohinder Singh;Bansal A;Vinod Kumari;Ashok Kumar
008175 Mohinder Singh;Bansal A;Vinod Kumari;Ashok Kumar (Defence Scientific Information and Documentation Centre (DESIDOC), , Metcalfe House, Delhi-110 054) : Desidoc: An example of paradigm shift. DESIDOC Bull Inf Technol 2006, 26(2), 3-18.
DESIDOC has made considerable efforts over the years towards collection development and database development to serve the large number of scientists/engineers working in various Defence Research and Development Organisation (DRDO) labs/estts and top management at DRDO HQrs. The Defence Science Library (DSL) of DESIDOC has developed into a major information resource centre by way of over 2.39 lakh documents in its collection. For achieving the optimum use of LIS resources, a user-friendly library automation software, DeLAS, has been developed with six integrated modules: acquisition, cataloguing, OPAC, serial control, circulation control, and Web OPAC. The DSL has been regularly subscribing CD-ROM and online databases. DESIDOC has initiated a project 'Virtual Walkthrough for Defence Science Library.' It has two modules: Module 1_General Browsing_Through DRONA, users can take virtual tour of the DSL which is completely user interactive that means that user can take the tour at his own pace and Module 2_Guided Tour_complements the text-based search of the user for the books with an extended multimedia interface. DESIDOC made significant progress in the development of digital resources underlying digital library technologies that include: Full-text CD of Defence Science Journal (1950-2005); Patrika (Newspaper Clippings 2000-2005); DRDO Science Spectrum; Popular Science and Technology Series (13 books), Database of Photo Negatives of important events and so on. DESIDOC is bringing out a large number of regular and ad hoc special publications such as Defence Science Journal, Technology Focus, DRDO Newsletter and DRDO Samachar which have undergone various changes in terms of coverage, quality, and timeliness over the period of time. A large number of special publications are also brought out each year to meet the needs of DRDO HQrs and labs/estts. DESIDOC developed a large-sized 'DRDO website' providing information on key activities of the DRDO labs/estts, and technical directorates. Some of the products created and services offered by DESIDOC to fulfill its vision of processing and dissemination of information to defence scientists has been highlighted.
9 illus, 1 table
Kunte P D;Narvekar P
008174 Kunte P D;Narvekar P (NO, National Institute of Oceanography, Dona Paula, Goa-403 004, Email: dr_pdkunte@yahoo.com) : A portable marine geophysical data access and management system. Curr Sci 2006, 90(12), 1658-63.
Marine Geophysical Data Access and Management System (GPDAMS) is a portablle software system designed for computerized storage, selective retrieval and management of marine geophysical data. It constitutes an integral part of the larger Geophysical Oracle Database Management System (GPODMS) that is residing on UNIX True 64 Compaq Alpha server. GPODMS is a stable Oracle database sysgtem for longterm storage and systematic management of geophysical data and information of various disciplines. The Indian Oceanographic Data Centre (IODC) of the National institute of Oceanography (NIO) has archived 1,356,833 records (fixes) of marine geophysical data pertaining to 58 scientific cruises in GPODMS database. This dataset is of 190,690 line-km profile data and includes different marine geophysical parameters like bathymetry (corrected depths), magnetic (total magnetic field and magnetic anomaly) and gravity (observed gravity, Eotvos correction, free-air, Bouger anomalies, etc.). For the purpose of potability, geophysical data have been migrated to GPDAMS Microsoft Access-based database on compact disk. GPDAMS consists of both indigenously collected and international geophysical database, and management and presentation software modules to run on Windows PC. GPDAMS consists of four modules, namely data import module, query builder or search module, data visualization and download module, data visualization and download module, and data management (administtration) module. GPDAMS is a complete marine geophysical data management system that provides user-friendly access to large volume of marine geophysical data and means to visulaize and extract selected data according to need. The software requires a minimum of computing expertise as it is controlled by a system of `pull-down' menus, backed up by a context-sensitive help system.
4 illus, 1 table, 4 ref
Husain R;Ansari M A
008173 Husain R;Ansari M A (Documentation Research & Training Centre, , Bangalore, Email: mehtaba@rediffmail.com) : From card catalogue to web OPACs. DESIDOC Bull Inf Technol 2006, 26(2), 41-7.
Online Public Access Cataloauge (OPAC) changed the traditional card catalogue system. In the new system, data can be spread within computer and then the required entry can be retrieved immediately through OPAC system in any format. Now, user can search for information via OPAC and most recently, the internet. Desscribes what is OPAC, discusses about the OPACs & Web OPACs technology in libraries and explains various features, applications and advantages of Web OPACs.
1 tables, 17 ref
Venkata Rao D;Pratap Reddy L
007153 Venkata Rao D;Pratap Reddy L (NO, JNTU, Kakinada, Andhra Pradesh) : No reference measurement of blocking artifacts in JPEG compressed images. Int J Syst Cybernetics Inf 2006, (Jan), 108-13.
Image quality assessment is the key issue in the design and optimization of video coding systems and in the design and development of compression algorithms. Image and video compression include block transformation, which introduces blocking artifacts. This causes visual perturbations that are most significant to human perception. Proposed a blocking effect measurement technique to quantify such effects in JPEG compressed images. The proposed approach has the flexibility to integrate Human Visual System (HVS) features.
6 illus, 1 table, 6 ref
Typke R;Hoed M D;Nooijer J D;Wiering F; Veltkamp R C
007152 Typke R;Hoed M D;Nooijer J D;Wiering F; Veltkamp R C (NO, Utrecht Univ ICS, Padualaan 14 3584 CH Utrecht, The Netherlands, Email: rainer.typke@cs.uu.nl) : A ground truth for half a million musical incipit. J Digital Inf Mgmt 2005, 3(1), 34-9.
Musical incipits are short extracts of scores, taken from the beginning. The RISM A/II collection contains about half a million of them. This large collection size makes a ground truth very interesting for the development of music retrieval methods, but at the same time makes it very difficult to establish one. Human experts cannot be expected to sift through half a million melodies to find the best matches for a given query. For 11 queries, we filtered the collection so that about 50 candidates per query were left, which we then presented to 35 human experts for a final ranking. We present our filtering methods, the experiment design, and the resulting ground truth. To obtain ground truths, we ordered the incipits by the median ranks assigned to them by the human experts. For every incipit, we used the Wilcoxon rank sum test to compare the list of ranks assigned to it with the lists of ranks assigned to its predecessors. As a result, we know which rank differences are statistically significant, which gives us groups of incipits whose correct ranking we know,. This ground truth can be used for evaluating music information retrieval systems. A good retrieval system should order the incipits in a way that the order of the groups we identified is not violated, and it should include all high ranking melodies that we found. It might, however, find additional good matches since our filtering process is not guaranteed to be perfect.
1 illus, 3 tables
Tsz-Wai Lo R;He B;Qunis L
007151 Tsz-Wai Lo R;He B;Qunis L (Dep of Computing Sci, Univ of Glasgow, 17 Lilybank Gardens, Glasgow, UK, Email: lotr/ben/ounis@dcs.gla.ac.uk) : Automatically building a stopwork list for an information retrieval system. J Digital Inf Mgmt 2005, 3(1), 3-8.
Words in a document that are frequently occurring but meaningless in terms of Information Retrieval (IR) are called stopwords. It is repeatedly claimed that stopwords do not contribute towards the context or information of the documents and they should be removed during indexing as well as before querying by an IR system. However, the use of a single fixed stopword list across different document collections could be detrimental to the retrieval effectiveness. This paper presents different methods in deriving a stopword list automatically for a given collection and evaluates the results using four different standard TREC collections. In particular, a new approach, called term-based on Zipf's law, which we used as our baselines here. Results show that the stopword lists using thestopword lists derived by the methods inspired by Zipf's law are reliable but very expensive to carry out. on the other hand, the computational effort taken to derive the stopword lists using the new approach was minimal compared to the baseline approaches, while achieving a comparable performance. Finally, we show that a more effective stopword list can be obtained by merging the classical stopword list with the stopword lists generated by either the baselines or the new proposed approach.
9 tables, 20 ref
Trieschigg D
007150 Trieschigg D (NO, Univ of Twente, Enschede, The Netherlands, Email: trieschn@cs.utwente.nl) : Hierarchicaltopic detection in large digital news archives: Exploring a sample based approach. J Digital Inf Mgmt 2005, 3(1), 21-6.
Hierarchical topic detection is a new task in the TDT 2004 evaluation program, which aims to organize a collection of unstructured news data ina directed acyclic graph (DAG) structure, refecting the topics discussed in the collection, ranging from rather coarse category like nodes to fine singular events. The HTD task poses interesting challenges since its evaluation metric is composed of a travel cost component reflecting the time to find the node of interest starting from the top node and a quality cost component, determined by the quality of the selected node. Presents a scalable architecture for HTD and compare several alternative choices for agglomerative clustering and DAg optimization in order to minimize the HTD cost metric. The alternatives are evaluated on the TDT3 and TDT5 test collections.
6 illus, 6 tables, 12 ref
Sigurbjornsson B;Kamps J;Rijke M D
007149 Sigurbjornsson B;Kamps J;Rijke M D (NO, Informaitcs institute Univ of Amsterdam, kruislann 403, 1098 SJ Amsterdam, The Netherlands, Email: borkur@science.uva.nl) : Blueprint of a cross lingual web retrieval collection. J Digital Inf Mgmt 2005, 3(1), 9-13.
World wide web is a natural setting for cross lingual information retrieval; web content is essentially multilingual, and web searchers are often polyglots. Even though English has emerged as the lingua franca of the web, planning for a business trip or holiday usually involves digesting pages in a foreign languages. The same holds for searching information about European culture, sports, economy, or politics. Discusses the blue-print of the WebCLEF tract, a new evaluation activity addressing cross lingual web retrieval within the Cross Language Evaluation Forum in 2005.
1 illus, 3 tables, 18 ref
Shen J;Miyazaki S;Aoki T;Yasuda H
007148 Shen J;Miyazaki S;Aoki T;Yasuda H (The Univ of Tokyo, , 153-8904 Tokyo, Japan, Email: Shenjinhong2005@yahoo.com ) : E-moviemaking system for visualizing screenplay using sound motion picture. Int J Syst Cybernetics Inf 2006, (Jan), 32-7.
Describes an intelligent digital software system EMM Focusing on automatic synthesis of character animation dependent on filmmaking rules. EMM employs screenplay as user's input similar to traditional film/video generation. It generates shot sequence from the screenplay that describes abstract relationship between objects (such as two talk) or concrete actions of characters (such as stand) in various shots (such as close up). A virtual director achieves user's intentions by rule-based approach through setting a scene, determining the corresponding shot types and shot sequence, and planning virtual camerawork following the cinematic expertise stored in a filmmaking knowledge base. The knowledge representation is written in CLIPS language, which itcludes scene's layout and shooting and character's action.
6 illus, 4 tables, 14 ref
Ramamoorthy P;Shanmugam A;Ramamurthy G; Tripathi B
007147 Ramamoorthy P;Shanmugam A;Ramamurthy G; Tripathi B (Dep of ECE, GCT, Coimbatore, T.N.) : Performance evaluation of congestion aware distance vector routing protocol in mobile ad hoc networks. Int J Syst Cybernetics Inf 2006, (Jan), 76-80.
Mobile Ad hoc Network (MANET) is a collection of mobile devices equipped with a transmitter and a receiver connected in the absence of fixed infrastructure. The nodes in MANET are highly mobile and the nodes are dynamically connected in an arbitrary manner. Mobile networking has established itself as the operational backbone of day-to-day human activities. In order to facilitate the communication with the mobile network, a routing protocol is needed and the protocol has to be able to cope with the new characteristics that a MANET provides. Even through few protocols exist to facilitate the routing; they suffer scalability problems to varying extents. Examines the scalability issues pertinent to a protocol called Congestion -Aware Distance Vector Routing (CADV). The performance of the protocol has measured against selected parameters. The behaviour of CADV is analyzed in a thickly populated network through detailed simulations. Based on the observations, conclusions are drawn on the scalability of CADV routing protocol. The results provide some valuable data, which can cater, not only to the operational concerns about CADV, but also to the needs of efficient, reliable and economical deployment, functioning and maintenance of the systems using it.
7 illus, 6 ref
Rajan E G
007146 Rajan E G (Pentagram Res Cent (P) Limited, , #201, Venkat Homes, MIGH-59, Mehdipatnam, Hyderabad-500 028, Email: rajaneg@yahoo.co.in) : Nonnumerical representation and processing of signals and images. Int J Syst Cybernetics Inf 2006, (Jan), 1114-19.
57 ref
Moraga C
007145 Moraga C (Univ of Dortmund, , 44221 Dortmund, Germany, Email: claudio.moraga@udo.edu) : Compensating systems-A challenge for Neuro-Fuzzy modeling. Int J Syst Cybernetics Inf 2006, (Jan), 16-20.
Extraction of models for complex systems from numerical data of behavior is studied. In particular, systems representable as sets of fuzzy if-then rules where the premises are not connected by t-norms, but by a compensating aggregation operator are discussed. A method is presented to extract this kind of fuzzy rules with support of neural networks. Finally it is shown that the method may be applied to already existing neural networks to extract rule-based models.
2 illus, 19 ref
Mittal A
007144 Mittal A (NO, Indian Inst of Technol Roorkee, Roorkee-247 667, Email: ankumfec@iitr.ernet.in) : Content based image inpainting video streaming and object tracking. Int J Syst Cybernetics Inf 2006, (Jan), 49-54.
Image processing has taken a new dimension with its applications becoming more popular and diverse. Presented three recent developments in image processing and computer vision. Image inpainting is a new technique of image interpolation with application domain in recovering destroyed images in museum, or removing text from an image. The next significant application is in content-based video compression and streaming, where variable bit-rate is decided depending upon the importance of the content. Lastly, presented an upcoming application in object tracking beyond the visible spectrum which is likely to very significantly impact video surveillance, traffic control, and detection of remote objects.
7 illus, 9 ref
Mishne G;Rijke M D;Jijkoun V
007143 Mishne G;Rijke M D;Jijkoun V (NO, Informatics Inst Univ of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands, Email: gilad,mdr,jijkoun@science.uva.nl) : Using a reference corpus as a user model for focused information retrieval. J Digital Inf Mgmt 2005, 3(1), 47-52.
Proposed a method for ranking short information nuggets extracted from a text corpus, using another, reliable reference corpus as a user model. Availability and usage of such additional corpora is common in a number of IR tasks, and apply the method to answering a form of definition questions. The proposed ranking method makes a substantial improvement in the performance of our system.
2 illus, 2 tables, 21 ref
Kahol K;Tripathi P;Panchanathan S
007142 Kahol K;Tripathi P;Panchanathan S (Dep of Computer Sci and Engng Cent for Cognitive Ubiquitous Computing, Arizona St Univ, Tempe, Arizona, 85284) : Recognizing human movements through human anatomy based coupled Hidden Markov Models. Int J Syst Cybernetics Inf 2006, (Jan), 25-31.
Gesture recognition has been an active research area for several decades. Pose-driven Hidden Markov Models (HMMs), in which each state corresponds to a single pose, have been the most popular technique for gesture recognition. While this approach gives reasonably good results for small sets of gestures, the human body has many of degrees of freedom, allowing it to assume an essentially unlimited number of distinct poses. Since the complexity of an HMM is proportional to its number of states, this approach cannot be scaled to reliably recognize a large set of full-body gestures. However, all motion sequences performed by humans are constrained by the anatomy of the body. Used this constraint to construct a novel algorithm for modeling gestures as a sequence of events that take place within the segments and the joints of the human body. Each gesture is then represented in an event-driven HMM as a sequence of events, occurring in the various segments and joints. The inherent advantage of using an event-driven HMM (instead of a pose-driven HMM) is that there is no need to add states to represent more complex gestures. The proposed model was tested with a 3D motion gesture library of 58 gestures. When the model was trained using 3 instances for each gesture, and was then tested using 3 other instances, it achieved an average recognition rate of 91.4%. These results indicate that the proposed method is useful for recognizing the gestures in library and, given the inherent advantage of an event-driven model (with its fixed number of states) this approach might provide a better solution to the problem of whole-body gesture recognition than traditional pose-driven methods.
3 illus, 2 tables, 16 ref
Guru D S;Nagabhushan P;Shekar B H
007141 Guru D S;Nagabhushan P;Shekar B H (Dep of Computer Sci, Univ of Mysore, Mysore, Email: guruds@mailcity.com) : Dominant lines perceptual organization and eigenvalue analysis: an integrated approach for object recognition. Int J Syst Cybernetics Inf 2006, (Jan), 81-6.
Simple and robust methodology to recognize objects considering grouping of dominant lines and eigenvalue analysis. The proposed methodology has three stages. In the first stage, all the lines present in an edge image are extracted using line detection algorithm (Guru, et.al., 2004). In the second stage, lines, which are having similar slopes, are placed together and dominant line is identified in each group. In the third stage, dominant-angle matrix is computed which represent the relationship among the groups. Principal component transformation is applied on dominant-angle matrix to obtain the principal component vectors which are stored in the knowledgebase for the purpose of object recognition. The proposed methodology is invariant to linear transformations and is simple to realize. Experiments have been conducted on the standard dataset to corroborate the success of the proposed methodology.
6 illus, 1 table, 20 ref
Braun L;Wiesman F;Herik J V D;Hasman A; Korsten E
007140 Braun L;Wiesman F;Herik J V D;Hasman A; Korsten E (NO, Inst for Knowledge and Agent Technol, P.O.Box 616, 6200 MD Maastrict, The Netherlands, Email: l.Braun@cs.unimaas.nl) : Towards automatic formulation of a physician's information needs. J Digital Inf Mgmt 2005, 3(1), 40-6.
Goal of this paper is to contribute to the improvement of the quality of care by providing physicians with patient-related literature. For physicians, it is a problem that they are often not aware of gaps in their knowledge and the corresponding information needs. Our research aim is to resolve this problem by formulating information needs automatically. Based on these information needs, patient-related literature can be retrieved. We investigate how to model a physician's information needs. Thereafter, we design and analyze an approach to instantiate the model with patient data, resulting in information-need templates that are able to represent patient-related information needs. Since the patient data are in Dutch, we developed a translation mechanism for translating Dutch terms into the standard English terminology. From our experiments it is clear the a physician's information needs can be modelled adequately and can be substantiated into patient-related information needs. As an aside, we have shown that the automatic translation mechanism is not sufficiently effective in comparison with a manual translation mechanism. The usability of our information-need formulation approach is demonstrated by performing a literature retrieval that is based on the formulated information needs. Since the number of formulated information needs is rather high, methods have to be developed that restrict the set of automatically formulated information needs to a more specialized set.
3 illus, 2 tables, 25 ref
Biryukov M;Angheluta R;Moens M F
007139 Biryukov M;Angheluta R;Moens M F (NO, Katholieke Universiteit leuven, Belgium, Email: barmaliska@yahoo.com) : Multidocument question answering text summarization using topic signatures. J Digital Inf Mgmt 2005, 3(1), 27-33.
The process of the multidocument question answering summarization based on the topic signature has been described. It has been shown that summaries produced using the topic signatures have coverage which is comparable to that of the best systems competing at the Document Understanding Conference.
2 tables, 29 ref
Ahn Da;Fissaha S;Rijke M D
007138 Ahn Da;Fissaha S;Rijke M D (NO, Informatics institute Univ of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands, Email: ahn@science.uva.nl) : Extracting temporal information from pen domain text: A comparative exploration. J Digital Inf Mgmt 2005, 3(1), 14-20.
Utility of data driven technique in the end-to-end problem of temporal information extraction is unclear. Recognition of temporal expressions yields readily to machine learning, but normalization seems to call for a rule-based approach. Explored two aspects of the (potential) utility of data-driven methods in the temporal information extraction task. First whether improving recognition beyond the rule base used by a normalizer has an effect on normalization performance, comparing normalizer performance when fed by several recognition systems. Also performed an error analysis of the normalizer's performance to uncover aspects of the normalization task that might be amenable to data-driven techniques.
3 tables, 25 ref
Obot;Udo O
006078 Obot;Udo O (Math Statist and Computer Sci Dep, Univ of Uyo, Uyo, Nigeria, Email: abatakure@yahoo.com) : Experimental study of knowledge representation in a knowledge-based system (a case study of diagnosis and therapy of Typhiod fever). Ultra Scient phys Sci 2006, 18(1M), 109-18.
Knowledge acquisition and representation are two essential necessities of a knowledge-based system. Acquisition is concerned with the collection of knowledge from a domain expert while representation depicts how knowledge is presented by a knowledge engineer to a computer in an understandable form. The duo is therefore very essential in the building of a reservoir of knowledge for use as and expert system. Presents the principles, practice of knowledge acquisition and representation. Then caps it with the acquisition of knowledge for the diagnosis and therapy of typhoid fever. Finally, the acquired knowledge is represented in a computer understandable form using a case based system exhibited by visual basic 6.0 programming language.
6 illus, 10 ref
Pal S;Maiti C;Debnath K;Ghosh A M
005087 Pal S;Maiti C;Debnath K;Ghosh A M (Dep of Computer Sci and Technol, Bengal Engng and Sci Univ, Shibpur, Howrah-711 103) : SPID3: Discretisation using pseudo deletion. J Instn Engrs-Pt CP 2006, 87(May), 25-31.
Discretization is the process of converting the continuous attributes of the database into discrete ones in order to apply some classification algorithms. This is an important problem in developing generally applicable methods for data mining. A new technique for discretization based on successive pseudo deletion of instances to reduce the conflicting instances, ie, by reduction of noise in the database. The empirical experiments conducted show that the state-of-the-art algorithms for learning, such as, CN2, C4.5 Rules and RISE give considerable improvement in performances with the discretized outputs from the method than their respective local discretizations.
5 tables, 25 ref
Mandoria H L;Singh R P
005086 Mandoria H L;Singh R P (Dep of Computer Engng, Coll of Technol, Pantnagar-263 145) : Comparative performance study of various priority schemes in ATM networks. J Instn Engrs-Pt CP 2006, 87(May), 9-13.
Asynchronous transfer mode (ATM) network provides multimedia services with diversified traffic flow characteristics and quality requirements, thus, priorities are given to different classes of services. The priority schemes for solving the quality of service (QoS) control problem are discussed. These are static, dynamic and state dependent priority queueing systems to model various classes with different service requirements. A buffer management scheme using various priority schemes, ie, static, dynamic (LLF, SLF, OCF) and state dependent priority schemes (ARBSD, RSD) in the scheduling of an output buffered ATM switch in order to improve the QoS in terms of cell delay time for each traffic class and to reduce the cell loss rate of loss sensitive class in an ATM network. The comparison of these priority schemes is discussed and analyzed with different traffic conditions.
1 illus, 1 table, 14 ref
Dave M;Joshi R C
005085 Dave M;Joshi R C (Dep of Computer Engng, Natn Inst of Technol, Kurukshetra-136 119) : On performance of pre computation of quality of service routes. J Instn Engrs-Pt CP 2006, 87(May), 20-4.
Quality of service (QoS) routing is the process of selecting the path to be used by the packets of a flow based on its QoS requirements and the resource availability of the network. A new algorithm for pre computation of k constrained QoS routes has been proposed and its performance is evaluated. QoS routing relies on state information specifying resource availability at network nodes and links in the form of a database, and uses it to find paths with enough free resources to accommodate new flows. QoS routes can either be selected on demand or they can be pre computed. Path pre computation schemes offer multiple candidate routes to each destination. The proposed algorithm is implemented for pre-computing k widest-shortest and shortest-widest optimal routes and performs better than the traditionally used algorithm.
4 illus, 2 tables, 11 ref
Chowdhary K R;Bansal V S
005084 Chowdhary K R;Bansal V S (Dep of Computer Sci and Engng, MBM Engng Coll JNV Univ, Jodhpur-342 011) : Information extraction from natural language texts. J Instn Engrs-Pt CP 2006, 87(May), 14-19.
Process of information extraction (IE) from natural language (NL) texts for query answering has been presented. The proposed system of IE is implemented in two phases. In the first phase, the NL documents, relevant to the query under consideration are retrived using theory of fuzzy sets. This is followed by IE for answering the query in the second phase. A special type of grammar, called structured description grammar, has been described with a view to facilitate fast and unambiguous answers for the query. The application of the schemes proposed for IE has been shown in illustrative examples.
5 illus, 1 table, 7 ref
Jayapandian J
004075 Jayapandian J (Indira Gandhi Cent for Atom Res, , Kalpakkam-603 102) : Embedded control and virtual instrument simplifies laboratory automation. Curr Sci 2006, 90(6), 765-70.
Personal computers (PCs) are playing a vital role everywhere. From physics to psychology, the use of PCs is increasing rapidly. Trend in laboratory as well as industrial automation, to establish ongoing research and development programmes is minimal hardware design and maximal support of software. The software availability and the intelligent embedded hardware design configuration enable easy interfacing of systems with PCs. In the field of research and development programmes PCs act as a powerful tool for measurement of data and automation of experiments through their standard interfacing techniques. Virtual instrument design concept in software provides graphical user interface and enables a simple design solution with embedded controller through its standard communication interface with PCs. This note describes automation of some simple physics experiments using PCs.
6 illus, 6 ref
Bhaskar S M;Ramachandran P;Ahsori S I
004074 Bhaskar S M;Ramachandran P;Ahsori S I (Dep of Computer Sci, JMI Univ, New Delhi) : IT Act 2000 and PKI interoperability in India. Elect Inf Plann 2006, 33(7-8), 194-9.
Use of PKI in India is expected to increase rapidly and for activation of global e-commerce and so as the use of digital signature within domestic and other Global PKJ domains. Discusses key issues in the area of PKI based interoperability and trust relation among domestic CAs and Global PKI domain, under the framework of IT Act 2000 and also discuss the challenges in deployment of PKI.
6 illus, 10 ref
Sudha T;Usha Rani M;Rama B
003061 Sudha T;Usha Rani M;Rama B (Department of Computer Science, S.P.M. Vishwa Vidyalaya, Tiruapti-517 502) : Knowledge based system development for the health assessment. Biosci Res Bull 2005, 21(2), 157-65.
Health is a field particularly well suited to the techniques of Al. The health assessment expert system has the power to assess the life-expectancy of an individual and this ES is implemented in PROLOG and C++. In the inference mechanism of HAXS (Health Assessment Xpert System), combining the concept of And/Or graph search and Data-Driven strategy the algorithm was derived and implemented in C++. The production rules with a certainty factor was adopted to represent the knowledge of experts. Backward chaining and built in inference mechanism is existing in PROLOG and it is easy to implement a prototype in this.
1 illus, 3 tables, 12 ref
Sudha T;Rama B;Usha Rani M
003060 Sudha T;Rama B;Usha Rani M (Deptt. of Computer Science, Sri Padmavathi Mahila Viswavidyalayam, Tirupati-517 502) : Evaluation of XMR-the expert system on mental retardation. Biosci Res Bull 2005, 21(2), 77-86.
Artificial Intelligence is a branch of Science which deals with helping machines find solutions to complex problems in a more human-like fashion. Both medical care and medical education will be aided by successful in this area (Peter Jackson, 1998). XMR is an expert system for mental retardation. This is based INTERNIST model, which is an expert system in the domain of internal medicine (Davis, 1998). Mental retardation is the most handicapping disorder of child hood. The children affected by this disorder will be referred to the hospital for genetic diseases from different hospitals. The services available with hospital for genetic diseases and expertise available can be best by hospitals with the help of XMR. Thus the XMR diagnostic procedure reflects the actual procedure followed by a doctor in clinic, knowledge representation in XMR is similar to MYCIN but it has both forward and backward chaining exhaustive search, back tracking, hierarchical resolution and meta-rules (Davis, 2000). It has explanation facility also. It gives the line of reasoning and the explanations of each of the rules. In the evaluation of XMR, it was found 78 per cent definitive correct by its diagnosis and 91 percent definitive correct by physician's diagnosis. Out of 100 cases 16 per cent of XMR and 08 percent of physician were tentative correct. Just 06 percent cases were failure by XMR diagnosis.
3 tables, 6 ref
Snasel V;Moravec P;Pokorny J
003059 Snasel V;Moravec P;Pokorny J (Department of Computer Science, FEECS, VSB-TU Ostrava 17, Listopadu 15, 708 33 Ostrava-Poruba, CZ Czech Republic, Email: vaclav.snasel@vsb.cz) : Using BFA with wordnet based model for web retrieval. J Digital Inf Mgmt 2006, 4(2), 107-11.
In the area of information retrieval, the dimension of document vectors plays an important role. One may need to find a few words or concepts, which characterize the document based on its contents, to overcome the problem of the "curse of dimensionality", which makes indexing of high-dimensional data problematic. To do so, it has earlier proposed a Wordnet, and Wordnet+LSI (Latent Semantic Indexing) based model for dimension reduction. While LSI works on the whole collection, another procedure of feature extraction (and thus dimension reduction) exists, using binary factorization. The procedure is based on the search of attractors in Hopfield-like associative memory. Being applied to textual data the procedure conducted well and even more it showed sensitivity to the context in which the words were used. It has been suggested that the binary factorization may benefit from the Wordnet filtration.
1 illus, 20 ref
Mahesh Kumar;Ahmad N;Quadri S M K
003058 Mahesh Kumar;Ahmad N;Quadri S M K (Stat, Math & Computer Application Dep, Rajendra Agricultural University, Bihar, Pusa, Samastipur-848 125) : Software reliability growth models and data analysis with a pareto test-effort. Rajendra Agric Univ J Res 2005, 15(1-2), 124-8.
Deals with the software reliability growth model (SRGM) with a Pareto testing effort and the model is formulated by a Non Homogenous Poisson Process. Assuming that the error detection rate to the amount of test-effort spent during the testing phase is proportional to the current error content. Using the model, the method of data analysis for software reliability measurement is here developed. Develops a software-reliability growth model incorporating the amount of test effort expenditure at the time of software testing phase. Software reliability measurement during the testing phase is essential for examining the degree of quality or reliability of a developed software system. The time dependent behaviour of test effort expenditure is described by a Pareto curve. Least square estimation method is used to estimate the SRGM parameters and experiment on actual software failure data is illustrated.
4 tables, 9 ref
Lokpo I;Bi T G
003057 Lokpo I;Bi T G (Institut National, Polytechnique Felix Houphouet-Boigny BP 1093 Yamoussoukro, Cote d'lvoire, France, Email: lokpo@hotmail.com) : Ad Hoc location service for mobile agents. J Digital Inf Mgmt 2006, 4(2), 131-5.
Two implementations of a mobile agent location service in the context of an underlying ad hoc network has been studied. More precisely, this service aims at solving the problem of routing an agent toward a target agent in order to cooperate on a common host. Both the migration number and the tracking time must be minimized by such a service. Two implementations based on rumor propagation using either a piggybacking approach or a gossipy agent-based approach has been compared. The comparison of the two solutions is based upon simulation results. Performance analysis demonstrates that the piggybacking approach minimizes the response time and the gossipy agent-based approach minimizes the network overhead.
6 illus, 1 table, 16 ref
Li G;Li J;Guo L
003056 Li G;Li J;Guo L (NO, School of Computer Science and Technology Harbin Institute of Technolo, China, Email: liguilin@hit.edu.cn) : Energy efficient adaptive message transmission algorithm for wireless sensor networks. J Digital Inf Mgmt 2006, 4(2), 142-6.
An energy efficient adaptive message transmission algorithm is proposed to save the energy consumption of the wireless sensor networks when answering the event-based ad hoc query. Compared with other algorithms based on either active or inactive message transmission mode, the adaptive algorithm emphasizes that every event lasts for a period of time, in which the ratio between the query frequency and the data production frequency changes from time to time, so using only one kind of message transmission mode is not enough to save energy. The algorithm can adaptively change the message transmission mode for the sensor nodes according to this ratio. Experimental results showed that the adaptive algorithm could save more energy than other algorithms.
6 illus, 8 ref
Gabillon A;Fansi M
003055 Gabillon A;Fansi M (NO, Universite de Pau et des Pays de l'Adour lUT des Pays de l' Adour LIUP, France, Email: alban.gabillon@univ-pau.fr) : A new persistent labelling scheme for XML1. J Digital Inf Mgmt 2006, 4(2), 112-16.
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However, if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. The goal of the research reported is to design a persistent structural labelling scheme, namely a labelling scheme where labels encode ancestor-descendant relationships and sibling relationship between nodes but need not to be changed when the document is updated.
9 illus, 2 tables, 21 ref
Elias S
003054 Elias S (Department of Computer Science and Engineering, Sri Venkateswara College of Engineering, Chennai-602 105, Email: susan@svce.ac.in) : Providing support for interaction with consistent multimedia presentations. J Digital Inf Mgmt 2006, 4(2), 124-30.
Multimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. These specifications could result in inconsistencies, which need to be checked and resolved. Moreover, consistent presentations could become inconsistent due to interactions during the playout. The main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of the approach are a new composite spatio-temporal operator and an effective relaxation policy. A prototype which helps to study the effectiveness of the proposed approach has been developed. Thus, An interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation has been presented.
1 illus, 3 tables, 18 ref
De Vrieze P;Van Bommel P;Van der Weide T,
003053 De Vrieze P;Van Bommel P;Van der Weide T, (Computing and Information Science, Radboud University Nijmegen, The Netherlands, Email: pauldv@cs.ru.nl) : A Method for incorporating user modelling. J Digital Inf Mgmt 2006, 4(2), 136-41.
A method is presented for adding user modelling to (existing) software systems. The method consists of seven steps that lead from initial analysis to the definition and evaluation of the elements needed for the adaptive behaviour. Along with the method, the central concepts of adaptation elements and adaptation graphs are introduced. An adaptation element can be used to determine the impact of personalisations, while adaptation graphs describe the adaptation in a system as a whole.
10 illus, 25 ref
Bock D B;Bordoloi B
003052 Bock D B;Bordoloi B (Department of Computer Management and Information Systems Campus Box 1, Southern lllinois University Edwardsville, Edwardsville, lL 62026-1106, Email: dbock@siue.edu) : Trends in data management: 'high availability'. J Digital Inf Mgmt 2006, 4(2), 150.
In today's highly competitive business environment, for most companies it is imperative that their business data is always accessible from their data servers in a seamlessly fault tolerant manner. DBMSs, which constitute the core of most business information systems, are attempting to implement this requirement through a feature often referred to in the data management literature as 'high availability'. Against the backdrop of a leading DBMS, Microsoft SQL Server 2005. The concept of high availability has been defined and examine the various approaches to high availability, namely, mirroring, clustering, replication, and log shipping, which should be of interest to database administrators and the students of database management system technology.
2 illus, 2 tables, 12 ref
Bihler P;Scuturici V M;Brunie L
003051 Bihler P;Scuturici V M;Brunie L (Department of Computer Science, Yale University 51 Prospect St., New Haven, CT 06520, USA, Email: bihler@cs.yale.edu) : Expressing and interpreting user intention in pervasive service environments. J Digital Inf Mgmt 2006, 4(2), 102-3.
The introduction of pervasive computing environments enforce new ways of human-machine-interaction. The welldefined interaction interfaces will make place for other, more intuitive ways of interaction. In a pervasive service environment, the system middleware should take care of capturing the user's expression of an action intention, solving ambiguousness in this expression, and executing the final pervasive action This article introduces the Pervasive Service Action Query Language (PsaQL), a language to formalize the description of a user intention using composed pervasive services. It presents the next steps of intention treatment in a pervasive service environment: A mathematical model is given, which helps to express the algorithms performing translation of the user intention into an executable action. To implement such algorithms, a suitable object- oriented model representing actions is introduced. In the scope of PERSE, a pervasive service environment developed by our research group, general evaluation metrics for such algorithms are identified, a prototype has been developed and first benchmark results are presented in this article.
4 illus, 15 ref
Badr Y
003050 Badr Y (NO, National Institute of Applied Sciences-Lyon PRISMa-Production Engineer, av. Jean Capelle 69621 Villeurbanne-France, Email: youakim.badr@insa-lyon.fr) : Extracting information from coarser-grained data in XML documents. J Digital Inf Mgmt 2006, 4(2), 117-23.
XML is fast emerging as the dominant standard for representing data in the applications centric documents. While there has been a great deal of works recently proposing the extraction of relevant data of natural language texts, most of the underlying works confront with the irregular structure hidden in the text. To this end, a large spectrum of wrappers has been conceived for web pages. Unfortunately, they cannot deal with semi-structured data and cannot still take into consideration the natural language processing. A specification language to write expressive and easy extraction patterns. The specification relies on regular expression fashion in order to write patterns by non expert users. In addition, the Xtractor wrapper for coarser-grained data (i.e. paragraphs) has been introduced. The Xtractor hinges on linguistic parsing of paragraphs and applies technical and natural language dictionaries. Then it employs the extraction patterns against the pre-processed paragraphs in order to locate relevant data. The key idea of the approach consists of translating the extraction patterns to Finite State Transducers (FST) and even using the FST to build the domain specific dictionaries.
8 illus, 3 ref
Al-Zahrani S,
003049 Al-Zahrani S, (Department Faculty of Computer & Information Science, Imam Mohammad Bin Saud University P.O. Box 84800, Riyath 11681, Email: Dr_Saleh@hotmail.com) : From words to concepts in text mining. J Digital Inf Mgmt 2006, 4(2), 147-9.
In the text mining process the interface between the natural language text and content reflecting terms is essential for the successful indexing process. The traditional interfaces such as thesauri and lexicons have limitations for web content processing. The recent lexical nets have promises, but their efficiency needs to be tested. The current work measures the use of word relations specified by lexical nets in a large test bed. The results correlate with similar recent past studies as not all specified word relations in the lexical nets are semantically rich in expressing the conceptual relations between given words. The results call for applying more heuristic approaches for text mining.
2 illus, 2 tables, 12 ref
Zhang D;Li J;Wang W;Guo L;Ai C
002054 Zhang D;Li J;Wang W;Guo L;Ai C (Sch of Computer Sci and Technol, Harbin Inst of Technol, China, Email: zddhit@hit.edu.cn) : Reducing communication overhead over distributed data streams by filtering frequent items. J Digital Inf Mgmt 2005, 3(2), 101-7.
In the environment of distributed data stream systems, the available communication bandwidth is a bottleneck resource. To improve the availability of communication bandwidth, communication overhead should be reduced as much as possible under the constraint of the precision of queries. New approach has been proposed to transfer data streams in distributed data stream systems. By transferring the estimated occurrence times of frequent items, instead of raw frequent items, it can save a lot of communication overhead. Meanwhile, in order to guarantee the precision of queries, the difference between the estimated and true occurrence times of each frequent item is also sent to the central stream processor. Presented the algorithm of processing frequent items over distributed data streams and give the method of supporting aggregate queries over the preprocessed frequent items. Finally, the experimental results prove the efficiency of the method.
11 illus, 3 tables, 18 ref
Woda M;Michalec P
002053 Woda M;Michalec P (Inst of Engng Cybernetics, Wroclaw Univ of Technol Janiszewskiego, Poland 11-17, Email: marek.woda@pwr.wroc.pl) : Distance learning system: multi agent approach. J Digital Inf Mgmt 2005, 3(3), 198-201.
Focusing only on a knowledge delivery problem in distant learning systems, can find course material selection with relation to an education level of particular student as a main shortcoming. The other equally week point to the mention above is immense burden for the course administrators, when number of students exceeds a few dozen or so. Then the number of people involved in planning, control, scheduling of classes and students progress assessment, increases in proportion to a number of students. The remedy for the presented above distant learning inconveniences and a way to improve efficiency of knowledge acquire process could be application of intelligent multi-agent system. Beyond theoretical consideration of multi-agent usefulness, model of a real multi-agent system (in couple variants) based on agents along with performance comparison has been presented.
3 illus, 6 ref
Walkowiak T
002052 Walkowiak T (Inst of Engng Cybernetics, Wroclaw Univ of Technol Ul. Janiszewskiego 11/17 50-372, Wroclaw, Poland) : Application of virtual laboratories in teaching at technical universities. J Digital Inf Mgmt 2005, 3(3), 202-4.
Problem of a usage of virtual laboratories in teaching process at technical universitie has been discussed. The analysis of advantages and disadvantages of simulated laboratories and laboratories with an distant access has been presented. Also different ways of implementing simulated virtual laboratories are given. Moreover, the problem of the supporting virtual laboratories by multimedia lesson and a usage of e-platforms is raised, several examples of virtual laboratories application at Wroclaw Technical University are also given.
4 illus, 11 ref
Thiyagarajan M;Elango N M
002051 Thiyagarajan M;Elango N M (Sch of Computing SASTRA, Deemed Univ, Thirumalaisamudhram, Tamil Nadu, Email: m_thiyagarajan@yahoo.com) : Expressive images of Swami Vivekananda using image warping algorithm. Indian J Math mathl Sci 2006, 2(1), 1-5.
The human face is a multi-signal and multi-message response system capable of tremendous flexibility and specificity. It is an irregular structure, which varies from person to person. Today facial animations are used in computer games, movies, advertising and education. The proposed model generates a discrete set of expressive images of Swami Vivekananda by varying the argument used in image warping algorithm. The generated facial images belong to the six universal categories of expressions - happiness, fear, sadness, disgust, anger and surprise, apart from other expressions. This type on non-verbal communication has been exploited extensively in traditional cartoon animations.
1 illus, 1 table, 7 ref
Thilliez M;Delot T;Lecomte S
002050 Thilliez M;Delot T;Lecomte S (LAMIH Lab - CNRS UMR 8530, Univ of Valencienas Le Mont Houy 59313 Valenciennes Cedex 9, France, Email: {firstname.lastname}@univ-valenciennes.fr) : An original solution to evalute location-dependent queries in wireless environments. J Digital Inf Mgmt 2005, 3(2), 108-13.
Recent emergence of handheld devices and wireless networks has provoked an exponential increase in the number of mobile users. These users are potential consumers of new applications, such as the Location-Dependent Applications (LDA) examined in the article. As their name implies, these applications depend on location information, which is used to adapt and customize the application for each user. In the article, focused on the problem of information localization, particularly the evaluation of Location-Dependent Queries (LDQ). Such queries allow, for example, a mobile user who is in an airport to locate the closest bus stop to go to the university. To evaluate these queries, the client position must be retrieved. Often, positioning systems such as GPS are used for this purpose; however, not all mobile clients are equipped with such systems and these systems are not well suited in every environments. To remedy this lack, proposed a positioning solution based on environment metadata, that can provide an approximate client position, sufficient for evaluating LDQs. Presents both the positioning system, and its optimization with regard to minimizing response time and economizing mobile device resources.
9 illus, 1 table, 14 ref
Thabtah F;Cowling P;Peng Y
002049 Thabtah F;Cowling P;Peng Y (Dep of Computing and Engng, Univ of Huddersfield, Huddersfield, UK, Email: F.Thabtah@hud.ac.uk) : Predictive accuracy for four associative classfiers. J Digital Inf Mgmt 2005, 3(3), 205-8.
Association rule discovery is one of the primary tasks in data mining that extracts patterns to describe correlations between items in a transactional database. Using association rule mining for constructing classification systems is a promising approach. There are many associative classification approaches that have been proposed recently such as CBA, CMAR and MCAR. Four associative rule algorithms (CBA, CMAR, CPAR, MCAR) have been compared with reference to accuracy against 12 benchmark classification problems. The goal is to determine the most accurate technique in forecasting the future classes of unseen test data objects. After experimentation with different data sets, the results revealed that none of the investigated techniques dominated the others with regards to accuracy. Moreover, MCAR produced more accurate classification systems than CBA, CMAR and CPAR, respectively. This is due to the less pruning operation employed by MCAR, which leads to generating larger classifiers. A post pruning method is recommended to reduce the number of rules generated by MCAR, where it is obvious for cases like "Cleve" and "Germany" data sets.
1 illus, 2 table, 20 ref
Tang W;Ma Y X;Chen Z
002048 Tang W;Ma Y X;Chen Z (Sch of Electron Engng and Computer Sci, Peking University-100 871, Beijing, P.R. China) : Managing trust in peer-to-peer networks. J Digital Inf Mgmt 2005, 3(2), 58-63.
Notion of trust is fundamental in open networks for enabling peers to share resources and services. Since trust is related to subjective observers (peers), it is necessary to consider the fuzzy nature of trust in peers for representing, estimating and updating trustworthiness in peer-to-peer networks. In the paper, presented a fuzzy theory-based trust model for trust evaluation, recommendation and reasoning in peer-to-peer networks. Fuzzy theory is an appropriate formal method for handling fuzziness that happening all the time in trust between peers for practical purposes, and fuzzy logic provides an useful and flexible tool by utilizing fuzzy IF-THEN rules to model knowledge, experiences and criteria of trust reasoning that people usesin everyday.
9 illus, 16 ref
Sonosy O E;Hamad A;Elnahas A
002047 Sonosy O E;Hamad A;Elnahas A (Fac of Computer and Inf Systems, Ain Shams Univ, Cairo, Egypt, Email: Sonoso@hotmail.com) : An enhanced adaptive location update scheme for next generation PCS networks. J Digital Inf Mgmt 2005, 3(3), 192-7.
Locating users as they move from one place to another in a cellular network is a key issue that allows unrestricted mobility, yet poses several challenging constraints to the network designers. An enhanced adaptive location update scheme has been proposed to decrease the total cost of the location management process. The proposed scheme relies on the deployment of a direction based location update scheme along with a simple prediction line paging technique to decrease the paging cost. The proposed protocol is implemented over both random walk and random waypoint mobility pattern. Results obtained proved a reduction in the overall cost up to 47% compared to the direction based location update scheme without prediction. Further, the accuracy of the prediction technique for users with varying speed is increased by issuing a location update message periodically. The slight increase in the update cost is compensated by the savings in the paging cost. This enhancement is implemented over two set of experiments with different cost coefficients. Both produced a reduction in the location management overall cost up to 26% compared to the proposed protocol without the enhancement.
7 illus, 24 ref