005444   Kaul C (Computer Science and Engineering and Information Technology Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: chitra.kaul@dronacharya.info) : Nature's intelligence: computing with the genes. Dronacharya Res J 2009, 1(1), 87-93.

Genetics derived from the Greek word "genesis" meaning "to grow" or "to become" is the science that deals with the mechanism responsible similarities and differences in a species. A Genetic Algorithm (GA) [1] is a problem solving method that uses genetic as its model of problem solving. The mathematics is used in technology transfer Certain methods and models are there which describe many different phenomena and solve wide variety of problems. GAs are examples of mathematical technology transfer By simulating evolution, one can solve optimization problems from a variety of sources. There is no particular requirement on the problem before using GAs, so it can be applied to resolve any problem. Nowadays GAs are used to resolve complicated optimization problems, like timetabling and job-scheduling, strategy game playing.

2 illus, 1 table, 9 ref

005443   Hooda V (Computer Science Engineering & Information Technology Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: viju_hooda@rediffmail.com) : Challenges of components based software engineering. Dronacharya Res J 2009, 1(1), 100-6.

Component-Based Software Engineering (CBSE) is an emerging paradigm of software development. Its goal is composing applications with plug & play software components on the frameworks. CBSE is aiming at realizing long-waited software reuse by changing both software architecture and software process. It may vastly change the way we develop software. However, we still see many problems to solve. The last decade has shown that object-oriented concept by itself is not that powerful to cope with the rapidly changing requirements of ongoing applications. Component-based systems achieve flexibility by clearly separating the stable parts of systems (i.e. the components) from the specification of their composition. In order to realize the reuse of components effectively in CBSD, it is required to measure the reusability of components. However, due to the black-box nature of components where the source code of these components are not available, it is difficult to use conventional metrics in Component-based Development as these metrics require analysis of source codes.

1 illus, 10 ref

005442   Goel M (Computer Science and Engineering and Information Technology Dep, Dronacharya College of Engineering, Gurgaon-123 506) : Evolutionary computation: a contemporary survey. Dronacharya Res J 2009, 1(1), 75-81.

Evolutionary computation (EC) refers to computer-based problem solving systems that uses computational models of evolutionary process. This paper attempts to provide an overview of evolutionary computation and describes the major paradigms of evolutionary computation. Further on, the paper discusses the various advantages of evolutionary computation followed by the numerous applications of the same that are of contemporary interest. Finally, for the purpose of illustration, a case study of travelling salesman problem as one of the innumerable applications of evolutionary computation has been discussed.

10 illus, 10 ref

005441   Duhan M;Dahiya S;Vikram Singh (Electronics & Communication Engineering Dep, DCRUST Murthal, Sonepat, Haryana, Email: duhan_maoj@rediffmail.com) : Review of routing protocols and simulators for adhoc networks. Dronacharya Res J 2010, 2(2), 31-6.

Mobile Adhoc Networks are infrastructure less wireless network. Due to the random movement of nodes adhoc network does not have fixed topology. Hence routing is always poses a challenge in the wireless network. Moreover all the mobile nodes are working on the batteries and hence energy of the node is a scarce resource. Therefore some special protocols are developed that reduces the energy consumption of the node. In section 2 the traditional protocols are discussed. Section 3 explained the energy efficient routing approach. Section 4 contains the details of the available simulator for the Adhoc Network. In section 5 the factors that affect the performance of adhoc network are discussed.

3 tbales, 19 ref

005440   Bharti V;Suri H (Computer Science & Engineerig Dep, Dronacharya College of Engineering, Gurgaon-123 506, Email: mevishalbharti@yahoo.com) : Implementing "SYN" based port scanning in windows environment. Dronacharya Res J 2010, 2(1), 86-94.

One of the primary stages in penetrating/auditing a remote host is to perform Port scanning. It is one of the most popular techniques used to discover and map services that are listening on a specified port. This paper gives the real life scenario of implementing SYN based port scanning along with the various issues involved either directly or indirectly with it. We have implemented the scheme in Windows based environment, which till date is only implemented in UNIX/Linux based environment. The result of our implementation is depicted in the form of clear cut screenshots. Finally the paper also gives some of the screenshots in Behind the Scene section, which shows ICMP ECHO REQUEST packets for the target machine to see if the Target is alive or not along with the requests to get the Target's MAC/physical address as an ARP REQUEST packet.

13 ref

022194   Yue X;Yuansheng Y;Liping W (Computer Science Dep, Dalian Univ of Technology, Dalian, 116024, People's Republic of China, Email: yangys@dlut.edu.cn) : On harmonious labeling of the double triangular snake. Indian J pure appl Math 2008, 39(2), 177-84.

A triangular snake is a triangular cactus whose block-cutpoint-graph is a path. David Moulton proved that triangular snakes with p triangles are graceful if p is congruent to 0 or 1 modulo 4. Xu proved that they are harmonious if and only if p is congruent to 0, 1 or 3 modulo 4. A double triangular snake is a graph formed by two triangular snakes having a common path, i.e., a double triangular snake with p blocks is obtained from a path v₀, v₁, ... v_p up by joining v_i and v_i+i to two new vertices v_p+1+i and v_2P+1+i for i = 0, 1, ..., p-1. Shows that all double triangular snakes are harmonious.

ref

022193   Tripathi A K;Gupta S K;Gupta M (Computer Engineering Dep, Institute of Technology, Banaras Hindu University, Varanasi-221 005, Email: anilkt@bhu.ac.in) : Some observations on relationship between maintainability and object - oriented analysis. Int J Inf Comput Sci 2007, 10(2), 1-7.

Object oriented analysis (OOA) gives emphasis only on conceptual picture of the system 10 be built as objects. Complexity in expressing requirements during analysis modeling is a prime cause for maintenance. This paper carries out the 'don'ts" dos of the analysis process to enhance the maintainability of the object oriented system. Define relationship among all the four maintenance activities (corrective, adaptive, preventive and perfective maintenance) and nine elements (noise, silence, overspecification, contradiction, ambiguous, forward reference, dilemma, inconsisfentvocabulary and non-clarity) that are generally drawbacks attached to use of natural language during analysis phase. This relationship will help an analyst to perform analysis in such a way that would result in enhanced maintainability of the software system.

1 table, 11 ref

022192   Rishi R;Singh S;Kamra A;Hari Singh (Computer Science & Engineering Dep, TITS, Bhiwani (Haryana), Email: rahulrishi@rediffmail.com) : Software reliability estimation with mission time using moranda's geometric software relibility model. Pure appl Math Sci 2008, 67(1-2), 1-3.

Moranda geometric de-Eutrophication model [20], N(t) is defined as the number of faults detected in the time interval (0, f]. In this paper, N(t) is studied as a pure birth stochastic process, where failure rates decrease geometrically with a detection and fixing of a fault. This paper demonstrates the use of a recursive scheme to study the probability of detecting V number of bugs in time (0,t]. The method uses a constructed table which makes this method more easier compared to all the other existing methods to compute the Probability of removal of n number of faults in time (0, t] i.e. P_n(t), intensity function λ(t) and Probability that the software does not fail in the interval (t, t + t] i.e. (t). In the proposed procedure P_n(t) involves (n + 1) terms and each term is multiplied by a constant, obtained from the constructed table. The developed system performs with 90% accuracy as compared to earlier system and approximately 10% reduction in time for projects with size (delivered object code instructions) in the range of 5000-21000 and the tabular and the recursive technique has made the system simple to understand.

10 illus, 4 tables, 21 ref

022191   Rahul R;Sukhvir Singh;Hari Singh (Computer Science & Engineering Dep, TITS, Bhiwani-127 021, Email: rahulrishi@rediffmail.com) : Classification of software reliability models. Pure appl Math Sci 2008, 67(1-2), 15-21.

In the paper, an effort has been made to classify software reliability models according to Software Development Life Cycle phases.

1 table, 22 ref

022190   Malviya A K (Computer Centre, M. G. Kashi Vidyapith, Varanasi, Email: anilkmalviya@yahoo.com) : Predicting software maintenace, effort for object oriented systems using neural network. Int J Inf Comput Sci 2007, 10(2), 14-37.

Software maintenance is still a major activity that uses up much of the time and capital of the software industry. Thus, producing software that is easy to maintain may potentially save large costs. The problem of maintaining software is widely acknowledged in software industry. Result of a study in which eight Object-Oriented metrics and two size metrics were empirically investigated. More particularly, the relationships between Object-Oriented design metrics, size metrics and maintenance effort of a class as measured by change metric were investigated, therefore it is determined that whether these metrics can be used as quality (maintenance effort) predictors, and (2) a feed forward back propagation MLP neural network trained with maintenance history, which maps the class based design metrics onto an estimated maintenance effort is to be used for predicting maintenance effort of Object-oriented system.

12 illus, 15 tables, 15 ref

022189   Liu Y;Li J;Zhu J;Gao H (School of Computer Science & Technology, Harbin Institute of Technology, 318# 150001, Harbin, China, Email: liuyong123456@hit.edu.cn) : Clustering frequent graph patterns. J Digital Inf Mgmt 2007, 5(6), 335-46.

Several novel concepts such as δ-cover graph, jump value and o-jump pattern are proposed for efficiently summarizing frequent graph patterns: Based on the property of all o-jump patterns being representative graph patterns, we propose two efficient algorithms for summarizing frequent graph patterns, RP-FP and RP-GD. The RP-FP algorithm computes representative graph patterns from a set of closed frequent graph patterns, whereas the RP-GD algorithm directly mines representative graph patterns from graph databases. The RP-FP has tight approximation (summarization) bound but higher computational complexity. The RP-GD has no approximation bound guarantee but is far more efficient. We conducted extensive experimental studies using various real and synthetic datasets. Experimental results show that RP-FP and RP-GD are able to obtain compact summarization in both real and synthetic graph databases. When the number of closed graph patterns is very large, RP-GD is much more efficient than RP-FP, while achieving comparable summarization quality.

17 illus, 20 ref

022188   Jain M;Pandey R (Mathematics Dep, I.B.S., Khandari, Agra-282 002) : Bulk retrial queue with server breakdown and setup time. Int J Inf Comput Sci 2007, 10(2), 57-72.

In computer and telecommunication networks bulk retrial queues are very common. M^xIG/I queueing system with retrial, server breakdown and setup times, followed by two phases of repairs is considered. On finding the server busy or in case of incomplete service, the customers again join the orbit for a retrial. The noble feature of the present study is the incorporation of unreliable server, batch arrival, setup times and repair in two phases which have not been taken together into consideration in previous study on retrial queues. Making use of supplementary variable technique, we construct the governing Chapman Kolmogorov equations. We employ the probability generating functions and Laplace transform for obtaining the steady state queue size distribution. Several performance measures viz. mean queue length in orbit and in the system and mean waiting time. Numerical illustrations have been provided to support theoretical results.

1 illus, 1 table, 22 ref

022187   Idicula S M;David Peter S (Computer Science Department, Cochin University of Science & Technology, Cochin 682 022, Email: sumam@cusat.ac.in) : Multilingual query processing system using software agents. J Digital Inf Mgmt 2007, 5(6), 385-90.

Goal of this work was developing a query processing system using software agents. Open Agent Architecture framework is used for system development. The system supports queries in both Hindi and Malayalam; two prominent regional languages of India. Natural language processing techniques are used for meaning extraction from the plain query and information from database is given back to the user in his native language. The system architecture is designed in a structured way that it can be adapted to other regional languages of India. This system can be effectively used in application areas like e-governance, agriculture, rural health, education, national resource planning, disaster management, information kiosks etc where people from all walks of life are involved.

4 illus, 4 tables, 16 ref

022186   Huq A;Ramachandran N T (Middle East College of Information Technology, , Saltanate of Oman, Email: huq@mecit.edu.om) : VDM specification of an algorithm for graph decomposition. J Digital Inf Mgmt 2007, 5(6), 347-53.

Complex software systems need a precise specification of their intended behaviour. While graph theory plays an important role in several aspects of building such software systems, formal methods provide a rigorous mathematical framework within which a system can be described. In this paper, an algorithm for decomposing a graph into disjoint paths is presented. Such decompositions are useful, particularly in implementing software testing. VDM representation of the proposed algorithm facilitates automation of testing process without any ambiguity.

34 ref

022185   Chauhan R K;Parveen Kumar;Dalal S O (Computer Sc & Applications Dep, Kurukshetra University, Kurukshetra-136 119, Email: pk223475@yahoo.com) : Some complexities and inconsistencies in existing coordinated checkpointing protocols for mobile distributed systems. Int J Inf Comput Sci 2007, 10(2), 8-13.

Minimum-process coordinated checkpointing is a preferred approach to introduce fault tolerance in mobile distributed systems transparently. This approach is domino-free, requires at most two checkpoints of each process on stable storage, and forces only interacting processes to checkpoint. Sometimes, it also requires piggybacking of information onto normal messages, blocking of the underlying computation or taking some useless checkpoints. Some complexities and inconstancies in existing minimum-process blocking coordinated checkpointing protocols for Mobile Distributed Systems are pointed out. We also point out the cause of the problems and give some guidelines for designing such protocols.

2 illus, 10 ref

022184   Benyamina A E H;Boulet P (NO, Universite d'ORAN ES-SENIA BP 1524 EL mnaouer ORAN Algerie, , Email: benyanabou@yahoo.fr) : Multi-objective mapping for NoC architectures. J Digital Inf Mgmt 2007, 5(6), 378-84.

In order to improve the performance of current embedded systems, network -on-Chip (NoC) offers many advantages, especially in terms of flexibility and low cost. Applications require more and more intensive computations, especially multimedia applications such as video encoding. Developing production and application using such an architecture offers many challenges and opportunities. Many tools will be required to develop a NoC architecture for a specific application. A tool which can map and schedule an application or a set of applications to a given NoC architecture will be essential and must be able to satisfy many relative trade-offs (real-time, performance, low power consumption, time to market, re-usability, cost, area, etc.

7 illus, 10 ref

022183   Al-Dahleh M Z;Shehabat I M (NO, , hiladelphia University, Email: ishehabat@yahoo.com) : Method of reduction of the microinstructions of synchronous digital systems. J Digital Inf Mgmt 2007, 5(6), 368-71.

Method to synthesize the Algorithm State Machines (ASM) for synchronous digital systems using Combined Addressing is presented. In this proposed method, the microinstructions are divided into subsets, and thus the Numbers of microinstructions are apparently minimized and the throughput time of the automation is reduced.

7 illus, 3 tables, 13 ref

022182   Al- mawi A;Khanfar K (Al-Isra Private University, , Jordan, Email: amaal_amawi@hotmail.com) : Performance of integrated wired (Token ring) network and wireless (PRMA) network. J Digital Inf Mgmt 2007, 5(6), 372-7.

Computer networks can be built using either wired or wireless technology. Although wired network has been the traditional choice, wireless technologies are becoming more popular. One of the most challenges is to have an existing wired network to which a wireless network extension could be added. Specifically the challenge is to connect a group of wireless networks through a wired backbone. The primary purpose of this study is to develop an integrated mathematical model by integrating Packet Reservation Multiple Access (PRMA) one of the most wireless LAN protocols and Token Ring wired network protocol. Performance parameters of an integrated PRMA- Token Ring model such as delay and throughput have be analyzed. The numerical analysis presented in this paper may help in studying the affect of some parameters on the system performance and stability.

5 illus, 12 ref

022181   Ajit Singh (Computer Science & Information Technology Dep, Technological Institute of Textile & Sciences, Bhiwani-127 021, Email: ghanghas_ajit@rediffmail.com) : Efficient quantum crytography's algorithm for data security. Indian J Engng Mater Sci 2007, 14(5), 346-51.

Provides a conceptual framework on the proposed C-QUBITS Key exchange algorithm, which is used as a base for the data security through quantum computing. In the first phase a detailed description of the BB84 Cryptographic protocol is given, from which the first algorithm based on the quantum cryptography has been derived. In this the emphasis is on the loopholes present in this algorithm which makes it less effective. In the next phase the focus is made on the C-QUBITS algorithm, which can be used for the exchange of key between the sender and the receiver. Thereafter, the key is used for the encryption of the data to be transferred between the two entities. This algorithm makes use of the concepts of quantum physics like polarization and more importantly C-NOT gate which is mainly used in case of qubits (quantum hits). Complexe experimental set-up of the whole process involved in the algorithm has been presented and all possible cases have been discussed. Mathematical solution is derived which proves that data security through C-QUBITS algorithm is more effective and secure than other algorithms based on quantum approach.

5 illus, 2 tables, 12 ref

022180   Abuelyman E S;El-Affendi M A (NO, CCIS, Prince Sultan University, Riyadh 11586, Saudi Arabia, Email: abuelyaman@cis.psu.edu.sa) : Real time S-box construction using arithmetic modulo prime numbers. J Digital Inf Mgmt 2007, 5(6), 354-60.

Analyzed several implementations of the inverse function for the S-Box using various approaches in search for an optimal one. In particular, simulation was used to analyze performances of algorithms for computing the inverse function based on: the arithmetic modulo a power-of-two; arithmetic modulo a power-of-two plus one; and arithmetic modulo a prime number. The simulation revealed that the modulo a prime number approach has the best performance. Furthermore, the analysis revealed that using this approach may enhance security relative to the original approach. The proposed implementation will provide a better alternative that can be embedded in many systems.

2 illus, 3 tables, 17 ref

021148   Zaidi S M R;Hasan M (Electronics Engineering Dep, Zakir Hussain College of Engineering and Technology, Aligarh Muslim Univ, Aligarh-202 002, Email: moshsinrzadi@yahoo.com) : Energy efficient programmable hardware implementation of the secure hash 384 and 512 algorithms. IETE J Res 2007, 53(5), 451-7.

The sustained growth of communication networks over the past few years has led to a phenomenal increase in the amount of data being carried over them. A consequence of this has been an increase in the amount of sensitive data being carried over these networks resulting in the need for a secure means of data transfer. Used for this purpose, cryptographic algorithms, among others, are known to be computationally intensive, consuming a significant amount of computing resources a fact of critical importance for wireless devices that usually have very limited resources in terms of battery power. Proposes programmable energy efficient architectures for the SHA-384 and 512 algorithms.

8 illus, 7 ref

021147   Mythreyi S;Vaidehi V (Madras Institute of Technology, Anna Univ, Chennai, Email: mythreyis@yahoo.com) : Solutions for group domain of interpretation. IETE J Res 2007, 53(5), 495-502.

Presents a modified standard for Internet Security Associations and Key Management Protocol (ISAKMP) Domain of Interpretation (DOI) for group key management to support secure group communications. The Group Domain of Interpretation (GDOI) manages group security associations, which are used by IPSec (Internet Protocol Security) and other potential data security protocols running at the IP or application layers. These security associations protect one or more key-encrypting keys, traffic-encrypting keys and data shared by group members. In this paper few inadequacies like lack of group identification, lack in unique Source authentication of ESP (Encapsulated Security Payload) and bottle neck in the Group Controller Key Server (GCKS) are addressed and modifications are suggested in order to make GDOI a more secure protocol. The experimental results also prove the above claim.

9 illus, 23 ref

021146   Kunte R S;Samuel R D S (Electronics Dep and Communication, S J College of Enfineering, Mysore-570 006, Email: sanjeevkunte@yahoo.com) : A simple and efficient optical character recognition system for basic symbols in printed Kannada text. Sadhana 2007, 32(5), 521-33.

Optical Character Recognition (OCR) systems have been effectively developed for the recognition of printed characters of non-Indian languages. Efforts are on the way for the development of efficient OCR systems for Indian languages, especially for Kannada, a popular South Indian language. We present in this paper an OCR system developed for the recognition of basic characters (vowels and consonants) in printed Kannada text, which can handle different font sizes and font types. Hu's invariant moments and Zernike moments that have been progressively used in pattern recognition are used in our system to extract the features of printed Kannada characters. Neural classifiers have been effectively used for the classification of characters based on moment features. An encouraging recognition rate of 96.8% has been obtained. The system methodology can be extended for the recognition of other south Indian languages, especially for Telugu.

9 illus, 2 tables, 17 ref

021145   Karim A (Institute of Management and Computer Sciences, Bahria Univ, 13-National Stadium Road, Karachi 75260, Email: abid@bimcs.edu.pk) : Detecting properties of four-segment twin tandem-stripe monolithically integrated devices. IETE J Res 2007, 53(5), 459-63.

Major objective of monolithic integration of active optical components are small size, low power consumption, low cost, improved performance and reliability. Most of these goals can be achieved in multi-segment devices where each segment can be used as optical source, detector, amplifier, switch, modulator etc. In this paper, detecting properties of a four segment twin tandem-stripe monolithically integrated device are investigated experimentally. Results are justified with the help of hybrid active waveguide devices in order to make investigations more reliable.

6 illus, 15 ref

020082   Rathedi M (Botswana Univ, Private Bag UB 705, Gaborone, botswana, Email: rathedim@mopipi.ub.bw) : Botswana's energy sector: seeking alternative sources of enegry. Int J Envir Dev 2007, 4(1), 73-82.

Botswana economy is largely dominated by a non-renewable commodity- diamond in spite of efforts of the past two decades to diversify the economy. Given the concept of diversification of the fuel mix to increase security of supply, all existing sources of energy will be developed in their own right so as to achieve the optimal energy needs for all. The development of the energy policy in Botswana which is guided by national development goals can increase its reliance on renewable energy by enacting supportive state policies, reducing barriers to the adoption of renewable technologies and by encouraging individual, business, and government purchasers of energy to use renewable more efficiently. Government has to give special emphasis on developing new and renewable sources of energy as alternatives or complementary supplies of affordable and sustainable sources of energy.

2 illus, 10 ref

019090   Zhu J;Esenstadt M;Goncalves A;Denham C;Uren V;Song D (Knowledge Media Inst and Computing Res Consortium, The Open University, , , Email: j.zhu@open.ac.uk ) : Social search with missing data: which ranking algorithm?. J Digital Inf Mgmt 2007, 5(5), 249-61.

System called Buddy Finder is presented' which can automatically identify buddies who can best match a user's search requirements specified in a term-based query, even in the absence of stored user-profiles. Five statistical measures, namely, our own CORDER, mutual information (MI), phi-squared, improved MI and Z score, and two TF/IDF based baseline methods to find online users who best match the search requirements based on 'inferred profiles' of these users in the form of scavenged web pages are compared. These measures identify statistically significant relationships between online users and a term-based query. Our user evaluation on two groups of users shows that BuddyFinder can find users highly relevant to search queries, and that CORDER achieved the best average ranking correlations among all seven algorithms and improved the performance of both baseline methods.

3 illus, 3 tables, 24 ref

019089   Zhang Y;Milios E;Zicir Heywood N (Faculty of Computer, Dalhousie Univ, 6050 Univ Ave., Halifax, NS, Canada B3H 1W5, Email: cs.dal.ca) : Comparative study on key phrase extraction methods in automatic web site summarization. J Digital Inf Mgmt 2007, 5(5), 323-32.

Web Site Summarization is the process of automatically generating a concise and informative summary for a given Web site. It has gained more and more attention in recent years as effective summarization could lead to enhanced Web information retrieval systems such as searching for Web sites. Extraction-based approaches to Web site summarization rely on the extraction of the most significant sentences from the target Web site based on the density of a list of key phrases that best describe the entire Web site. In this work, we benchmark five alternative key phrase extraction methods, TFIDF, KEA, Keyword, Key term, and Mixture, in an automatic Web site summarization framework we previously developed. Investigates the performance of these underlying methods via a formal user study and demonstrate that Key term is the best choice for key phrase extraction while Mixture should be used to obtain key sentences. Also discusses why one method performs better than another and what could be done to further improve the summarization system.

3 tables, 35 ref

019088   Semeraro G (Informatics Dep, Univ of Bari, Via E. Orabona, 4 70126-Bari, Italy, Email: semeraro@di.uniba.it) : Personalized searching by learning wordnet-based user profiles. J Digital Inf Mgmt 2007, 5(5), 309-22.

Novel technique is prepared to learn user profiles which exploits word sense disambiguation based on the Word Net lexical database, in an attempt to produce semantic user profiles that might discover topics semantically closer to the user interests.' Semantic profiles are used in the definition of a retrieval model that turns the traditional document-query search paradigm into a novel document-query-profile paradigm. As an example of this paradigm, we present an extension of the vector space model in which profiles are used to modify the ranking of search results obtained in response to a query, hopefully putting personally relevant items on the top of the result list. Experimental results in a movie retrieval scenario indicate that the proposed model to personalize Web search is effective.

7 illus, 5 tables, 33 ref

019087   Ntoulas A;Chao G;Cho J (NO, , ) : Infocious web search engine: improving web searching through linguistic analysis. J Digital Inf Mgmt 2007, 5(5), 277-91.

Infocious Web search engine [23], which currently indexes more than 2 billion pages collected from the Web. The main goal of Infocious is to enhance the way that people find relevant information on the Web by resolving ambiguities present in natural language text. Towards this goal, Infocious performs linguistic analysis to the content of the Web pages prior to indexing and exploits the output of this analysis when ranking and presenting the results to the users. Our hope is that this additional step of linguistic processing provides Infocious with two main advantages. First, Infocious tries to gain a deeper understanding of the content of Web pages and to match the users' queries with the indexed documents better, improving the relevancy of the returned results. Second, based on its linguistic processing, Infocious tries to organize and present the results to the users in a structured and more intuitive way. In this paper we present the linguistic processing technologies that we investigated and/or incorporated into the Infocious search engine, and we discuss the main challenges in applying these technologies to Web documents. We also present the various components in the architecture of Infocious, and how each one of these components benefits from the added linguistic processing. Finally, we present preliminary results from our experimental study that evaluates the effectiveness of the described linguistic analysis.

1 illus,8 tables, 54 ref

019086   Bhanu Teja C;Mitra S;Bagchi A;Bandyopadhyay A K (Tata Consultancy Service, , Hyderabad, Email: bhanu_teja@gmail.com) : Pre-processing and path normalization of a web graph used as a social network. J Digital Inf Mgmt 2007, 5(5), 262-76.

Two level compression technique has been provided. In the first level, the structural properties of a graph are studied and strongly connected components are fused ªto reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalªization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.

10 illus, 34 ref

019085   Adali S;Hill B;Magdon-Ismail M (Rensselaer Polytechnic Institute, , 110 8th Street, Troy, New York 12180, USA, Email: sibel@cs.rpi.edu) : Information vs. Robustness in rank aggregation: models, algorithms and a statistical framework for evaluation. J Digital Inf Mgmt 2007, 5(5), 292-308.

Rank aggregation problem has been studied extensively in recent years with a focus on how to combine several different rankers to obtain a consensus aggregate ranker. Studies the rank aggregation problem from a different perspective: how the individual input rankers impact the performance of the aggregate ranker. Developes a general statistical framework based on a model of how the individual rankers depend on the ground truth ranker. Within this framework, one can generate synthetic data sets and study the performance of different aggregation methods. The individual rankers, which are the inputs to the rank aggregation algorithm, are statistical perturbations of the ground truth ranker. With rigorous experimental evaluation, we study how noise level and the misinformation of the rankers affect the performance of the aggregate ranker. Introduces and study a novel Kendall-tau rank aggregator and a simple aggregator called PrOpt, which we compare to some other well known rank aggregation algorithms such as average, median, CombMNZ and Markov chain aggregators. The results show that the relative performance of aggregators varies considerably depending on how the input rankers relate to the ground truth .

14 illus, 3 tables, 20 ref

018054   Pathak S V;Shirsat N A;Gajakos A V;Nalawade S M;Gharde K G (CAET, Dr. B.S. Konkan Krishi Vidyapeeth, , Dapoli, Dist Ratnagiri, Maharashtra) : Development of an electronic information system on farm mechanisation. Biomed 2007, 18(1-2), 99-106.

Electronic information system that take advantage of new technological developments on the world wide web, is the key towards fulfilling the mission of the extension educator i.e. to help individuals, families and communities put research based knowledge to work in improving their livelihood. Web pages are one key to achieving these goals, which provide rapid and easy access to verifiable information database and the co-ordination of good information resources using an organisational format. A database has been created on Farm Mechanisation to provide complete information about Crop Production and Land development equipment, Irrigation and Drainage equipment, Poultry equipment, Dairying Machinery and Equipment, Fisheries Equipment including Trawlers, Crop Processing and Value Addition Equipment and Allied Machinery. The database was designed using Oracle 8i and a series of Web pages was developed which provides information on Farm Mechanisation by a click of the mouse on highlighted links. ASP, HTML, Java Script, and VB Script were used for filtering the database and designing the Web Site. Finally the accessibility of the web site will be provided using Geographical Information System Interface (GIS).

5 illus, 11 ref

016001   Satyanarayana Reddy K;Sriharsha C (NO, Birla Institute of Technology and Science, Pilani, Rajasthan, Email: ksn632@gmail.com) : Laptop Hard Disk Drive thermal validation. J Coop Univ Res Ind Enterpr 2008, 1(2), 57-66.

For Laptop thermal validation, it is very essential to know a method for Flotherm model by which each of its major components can be modeled accurately. Since Hard Disk Drive (HDD) is one of the major power consuming components of any system, a numerical model which describes all of its thermal properties should be known for doing complete system analysis. The aim of thermal validation is to come up with a Flotherm model which can predict the temperatures on the HDD surfaces that reasonably match with the experimental temperatures. One way to model a Hard disk is to assume a cuboid with volumetric heat generation. But this method might not capture the hotspots exactly. Demonstrates the methods applied in finding the best method for the Flotherm-HDD thermal model which clearly represents the HDD with its hotspots. Also gives the relationship of HDD power with its RPM and capacity.

15 illus, 3 tables, 4 ref

016000   Pal R;Mitra J;Pal M N (Computer Science Dep, Univ of California, Davis, Davis, California, Email: rnpal@ucdavis.edu ) : Evaluation of relative performance of product designs: a fuzzy DEA approach to quality function deployment. Opsearch 2007, 44(4), 322-45.

The Fuzzy DEA approach is introduced in Quality Function Deployment (QFD) to evaluate relative performance of alternative product designs, when performance characteristics obtained from voice of customers are fuzzy, product design data are often limited, inaccurate and vague, and imprecise relationships exist among engineering and performance characteristics.

2 illus, 7 tables, 17 ref

015999   Jagadeesh Kannan R;Prabhakar R;Suresh R M (NO, , ) : Recognition of printed and handwritten Tamil characters using hybrid technique. Int J mathl Sci 2007, 6(3-4), 385-99.

Describes a system to recognize handwritten Tamil Characters using a Hidden Markov Model (HMM) approach, for a subset of the Tamil alphabet. The handwritten documents are available in the form of books, papers, etc. are scanned using standard scanners, which produce an image of the scanned document. In the first stage, an unknown character is pre-classified into one of the three groups: core, ascending and descending characters. As part of the preprocessing phase the image file is checked for skew detection, noise removal and binarization. The preprocessed image is segmented using an algorithm, which decomposes the image into individual characters. A database of character image glyphs is created out of the segmentation phase. Then all the image glyphs are considered for recognition using Hidden Markov Models (HMM). Each image glyph is passed through various routines, which extract the features of the glyph. The glyphs are now set ready for classification based on these features. The HMM Classifier is then used for the final recognition. The system is trained with 200 character images. A separate set of character being considered for the testing purpose. 5 different writers are considered for colleting the samples, written on the preformatted paper.

4 illus, 2 tables, 29 ref

014850   Srikumar Murthy G;Bhakthavathsalam R (NO, , BITS-Pilani, Rajasthan-333 031, Email: srikumamurthy@gmail.com ) : Perspectives of emerging computing paradigms and related issues. J Coop Univ Res Ind Enterpr 2008, 1(1), 19-26.

Computing in the future shall engulf and encompass every sphere of human life but will be inconspicuous yet ubiquitous and pervasive in nature. Discusses the revolution set to take place in the next two decades with its profound impact on industry, commerce, social and psychological factors. Also discussed certain issues that can be detrimental to every living being as a result of such colossal computing. This work has been done as a collaborative research initiative between lISc, Bangalore and BITS-Pilani.

1 illus, 6 ref

013868   Venkatesh S R;Mohan Kumar G C (Industrial & Production Engg, J N N College of Engineering, Shimoga, Karnataka, Email: srvenkatesh_12@yahoo.co.in) : Optimization of manufacturing process to improve casting yield. Mfg Technol Today 2008, 7(1), 16-21.

Numerical simulation and animation is widely used and accepted in manufacturing to reduce hardware prototyping and to improve the parts design and manufacturing processes. Using casting simulation and animation systems it is possible to define the temperature fields in the mould and the cast parts quantitatively. Through the temperature field analyses, the thermal induced stresses and plastic displacements occurring in the material during the cooling process can be analyzed. The manufacturing tolerance can be controlled in the development phase and time necessary for product design can be optimized. ProCAST software is used in the present work to organize around a manager, which calls the four different modules. MeshCAST, PreCAST, DataCAST and ViewCAST. First casting geometry, in the form of CAD model is loaded into MeshCAST, to generate a FEM mesh. Then the calculation is configured in PreCAST, the pre-processor, PreCAST is linked to Thermodynamic Databases for the automatic determination of the material properties form thermodynamic databases. Before the solver ProCAST is launched, a data conditioner named DataCAST is run. Finally, the results are viewed and presented in this paper.

10 illus, 9 ref

013867   Singh A P (NO, College of Engineering, Technology, Moradabad, Uttar Pradesh) : Compution of medians in a distributed service network. Acta Cienc Indica-Math 2007, 33(3), 1061-4.

Mathematical programming algorithms for finding the medians in a distributed network has been formulated.

5 ref

013866   Shribman V (PULSAR Ltd. Magnetic Pulse Forming, , Joining & Welding Yavne 81103, Email: pulsar@pulsar.co.il) : Magnetic pulse technology applied to welding and forming. Mfg Technol Today 2008, 7(3), 3-9.

2 illus, 1 table, 8 ref

013865   Jeyaraman K;Kalyana Raman R;Vidhya V (Computer Science Dep, Alagappa Univ, Karaikudi, Tamil Nadu) : Single server feedback queues of bath arrivals and optional server vacations. Acta Cienc Indica-Math 2007, 33(3), 745-53.

Single server queue with batch arrivals and general service time distribution has been studied. The server provides service to customers one by one on a first come first served basis. As soon as the system empties the server goes for vacation, and returns from the vacation and starts service if at least one customer is in the system. Also just after completion of service, the customer may either leave the system or rejoin for re-service. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers in the queue, the average waiting time in the queue. Some special cases of interest are discussed and some results have been derived. A numerical illustration is provided.

15 ref

013864   Dev Anand M;Selvaraj T;Kumanan S (Production Engg Dep, National Institute of Technology, Tiruchirapplli, Email: anandpmt@yahoo.co.in) : An adaptive fuzzy logic approach for fault detection in robot manipulators with parametric uncertainty. Mfg Technol Today 2008, 7(2), 15-23.

A high degree of automation in flexible production units demands powerful tools for supervision and fault detection. Recent advances on the theory of model-based fault diagnosis in dynamic systems. Robot manipulator fault detection and diagnosis involves processing of huge information about the robot system. A fuzzy logic based threshold for residual evaluation is suggested here. The proposed fuzzy logic control scheme has been applied to trajectory control of a five -degree-of -freedom robot manipulator. The proposed method is capable to address unstructured and unknown disturbances. Simulated results are presented in terms of fault detection accuracy and knowledge extraction feasibility.

10 illus, 21 ref

012930   Stephan K;Harrison L M;Kiebel S;David O; Penny W D;Friston K J (Wellcome Dep of Imaging Neuroscience, Institute of Neurology, University College London, 12 Queen Square, London WC1N 3BG, UK, Email: k.stephan@fil.ion.ucl.ac.uk) : Dynamic causal models of neural system dynamics: current state and future extension. J Biosci, Bangalore 2007, 32(1), 129-44.

Causal mechanisms in neural systems are described in terms of effective connectivity. Recentl, dynamic causal modelling (DCM) was introduced as a generic method to estimate effective connectivity from neuroimaging data in a Bayesian fashion. One of the key advantages of DCM over previous methods is that it distinguishes between neural state equations and modality-specific forward models that translate neural activity into a measured signal. Another strength is its natural relation to Bayesian model selection (BMS) procedures. In this article, we review the conceptual and mathematical basis of DCM and its implementation for functional magnetic resonance imaging data and event-related potentials. After introducing the application of BMS in the context of DCM, we conclude with an outlook to future extensions of DCM. These extensions are guided by the long-term goal of using dynamic system models for pharmacological and clinical applications, particularly with regard to synaptic plasticity.

8 illus, 36 ref

010885   Su-Cheng Haw;Radha Krishna Rao G S V (Faculty of Information Technology, Multimedia Univ, 63100 Cyberjaya, Malaysia, Email: schaw@ammu.ed.my) : Eficient path query processing support for parent-child relationship in native XML databases. J Digital Inf Mgmt 2007, 5(2), 82-7.

Due to its flexibility and efficiency in transmission of data, XML has become the emerging standard for data transfer and exchange across the Internet. In native XML database, XML documents are usually modeled as trees, and XML queries are typically specified in path expression. The primitive structural relationships are parent-child and ancestor-descendant in the path expression. Thus, finding all occurrences of these relationships is crucia. Authors adopt the decomposition-matching-merging approach and propose INLAB, a novel hybrid query processing merging both indexing and labeling technologies. Experimental results show that INLAB can process XML path queries by up to an order of magnitude faster than conventional top-down approach.

8 illus, 28 ref

010884   Mitrovic D;Zeppelzauer M;Edidenberger H (Vienna Univ of Technol, Inst of Software Technol and Interact Systems, Favoritenstrasse 9-11, A-1040, Vienna, Austria, Email: edenberger}@ims.tuwien.ac.at) : Analysis of the data quality of audio descriptiosn of environmental sounds. J Digital Inf Mgmt 2007, 5(2), 48-54.

Perform statistical data analysis of a broad set of state-of-the-art audio features and low-level MPEG-7 audio descriptors. The investigation comprises data analysis to reveal redundancies between state-of-the-art audio features and MPEG-7 audio descriptors. Also Introduces a novel measure to evaluate the information content of a descriptor in terms of variance. Statistical data analysis reveals the amount of variance contained in a feature. It enables identification of independent and redundant features. This approach assists in efficient selection of orthogonal features for content-based retrieval. We believe that a good feature should provide descriptions with high variance for the underlying data. Combinations of features should consist of decorrelated features in order to increase expressiveness of the descriptions. Although MPEG-7 is a popular and widely used standard for multimedia description, only few investigations do exist that address analysis of the data quality of low-level MPEG-7 descriptions.

2 illus, 4 tables, 19 ref

010883   Maurizio Montagnuolo;Alberto Messina (Universita di Torino, Dipartimento di Informatica, , Corso Svizzera 185, Torino, Italy, Email: montagnuolo@di.unito.it) : Multimedia knowledge representation for automatic annotation of broadcast TV archives. J Digital Inf Mgmt 2007, 5(2), 67-74.

Multimedia content classification and retrieval are indispensable tools in the current convergence of audiovisual entertainment and information media. Thanks to the development of broadband networks, every consumer will have digital video programmes available on-line as well as through the traditional distribution channels. In this scenario, since the early '90s, the most important TV broadcasters in Europe have started projects whose aim was to achieve preservation, restoration and automatic documentation of their audiovisual archives. In particular, the association of low-level multimedia features to know edge and semantics for the purpose of automatic classification of multimedia archives is currently the target of many researchers in both academic and IT industrial communities. This paper describes research direction, which is focusing on three points: (a) introduce a new taxonomy for classification of broadcast digital archives based on a novel theoretical approach. The advantage of this taxonomy is that it can provide an unambiguous representation of multimedia informative content from the relevant points of view to the broadcasters community. (b) secondly present a multilayer multimedia database model to represent both structure and content of multimedia objects. (c) further propose a framework architecture for building a Multimedia Fuzzy Annotation System (MFAS), and a description of our experimental plan.

3 illus, 34 ref

010882   Jinghua Zhu;Jianzhong Li;Hong Gao (School of Computer Science & Technology, Harbin Institute of Technology, 318#, 150 001, Harbin, China, Email: zhujingua@hit.edu.cn) : Energy efficient and QoS-aware tasks allocation for sensor networks. J Digital Inf Mgmt 2007, 5(2), 88-94.

Collaborative processing among sensors to fulfill given tasks is a promising solution to save significant energy in resource-limited wireless sensor networks (WSN). Quality-of-Service (QoS) such as lifetime and latency is largely affected by how tasks are mapped to sensors in network. Tasks allocation is a well-defined problem in the area of high performance computing and has been extensively studied in the past. Due to the limitations of WSN, existing algorithms cannot be directly used. In this paper, a novel nested optimization technique based on genetic algorithm is proposed to assign tasks onto sensors with minimal cost while meeting application's QoS requirements. Optimal solution can be achieved by incorporating task mapping, routing path allocation, communication scheduling, dynamic voltage scaling. Performance is evaluated through experiments with randomly generated Directed Acyclic Graphs (DAG) and experiments results show better solution compared with existing methods.

10 illus, 2 tables, 18 ref

010881   Hammiche S;Lopez B;Benbernou S;Mohand-Said hacic;Vakali A (NO, LIRIS - University Claude Bernard Lyon 1, , Email: shammich}@liris.univ-lyon 1.fr) : Domain knowledge based queries for multimedia data retrieval. J Digital Inf Mgmt 2007, 5(2), 75-81.

Describes an approach for semantic description and retrieval of multimedia data described by means of MPEG-7. This standard uses XML schema to define the descriptions. Therefore, it lacks ability to represent the data semantics in a formal and concise way and it does not allow integration and use of domain specific knowledge. Moreover, inference mechanisms are not provided and hence the extraction of implicit information is not (always) possible. To address these issues, we propose to add a conceptual layer on top of MPEG-7 metadata layer, where the domain knowledge is represented using a formal language. A set of mapping rules is proposed. They serve as a bridge between the two layers. Querying MPEG-7 descriptions using XML query languages such as XPath or XQuery requires to know MPEG-7 syntax and documents structure. To provide a flexible query formulation, we exploit the conceptual layer vocabulary to express user queries. A user query, making reference to terms specified at the conceptual level, is rewritten into an XQuery expression over MPEG-7 descriptions.

3 illus, 4 tables, 13 ref

010880   Emmanuel Eze;Tanko Ishaya;Dawn Wood (Centre for Computing, The Univ of HULL, Scaborough Campus, UI, Email: e.eze}@dcs.hull.ac.uk) : Contextualizing multimedia semantics towards personalised e learning. J Digital Inf Mgmt 2007, 5(2), 61-6.

Recent developments of the Internet and the World Wide Web (WWW) have resulted in the proliferation of multi-media resources and learning with existing multimedia web resources on the Web is becoming more prevalent and important. While recent standardization efforts in eLearning such as LOM, SCORM, and IMS Learning Design work towards learning content description, packaging, and delivery; existing eLearning solutions still lack the ability to adequately use multi-media resources to provide a learner with personalised learning resources. Effective use of multimedia for web-based learning provides quality interactive learning experience, but current techniques does not adequately provide a semantic approach for organising multimedia resources. With evolving trend in learning through the use of web technology, Learning systems are expected to provide personalised learning resources for effective learning. We have accordingly proposed a way of organising existing multimedia resources based on contexts towards providing a truly personalised eLearning experience. This paper presents a framework for achieving context-based multimedia semantic annotation and organisation towards personalised learning.

3 illus, 19 ref

010879   Ansgar Scherp;Susanne Boll;Holger Cremer (Research Institute OFFISpOldenburg, Germany, , , Email: ansgar scherp@offis.de) : Emergent semantics in personalized multimedia content. J Digital Inf Mgmt 2007, 5(2), 55-60.

Authoring of personalized multimedia content can be considered as a process consisting of selecting, composing, and assembling media elements into coherent multimedia presentations that meet the user's or user group's preferences, interests, current situation, and environment. In the approaches authos find, media items and semantically rich metadata information are used for the selection and composition task. However, most valuable semantics for the media elements and the resulting multimedia content that emerge with and in the authoring process are not considered any further. This means that the effort for semantically enriching media content comes to a sudden halt in the created multimedia document-which is very unfortunate. His proposed with the SemanticMM4U framework an integrated approach for deriving and exploiting multimedia . semantics that arise with and from the creation of personalized multimedia content and make it available for further use and applications. In this approach, not only the metadata are considered that are semantically evolving from the media elements of the newly created presentation. Also the actual usage of media elements for the authoring can emerge new semantics of the single media elements employed. In the application domain of authoring of digital photo albums authors show where and how semantics emerge in the authoring process and how these contribute to an even richer medIa content pool, both for single media and also for the composition and its later use.

4 illus, 27 ref

009855   Pawar V;Mehrotra S C;Marwale A (Computer Sci & Information Technol Dep, Dr B.A.M. Univ, Aurangabad-431 004, Email: vrushsen_pawar@indiatimes.com) : Sensitive analysis of electroencephalography signals to human facial expressions. Natn Acad Sci Lett 2006, 29(5-6), 207-11.

Brain signals have been recorded using Digital Electroencephalograph (EEG) instrument on different human subjects under different conditions. The experimental subjects have been asked to give different human expressions and corresponding signals have been recorded through EEG. An attempt has been made to correlate these results to Facial Action Coding System (FACS). The result can be used for recognition of facial expression in a real time computer system.

4 illus, 6 ref