009202   Garg B (Computer Science and Information Technology Dep, Institute of Technology and Management, Sec-23A, Gurgaon-122 017, Email: bindugarg80@gmail.com) : Fuzzy time series forecasting. VOYAGER 2009, 8(1), 5-8.

The Time series analysis method is used for forecasting. Time series analysis is based on the idea that past data can be used to predict the future data. Past data may contain imprecise and incomplete information coming from rapidly changing environment. Also the decisions made by the experts are subjective and rest on their individual competence. Therefore, it is more appropriate for the data to be presented by fuzzy numbers instead of crisp numbers. A weakness of traditional crisp time series forecasting methods is that they process only measurement based numerical information and cannot deal with the perception-based historical data represented by fuzzy numbers. Time Series Analysis using fuzzy method is represented.

1 illus, 18 ref

009201   Divya;Latika Singh (NO, Institute of Technology and Management, Sec-23A, Gurgaon-122 017) : Challenges in software testing based on service level agreement and service oriented architectures. VOYAGER 2009, 8(1), 1-4.

Service Level Agreement is typically a written contract between an IT service provider and its customer which defines specifically the minimum required system performance. This would allow the developer to improve service performances, where needed, and the provider to avoid promising Quality of Service (QoS) level that cannot be guaranteed. SOA consists of a composite set of business-aligned services that support a flexible and dynamically re-configurable end-to-end business processes realization using interface-based service descriptions. The diffusion of service oriented architectures introduced the need of novel testing approaches and one such successful trend is to use SLA as a basis to conduct software testing. Presents a broad review of how the SLA's are beneficial in testing and will discuss some of the challenges faced when testing SLA and SOA.

009200   Chaba Y;Singh Y;Prabha;Sangwan Y (Dep of C S E, G J U & T, Hisar) : Scalability analysis of multicasting routing protocols for mobil AD HOC networks. VOYAGER 2009, 8(1), 30-4.

The advent of universal computing and circulation of portable computing devices have raised the importance of mobile and wireless networking. In wireless and mobile networking multicasting has great impact since it has overcome overheads in unicast routing. This paper investigates, two prominent MANET multicast routing methods for ad-hoc network protocols(ODMRP- On Demand Multicast Routing Protocol and MAODV -Multicast Operation Of Ad Hoc on Demand Distance Vector Protocol). MAODV generate and maintains a multicast tree based on the hard state, whereas ODMRP does the multicast operation based on the soft state by constructing the forwarding group. The analysis shows that ODMRP is better than MAODV in packet delivery ratio at the cost of higher overheads; whereas ODMRP do not have good scalability as the number of senders or the group size increases.

009199   Chaba Y;Kanwarpreet;AmritPal (NO, , ) : Review of computational forensics models for enterprise informatio security. VOYAGER 2009, 8(1), 45-9.

Internet crimes are very serious problem in the current internet era. General crimes of real world are now happening in the cyber society. In order to trace the accused person and prosecute the offenders, legally allowable evidence are gathered from a latent source end and then processed and presented before a court of law. Computational Forensics is one of the foundational ways in which researchers try to understand the scientific basis of a discipline to construct a model which reflect their observations. Enterprise information security architecture (EISA) is a part of enterprise architecture focusing on information security throughout the enterprise. This paper describes various computational forensics models such as Basic Pollitt, DFRW 2001, Reith 2002, and Kruse for Enterprise Information Security, their comparative study and their relevancy in the field of internet crime.

008176   Vasudevan V;Sukumar R (Information Technology Dep, Arulmigu Kalasalingam College of Engineering, Krishnankovil, Virudhunagar District, Tamil Nadu, Email: drvvmcs@yahoo.com ) : Multiserver approach for large-scale secure multicast in wireless environments. Icfai Univ J Comp Sci 2009, 3(4), 48-55.

Deals with multiserver architecture for group key management to minimize the overall system bandwidth. The proposed system utilizes the dynamic split and merge with a low overhead where a physical server adaptively splits and merges its traffic into multiple groups, each served by a logical server so as to minimize its total bandwidth. The performance of this proposed approach is compared with that of the single-server case. The results show that multiserver architecture scales well when compared with the single-server approach.

3 illus, 16 ref

008175   Tirimula Rao B;Srinivasu P;Rao C A;Vardhan K S V;Vidyadhari J (CSE Dep, Anil Neerukonda Institute of Technology & Sciences, Vasakhapatnam) : PGP using chebyshev polynomials. Icfai Univ J Comp Sci 2009, 3(4), 23-9.

Novel idea of achieving higher degree of privacy for e-mails using Chebyshev polynomials for 'Pretty Good Privacy' (PGP) (Kenneth and Ballou, 2005). The strength of polynomials lies in their chaotic properties which are potentially suitable for cryptograph;'. A brief discussion on how these polynomials are helpful in providing good security is also presented and the security strengths are evaluated.

1 illus, 17 ref

008174   Suresh Rao N;Devanand;Avadham P S (NO, College of Engineering, Ghatkesar, Hyderabad, Email: Suresh_jmu@yahoo.co.in) : Propagation behavior of computer virus in the framework of SIR model. Icfai Univ J Comp Sci 2009, 3(4), 37-47.

Describes the dynamics of propagation of computer virus in a network of computers based on the mathematical epidemiological model, Susceptible-Infected-Removed (SIR) model. The asymptotic behavior of susceptible, infected and removed nodes is examined. The threshold phenomena of growth and fall of infective nodes, based on the initial number of susceptible nodes and effective removal rate, is investigated. Further, the Kermack-McKendrick (K-M) epidemic theorem's prediction is examined under certain approximations and also a measure of intensity of the epidemic is shown.

3 illus, 1 table, 9 ref

008173   Selot S;Tripathi N;Zadgaonkar A S (Computer Application Dep, SSCET, Bhilai, Email: sselot@sify.com) : Transition networks for the processing of sankrit text for identification of case endings. Icfai Univ J Comp Sci 2009, 3(4), 56-63.

Processing of the language for extraction of semantic is a challenge in the field of artificial intelligence. Work is being carried out in most of the Indian languages, and Sanskrit being the ancient of all, has a great potential in the extraction process. As given in the grammar of Sanskrit language, its case endings are strong identifiers of the respective word in the sentence. These features are used for identifying the thematic role of a word in a sentence. The problem lies in developing a system with these capabilities. Generally a complete database of all such suffixes is maintained, and then these databases are mapped with each word to identify it as a noun, pronoun, verb and adjective. However, search time in these is very large. This paper presents the design of the system which processes the suffix with the help of the type of net, similar to the transition net for identification purpose. Such extraction features help in representation of knowledge using Sanskrit language.

5 illus, 3 tables, 10 ref

008172   Sarkar S (Computer Science & Engineering Dep, Dr. B.C Roy Engineering College, Jemua Road, Phuljhore, Durgapur-713 206, Email: suvo_sarkar@rediffmail.com) : Fuzzy decision system for student evaluation. Ultra Scient phys Sci 2009, 21(2M), 617-22.

Main aim of the study is to generalize fuzzy decision system for the Assessment of Students in an Engineering colleges or Universities. Roughly speaking, the student's category can be classified into three major classes: so- called Good, Average and Poor. The Teachers who are involved in the course & regularly delivering the lecture Classes, interacting with the students are the best persons to judge or assess a student. The various factors that are taken into consideration for the Student's Assessment are Appearance, Communication skills, IQ, Class Attendance, Punctuality, Alertness, Class Performance and Extra-curricular Activities. Periodically, the University Director is interested in studying the performance Assessment of the Students. Generally, meetings are held where the Teachers involved in the course give their opinion linguistically to the respective Students depending upon the various factors that are taken into consideration for Student's Assessment Process. Then a decision is taken to find out the best Student in the University. A requirement fuzzy subset has been formulated. A relationship is formed between the respective students and the teacher's opinion using the fuzzy subset representation. It is proposed to construct fuzzy decision set which includes the relative merits of all Students in the University. The Index of fuzziness of various Teacher involved in the course are measured and compared. A decision system has been developed using fuzzy distance approach to select the best Student.

1 illus, 1 table, 15 ref

008171   Panduranga Rao M V;Shet K C (National Institute of Technology Karnataka (NITK), , Surathkal, Mangalore, Email: raomvp@yahoo.com) : Analysis and refining of scheduler for real-time operating system. Icfai Univ J Comp Sci 2009, 3(4), 7-22.

Implementing a new scheduling algorithm in an OS kernel is often an important step in scheduling research because it permits evaluation of the algorithm's performance on real workloads. However, developing a new scheduler is not a trivial task because it requires sophisticated programming skills and a deep knowledge of kernel internals. This paper describes our work towards a rapid proto typing system for hard real-time systems focusing on scheduling algorithms arid scheduler implementations. The framework aims at speeding up the decision making process during selection of a suitable scheduling algorithm for a real-time application. In this research paper, the comparison of different preemptive scheduling algorithms is carried out. Hence, by extracting the positive features of each of the generic preemptive scheduling policies, a new parametric scheduling policy is developed. It is expected that the new scheduling algorithm will give better performance with respect to satisfying the needs, such as response time, waiting time and turnaround time.

3 illus, 1 table, 10 ref

008170   Panda S N;Rana N S (NO, RIMT-Regional Institute of Mgt & Tech., Mandi Gobindgarh, Punjab) : ICT : an effective retrofit tool for cyber terrorism. Ultra Scient phys Sci 2009, 21(2M), 611-16.

Tremendous growth and utilization of Information and Communication Technology's (ICT) influence on our society has lead to increased risk of its exploitation by the criminals and terrorist groups. In this age of information superhighways, the traditional paradigm of terrorism is evolving beyond traditional physical violence, hijack, and bombing. Today, a terrorist does not need to travel thousands of miles to attack a target, rather it uses the networked critical ICT infrastructure to target the nation's sensitive installations. This paper explores emerging security threats, tremendously increasing rate of vulnerabilities and multiple types of incidents and its impact.

2 illus, 19 ref

008169   Lal M;Jagtar Singh (Computer Sc. & Engg. Dep, GTBKIET, Chhapianwali, Malout, Email: mlgtb@rediffmail.com) : Novel approach for massage security using steganography. Ultra Scient phys Sci 2009, 21(2M), 633-9.

Establishing hidden communication is an important subject of discussion that has gained increasing importance nowadays. There has been many secret communication techniques proposed in the last few years. The focus was given to steganography to build such techniques. Utilizing stego-keys to hide secret messages into images strengthen the security of these techniques. Informally, steganography refers to the practice of hiding secret messages in communications over a public channel so that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In contrast to the common LSB method used for hiding information in images we have generated a better algorithm for steganography along with its implementation with better security. In this work we have illustrated the fact that next to LSB method with minimum noise of steganography gives less chance for the hacker to hack the information in the network as compared to LSB method.

2 illus, 1 table, 9 ref

008168   Jaswal P K;Pathania D S;Grewal H K;Singla S K (Computer Science & Engineering Dep, Guru Nanak Dev Engineering College, Ludhiana-141 106, Email: dimpy130@yahoo.co.in) : Image restoration using wavelet transformation. Ultra Scient phys Sci 2009, 21(2M), 623-32.

Image de-noising and restoration represent basic problems in image processing with many different applications including engineering, reconstruction of missing data during their transmission and enhancement of biomedical structures as well. This problem occurs also in filling-in blocks of missing or corrupted data. The paper presents the use of Wavelet transform in this area including its application for image, decomposition and rejection of its components at first. The main part of the study is then devoted to methods of restoration of missing image blocks by the search of similar structures of a given image in the Wavelet domain space and comparison of this approach with iterated Wavelet interpolation and predictive image modeling. Proposed methods are verified for simulated images and then applied for processing of magnetic resonance images.

9 illus, 2 tables, 12 ref

008167   Chakraborty P (School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi-110 067, Email: pinaki_chakraborty_163@yahoo.com) : Extracting equations for actual execution times of some frequently used sorting alogrithms. Icfai Univ J Comp Sci 2009, 3(4), 30-6.

Ten common sorting algorithms were implemented and executed on a computer with Intel Pentium-4 running the Microsoft Windows XP operating system. Best case and worst case analyses of the algorithms were performed for lists of 1,000 to 10,000 integers. An improved version of bubble sort algorithm and the recursive quick sort algorithm were the fastest in the best case and the worst case, respectively. Equations for the execution times were also extracted from this analysis. The results displayed the actual performance of the algorithms on the given platform. The results of this study can be used to predict the execution time of these algorithms for an input of arbitrary size. Moreover, the results can be used to compare the performances of new sorting algorithms with those of the existing ones. The study also shows that an algorithm whose execution time is bound by a loose asymptotic limit may run faster than an algorithm whose execution time is bound by a stricter asymptotic limit. This signifies the need to study the actual execution times of algorithms on different hardware and software platforms.

2 illus, 3 tables, 14 ref

008166   Bal S;Nath R (Computer Science & Engineering Dep, Vaish College of Engineeering, Rohtak, Haryana, Email: satinder_bal@yahoo.com) : Comparative study of traditional search engines with the metasearch engines. Ultra Scient phys Sci 2009, 21(2M), 597-610.

Exponential growth of information source on the web and in turn continuing technological progress of searching the information by using tools like Search Engines gives rise to many problems for the user to know which tool is best for their query and which tool is not. To overcome this problem, Metasearch Engines are developed, which dispatch the user's query to multiple search engines automatically and refine the results obtained from the underlying search engines to give the best out of the best to the user. Gives the overview of the architecture of a typical metasearch engine and identifies various technical and non-technical parameters. On the basis of these parameters, a comparative study between traditional search engines and metasearch engines has been carried out and reported.

28 ref

008165   Anisha Kumar (MCA Dep, Pooja Bhagavat Memorial mahajana PG Center, KRS Road, Metagalli, Mysore-560 017, Email: ishaphilip@yahoo.com) : Approaches of the winrunner and load runner softwere testing tools. Icfai Univ J Comp Sci 2009, 3(4), 64-7.

1 illus

005057   Zhao Y;Zhao Y;Zhu Z (NO, Institute of Information Science, Beijing Jiaotong Univ, Beijing, China-100 044, Email: snowmanzhao@163.com) : Co-training for search-based automatic image annotation. J Digital Inf Mgmt 2008, 6(2), 214-18.

Search-based automatic image annotation is an effective technology to enhance the performance of annotation. By integrating the co-training technique, this paper addresses on a novel scheme for search-based image annotation, in which two classifiers can contribute to each other during the training phase. Since each classifier can select some most confident images to enhance the generalization ability of the other one, the co-training learning algorithm is triggered out for automatically mining more and more relevant images, which improve the annotation performance greatly. To characterize the various contribution of each relevant image, the probability output of the classification is taken as the corresponding weight. Moreover, the histogram of retrieved keywords is proposed to re-rank the final reliability of the keywords to be annotated, which can also guarantee the scalability property of annotation to some extent. With the promoted search precision on the basis of co-training strategy, the experimental results demonstrate the improvement of annotation performance.

3 illus, 3 tables, 13 ref

005056   Yoshioka K;Sonoda K;Takizawa O;Matsumoto T (NO, , 79-7 Tokiwadai Hodogaya-ku, Yokohama, Japan, Email: {yoshioka, tsutomu}@yru.ac.jp) : Information hiding on lossless data compression. J Digital Inf Mgmt 2008, 6(2), 151-6.

Authors address a new class of Information hiding on lossless data compression. In 'model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information, from the compressed data. In this paper, we formally define the above model of information hiding on lossless data compression. Then, we focus on a particular compression method, namely LZSS, which is used in ZIP/LHA. Proposes a new method, called IH-LZSS, which controls the trade-off between the maximum embeddable data size and compression rate. Some experimental results are also shown.

7 illus, 1 table, 9 ref

005055   Wang D J;Chen T H C H;Yin Y H (Information Management Dep, National Kaohsiung Marine Univ, Kaohsiung, Taiwan 811, R.O.C., Email: wangdaj@mail.nkmu.edu.tw) : Smoke detection for early fire-alarming system based on video processing. J Digital Inf Mgmt 2008, 6(2), 196-202.

Presents a smoke-detection method for early fire-alarming system based on video processing. The basic strategy of smoke-pixel judgment is composed of two decision functions: a chromaticity-based decision function in static characteristic and a diffusion-based decision function in dynamic characteristic. The chromatic decision rule is deduced by grayish color of smoke and the dynamic decision rule is dependent on the diffusion attribute of smoke. To give an appropriate alarm, a fuzzy scheme is introduced to enhance the reliability of alarming by checking if the quantity of smoke extracted increases with the checking time. Experimental results show that the proposed method can provide an early alarm at a lower false alarm rate before the fire burns up, and hence is very attractive for the important places, social security, commercial applications, and so on.

10 illus, 14 ref

005054   Tsai P W;Chu S C;Huang H C;Chou T;Day J D (Electronic Engineering Dep, National Kaohsiung Univ of Applied Sciences, No. 415, Jiangong Rd., Sanmin District, Kaohusing City 80778, Taiwan, Email: pwtsai@bit.kuas.edu.tw) : Strategy for opposing DC components watermarking. J Digital Inf Mgmt 2008, 6(2), 157-60.

For the watermarking technique, which embeds the watermark in the dc components of the discrete cosine transform (DCT) based image using the method presented by Huang et al. [1], we present two methods to remove the watermark from the carrier image. In our first method, it removes the watermark via varying the energies in the transform domain and redeeming the luminance in the spatial domain. And in the second method, it removes the watermark through diversifying the intensity of dc components in the transform domain. These two methods both can remove the watermark and pass the watermark detection as the images without hidden watermarks. In addition, though we remove the watermark from the watermarked image, the peak signal-to-noise ratio (PSNR) of the cleaned image, in comparison with the original carrier image, is still high.

3 illus, 2 tables

005053   Sankara Gomathi S;Chbeir R;Krishnamurthi S (Computer Science Dep, Sri Venkateswara College of Engineering, Chennai-602 105, Email: sgomathi@svce.ac.in) : Efficient power aware and reputation-based routing protocol for MANET. J Digital Inf Mgmt 2008, 6(1), 21-9.

Energy conservation is a critical issue in Mobile Ad hoc Networks (MANETs) for node and network life, as the nodes are powered by batteries only. In order to maximize the lifetime of MANETs, traffic should be sent through a shortest path that does not contain nodes with low residual energy and consumes minimum total transmission power. The above objectives cannot be satisfied simultaneously by applying the existing power aware routing algorithms. For this reason, several power-aware routing approaches have been proposed in the literature attempting to maximize the network lifetime. An interesting approach called Minimum Drain Rate (MDR) aims to predict the lifetime of nodes according to the current traffic conditions. However, it does not guarantee that the total transmission power is minimized over a chosen route. In this paper, we provide an new approach called Secure Extended Optimal Energy Drain Kate (SEOEDR) able to extend the MANET lifetime and duration of the path, and also to minimize the total transmission power consumed per packet. In our approach, the traffic is routed such that the energy consumption is balanced among the nodes in proportion to their energy reserves. We also handle the selfishness of nodes by considering the node reputation while making the routing decisions. It results in selection of routes that are simultaneously energy efficient and reliable. The simulation results that we have conducted during our study show the relevance of our algorithm, in terms of energy saving and overall network lifetime, in comparison with existing ones.

10 illus, 16 ref

005052   Rajbhandari S;Andres F;Naito M;Wuwongse V (NO, Asian Institute of Technology, Klong Luang, Pathumthani 12120, Thailand, Email: andres@nil.ac.jp) : Topic maps management in spatial-temporal multimedia blogs. J Digital Inf Mgmt 2008, 6(1), 92-9.

Web-based blogging has entered the mainstream of society as an easy way to publish information, and it is exponentially increasing the data volume and its related complexity. Spatial-temporal information (Where and When contexts) contained inside multimedia postings needs to be better semantical/y handled by search engines or by end-users as current web blogs still lack semantic support. The semantic web community has promoted Topic Maps as a technology that reduces the lack of semantics regarding optimization of information creation, exchange, navigation, merging, and dissemination. This paper introduces a new layer that combines blogging standards (e.g. RSS and Atom) with the Topic Maps data model for semantic-augmented and interoperable information exchange support. In addition, the paper includes examples from the Isfahan Islamic Architecture DataBase (IIADB) project, the pilot user of the topic maps layer bridging the semantic gap of multimedia postings in a historical and architectural context.

8 illus, 23 ref

005051   Pesenhofer A;Mayer R;Rauber A (Spaces Group, Competence Competence Center-EC3, Donau-City-Strabe 1, A-1220 Wien, Austria, Email: andreas.pesenhofer@ec3.at) : Automating the management of scientific conferences using information mining techniques. J Digital Inf Mgmt 2008, 6(1), 3-11.

Conference management systems, which help organizers in carrying out tasks in the workflow, of scientific events are widely used in the academic world. In this paper author focus on tasks where methods from the domain of information retrieval, information management and information organization can assist the organizer, the program committee members and the participants. Presents a method for the creation of an improved review process by better matching the reviewers expertise with the paper topics, which can to increase the quality of the conference. Furthermore the conference participants benefit from better access to the wealth of information accumulated throughout a conference series. The Conference organizers profit from the reduced workload because of the partial automating of tedious tasks, such as the review assignment, the compilation of the conference program and the creation of poster setup plans. Reports on case studies from a small-sized (around 200 participants), a medium-sized (around 400 participants) as well as a large (more than 700 participants) conference in the computer science as well as the medical domains.

8 illus, 16 ref

005050   Paul M;Ghosh S K (School of Information Technology, Indian Institute of Technology, Kharagpur-721 302, Email: manojpkgp@gmail.com) : Application schema mapping based on ontology: an approach for geospatial data storage. J Digital Inf Mgmt 2008, 6(1), 51-60.

Heterogeneous nature of geospatial data makes the sharing of it across organizations a complex issue. As a standard means of geospatial data encoding, Geography Markup Language (GML) has been proposed by Open Geospatial Consortium (OGC), which facilitates sharing and exchange of geospatial information. With the proliferation of GML in many geospatial applications and storage support from the standard DBMS, the need arises for the efficient storage mechanism of GML data. This paper analyses approaches for XML data storage in traditional DBMS and proposes alternative solutions for GML. Every GML document structure is defined in an application schema. We propose an approach for GML storage based on the analysis of the underlying application schema. A semi-automatic mapping mechanism has been proposed for the application schema to relational schemas of standard database with the utilization otthe domain ontology. A set of relational schema is presumed to exist for different geospatial features. The proposed ontology based schema-matching approach for GML storage enhances the mapping process, thus facilitates sharing of heterogeneous data repositories.

1 table, 29 ref

005049   Mitra S;Bagchi A;Bandyopadhyay A K (International Institute of Information Technology, , X-1/8/3, Block EP, Salt Lake Electronics Complex, Sector-V, Kolkata-700 091, Email: susanta_mitra@yahoo.com) : Complex query processing on web graph: a social network perspective. J Digital Inf Mgmt 2008, 6(1), 12-20.

Social network represents a social community as a directed graph. Communication on the Web has given rise to social network formation like, Web Community, Referral System etc. An earlier effort has proposed a data model for such Web-based social network. Discusses the relevant index structures for processing queries on a social network schema based upon the proposed data model. The paper has also provided evaluation of the structural operators proposed in the data model and discussed their efficacy with query examples.

9 illus, 2 tables, 15 ref

005048   Marquesuzaa C;Etcheverry P;Sallaberry C; Baziz M (NO, , IUT de Bayonne, Chateau-Neuf, Place Paul Bert, 64100 Bayonne - France, Email: patrick.etcheverry@iutbayonne.univ-pau.fr) : Accessing heritage documents according to space criteria within digital libraries. J Digital Inf Mgmt 2008, 6(1), 100-15.

Local cultural heritage document collections are characterized by contents strongly attached to a territory and its associated land history. Our contribution aims at enhancing such a content retrieval process efficiently each time a query includes geographic criteria. We propose a unified model for a formal representation of geographic information. This geographic model allows space features to be described independently of their representation mode (text, graphics) in the documents. We have developed a prototype implementing geographic Information Extraction (IE) and geographic Information Retrieval (IR) processes. We process geographic IE with semantic techniques combined to classic IE approaches. Then, we implement geographic IR with intersections researching algorithms: these algorithms search for all geocoded entities in the documents collections indexes which intersect any entity in the user's query. This paper focuses on IR and Visualization proposals relying on the geospatial characteristics of cultural heritage corpora.

15 illus, 2 tables, 58 ref

005047   Markscheffel B;Fischer D;Stelzer D (Technische Universitat Ilmenau, Chair of Information and Knowledge Management Institute of Information, P.O. Box 100565, 98684 Ilmenau, Germany, Email: {bernd.markscheffel,daniel.fischer, dirk.stelzer}@tu-ilumenau) : Classification of digital libraries - an e-business model-based approach. J Digital Inf Mgmt 2008, 6(1), 71-80.

Impact of digital libraries on information processes steadily increases. Today, users may choose from a rapidly increasing number of digital libraries with various characteristics. Business models for digital libraries evolve from mere content providers to sophisticated service suppliers. They offer a rich variety of information services combined with collaboration, e-learning and portal features. Traditional classification schemes for digital libraries do not sufficiently take this development into account or fail to meet it at a/I. In this paper we present a novel approach to the classification of digital libraries. It is based on business model characteristics with special emphasis on the evolution of digital libraries from content to information service providers. Our classification approach helps suppliers to communicate benefits and features of their libraries more effectively. It also supports customers when selecting an appropriate digital library.

1 illus, 6 tables, 18 ref

005046   Lto A;Makino S (Graduate School of Engineering, Tohoku Univ, 6-6-05 Aramaki aza Aoba, Aoba-ku, Sendai 980-8579, Japan, Email: (aito.makino)@makino.ecei.tohoku.ac.jp) : Multiple description coding of an audio stream by optimum recovery transforms. J Digital Inf Mgmt 2008, 6(2), 189-95.

Discussed a method of splitting one audio stream into two equal-quality streams and recover the original audio stream from only one of the split streams. From a mathematical consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if simple recovery is carried out. Next, describes the optimum recovery transform. This method utilizes the covariance matrix of the signal to minimize the error of the recovered signal. Carried out several experiments to recover a signal from one of the split signals. The result showed that the optimum recovery transform gave better results than the simple recovery, while the best splitting transform differed according to the signal to be processed.

9 illus, 10 ref

005045   Lortal G;Todirascu-Courtier A;Lewkowicz M (NO, National Institute of Applied Sciences Place Emile Blondel - BP 08 761, France, Email: ganelle.lortal@insa-rouen.fr) : AnT&CoW: share, classify and elaborate documents by means of annotation. J Digital Inf Mgmt 2008, 6(1), 61-70.

As collective and mediated work spread out, digital data, and particularly documents, become predominant. In this paper, we describe how to support document management and especially document classification within a mechanical engineering design team working in an asynchronous and distributed way. The team members exchange comments to plan their project, to share documents, and to elaborate new documents. These comments are annotations linked together and linked to document(s). Annotations enable users to understand who is playing which role in the project and how collaborators understand a document and classify it. Observing this team led us to design an annotation tool (AnT&CoW) that we have implemented to support its collective activity. They concluded this article by focusing on the classification building functionality, based on the use of Natural Language Processing tools.

8 illus, 1 table, 48 ref

005044   Lin L;Jiang S (Automatic Test and Control Dep, Harbin Institute of Technology, China, Email: linlianlei@hit.edu.cn ) : Adaptive online recursive learning algorithm for least squares SVM classifiers. J Digital Inf Mgmt 2008, 6(2), 208-13.

Adaptive online recursive learning algorithm for training Least Squares SVM (LS-SVM) classifiers is proposed, which is based on incremental and decremental learning theory. When a SV (Support Vector) is added or removed, computation based on previous training result replaces matrix inverse, thus the computation cost is reduced. The innovation is that by reasonable use of incremental and decremental learning the proposed algorithm can adaptively get sparse solution according to the object classification problem. Finally several experiments show that the validity of the proposed algorithm.

1 illus, 3 tables, 21 ref

005043   Li J B;Chu S C;Pan J S (Automatic Test and Control Dep, Harbin Institute of Technology, China, Email: junbaolihit@hotmail.com) : Discriminant parallel feature fusion based on maximum margin criterion for pattern classification. J Digital Inf Mgmt 2008, 6(2), 203-7.

Proposes a novel parallel feature fusion based maximum margin criterion, namely discriminant parallel feature fusion, for pattern classification. The advantage of algorithm lies in: 1) A constrained optimization problem based on maximum margin criterion is created to solve the optimal fusion coefficients, which causes that fused data has the largest class discriminant in the fused feature space. 2) An unique solution of optimization problem is transformed to an eigenvalue problem, which causes the proposed fusion strategy to perform a consistent performance. Besides of the detailed theory derivation, many experimental evaluations also are presented.

5 illus, 17 ref

005042   Kwon D K;Shen M Y;Jay Kuo C C (Ming Shieh Dep of Electrical Engineering and Integrate Media Systems C, , Los Angeles, CA 90089-2564, USA, Email: d-kwon@ti.com) : Optimal two-pass frame-layer bit allocation for H.264 video. J Digital Inf Mgmt 2008, 6(2), 174-9.

Frame-layer bit allocation problem is studied for H. 264 video. Authors first impose a GOP (Group of Pictures) structure on the underlying H.264 video, and then develop a two-pass rate control algorithm based on the Lagrange optimization framework. The proposed algorithm estimates the rates and the distortions of all frames in a GOP by pre-encoding them using a constant quantization parameter (QP) in the first pass. The target number of bits of each frame is determined by searching the Lagrange multiplier that meets the bit budget constraint for the GOP, The proposed algorithm is useful for nonconversational applications such as video streaming where video sources can be encoded off-line. Experimental results demonstrate that the proposed algorithm achieves substantially higher picture quality than the rate control algorithm in the H.264 reference encoder.

2 tables, 2 illus, 2 ref

005041   Ignatova T;Heuer A (Database Research Group, Computer Science Dep, Rostock Univ, Albert-Einstein-Str. 21, 18051 Rostock, Germany, Email: {temi,heuer}@informatik.uni-rostock.de) : Model-driven development of content-based image retrieval systems. J Digital Inf Mgmt 2008, 6(1), 81-91.

Generic systems for content-based image retrieval (CBIR), such as QBIC cannot be used to solve domain-specific image retrieval problems, as for example, the identification of manuscript writers based on the visual characteristics of their handwriting. Domain-specific CBIR systems currently have to be implemented bottom up, i.e. almost from scratch, each time a new domain-specific solution is sought. Inspired by the recognition, that CBIR systems, although developed for different domain-problems, comprise similar building blocks and architecture, the idea of adopting model-driven development techniques for generating CBIR systems was elaborated. To support the design of domain-specific CBIR-Systems on a conceptual level by reusing data structure and functional interfaces a framework model is developed, which can be used to derive concrete domain-specific CBIR models. A transformation approach for the generation of a platform-specific implementation on top of an object-relational database from the concrete conceptual model is proposed. Finally, how these techniques can be applied for the design of a CBIR system for the identification of music manuscript writers based on the visual characteristics of their handwriting is demonstrated.

12 illus, 22 ref

005040   Han Q;Wang Z;Niu X (Computer Science and Technology Dep, Harbin Institute of Technology, 150001 Harbin, China, Email: handqi_xf@hit.edu.cn) : Improved biometric template protection method based on non-uniform quantization. J Digital Inf Mgmt 2008, 6(2), 168-73.

Issue of biometric template protection was raised. Some schemes were proposed to solve the contradiction between the fuzzy biometric information and accurate cryptography functions to achieve the protection of biometric template via cryptography method. A novel methodology to achieve the security of the biometric templates in biometric systems is proposed. An adaptive non-uniform quantization (ANUQ) algorithm is introduced to eliminate the contradiction between the fuzz/ness of the biometric information and the sensitive of the Hash function. The ANUQ algorithm maps different biometric feature vectors from the same individual to a unique quant/zed feature vector. Then the quantized feature vector can be saved and identified by its hash and the biometric system can be free from the risk of the leakage of users' privacy information. Based on the ANUQ algorithm, two biometric template protection scheme are designed to meet different applications. Scheme-I involved a single quantizing template while scheme-II use a quantizing template array. The comparison of the two schemes are raised. Further, the testing of these schemes are carried out on an iris recognition algorithm. The results show the feasibility of the ANUQ-based schemes.

9 illus, 4 tables, 15 ref

005039   Eiamjumrus N;Aramvith S (Electrical Engineering Dep, Faculty of Engineering Chulalongkorn Univ, Bangkok 1033, Thailand, Email: supavadee.a@chula.ac.th) : Rate control scheme based on Cauchy R-D optimization model for H.264/AVC under low delay constraint. J Digital Inf Mgmt 2008, 6(2), 180-8.

Motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. Proposes a new rate control scheme for H,264 low-delay video transmission using Cauchy rate-distortion optimization model. The proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H. 264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.

8 illus, 2 tables, 9 ref

005038   Chen J;Zhong P;Cook T (Computer Science Dep, Queen College, City Univ of New York, USA, Email: jchen@cs.qc.edu) : Cluster based mixed coding schemes for inverted file index compression. J Digital Inf Mgmt 2008, 6(1), 30-7.

Cluster property of document collections In today's search engines provides valuable information for index compression. By clustering d-gaps of an inverted list based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, author propose a cluster based approach and present two new codes for inverted file index compression: mixed gamma/flat binary code and mixed delta/flat binary code. Experiment results show that the two new codes achieve better or equal performance in terms of compression ratio comparing to interpolative code which is considered as the most efficient bitwise code at present. Besides, the two new codes have much lower complexity comparing to interpolative code and therefore enable faster encoding and decoding. By adjusting the parameters for the mixed codes, even better results may be achieved. Experiments show promising results with our approaches.

1 table, 17 ref

005037   Chang C C;Kieu T D;Chou Y C (Information Engineering and Computer Science Dep, Feng Chia Univ, Taichung 40724, Taiwan, R.O.C., Email: ccc@cs.ccu.edu.tw) : Reversible data embedding for colour images. J Digital Inf Mgmt 2008, 6(2), 143-50.

Data hiding technique is used to hide a secret message into a cover image which is then sent to a receiver without raising any suspicions. With a reversible (lossless) data hiding method, a receiver can extract a secret message and exactly restore an original cover image from an embedded image. This paper presents a novel reversible data embedding scheme for color images. The proposed scheme mostly embeds two secret bits into one cover pixel by replacing the cover pixel with its permutation whose Euclidean distance is closest to the cover pixel. The experimental results show that the proposed scheme can achieve a high embedding rate while maintaining the visual quality of stego color images in comparison with other methods.

11 illus, 2 tables, 10 ref

005036   BADR Y (NO, National Institute of Applied Sciences - Lyon, LIESP, INSA-Lyon, F-69621, France, Email: youakim.badr@insa-lyon.fr) : Service-oriented workflow. J Digital Inf Mgmt 2008, 6(1), 116-25.

Advantages of Information and Communication Technologies (ICT) have forced many enterprises to reconsider the way their business processes are undertaken. Among various Information Technologies, the Workflow Management System greatly improves the efficiency of business processes. The challenge for Workflow Systems relies on their ability to align ICT and the processes of production and business. They should support the strategic policy of the enterprise and quickly respond to on-demand business and opportunities. Unfortunately, they suffer from some lacks and limitations due to their monolithic architectures. Most Workflow Management Systems are dependent on technology platforms and partially conform tor standards. Author propose the next generation of Workflow architectures. We conceive workflow systems as a set of services, which are generic and platform-independent. Services are self-contained and fully-customized. Workflow services are assembled from computational components (i.e. web services), which are loosely coupled. The new architecture is split into layers to guarantee a high level of abstraction, each of which is managed by a crucial Web Service known as the orchestrator service.

8 illus, 1 table, 46 ref

005035   Atomori Y;Echizen I;Dainaka M;Nakayama S; Yoshiura H (Human Communication Dep, The Univ of Electro-Communications, Japan, Email: yoshiura@hc.uec.ac.jp) : Robust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion. J Digital Inf Mgmt 2008, 6(2), 161-7.

Robust video watermarking method is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It can detect watermarks without any search for canceling the effect of random distortion. Rotation, scale, and translation are canceled by searching for the angle, size, and origin of the original picture. The search for the angle and size is combinatorial but is independent of the search for the origin. That is, the angle and size of the target picture can be restored without restoring the picture's origin. Furthermore, the search for the origin is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation using actual video samples demonstrated that the proposed method can embed watermarks immune to all four types of transformations.

8 illus, 3 tbales, 12 ref

005034   Al-Tameem A A (NO, College of Computer and Information Sciences, Al-Imam Muhammad Ibn Sau, P.O. Box 50996. Riyadh 11533, Saudi Arabia, Email: altameem@yahoo.com) : Analysis of the association between bioinformatics and biotechnological development. J Digital Inf Mgmt 2008, 6(1), 126-33.

Generally, the literature tends to either subsume bioinformatics under the general sector of biotechnology or it uses it as an explanatory dimension because it provides knowledge sources for biotechnology activities. In this study, the researcher attempt to reverse this relationship, for under the assumption of co-evolution of technology and institutions, both shape each other rather than one alone shaping the other. In testing the relationships between the biotechnology firms and bioinformatics firms of the most active countries in these sectors, the logistic regression results produce three groups of countries: (a) those that significantly positively influence bioinformatics because of biotechnology activity, (b) those that significantly negatively influence bioinformatics because of biotechnology activity, and (c) those that remain indifferent.

3 tables, 35 ref

001944   Shanthi M;Manohar G T (Computer Application Dep, Velammal Engineering College, Chennai, Tamilnadu-600 066, Email: sha_karnan@yahoo.com) : Characterization of multithreaded application workloads on intel processors. Karpagam J Comput Sci 2008, 2(5), 763-8.

This paper describes how to speed up a commonly used application by taking advantage of multithreading on Hyper-Threading Technology base Intel(r) Pentium(r) 4 processors. The techniques shown here can be applied to any application where parallelization is targeted. The performance gains will, of course, vary with the applications as well as system configuration. Multithreading is suitable for all applications where optimization is the subject for program performance. This paper shows a few simple applications for the threaded scenario. Also presented performance numbers for comparing the application with and without threading concept. All performance data presented was collected on a 3.2 GHz Intel(r) Pentium(r) 4 processor with Hyper-Threading Technology.

3 illus, 17 ref

001943   Pal O R;Jain R C (MCA Dep, Lakshmi Narain College of Technology, Bhopal, Madhya Pradesh, Email: prpal@rediffmail.com ) : CAARMSAD : combinatorial approach of association rule mining for sparsely associated databases. Karpagam J Comput Sci 2008, 2(5), 717-24.

Classification based on association rule mining has now become a very powerful technique of data mining for extraction of accurate knowledge from very large databases. First it finds all association rules in a training database then uses these rules to classify an unknown object of test database. Support threshold and confidence threshold are used to specify the user's interests. This paper proposes an algorithm CAARMSAD to mine the association rules in sparsely associated databases by applying minimum efforts. It uses the concepts of combinatorial mathematics to generate only those candidate itemsets whose sizes are up to the probable size of maximal frequent itemsets. Since CAARMSAD reduces the large number of candidate itemsets generations, it is very efficient for association rule mining in sparsely associated databases.

001942   Mendanha R E (NO, , 91, St. Patrick Town, Pune-411 013, Email: mendanha@gmail.com) : Method for computerised recording and analysis of high frequency biopotentials (Oscillometry). Indian J Physiol Pharmac 2008, 52(4), 398-402.

Oscillometry records the high frequency electrical activity on the skin surface. These are induced by external ambient electromagnetic radiations, and generated internally by physiological processes. The existence of these surface A.C. oscillations is fundamental to the existence of an electromagnetic field around the human body. Unfiltered electrical and inductive signals are digitally recorded using the computer sound card and audio analysis software. The power and frequency content of the signal is measured. A sound card with a sample rate of 96 KHz enables FFT from 0 to 45 KHz. It can be used to study the electrical response of the body to externally administered electromagnetic radiations. Some of the responses seen during yoga practices are capable of inductive influences.

2 illus, 1 table, 6 ref

001941   Kiran Sree P;Ramesh Babu I;Usha Devi N S S N (CSE Dep, SRKIT, Vijayawada, Email: profkiran@yahoo.com) : Investigating an artificial immune system to strengthen the promoter region structure prediction and promoter region identification using cellular automata classifier. Karpagam J Comput Sci 2008, 2(5), 704-16.

Genes carry the instructions for making Promoter Regions that are found in a cell as a specific sequence of nucleotides that are found in DNA molecules. But, the regions of these genes that code for Promoter Regions may occupy only a small region of the sequence. Identifying the promoter regions play a vital role in understanding these genes. In this paper author have explored an artificial immune system can be used to strengthen and identify the Promoter Region coding regions in genomic DNA system in changing environments, and Cellular Automata (CA) technique for Promoter Region structure prediction of small alpha/beta Promoter Regions using Rosetta. From an initial round of Rosetta sampling, we learn properties of the energy landscape that guide a subsequent round of sampling toward lower-energy structures. Three different approaches to improve tertiary fold prediction using the genetic algorithm are discussed: (i) Refinement of the search strategy, (ii) combination of prediction and experiment and (iii) inclusion of experimental data as selection criteria into the genetic algorithm. It has been developed using a slight variant of genetic algorithm. Good classifier can be produced especially when the number of the antigens is increased. However, an increase in the range of the antigens had somehow affected the fitness of the immune system. Experimental results confirm the scalability of the proposed Artificial Immune System Fuzzy Multiple Attractor Cellular Automate (AIS FMACA) based classifier to handle large volume of datasets irrespective of the number of classes, tuples and attributes. We note an increase in accuracy of more than 5.2%, over any existing standard algorithms for addressing this problem. This was the first algorithm to identify Promoter Region coding regions in mixed and non overlapping exon-inton boundary DNA sequences also. The accuracy of predicting the structure of Promoter Regions was also found comparable.

8 illus, 4 tables, 20 ref

001940   Devapriya M;Ramar K (NO, Government Arts College, Udumalpet, Email: priyavasanth@yahoo.com) : Dual digital water marking using wavelet transform. Karpagam J Comput Sci 2008, 2(5), 725-31.

Image watermarking has become an important tool for intellectual property protection and authentication. Digital watermark is the technique in which visible / invisible signal is embedded in a multimedia document for copyright protection. Dual watermarking is a combination of visible watermark and an invisible watermark. In this paper, author proposed watermarking scheme called dual watermarking that incorporates two invisible watermarks in the host image for improved protection and robustness. A watermark, in form of a PN sequence (secondary watermark), is embedded in the wavelet domain of a primary watermark before being embedded in the wavelet domain of host image. The discrete wavelet transformation algorithm is proposed for embedding invisible watermark. The results obtained are shown and their detecting strategy for authentication is also discussed in this paper.

8 illus, 14 ref

001939   Chandra Sekhar Reddy C;Prasad K R (NO, RGM Engineering College, Nandyal, Email: srisaimax@gmail.com) : Performability modelling of identical multiprocessors system with remodelling and restarting delay. Karpagam J Comput Sci 2008, 2(5), 755-62.

Computer system models provide detailed answer to system performance. In designing, the models play an important role of helping to resolve architecture of remodelling and the system breakdown. In this paper, the performance modelling of homogeneous multiprocessor systems are covered. To account for delays due to remodelling and start up of the system, such systems are modelled and solved. Numerical results for various cases are presented.

8 illus, 12 ref

001938   Chandra E (Computer Applications Dep, D.J. Academy for Managerial Excellence, Coimbatore-32) : Performance adjustment of speech rate in automatic speech recognition. Karpagam J Comput Sci 2008, 2(5), 769-74.

Rate of speech (ROS) has a greater influence in both spectral features and word pronunciations that affect automatic speech recognition (ASR) systems. To deal with these ROS effects, the research proposes to use parallel, rate-specific, acoustic models: one for fast speech, the other for slow speech. Rate switching is permitted at word boundaries, to allow modeling within sentence speech rate variation, which is common in conversational speech. The Input Signal Processing configures the front end for ROS to identify the fast and slow speech and customize the application to handle both the situation well.

5 tables, 16 ref

001937   Anndurai S;Uma S (NO, Government College of Technology, Coimbatore-641 013, Email: uma_natarajans@yahoo.com ) : Image restoration using five level modified weighed fuzzy mean filter. Karpagam J Comput Sci 2008, 2(5), 732-41.

A new fuzzy filter for the removal of heavy additive impulse noise, called the Modified Weighted Fuzzy Mean filter (MWFMF) is proposed and analyzed in this paper. The MWFM-filtered output signal is the mean value of the corrupted signals in a sample matrix, and these signals are weighted by a membership grade of an associated fuzzy set stored in a knowledge base. The knowledge base contains a number of fuzzy sets derived from the histogram of a reference image. The Proposed filter performances are then compared with the conventional filters performances. Criteria such as MSB and PSNR are adopted for evaluating the performances of the proposed and the conventional filters. The proposed approach restores the noisy images very effectively and the PSNR improvement achieved is 3 to 5 db more than the conventional approaches.

12 illus, 15 ref

000962   Yadav B S;Gupta S;Mishra K P (NO, , ) : Prediction of biochemical properties of protein active site residues with ANN classifier. Archiv appl Sci Res 2009, 1(1), 8-17.

Presents a method for the prediction of physiochemicai properties of catalytic sites residues using a suitable Artificial Neural Networking (ANN) Feed Forward Backpropagation algorithm coupled with a set of structural proteins with the properties of their amino acid residues. The method has been applied to a set of 100 structural proteins from the Protein Data Bank (PDB) having a ligand at their active site. Using Ligpiot program for searching of active site residues and Surface racer for identifying the non active site moieties, the identified amino acid residues were classified in 15 different categories based on their physiochemicai properties. After classification of active and non active site amino acids, their properties were converted into machine language. Furthermore, we created Neural Network Using Matlab software and generated algorithm for training and testing of data. Thereafter, analysis of results showed that 95% of active site's physiochemicai properties were correctly predicted. It is hoped that this work would help in determining the surface topographic properties for ligand binding sites residues in protein. The computational outcome would be helpful in ligand designing, molecular docking, de novo drug designing and structural identification and functional sites Comparisons.

000961   Shaikh Y;Tanwani S (School of Computer Science, Devi Ahilya Vishva Vidyalaya, Indore) : Association rule mining using prefix tree. Ind Res Commun 2008, 2(1), 16-18.

A well known technique for Data Mining is discovery of association rules linking database attributes. Apriori is the oldest and most versatile algorithm for frequent set mining. This algorithm outperforms if an efficient data structure is used for storing frequent sets generated in each iteration. In this paper used prefix trees at each level for storing frequent sets. Examined the data structure, implementation and algorithmic features focusing on frequent itemset mining. In the analysis took into consideration modern processors' properties (memory hierarchies, prefetching, branch prediction, cache line size, etc.), in order to better understand the results of the experiments.

7 ref