023579   Indumathi D;Chitra A;Lavanya R (Dep of CSE, PSG Coll of Technol, Coimbatore, Email: indumathi_d@yahoo.com) : Suitability of multiagents for intelligent distributed searching. J Comput Sci 2005, 1(3), 243-8.

Search engines have become an essential component of everyday life in modem society. Most of the applications involve some interaction with search engines one way or the other. The objective of the work is that an agent can "rapidly" customize a search result. An agent is a software or hardware that is capable of acting on behalf of its users to accomplish their tasks. An agent monitors the user's actions to prioritize the remaining query results. It learns based on the user's preferences and information content of the query. Fuzzy based computation is used in grouping/categorizing the files according to the relevancy. Based on the relevancy score calculated, the files are ranked. This is a powerful utility for fast file searching across the LAN and includes the ability to search for the file and its contents, given the keyword and ranks the result set based on the relevancy.

9 illus, 2 tables, 11 ref

023578   Hamsapriya T;Sumathi S (Computer Sci and Engng Dep, PSG Coll of Technol, Coimbatore-641 004, Email: prish_67@yahoo.co.in) : Targeted association querying for dynamic and distributed databases. J Comput Sci 2005, 1(3), 249-59.

Advances in computing and communication over wired and wireless networks have resulted in many pervasive distributed computing environments. Many of these environments deal with different distributed sources of voluminous data, multiple compute nodes, and distributed user community. Implementation of data mining ideas in high-performance parallel and distributed computing environments is thus becoming crucial for ensuring system scalability and interactivity as data continues to grow inexorably in size and complexity. Recent business trends favor targeted association querying to constrain the search to specific items. Discusses a unified approach for distributed datamining and targeted querying that reduces the communication overhead by constructing a distributed itemset tree. The tree also provides the ability for incremental mining and transaction tracing. Construction of the itemset tree has O(N) space and time requirements. Experiments were conducted to observe the behavior of the itemset tree in distributed and incremental mining.

4 illus, 8 tables, 23 ref

023577   Ganapathy G (Dep of Computer Sci, Bharathidasan Univ, Trichirapalli, Tamil Nadu-620 023) : Pre-syntactive analysis of NL sentences for auto generation of programming interface. J Comput Sci 2005, 1(3), 269-76.

Auto Generation of Programming Interface is a framework that leverages the NLP and Auto Programming concepts and suggests a probable generation of a syntactically valid piece of code transformed from NL description. Addresses the initial phases of the framework that include lexical and morphological analysis. A size conscious lexicon has been constructed for the framework that is compiled from the data collection survey. A powerful yet simple strategy called projection mathematics is employed to map a lexical component to all possible derivations from its stem.

1 illus, 2 tables, 10 ref

023576   Chenna Reddy P;Chandra Shekhar Reddy P (NO, JNTU Coll of Engg, Anantapur, Andhra Pradesh, Email: pcreddy1@rediffmail.com) : Active queue management in a QOS enabled network. J Comput Sci 2005, 1(3), 197-204.

Performance comparison of Drop Tail and RED and does an extensive study of RED have been done. The impact of both the Queue disciplines on TCP traffic have been examined. Performance difference is observed at higher levels of congestion. Average queuing delay of Drop Tail and RED has been measured. By maintaining average queue size small RED tries to minimize the delay, which makes it suitable for delay sensitive applications. RED Byte and Packet modes of operation have been compared. The effect of RED's ability to mark packets instead of dropping them called Explicit Congestion Notification is also studied. The simulation is performed using NS2 and graphs are drawn using Xgraph.

5 ref

023575   Bhuuvaneswari K;Arunkumar T (Dep of Master of Computer Applics, Karpagam Coll of Engng, Coimbatore-32, Tamilnadu) : Security in group conference protocol (SGCP). J Comput Sci 2005, 1(3), 205-13.

The technology of digital conference has opened up a new area of research and application to computer networks in industry. It can be used in a board meeting, scientific discussion or in virtual classrooms, through the computers connected by IP networks. To protect conversations from eaves dropping, a common conference key agreement protocol is required. Conference key protocol secures the discussion session and data among multiple conferees engaged in common goal of communication. Numerous works have been carried out in providing secured conference, but most of the works concentrate on an efficient key exchange protocol to prevent malicious users to attempt to play the proxy role or delay or destruct the conference environment. Proposes a novel approach of unique dynamic ID based key exchange protocol using Diffie-Hellman algorithm, which possesses the property of fault-tolerance secured session, dynamic ID key generation and key exchange methods.

5 illus, 3 tables, 9 ref

022495   Patra K (NO, Rourkela Inst of Mgmt Stud, Rourkela) : Knowledge management: a challenge in IT industry. Elect Inf Plann 2005, 33(1-2), 18-21.

Technology is the great enabler and one of the most powerful forces of change. It has a major impact on the business. Of many management tools widely used for the successful corporate, the most management control. Information technology has found an indispensable place in most of the organisation. All activities and resources are seamlessly linked to each other to ensure cost and time efficiency. Examined the importance of knowledge management in the field of information technology.

3 illus, 4 ref

022494   Parvinder Singh;Batra S;Sharma H R (Dep of Computer Sci and Engng, Guru Jambheshwar Univ, Hisar-125 001) : Hiding credentials in biological images. Agric biol Res 2006, 22(1), 22-5.

Algorithm to hide the credential of biological image in 6th and 7th bit of image pixel and its retrieval at the receiver end has been developed. Algorithm hides the credential in 6th and 7th bit in such a way that effect to original image is not only perceptually invisible as in the case, when credential is hidden in least significant bit, but it avoids the some of the disadvantages associated with least significant bit insertion method.

1 table, 9 ref

022493   Chatterjee S;Agrawal R (NO, , ) : EU market- an opportunity for Indian ICT industry. Elect Inf Plann 2005, 33(1-2), 3-17.

India's IT strength is being recognized by the world. Its software exports, one of the key enabler for the growth in economy, are mainly dependent on three markets such as US, UK and Australia. Indian companies are, thus, looking forward to other destinations to sustain the growth of its Information and Communications Technology (ICT) business. European Union of its present form after integration, would be an excellent opportunities for Indian ICT sector. Discusses the availability of market access for Indian ICT sector in the 25EU states. An attempt has also been made to study the country wise ICT penetration, ICT spendilng and thereto market niches and hurdles for Indian companies. Also suggests strategies needs to be adopted by European Union (EU) companies to forge win-win business tie up with Indian ICT synergies. Concludes with a perception that EU-India collaboration in ICT sector has an enormous potential to grow the future world economy if the technology, skills sets, funds available on both sides could be utilized in logical manner without having threat perception and job transfer etc.

1 illus, 3 tables, 32 ref

021489   Visveswaran C R (NO, , ) : Information security challenges in RFID. Elect Inf Plann 2006, 33(5-6), 139-42.

7 ref

021488   Victor S P;Xavier C;Arumugam S (Computer Sci Dep, St. Xavier's Coll (Autonomous), Palayamkottai-627 002) : Parallel algorithm to find a weighted core of a tree. J Comput Sci 2006, 1(4), 287-92.

Let T be a tree in which both the vertices and edges are assigned weights. For any two vertices u, v in V(T), the weighted distance wd(v,u) is defined to be the product of the weight of the vertex u and the sum of the weights of the edges of the unique v - u path in T. If s⊆(T) and v ∈V(T), wd(v,s) = min_u∈s wd(v,u). The w-core of T is path P in T for which wd(P)=Σ_v∈V(T)d(v,P) *w(v) is minimum. A parallel algorithm for finding the w-core of T has been presented and proved that the algorithm requires O(log²n) time using O(n²) processors on the CREW PRAM.

3 illus, 6 ref

021487   Thakur R S;Jain R C;Pardasani K R (Computer Applic Dep, UIT RGPV, Bhopal, M.P., Email: ramthakur2000@yahoo.com) : (NULL). J Comput Sci 2006, 1(4), 301-12.

The problem of efficiency of the main phase of most data mining applications such as frequent pattern mining has been described. This problem is mainly related to the number of operations required for counting pattern supports in the database. Proposed a multi-strategy based new algorithm, which combines Pincer-search approach with counting Inference approach for mining maximum frequent pattern. Pincer-search works in both direction, bottom-up as well as top-down. The main search direction is still bottom-up but a restricted search is conducted in the top-down direction. As a very important characteristic of the algorithm, it is not necessary to explicitly examine every frequent itemset. Counting inference allow to perform as few support counts as possible. Using this method, the support of a pattern is determined without accessing the database whenever possible using the supports of a pattern is determined without accessing the database whenever possible using the supports of some of its sub-pattern called key patterns. MAXFP method performs well even when some maximal frequent itemsets are long. It reduces cost of the frequent itemsets discovery process that is minimize support count operation as well as database scan.

3 illus, 18 ref

021486   Suganthi M;Albert Raj A (ECE Dep, Thiagarajar Coll of Engng, Madurai, Tamil Nadu) : FPGA implementation of an efficient Ip routing filter. J Comput Sci 2006, 1(4), 324-9.

Proposes a new mechanism for an efficient router design with focus to an IP address lookup algorithm, which uses a small amount of memory. Typically each filter is a destination adderss prefix and longest prefix matching is used to determine the next hop for each incoming packets. By exploiting the low memory access latency and high bandwidth of on chip memory high speed packet forwarding can be achieved using this data structure. When designing a router three pertinent issues are to be addressed i.e., routing lookup, switching and scheduling. The main objective is to design an efficient router that uses a fast routing lookup algorithm and an efficient data compression algorithm to store the routing table in a tree, which uses a very little memory in the router. The route lookup mechanism proposed here, when implemented in a pipeline fashion in hardware, can achieve one route lookup for every memory access. With the current 50 ns DRAM, this corresponds to approx 20 x 10⁶ packets (lookups) per second. Analysis shows that this algorithm needs only 400 kb memory for storing 20 k entries thus achieving a high compression. This design can be easily up from IPv4 to IPv6.

4 tables, 18 ref

021485   Samarajesh M D;John J (NO, Rajagiri Sch of Computer Sci, Rajagiri, Kalamassery, Kochi-683 104, Email: samrajesh@rajagiri.edu) : Processor allocation in grid using binary linear programming. J Comput Sci 2006, 1(4), 336-40.

The essence of Grid Computing is federation, process acceleration and virtualization of computing resources; it creates a dynamic computing environment for sharing resources. Grid resource mangement is the process of locating various types of resources, finding their capacity and their current status and allocating them and monitoring their state. One of the main challenges in Grid resource management is the optimal allocation of the various resources available in the grid system to the tasks submitted by users. An optimal grid allocation strategy will make the grid system work efficiently by completing the tasks effectively utilizing the available resources in the grid system to its optimum. Discusses about using Binary Integer Linear Programming (Binary ILP) technique for optimally assigning the requested tasks to various available resources in the grid system. The various tasks at time t are quantified as their sizes in bytes. The primary memory, in bytes of each resource in the grid system is considered as its capacity. The allocation of various tasks to various resources are optimally done considering the various parameters influencing the grid allocation viz. speed of the CPU, Average waiting time, Band width, Latency time, Data transfer rate, Physical devices etc.

2 illus, 2 tables, 10 ref

021484   Sachan A K;Jain R C;Rana R L (Computer Sci and Engng Dep, SATI (Degree), Vidisha, M.P., Email: sachank12@yahoo.com) : Distributed dynamic channel borrowing with call-on-stay scheme for cellular mobile networks. J Comput Sci 2006, 1(4), 317-23.

A new distributed dynamic channel-borrowing with call on stay scheme based on compact pattern has been presented. If a new or handoff call is put on hold for a short while in a cell, in the absence of an available channel, it is highly likely that the local base station will soon find a channel for the call. This scheme does not require system wide information about the local cell and its interfering cells. In the proposed, DDCA algorithm is said to have failed to assign a channel to a call only if a waiting call is delayed for longer than a threshold period called maximum delay. The impact of small values of maximum delay on the average delay suffered by all calls in the network is negligible, but the reduction in failure rate is significant.

7 illus, 2 tables, 10 ref

021483   Rampal M (NO, , ) : Secured banking using PKI. Elect Inf Plann 2006, 33(5-6), 150-5.

021482   Ramaraj E;Karthikeyan S;Hemalatha M (Computer Sci and Engng Dep, Alagappa Univ, Karaikudi, Tamilnadu) : Improvement of Eun-Jun-Kyung-Kee's remote user authentication scheme in smart card using hybrid encryption. J Comput Sci 2006, 1(4), 293-300.

The smart card plays a major role in on line transactions. Recently, Eun-Jun-Kyung-Kee proposed a remote user authentication scheme for smart card. In their scheme the remote system authenticates the details of smart card without any password or verification tables and the Trusted Timestamp Authority (TTA) provides the timestamp values. Furthermore, they calculate ΔT, a time difference between the card reader and remote systems. They are not given any proper information about maintaining the key values with secrecy in a remote system, or way of transfer of the key values securely using public networks and calculations of ΔT. Aims to solve the above problems using hybrid encryption approach. It gives a methodology using AES-Rijndael symmetric encryption algorithm for maintaining secure key values in a remote system and provides secure channel with the help of RSA asymmetric algorithm. It also focus on avoiding third party for providing the timestamp and reducing the computation cost.

5 illus, 1 table, 10 ref

021481   Prasanna M;Sivanandam S N;Venkatesan R (Computer Sci and Engng Dep, PSG Coll of Technol, Coimbatore, Email: mp_psg@rediffmail.com) : Test case generation using graph theory in object oriented systems. J Comput Sci 2006, 1(4), 341-7.

The UML models are used as the basis for functional testing. Considers the open state chart diagram for a real time example. The models are transformed into usage models to describe the system behavior. Graph Theory techniques has been employed to bring out all possible test cases of a given state chart diagram.

4 illus, 6 tables, 16 ref

021480   Poongodi P;Thanushkodi K;Sivanandam S (Electl and Electron Engng Dep, Govt Coll of Technol, Coimbatore, T.N., Email: poongodiravikumar@yahoo.co.in) : PID controller design for higher order continuous system via reduced model. J Comput Sci 2006, 1(4), 357-64.

The process of stabilization of linear time invariant continuous system involves appropriate selection of the parameters of the controller. In classical control systems, the stabilization of linear time invariant system is achieved by selection of either PID controller or phase compensator. Proposes a novel technique for model order reduction for a given higher order Linear Time Invariant Continuous systems. A PID controller is designed for reduced order model by using pole zero cancellation method for stabilization process. After obtaining the first estimates of the controller partameters further adjustment is still necessary to stabilize the output response. The steps inolved in this schme are illustrated with an exmaple.

3 illus, 4 tables, 14 ref

021479   Narotra P S (Deparment of Inf Technol, , ) : Nearshoring - compelling reasons for Indian Information Tehcnology export industry to adopt. Elect Inf Plann 2006, 33(5-6), 133-8.

`Nearshoring' refers to software development centers located outside the client's country but near enough for comfort. Nearshore centers allow IT companies to garner more business with a long-term impact on the bottom line, make dynamic sourcing decisions and improve the effectiveness of the IT organisation. Some of the Indian IT companies like TCS, Infosys, WIPRO and Satyam have already realized the importance of Nearshoring. Uruguay, Canada, Mexico and Germany are fast becoming destinations for Indian software firms to set up Nearshoring centers as these locations provide easy access to the US, Europe and Far East markets while catering to the local language requirements. In addition to the proximity, which gives increased comfort level to the client, the Nearshoring also brings the benefits of the common history and the culture, which go a long way is establishing long term business relationship between the client and the service providers. Offshoring still suffers from some of the major risks such as increased managment complexity, reduced effectiveness due to communication difficulties, lower quality of output, lack of direct control over resources, uncertain financial payback, uncertain information confidentiality and lack of proximity to staff/vendor. Whereas, Nearshoring has overcome almost preferred option for outsourcing. Various articles and papers available on the net giving research details on Offshoring and Nearshoring and describes the latest international trends, which the global companies are following has been analysed. At the end, the paper recommends a strategy that India should follow if it has to sustain growth and achieve the vision of becoming global powerhouse in the area of software development and software services including ITES and BPO.

2 tables, 7 ref

021478   Mukherjee S;Tapaswi S (Computer Applic Dep, Prestige Inst of Managemnet, Gwalior, M.P., Email: mukherjee.saurabh@rediffmail.com) : Dynamic image retrieval method based on genetic algorithm. J Comput Sci 2006, 1(4), 313-16.

A dynamic image retrieval algorithm, which tolerates the imperfection of feature expressions, has been presented. It is based on an interactive genetic algorithm (GA) that can address the image features of the physical, graphical and sematic layers.

1 illus, 8 ref

021477   Manikandan S;Chitra A;Venketesh P (CSE Dep, PSG Coll of Technol, Coimbatore, T.N., Email: manigandan_me@yahoo.co.in ) : Request routing in CDN using Haversine formula geo-deflection approach. J Comput Sci 2006, 1(4), 330-5.

Over the past few years, making information available to a rapidly growing user population in the Internet is becoming a challenging problem. This increased Internet access traffic has lead to a poor QoS (Quality of Service). Content Distribution Network (CDN) serves to provide some special solution to these issues with aid of surrogate servers. To disseminate data effectively to the end users, surrogate servers are palced in different geographical locations to maintain large number of replicas to act on behalf of origin servers. It significantly reduces the load on origin server, minimizes latency time and traffic on the Internet; improves response time to the users. Request routing is a familiar technique to progress the accessibility of web sites. An innovative technique referred as Geo-Deflection (GD) method for request routing in CDN that reduces the client latecny significantly has been prsented. In this GD method, geographical coordinates (longitudes and latitudes) of local DNS are used to find out the nearest surrogate server with minimum computation using Haversine formula.

3 illus, 11 ref

021476   Khan R A;Mustafa K (Computer Sci Dep, Jamia Millia Islamia, New Delhi, Email: khanraees@lycos.com) : Input profiling for reliability estimation. J Comput Sci 2006, 1(4), 348-56.

Identifies operation profile and test profile of execution as an important factor to analyze the failure behaviour of software as an extension of the study by the authors. The relationship between software relaibility and operational profile, and test profile has been recognized as a major issue in software engineering. Such inference is based on the premises that the identification of operational profile and test profile of software is proposed. Such an estimate of software reliability by observing or evaluating failure of software would be valid for specific operational profile. It is also observed that Reliability R(t) may be defined for some specific operational profile.

3 illus, 25 ref

021475   Avhad S;Ghude K (NO, , ) : RFID in logistics. Elect Inf Plann 2006, 33(5-6), 143-9.

020453   Talukder A K;Sharma D;Rao V B (NO, Int Inst of Inf Technol Bangalore, 26/C, Electronics City, Hosur Road, Bangalore-560 100) : Multifactor TLS protocol for holistic security in mobile environment. IETE J Res 2006, 52(2-3), 239-46.

Proposes holistic security model through multi-bearer communication protocols over TCP/IP and SS#7 signalling networks to address security challenges in mobile environment. Holistic security comprises of multi-bearer communication, multifactor authentication, mutual authentication, TLS (Transport Layer Security), and fine-grained contextual role based access control. Authors has presented a novel procedure named as SS#7 Medium Access Procedure (SMAP) to access the SS#7 bearer through SMS (Short Message Service) that has been tested in a live GSM network. Through this procedure, security vulnerability in SMPP (Short Message Peer-to-Peer) protocol was overcome. Extension of TLS protocol for mutual authentication and principal evaluation was also proposed. Through principal content awareness, determine the location and network attributes of the client to invoke fine-grained contextual role based access control.

4 illus, 20 ref

020452   Suri P K; Rakash Kumar;Chauhan R K (Kurukshetra Univ, , Kurukshetra) : Hypertext quality measurement. Int J Inf Comput Sci 2004, 7(2), 35-40.

Hypertext has given a new dimension to the Information retrieval (IR) science. The navigation in and retrieval from hypertext is quiet easy due to their flexible structure. But this flexibility is the main cause of `Lost in Hyperspace problem. The main source of this problem is superfluous cross reference links. There is a brief discussion of lost in hyperspace problem, techniques to tackle this problem and significance of software metrics. In the 2nd part of this paper. A hypertext quality metric LCD (Limit of Converted in Distance) is developed which is an indicator of limit of connectedness in hypertext.

2 illus, 4 tables, 10 ref

020451   Srivastava V (Computer Engng Dep, Inst of Technol Banaras Hindu Univ, Varanasi) : Three dimensional reengineering. Int J Inf Comput Sci 2004, 7(2), 25-34.

Traditional reengineering applies reverse engineering to existing system code to extract design and requirements. Forward engineering is then used to develop the replacement system. Due to limited resources, many organizations, NASA included, are looking at the use of COTS software packages as a means of decreasing development time and costs. Briefly describes traditional reengineering , then describes the earlier work in this area i.e. hybrid reengineering and then discusses the process of three dimensional reengineering which covers the aspect of reuse in software reengineering projects as mentioned in the earlier work of hybrid reengineering. Three dimensional reengineering uses a combination of reverse engineering, reuse and forward engineering to replace the existing system. The advantages, potential risks and metrics for a three dimensional mode of software reengineering. Again the reverse engineering is not only to find hidden facts; but also to extract the reusable components have been discussed.

10 ref

020450   Singla R K;Bansal P (Computer Sci and Applics Dep, Panjab Univ, Chandigarh, Punjab, Email: rksingla@pu.ac.in) : Why have open source applications caught the eye of higher education?. Punjab Univ Res J Sci 2005, 55, 13-22.

The choices of software in an educational environment are based upon a range of issues; much of which involve weighing the risks against the benefits about the purposes to which the softwawre is to be put. The educational institutes are interested in increasing the interoperability between software systems for teaching and learning and administrative purposes. The question of how to achieve interoperability hinges on the nature of the standards upon which the software is based. This is akin to determining the nature of the foundations upon which a house is to be built. Open standards that allow the standard to be seen, provide the capacity for interoperability between both open and proprietary software. Open source software (OSS) provides a concrete way of developing open standards. Rather than making open standards theoretical exercises, OSS provides the practical means for determining these standards. Open source, a new model of software development that brings millions of developers into a collaborative, productive community and provides an introduction to OSS in the context of higher education. It is intended to provide the basis for developing some shared understandings about what OSS is; its benefits; its limitations; and it provides a brief description of popular open source licenses common to eductional applications. Focuses on the use of OSS in computer science education.

4 illus, 1 table, 20 ref

020449   Pawar B V;Sharma A K (NO, , ) : Artifical life: goals, algorithms, its relation with AI and its simulation packages. Int Libr Movement 2006, 28(1), 11-15.

ref 5

020448   Parveen Kumar;Lalit Kumar;Chauhan R K (CSE Dep, NIT, Hamirpur, H.P., Email: pk223475@yahoo.com) : Hybrid coordinated checkpointing protocol for mobile computing systems. IETE J Res 2006, 52(2-3), 247-54.

Minimum-process coordinated checkpointing is a suitable approach to introduce fault tolerance in mobile distributed systems transparently. The approach is domino-free, requires at most two checkpoints of each process and only minimum number of processes to checkpoint. At times, it requires piggybacking of some information with normal messages, blocking of the underlying computation or taking some checkpoints more than the minimum required. In minimum-process checkpointing, some processes, which are not part of minimum set, may not take checkpoints for several checkpoint initiations, and thus may starve to checkpoint. In case of recovery after a fault, this may lead to their rollback to far earlier checkpointed states and thus may cause greater loss of computation. In coordinated checkpointing, where all processes checkpoint, the recovery line is advanced for each process but the checkpointing overhead checkpoint, the recovery line is advanced for each process but the checkpointing overhead may be exceedingly high, especially in mobile environments; because, all mobile nodes need to checkpoint even if some may be disconnected or in doze mode operation. To balance the checkpoint overhead and the loss of computation on recovery, author has proposed a hybrid coordinated checkpointing algorithm, where an all-process coordinated checkpointing is forced after the execution of minimum-process coordinated checkpointing algorithm for a fixed number of times. Thus, the Mobile nodes with low activity or in doze mode operation may not be disturbed during minimum-process checkpointing and the recovery line is advanced for all processes after an all-process checkpoint. Optimised the piggybacked information, avoid blocking and minimise the number of useless checkpoints.

2 illus, 1 table, 17 ref

020447   Omer K A A;Lobiyal D K (Sch of Computer and Systems Sci, Jawaharlal Nehru Univ, New Delhi-110 067, Email: k_abook@hotmail.com) : Efficient grid location service scheme for MANET. IETE J Res 2006, 52(2-3), 177-85.

Introduced modified and efficient Grid location Service scheme. Further developed an analytical model to evaluate the performance of Grid Location Service, and modified Grid location Service schemes using Markov chain. Author has used a distance based triggering strategy to trigger a location update for moving nodes in the network. Introduced the use of sub areas corresponding to threshold distances. Further, the model also considers selective queries for destination search to compute the average total cost that includes the update cost and query cost. The average total cost is determined for different threshold distances corresponding to sub areas in the network. The analytical results show that the modified Grid location Service scheme outperforms Grid Location Service location upgrade scheme.

17 illus, 17 ref

020446   Malviya A K;Dutta M (M.G. Kashi Vidyapeeth, , Varanasi) : Measuring the maintainability of object oriented systems. Int J Inf Comput Sci 2004, 7(2), 1012.

The paper aims to reanalyze the dat (Li and Henry, 1993), in an effort to find early indicator of predictability of maintainability of Object Oriented System. For this purpose, the maintainability of the system was analyzed at the analysis/design level and implementation levels by employing multiple linear regression and MLP neural network model. Results revealed that the employed models while providing comparability and explanatory bases of the observed major trends in tune with the models, provided early indices for predictability of maintainability of object oriented system.

1 illus, 4 tables, 23 ref

020445   Jain M;Sharma P (Math Dep, Inst of Basic Sci, Khandari, Agra) : Controllable multi server queue with balking and additional servers. Int J Inf Comput Sci 2004, 7(2), 13-24.

Multi server controllable queueing model with balking. To reduce the balking behaviour of the customers, there is provision of additional removable servers. These additional servers are facilitated / removed at a pre specified threshold levels of the queue size. The inter arrival and service times are interdependent and follow exponential distributions. Chapman Kolomogrove equations governing the model in the steady state are constructed by equating the in-flow rate to out-flow rate for each state. Queue size distribution was obtained by employing recursive approach. Various steady-state characteristics namely average number of customers in the system, expected waiting time, etc. were derived by using queue size distribution.

10 ref

019445   Saxena P C;Jasola S (Sch of Computer and System Sci, JNU, New Delhi-110 067) : Mobility management in IP based networks. IETE Tech Rev 2006, 23(1), 35-46.

With the ever increasing use of portable and hand held devices for voice and data communication, there is a growing expectation to access information anytime, any where. There are different technologies providing access to voice, data and video. These need to be converged in an all internet protocol (IP) based network. Mobile IP is standardized in IETF based on the different versions of IP. The operations involved in Mobile IPv4 and Mobile IPv6 are reviewed and their features compared.

12 illus, 26 ref

019444   Pal U;Chaudhuri B B;Belaid A (Computer Vision and Pattern Recognition Unit, Indian Statistical Inst, 203 BT Road, Kolkata-700 018, Email: umapada@isical.ac.in) : A complete system for bangle handwritten numeral recognition. IETE J Res 2006, 52(1), 27-34.

Paper deals with a complete recognition system for unconstrained off-line bangla (Bengali) handwritten numerals. To take care of variability involved in the writing style of different individuals, a robust scheme is presented here. The scheme is mainly based on new features obtained from the concept of water overflow from reservoir as well as topological and structural features of the numerals. The proposed scheme is tested on data collected from different individuals of various background and an overall recognition accuracy of about 92.8% from 12000 data have been obtained.

9 illus, 1 table, 16 ref

019443   Nandi S;Kandom Reddy S (Sch of Computer Engng, Naanyang Technol Univ, Singapore-639 798, Email: assukumar@ntu.edu.sq) : Customized and dynamic information systems - a web enabled approach. IETE Tech Rev 2006, 23(1), 61-9.

The main deficiencies of the web based systems which are available at present are its non-existent dynamic nature and its failure to provide user customization. This new customized and dynamic framework tried to overcome these above deficiencies of the web. Considering all features of the proposed system, it is expected that in future all publications and teaching methods will be based on proposed system or a variant of it where they will have far reaching utilities. The main advantage of the system can be felt when the suite of features offered by it be availed by users of the web.

4 illus, 10 ref

019442   Mitra A K (NO, , Marine Engineer, U.K) : Computer application onboard a vessel - distributed digital control system. J Instn Engrs-Pt MA 2006, 86(Jan), 42-5.

Describes a microprocessor-based, computer-oriented control system where all operations including navigation and propulsion controls of a ship have been decentralized and managed from the field controller command centres. All parameters, data and communications within the ship's sub-systems are controlled by the decentralized field control stations with data being acquired, processed and stored locally for onward transmission to the command centre.

019441   Chattopadhyay S;Nagamaheswara Reddy P (Electron and Electl Commun Engng Dep, Indian Inst of Technol, Kharagpur-721 302, Email: santanu@iitg/ernet.in) : Finite state machine decomposition for low power. IETE J Res 2006, 52(1), 35-43.

Paper presents a Genetic Algorithm based strategy to partition finite state machine (FSM) into two disjoint FSMs, such that the bigger partition can be kept deactivated most of the time. The resulting power saving is found to be much higher than the works reported in the literature.

7 illus, 5 tables, 13 ref

018374   Ram Kumar;Kush A (Dep of Computer Sci and Applics, Kurukshetra Univ, Kurukshetra 136 119) : Backbone based routing for ad hoc mobile networks. IETE Tech Rev 2006, 23(2), 127-33.

Recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use single route and do not utilize multiple alternate paths. Proposes a scheme to improve existing on-demand routing protocols by introducting the concept of backbone based node scheme in ad hoc network scenarios. The scheme establishes the multiple paths without transmitting any extra control message. It offers quick adaptation to distributed processing, dynamic linking, low processing and memory overhead and loop freedom at all times . Authors has incorporated scheme with the ad hoc On-Demand Distance Vector protocol and by extensive simulation the performance has been studied. It clearly shows that scheme performs very well with respect to existing schemes.

3 illus, 1 table, 16 ref

017362   Singh K;Thakur S S;Devraj (Computers Dep, Cent Inst of Agric Engng, Nabi Bagh, Berasia Road, Bhopal-438) : Approaches for uncertainty management in information systems. Ultra Scient phys Sci 2005, 17(3M), 333-42.

Studies a simple and general model of information systems, and use this model to classify the various kinds of uncertainty in information systems into two major categories: uncertainty in descriptions of the real world and uncertainty in manipulations of descriptions of the real world and uncertainty in manipulations of descriptions. Author has surveyed briefly several approaches that have been developed for dealing with these kinds of uncertainty, and authors speculate on the reasons that information systems have been slow to incorporate such uncertainty capabilities. Deals with basic issues regarding the measurement of relevant types of uncertainty and uncertainty-based information in theories that represent imprecise information of various types. Finally, Stresses that relevant research in the area of databases may be applicable to information systems, after it is adpated to address the specific concerns and constraints.

^iia3 illus, 20 ref

017361   Shobha G;Sharma S C;Doreswamy (NO, R. V. Coll of Engng, Bangalore, Email: shobhatilak@rediffmail.com) : Mining association rules for a large data sets. J Analysis Computn 2005, 1(1), 1-14.

Data mining is defined as the process of discovering significant and potentially useful patterns in large volumes of data. Discovering associations between items in a large database is one such data mining activity. In finding associations, support is used as an indicator as to whether an association is interesting. The objective of the research work is focused on investigating a technique for extraction associations, finding frequent patterns, correlations, or casusal structures from the data source, which is derived from the current population survey conducted by the United States. The survey is conducted based on demographic and economical aspects. The association module that developed used frequent pattern (FP) - growth method which needs only two databases scans when mining all frequent item sets. The first scan counts the number of occurrences of each item. The second scan constructs the initial FP-tree, which constains all frequency information of the original data sets. FP-tree is mined for finding the associations. The experimental results show that the investigated system achieves an acceptable level of performance.

2 illus, 15 ref

017360   Ramakanth Kumar P;Sharma S C;Doreswamy H; Sharath V (CMRTU, R.V. Coll of Engng, Bangalore, Email: pramakanth_2000@yahoo.com) : Document mosaicing using modified list data structures. J Analysis Computn 2005, 1(2), 121-39.

Modern scanning facility, in general restricts the size of the document or the picture to be scanned to the size of standard A4 page. Also, scanning pages from a hard bound book, or manuscripts which are immovable is problematic. Document scanning with an over-the-desk video camera offers an attractive alternative to the flat-bed scanner, photocopier or fax machine, since the documents need not be moved from their usual place of reading. However, standard digital cameras can sample full A4 pages at only 100 dots per inch, which merely translates to a crudest reproduction. This motivates the use of "mosaicing", whereby multiple, overlapping images of the document are stitched together seamlessly to form a high resolution composite. A novel metod for mosaicing documents. The method is applicable for documents which are not ortho-normal i.e. skew. The image is pre-processed to get a skew free image and then inserted into a two dimensionala singly linked list data structure to use for effective mosaicing. The method also works effectively for multi-lingual and hand-written documents.

24 illus, 7 ref

017359   Mehta B;Muttoo S K (Computer Sci Dep, Coll of Vocation Stud Univ of Delhi, New Delhi-17, Email: bhavyamehta2003@yahoo.com) : Java in software configuration management system. J Analysis Computn 2005, 1(2), 141-9.

Software Configuration Management community must create SCM systems that handle versions and configurations directly in terms of Java components mainly classes, functions and metods. A major objective of this research paper is to highlight the use of Java in Software Configuration Management systems. This paper portrays how Java can be used effectively in version management and various change control activivities. In web based software development environments, changes can crop up at any stage and Java provides a comprehensive solution to all kinds of changes that may affect any of the software development activities. Another distignuishing feature of the paper is the Java implementation of the case study.

4 illus, 10 ref

017358   Krishnamoorthi R;Seetharaman K (Computer Sci and Engng Dep, Annamalai Univ, Annamalainagar-608 002, Email: kseethadde@yahoo.com) : Image compression using 2-D autoregressive model. Ultra Scient phys Sci 2005, 17(3M), 343-50.

Two-D autoregressive model for image compression, where images are assumed to be gaussian Markov Random field (GMRF). The parameters of the model are estimated by employing the Metropolis-Hastings algorithm based on Bayesian approach. Authors had used arithmetic coding to store seed values and parameters of the model as it gives furthermore compression. Both textured and untextured images are used for experimentation to illustrate the efficiency of the proposed model has been discussed.

3 illus, 18 ref

016306   Tamura Y;Yamada S (Inf Systems Dep Fac of Envir and Inf Stud, Tottori Univ of Envir Stud, Kita 1-1-1, Wakabadai, Tottori-shi 689-1111, Japan) : Software reliability assesment tool for distributed software development projects. Opsearch 2005, 42(4), 297-309.

At present, software development environment has been changing into new development paradigm. Moreover, a software development paradigm based on an open source project is rapidly spreading. A software reliability assessment tool incorporating flexible software reliability growth models based on a nonhomogeneous Poisson process and stochastic differential equations for distributed development environment by using Java programming language has been proposed. The method of reliability assessment for open source software development has been incorporated into the software relaibility assessment tool. Also, actual software fault count data to show numerical examples fo software relaibility assessment for the open source project by using the tool has been analysed.

6 illus, 7 ref

016305   Pham H (Industrial Engng Dep, Rutgers Univ, New Jersey, USA) : Generalized logistic software reliability growth model. Opsearch 2005, 42(4), 322-31.

A generalized logistic software reliability growth model that integrates time-dependent fault detection rate and imperfect removing rate per fault have been presented. A time-dependent logistic growth model has been derived and descriptive and predictive ability of a set of "classical" NHPP reliability models have been compared with one that has been developed based on a software failure data set. The results show that inclusion of both time-dependent imperfect removing and fault-detection rates into a logistic growth function may be worth the extra model cocmplexity and the increased number of parameters required for a better relative fit based on several selection criteria.

5 tables, 14 ref

016304   Narahari Y (Computer Sci and Automn Dep, Indian Inst of Sci, Bangalore, Karnataka) : Contributions of electronic commerce. Ann Indian Natn Acad Engng 2005, 2(Dec), 65-71.

Describes some research contributions to electronic commerce resulting out of work during 2000 - 2004 at the Electronic Enterprise Laboratory, Department of Computer Science and Automation, Indian Institute of Science, Bangalore. The research is motivated by a strong conviction that appropriate mathematical models can significantly improve the efficiency of business processes in electronic commerce. Used mathematical tools such as linear programming, integer linear programming, game theory, mechanism design theory, Markov decision processes, and reinforcement learning to design innovative algorithms for improving the efficiency of electronic markers and electronic business processes.

14 ref

016303   Mehta P;Srividya A;Verma A K (RS Reliability Engng, IIT Bombay, Powai, Mumbai) : Application of machine learning paradigms for predicting quality in upstream software development life cycle. Opsearch 2005, 42(4), 332-9.

Prediction and estimation of the software quality early in the life cycle of software development have become an increasingly important problem. The primary factors affecting the determination of the software quality are the nature of the development process and the specification of the product in the upstream development phases. Current trends in software engineering are promoting the idea of processes maturity which improves the software quality. Models for integrating the product and process attributes are the need of the hour to ensure that process improvement actions are going into the right direction and software quality is improved. As a step towards building such model the application of machine learning paradigms like Artificial Neural Network, Case Based Reasoning, Rule Induction and Genetic Algorithm have been examined towards predicting the software quality characteristics and identifies the potential applications for further research.

1 illus, 15 ref

016302   Kapur P K;Gupta A;Archana Kumar (Opl Res Dep, Univ of Delhi, Delhi-110 007) : Flexible software reliability growth models for distributed systems. Opsearch 2005, 42(4), 378-98.

With the increasing demands on resources and skills needed to complete complex software projects, there is a steady move towards distributed working. Distributed software development is being made feasible owing to rapid advances in communication technologies. Distributed systems often involve development teams that are located across company sites, organizations, sectors and nations: as such there are special risks involved that are over and above the normal risks of software development. A distributed development project with some or all of the software components generated by different teams presents complelx issues of quality and reliability of the software. The need is growing to estimate, risk assess, plan and manage the development of these distributed components and the final full system release. An attempt has been made to compare Non Homogeneous Poisson Process (NHPP) based models in a distributed development environment. Proposed (NHPP) model assumes that the software system consists of a finite numebr of reused and newly developed sub-systems. The reused sub-systems do not consider the effect of severity of the faults on the software reliability growth phenomenon because they stabilize over a period of time i.e. the growth is uniform whereas, the newly develped sub-system does consider that.

6 tables, 16 ref

016301   Grottke M;Trivedi K S (Electl and Computer Engng Dep, Duke Univ, Durham, NC 27708, USA) : Truncated non-homogeneous Poisson process models - properties and performance. Opsearch 2005, 42(4), 310-321.

All non-homogeneous Poisson process (NHPP) software reliability growth models of the finite failures category share the property that every time to failure distribution is defective. The reason for this phenomenon is the fact that according to these models it is always possible that no fault is left in the software. Excluding this possibility leads to a class of infinite failures category NHPPP models which calls truncated NHPP models. Truncated models connected with three well-known finite failures NHPP models and some of their properties have been discussed. The performance of these new models with that of their counterparts have been compared.

3 tables, 12 ref

016300   Dhanalakshmi Y;Basaveswara Rao B;Gangadhara Rao K;Chandan K;Srinivas V (Computer Sci & Engng Dep, Nagarjuna Univ, Nagarjuna Nagar, Guntur-522 001) : Analysis of various performance measures in IP - ATM Gateway of M/G/1/N Queue model. Appl Sci Period 2005, 7(1), 35-41.

Paper brings out a model of IP-ATM gateway with M/G/1/N queue wherein the traffic intensity and server inactivity timeout assume paramount importance. For finite size of buffer, various performance measures viz. Setup rate, Bandwidth utilization, Queue length, Packet delay, Packet Loss and System Efficiency have been evaluated and their influence on the gateway has been discussed.

7 illus, 7 ref