Oriental Journal of Computer Science and Technology An International research journal of Computer Science and Technology

This paper presents a short survey of a framework of discriminative method of least squares regression (LSR) model and additionally its applications for. The core plan is to review the Discriminative method of least squares Regression framework and its application areas, wherever it provides the optimum answer. As per we have a tendency to study for applying in varied drawback of classification several new concepts are added to that like ε-dragging that is introduced to force the regression targets of various categories moving on opposite directions specified the distances between categories are often enlarged. Then, the ε-dragging are integrated into the LSR model for multiclass classification. during this means the new learning framework, cited as discriminative method of least squares regression, has a compact model form, wherever there's no ought to train two-class machines that are independent of every alternative. With its compact form, this model are often naturally extended for feature selection. So, the aim of this paper is to present survey on Discriminative least squares Regression method for finding its uses in varied fields wherever it may be used for different fine works.

Hide Abstract

A meta-search engine is a search engine that utilizes multiple search engines, when a meta search engine receives a query from a user, it invokes the underlying search engines to retrieve useful information for the user. Most of the data on the web is in the form of text or image. A good database selection algorithm should identify potentially useful databases accurately. Many approaches have been proposed to tackle the database selection problem. These approaches differ on the database representatives  they use to indicate the contents of each database, the measures they use to indicate the usefulness of each database with respect to a given query, and the techniques they employ to estimate the usefulness. In this paper, we study to design an algorithm and compare with the existing algorithm to select the most appropriate search engine with respect to the user query.

Hide Abstract

In this paper we are discussing about a new technology in mobile industry that is known as 5^th generation mobile technology (5G) or Nano technology. The enhancement in technologies by everyday, Mobile industry is also getting more enhanced. In every 4 to 5 years a new technology in the IT market is introduced. New technology is developed for integrating the real life with mobile technology. Over the years, wireless telecommunications market has recognized as one of the most dynamic and fastest growing segments of the global telecommunications industry [2].First came the 1G, after that  2G and 3G came to surface. Nowadays the very popular technology 4G is running that is also known as super fast technology. Now there will come 5G Fifth Generation technology. This latest and more enhanced technology will provide a unique experience to its users.5th generation wireless systems is a major phase of mobile telecommunications standards. 

Hide Abstract

Risk Identification tools are usually established for avoiding or minimizing problems, likely to occur during software development. It can be stated as the task of analysing and managing the impact of every important risk occurred in the project. In the context of Risk Identification tool practices, we developed a scoping study, aiming at analysing the current scenario of Risk Identification practices in software development process. We analysed different studies published by the most important venues published up to the year 2013. Based on the analysed data set, we sketched a set of useful techniques and tools for applying Risk Identification in software projects. The analysis indicates that most of the studies subjectively describe ways to evaluate risks, instead of providing readers with details on how Risk Identification is to be performed. Such findings points out to the need of further research in the field of Risk Management, especially for the identification of risks in software development process for better results.

Hide Abstract

The past fifteen years are characterized by an exponential growth of the Web both in the number of Web sites available and in the number of their users. This growth generated huge quantities of data related to the user’s interaction with the Web sites, recorded in Web log files. Moreover, the Web sites owners expressed the need to better understand their visitors in order to better serve them. The Web Use Mining (WUM) is a rather recent research field and it corresponds to the process of knowledge discovery from databases (KDD) applied to the Web usage data. It comprises three main stages: the preprocessing of raw data, the discovery of schemas and the analysis (or interpretation) of results. A WUM process extracts behavioral patterns from the Web usage data and, if available, from the Web site information (structure and content) and on the Web site users (user profiles). In this thesis, we bring two significant contributions for a Web Use Mining process. We propose a customized application specific methodology for preprocessing the Web logs and a modified frequent pattern tree for the discovery of patterns efficiently.

Hide Abstract

By leveraging virtual machine (VM) technology which provides performance and fault isolation, Cloud resources can be provisioned on demand in a fine-grained, multiplexed manner rather than in monolithic pieces. By integrating volunteer computing into Cloud architectures, we envision a gigantic Self-Organizing Cloud (SOC) being formed to reap the huge potential of untapped commodity computing power over the Internet. Towards this new architecture where each participant may autonomously act as both resource consumer and provider, we propose a fully distributed, VM-multiplexing resource allocation scheme to manage decentralized resources. Our approach not only achieves maximized resource utilization using the proportional share model (PSM), but also delivers provably and adaptively optimal execution efficiency. We also design

a novel multi-attribute range query protocol for locating qualified nodes. Contrary to existing solutions which often generate bulky messages per request, our protocol produces only one lightweight query message per task on the Content Addressable Network (CAN). It works effectively to find for each task its qualified resources under a randomized policy that mitigates the contention among requesters.This paper extends our previous work and proposes a lightweight mathematical model to estimate the energy cost of live migration of an idle virtual machine quantitatively. A series of experiments were conducted on KVM to profile the migration time and the power consumption during live migration. Based on these data we derived an energy cost model that predicts the energy overhead of live migration of virtual machines with an accuracy of higher than 90%.

Hide Abstract

Computer Simulation and Modeling techniques were used successfully to represent and propose an Optimum resource allocation problem in many field and applications. In wireless communication networks these techniques can be applied in the field of developing and controlling the available paths, power control, coverage area, delay, and delivery guarantee.

In this study the main objective function is to indicate the optimum location of the wireless network stations to maximize the throughput, minimize delay, reduce path loss information, increase the coverage area and minimize the total network costs. The network performance must not exceed the limitation constraints under the required feasible standard quality of service.

The modeling results showed good indications and gave a suitable guide to build, extend or develop such networks.

Hide Abstract

In this paper, a new method to encrypt the signals with one dimension and images(monochrome or color images) in a time more less than if these signals and images are encrypted with their original sizes This method depends on extracting the important features which are distinguished these signals and images and then discarding them. The next step is encrypting  the lowest dimensions of these data. Discrete Wavelet transform (DWT) is used as a feature extraction because it is a powerful tool of signal processing for it’s multiresolutional possibilities. The chosen data is encrypted with one of conventional cryptographic algorithm (Permutation algorithm) after shrinking it’s dimension using suitable encryption key. The encrypted data is 100% unrecognized, besides, the decryption algorithm  returned  the encrypted data to it’s original dimension efficiently.

Hide Abstract

Cloud computing, with its promise of (almost) unlimited computation, storage and bandwidth, is increasingly becoming the infrastructure of choice for many organizations. As cloud offerings mature, service-based applications need to dynamically recompose themselves, to self-adapt to changing QoS requirements. In this paper, we present a decentralized mechanism for such self-adaptation, using natural language processing. We use a continuous double-auction to allow applications to decide which services to choose, amongst the many on offer. The proposed scheme exploits concepts derived from graph partitioning, and groups together tasks so as to 1) minimize the time overlapping of the tasks assigned to a given resource and 2) maximize the time overlapping among tasks assigned to different resources. The partitioning is performed using a spectral clustering methodology through normalized cuts. Experimental results show that the proposed algorithm outperforms other scheduling algorithms for different values of the granularity and the load of the task requests.

Hide Abstract

This paper provides initial thought for why should do evolutionary study in computer science (in general) and in sorting algorithmic domain (in particular)?Primaryevaluation ofevolutionary study of sorting algorithms and list of literatures which can help during this evolutionary study of sorting algorithms.

Hide Abstract

Data mining represent the process of extraction interesting and previously unknown knowledge from data.  In this thesis we address the important data mining problem of discovering association rules in single-table and multiple-table database and we also introduce a generalization of database concept of functional dependency: the purity dependencies, which can be viewed as a type of rules that are information-ally more significant than association rule. An association rule expresses the dependence of a set of attributes value pairs, also called items, upon another set of items. 

Hide Abstract

The development of intelligent healthcare support systems always requires a formalization of medical knowledge. Artificial Intelligence helps to represent the knowledge in various ways which is a very important part in developing any systems, which in turn leads to precise understanding of knowledge representations. This helps to obtain the solution to the problem very easily. Knowledge engineers make use of a number of ways of representing knowledge when acquiring knowledge from experts. These are usually referred to as knowledge models. Knowledge acquisition includes the elicitation, collection, analysis, modelling and validation of knowledge for knowledge engineering and knowledge management projects. This paper presents an overview of available knowledge models, current knowledge acquisition techniques and also the recent developments to improve the efficiency of the knowledge acquisition process.

Hide Abstract

Multi-layer key for AES encryption technique are present in this paper. LFSR and MD5 as a primary key layer was used to increase the security of the key. Three types of tests for ten round for each key layer are tested and analyzed. From the tests the MD5 is present as more suitable for security but it more complexity while LFSR is good for both. The usage of them will be depending on the natural of applications.

Hide Abstract

In today’s modern world cardiovascular disease is the most lethal one. This disease attacks a person so instantly that it hardly gets any time to get treated with. So diagnosing patients correctly on timely basis is the most challenging task for the medical fraternity. A wrong diagnosis by the hospital leads to earn a bad name and loosing reputation. At the same time treatment of the said disease is quite high and not affordable by most of the patients particularly in India. The purpose of this paper is to develop a cost effective treatment using data mining technologies for facilitating data base decision support system. Almost all the hospitals use some hospital management system to manage healthcare in patients. Unfortunately most of the systems rarely use the huge clinical data where vital information is hidden. As these systems create huge amount of data in varied forms but this data is seldom visited and remain untapped. So, in this direction lots of efforts are required to make intelligent decisions. The diagnosis of this disease using different features or symptoms is a complex activity. In this paper using varied d

Hide Abstract

This paper describes effect of Skeleton pruning process on recognition shapes or objects, Pruning is accomplished by removing branches which is redundant or unnecessary branches , The removal of these small branches does not alter the shape information. It is still quite a challenging problem because of the lack of standard measurements for the importance or significance of a branch. A pruning technique is adopted to deal with the large amount of data that results in further improvement in recognition accuracy. Experimental results showed that our method can achieve good retrieval results .The moderate pruning ratio has improved the features of the shape and improved recognition accuracy.

Hide Abstract

This paper will describe the technology RFID that is Radio Frequency Identification and gives an overview of the current state of the art in the radio frequency identification (RFID) technology. It also tell how does it work and what are its applications and problems in RFID technology ? This paper presents a few applications that are possible using RFID technology such as locating lost items, tracking moving objects, and others . The convergence of lower cost and increased capabilities made businesses take a hard look at what RFID can do for them. Also its various types are described here.

Hide Abstract

The objective of this paper is to control the railway tracks by using anti-collision techniques. The model of railway track controller is designed by using 8952 microcontroller to avoid railway accidents. When we go through the daily newspapers we come across many railway accidents occurring at unmanned railway crossings. This is mainly due to the carelessness in manual operations or lack of workers. And also the collision of two trains due to the same track. This model is implemented using sensor technique. We placed the sensors at a certain distance from the gate detects the approaching train and accordingly controls the operation of the gate. Also an indicator light has been provided to alert the motorists about the approaching train.

Hide Abstract

In this paper, we have proposed image features based on chain code approach and RLE compression method for enhancing the image and proposed new method for extracting the features. The proposed method consist of the many steps, First is to apply the Chain code algorithm by using new chain code window, Second is to apply the Chain code Enhancement, in this step the chain code is first extracted and then enhanced by applying the RLE compression on the result, the purpose for this operation is to approximate the image by eliminate the small part of image and added it to the largest nearest part and the third is is to extract of chain code features by proposing a new algorithm.

Hide Abstract

In this paper, initially, the description and the processing way of the existing queries and languages in this field is performed and a base is graded for the new method by classifying the present methods and evaluating on strengths and weaknesses of each method. This three-step approach is proposed to improve previous methods. The method involves three steps: 1. First step: Simplifying query and reducing the searching area. 2. Second step: Producing a result table as a guide for the query processor. 3. Third step: Processing the document nodes according to the guide table produced in the previous step. This three-step method can prove its ability compared to the previous methods. The method is developed so that it has the efficiency for complicated multi-branches queries. Then, it is tried to optimize the method, considering the concept of the extraction points. During the three steps, useless nodes – the nodes that either do not make a response for the user, or return a repetitive one – were used so much; using such nodes is reduced by introducing an index called level index.

Hide Abstract

The advent of Computing Technology has significantly influenced our lives and two major impacts of this effect are Business Data Processing and Scientific Computing. During the early years of the development of computer techniques for business, computer professionals were concerned with designing files to store the data so that information could be efficiently retrieved. There were restrictions on storage size for storing data and on the speed of accessing the data. Needless to say, the activity was restricted to a very few, highly qualified professional. Then came an era when Database management System simplified the task. The responsibility of intricate tasks, such as declarative aspects of the programs was passed on to the database administrator and the user could pose his query in simpler languages such as query languages. Thus almost any business-small, medium or large scale began using computers for day-to-day activities. Now what is the use of all this data? Up to the early 1990’s the answer to this was “NOT much”. No one was really interested in utilizing data, which was accumulated during the process of daily activities. As a result a new discipline in computer science, Data Mining gradually evolved.

Hide Abstract

After fingerprints or iris digital, biometric identification of an individual can now be done through the veins of the hand. This technique uses a “palm vein scanner”: it is an optical sensor capable of “photographing” the palm vein using the “near infrared rays.” This technique uses a “palm vein scanner”.Biometric authenticationbyrecognition offinger veinorpalmis especially developed by Hitachi and Fujitsuin Japansince 2005. Compared to thetechnologyusingfingerprint recognition, it offers the advantage of beingsafer andit does not involveany physical contactwith the sensor.Vein recognitionis performed byremote effectoptically. This paper presents a survey of the biometric systems technology based hand vein.We first review the component modules including the algorithms they employ. Finally, a summary of the accuracy results reported in the literature is also provided. Key words: 

Hide Abstract

In this paper we will talk about information technology semantic , which plays an important role in many areas of human activity and therefore the task of data security semantic is very important for information technology and will consider this research to support the idea of data semantic cards safety of RDF tri- called safety data. Also with the security of confidential data labels in different security levels in different departments have different ranges and variety of use of user data. There are ongoing contacts with the idea of safety data on the labels of three diverse In this research has identified the main rules to control user access to the data by comparing the levels of access to the user ( the security levels triple ) Based on these rules and advanced algorithms will do read and modify data RDF triple.

Hide Abstract

This mobile network architecture will support terminal mobility, personal mobility, and service provider portability, making global roaming seamless. A location-independent Personal Telecommunication Number (PTN) scheme is conducive to implementing such a global mobile system. However, the non-geographic PTNs coupled with the anticipated large number of mobile user’s in future mobile networks may introduce very large centralized databases. This necessitates research into the design and performance of high-throughput database technologies used in mobile systems to ensure that future systems will be able to carry efficiently the anticipated loads. This is scalable, robust, efficient location database architecture based on the location-independent PTN. The proposed multi tree database architecture consists of a number of database subsystems, each of which is a three-level tree structure and is connected to the others only through its root. By exploiting the localized nature of calling and mobility patterns, the proposed architecture effectively reduces the database loads as well as the signalling traffic incurred by the location registration and call delivery procedures. In addition, two Memory-resident database indices, memory-resident direct file and T-tree are proposed for the location databases to further improve their throughput. Analysis model and numerical results are presented to evaluate the efficiency of the proposed database architecture. Results have revealed that the proposed database architecture for location management can effectively support the anticipated high user density in the future mobile networks.

Hide Abstract

Network intrusion detection Systems are designed to protect computer networks by observing frames and notifying the operators when a possible attack happened. But with the development of network and the information exchange, networks became increasingly vulnerable faced at the new forms of threats. It is necessary to improve the performance of an intrusion detection system. Inspired by immune biological system behavior and the performances of the multi-agent systems, we present in this article a new model (MAISID) of multi-agent system immune for intrusion detection. MAISID is a system that performs frames analyses by a group of immune agents’ collaboration. These agents are distributed on the network to achieve simultaneous treatments, and are auto-adaptable to the evolution of the environment and have also the property of communication and coordination in order to ensure a good detection of intrusions in a distributed network. In this approach, the MAISID model is installed in each host of the network and sub-network for an extensive monitoring and a simultaneous analysis of the frames.

Hide Abstract

Recent advances in trainable algorithms and electronic symmetries are continuously at odds with link-level acknowledgements. Given the current status of omniscient methodologies, theorists famously desire the development of Markov models, which embodies the appropriate principles of programming languages. We describe a mobile tool for visualizing the Ethernet, which we call Vaisya.

Hide Abstract

Sighting towards the current scenario of modern era‘s Higher education the scene is quite changing and widespread, extending within the reign of cloud computing only, campuses are now leveraging with mobile apps, smart phones and highly customized devices. And at the same time, the amount of data and content that are to be maintained and stored has gone from a nibble to what could now only be described as a flood. This add-ons complexity and cost. Beside these challenges, there is increasing demands for transparency, governance, and data-retention regulations are pointing to the “big data” problems faced by higher education. Therefore an unassailable shared service solution is now becoming a need for hour in this every second updating arena, the IT and computing leaders in higher education and research are wondering for it to integrate from already spread out lots of agile services from cloud. And the next battle will be in the area of architecture that provides services and applications according to a specific institution as “above campus” into cloud service that must be chosen with care to identify and deliver centrally or locally to persist a unique infrastructure from others in a row. And also investigating the standards and current cloud technologies such as content management framework for the above stated issues to consolidate and centralize a common service framework across disparate institutions of higher education and research and common services that can be used by all. This paper presents the role of cloud computing in the provision and support of up gradation and development in higher education that yield tools that meet the demands of the next generation campus society. Furthermore, we present integration components framework transformation in the development of higher education with cloud computing as an appropriate alternative support. And investigating the Interpretability standards currently available for higher education, the challenges and their possible solutions.

Hide Abstract

The network simulator (NS-2) is very important to simulate the network types such as mobile ad-hoc network efficiently and easily by providing the environment of this network exactly. This simulator helps the researcher in the last years to introduce Their researches without need to the expensive requirements to build the network in real time. This simulator uses file (called cbegen.tcl) to generate the traffic between nodes of the network at random time according to uniform distribution. The original cbrgen.tcl file provides two types of traffics that are CBR with UDP and FTP with TCP. The purpose of this paper is to add the one-way TCP and two-way TCP variants to NS-2. Also, this paper made these variants operate with many types of sink such as TCPSink, TCPSink/DelAck, TCPSink/Sack1, and TCPSink/Sack1/DelAck. This addition make it usable for anyone that wants to study the behaviour of these variants and its effects on the network.

Hide Abstract

In this research we will try to determine time quantization periods which could be used for cellular data analysis to reduce cost and time in processing such huge data. The research try to answer such questions as, What is the excite time quantization value required to perform network and user analysis? It is possible to eliminate any periods of time without effecting the quality of obtained result? Does it worth to eliminate such data(what is the gain for such elimination)?

Hide Abstract

Searching online has become part of the everyday lives of most people. Whether to look for information about the latest gadget to getting directions to a popular trend, most people have made search engines part of their daily routine. Beyond trivial applications, search engines are increasingly becoming the sole or primary source directing people to essential information. For this reason, search engines occupy “a prominent position in the online world”; they have made it easier for people to find information among the billions of web pages on the Internet. Due to the large number of websites, search engines have the complex task of sorting through the billions of pages and displaying only the most relevant pages in the search engine results page (SERP) for the submitted search query. With the continued growth of the Internet and the amount of websites available, it has become increasingly difficult for sites looking for an audience to achieve visibility. There are millions of new websites appearing on the Internet every month. As a result of this continued growth, it has made it increasingly difficult for websites to stay visible among all the other competing sites.

Hide Abstract

This paper surveys of digital vector map watermarking. Some information will be presented, such as the features of digital vector map, some digital vector map watermarking algorithms, possible attacks on embedded watermark. Also, challenges in field of digital vector map watermarking will be presented.

Hide Abstract

As a result of the physical storage expansion and backup equipment and the increasing need to store more data, the sequential searching algorithms of association rules have been found ineffective. Thus the introduction of new parallel versions has become a necessity. We propose in this paper, a parallel version of a sequential algorithm Partition. This is fundamentally different from other sequential algorithms, as it scans the database only twice to generate all significant association rules. Consequently, the parallel approach does not require much communication between sites. The proposed approach was implemented for an experimental study. The results obtained show a large gain in execution time compared to the sequential version.

Hide Abstract

Bit-plane slicing is a method which divides the image into many binary image planes and categorizes the image data into most significant and least significant information. In this paper a new edge detector using the most significant image data to detect the edges in the bacterial images is developed. This proposed method finds the edges in the higher order bit-planes using contouring technique and combines these edges to get the final edge image. The edges obtained by the proposed method are more accurate than the existing method. The experimental result obtained by the proposed edge detector is compared with the popular edge detectors Canny, Log, Prewitt, Robert and Sobel and have produced best results.

Hide Abstract

Mobile Ad-Hoc Network (MANET) is a wireless network without infrastructure and decentralized network which need a robust dynamic routing protocol and it is becoming an important concept of modern communication technologies and services. There are various routing protocols available for MANETs. In this work, we focus on the most popular ones are DestinationSequenced Distance Vector (DSDV), Optimized Link State Routing(OLSR), Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Multicast Ad Hoc On-Demand Distance Vector Routing Protocol (MAODV) routing protocol. This paper is an attempt to study, analysis and compare these five routing protocols on the basis of various performance metrics such as throughput of received packets, throughput of dropped packets, packet delivery ratio, end to end delays, jitter and normalizes routing load .This performance evaluation have been perform under different environments. The simulation results indicate that none of the routing protocols we selected have shown best performance in all the six different performance metric. Therefore, the efficiency of a network can be achieved by choosing the best suitable protocols based on the network requirement.

Hide Abstract

Information and communication technology has changed the way in almost all the fields and is playing salient role in education. Use of ICT in teaching-learning process is different from teaching in a classroom. Teachers have to be trained in such a way that they should plan, create and deliver the content using ICT tools. Integrating ICT into education seems to be necessary issue for educators and education administrators in the world. ICT tools provide more effective learning environment. Use of ICT make changes in teaching methods, learning approaches, handling and exchanging information. The purpose of this paper discusses the benefits and difficulties in use of ICT for teaching-learning process, approaches for use of ICT in education in India as well as other counties.

Hide Abstract

The internet information network of the latest technology at the moment, which is linked to information and communication technologies and computers that have evolved significantly since the end of the last century, and continues to evolve quickly and persistence. Some Statistics indicate that the number of Internet users in the world, about 0.7%, while in the United States and Canada, up to 40% . The online network is composed of huge numbers of networks, linking computers distributed in different parts of the globe, dubbed the “network of networks”, because most of the computers connected to the Internet, are also part of smaller networks, found within companies, universities and government departments, and connects online between these networks to make up the global network is huge, connects hundreds of millions of people, to communicate with each other, and access to information, and the exchange of data and programs, and serves the Internet more than 200 million users and is growing very fast up to 100 percent per year, has started the idea of the Internet was originally military government idea and spread to the education sector and research and then trade up to become accessible to individuals where the sail in the Internet completely free but the price you pay is to provide a service to you.

Hide Abstract

The artificial neural networks have been generally based on rate coding in the earliest stage of computational neuroscience development. What if all the idea of computational paradigm involving the propagation of continuous data affected straight the enhancing of neural network performance and the main objective becomes how to encode the data for modeling biological behavior. The spiking neural networks (SNN) were founded around this concept where not only the network topology, neuron model and plasticity rule should be defined, but also used the timing of the spike to encode and compute information. In this paper, we proposed an automatic lipreading system for spoken digits based on spike response model (SRM). We experimentally demonstrated the impact of the coding strategy to improve the results by comparing two strategies: Spike time coding and population coding by using Gaussian receptive fields (GRF); which achieved 75% and 83.33% accuracy, respectively, on Tulips1.0 dataset.

Hide Abstract

Digital image processing is rapidly evolving field with growing application in science and engineering. Edge enhancement plays a vital role in Digital image processing. Edge enhancement is a pre-processing technique for all images. Digital images are numeric representation of 2-dimensional images. A multi-scale algorithm for the unsupervised extraction of the most significant edges has been done in SAR images. It is planned to propose a novel technique for automatic edge enhancement in indoor digital images. The characteristics of digital images justify the importance of an edge enhancement step prior to edge detection. Therefore, a robust and unsupervised edge enhancement algorithm based on a combination of wavelet coefficients at different scales can be applied. Firstly, wavelet transform is used to remove noises and enhancement for images collected. Secondly, the edge detection can be performed in enhanced digital images by Canny edge detector. A double thresholding method modified from Canny’s method can be used. To derive the final image, the local intensities of each image, as well as their correlation must be taken into account using the fuzzy logic. It has been proven to be robust and effective for this application. This method could be effectively used for segmentation purposes in digital images.

Hide Abstract

Link prediction is a key technique in many applications in social networks; where potential links between entities need to be predicted. Typical link prediction techniques deal with either uniform entities, i.e., company to company, applicant to applicant links, or non-mutual relationships, e.g., company to applicant links. However, there is a challenging problem of link prediction among the composite entities and mutual links; such as accurate prediction of matches on company dataset, jobs or workers on employment websites, where the links are mutually determined by both entities that composite entity belong to disjoint groups. The causes of interactions in these domains makes composite and mutual link prediction significantly different from the typical version of the problem. This work addresses these issues by proposing the Support Vector Machine model. By implementing the proposed algorithm it is expected that the accuracy will get increased in the link prediction problem.

Hide Abstract

Web-based Content Management Systems (WCMS) consist of applications that are used to create, manage, store and deploy content on the Web, including text, multimedia data(graphics, video or audio),andapplication code. Web-based Content Management Systems are often a component of Enterprise Content Management (ECM) solutions. The Content Management layer contains the core components for the Web Content Management Application. In WCMS, the authorization component grants the appropriate privileges to users, based on their respective roles. Also the library Services provide the core content management functionality (check-in/out, version control), along with Publish, Staging, Logging, and Content Reporting/Auditing. The Web Interface and Portal Application presents the contents to the various user segments based on their authorization. Remote portals (e.g., web parts, gadgets, widgets) can be used to embed the content management functionality or sourced content in portals provided by other vendors. The search indexing engine can create searchable indexes from websites supported by the WCMS solutions. This paper concerned with some review work, introduction towards some basic modeling of CMS/WCMS for Business Processes with the reference of entire reviewed sources.

Hide Abstract

Cloud computing is not a new technology. Cloud computing is related to grid computing as well as it is based on distributed system. Cloud computing is used to provide services, access resources according to its different types. This paper explains in brief about the cloud computing and Grid computing as well as how both concepts differ from each other, its key strengths, and characteristics.

Hide Abstract

In the world of computing, information plays an important role in our lives. One of the major sources of information is database. Database and Database technology are having major impact on the growing use of computers. Almost all IT applications are storing and retrieving the information or data from the database. Database Management Systems (DBMS) have been widely used for storing and retrieving data. However, databases are often hard to use since their interface is quite rigid in co-operating with users. For storing and retrieving the information from database requires the knowledge of database language like SQL. Structured Query Language (SQL) is an ANSI standard for accessing and manipulating the information stored in database. However, everyone may not be able to write the SQL query as they may not be aware of the syntax and structure of SQL and database respectively. In India, the natural language of people is mainly Hindi. Also large number of e-governance applications use database. So, to use such database applications with ease, people who are more comfortable with Hindi language, requires these applications to accepts a simple sentence in Hindi, and process it to generate a SQL query. The SQL query is further executed on the database to produce the results. Therefore, any interface in Hindi language will be an asset to these people. This paper discusses the architecture of mapping the Hindi language query entered by the user into SQL query.

Hide Abstract

Recently trends and technologies are growing drastically, where the internet connectivity plays a significant role. But the disappointment is that the connectivity is not present in all locations. In this case study, we took the location based services which completely rely on connectivity, example, if the user loses his or her connectivity they will not be able to receive or get updates of the location based services. So we implemented an offline location based service where the users can get profited even when there is no connectivity. This system is proposed by developing an android application which contains all location based contents using database management system, and implemented it on a smart phone.

Hide Abstract

Communication is an essential part of the human experience, as humanity evolves, technology evolving too, impacting the way communicative aspect of our lives functions. we hear many acronym nowadays from here and there like IoT, M2M,Cloudmobile and so on, cellular communications is the seed for all , there is many research on that growing fields, In this paper we will display what other did in cellular communication from 2007-2012 , to determine , challenges and future trends, also the role of computer techniques on solving such challenges will be given too. The paper try to answer such question like: What is the open research area (or challenges ) of cellular communication? Are Computer techniques represent good solution for cellular challenges? What is the computer algorithms used to solve those challenges.

Hide Abstract

language processing, which governs the process of identifying which sense of a word (i.e. meaning) is used in a sentence, when the word has multiple meanings. Research has progressed steadily to the point where WSD systems achieve sufficiently high levels of accuracy on a variety of word types and ambiguities. A rich variety of techniques have been researched, from dictionary-based methods that use the knowledge encoded in lexical resources, to supervised machine learning methods in which a classifier is trained for each distinct word on a corpus of manually sense-annotated examples, to completely unsupervised methods that cluster occurrences of words, thereby inducing word senses. Among these, supervised learning approaches have been the most successful algorithms to date. The senses of a word are expressed by its WordNet synsets, arranged according to their relevance. The relevance of these senses are probabilistically determined through a Bayesian Belief Network. The main contribution of the work is a completely probabilistic framework for word-sense disambiguation with a semi-supervised learning technique utilising WordNet. Word sense disambiguation is a major problem in many tasks related to natural language processing. This paper aims to enriching wordnet for word sense disambiguation by adding some extra features to wordnet that may enhance the efficiency of knowledge-based contextual overlap WSD algorithms when they are used on wordnets. 

Hide Abstract

While the transmission technology of data is increases rapidly, the technology to protect these from unauthorized users need to be enhanced. There are several technologies have used such as cryptography, but this technology don’t provide efficient solution. Digital watermarking technology can provide efficient solution to the above crucial problem. Digital watermarking is applied in several media such as image, audio, video, text. As we know, in most of the applications of digital watermarking, the watermark is used to protect the copyright of digital product. In the other word, the product(cover) is important. According to this fact, we presented a new watermarking concept called intelligent watermarking. We took vector map of GIS (Geographic Information System), as case study. Briefly, the scheme depends on the feature of the cover. The embedding of the watermark can be done in several steps. First extracting some features from the original digital vector map. Second combining these features with external watermark in order to get the intelligent watermark. Third embedding the intelligent watermark in the vector map to get the watermarked vector map. The extracting of the watermark can be done in several steps. First, extract the intelligent watermark from the watermarked digital vector map. Second decomposing the intelligent watermark into features and external watermark. Third reversing the extracted features to features of watermarked vector map. So, if the watermarked vector map is attacked, this watermarked vector map will be distorted, otherwise will not be distorted. Our proposed scheme can be applied in all the other media.

Hide Abstract

In this paper, an investigation for the facts about what is the robust and energy efficient routing protocol in underwater wireless sensor networks by comparing between three routing protocol are Vector-Based Forwarding Protocol (VBF), hop-by-hop vector-based forwarding (HHVBF) and Vector-Based Void Avoidance (VBVA). The typical physical layer technology for underwater networks is acoustic communication compared with electromagnetic waves and optical waves. Energy constraint, long delay and limitation in bandwidth are greater challenges in underwater acoustic sensor networks for monitoring and other applications.in this paper present the performance evaluation of these protocols in term of energy consumption ,average end-to-end delay and Packet delivery ratio. Comparison is carried out by using Aqua-Sim simulators for underwater sensor networks and NS2 based simulator installed in Linux environment.

Hide Abstract

A mobile ad hoc network (MANET) is an autonomous, self-configuring network of mobile nodes that can be formed without the need of any pre-established infrastructure or centralized administration. MANETs are extremely flexible and each node is free to move independently, in any random direction. Each node in the MANET maintains continuously the information required to properly route traffic. This paper presents a simulation study to analyze and evaluate the behavior of the MANET with AODV routing protocol by testing four mobility models (i.e. Waypoint(RWP), Reference Point Group Model (RPGM), Gauss Markov Model (GMM) and Manhattan Grid Model (MGM)). Several performance metrics (Throughput, Packet Delivery Fraction (PDF), Average End-to-end Delay (AED),Normalize Routing Load (NRL) and packets loss) were suggested as a measuring tool to be used in the comparison stage for all these four mobility models using NS- 2.Various parameters such as different number of nodes, different speeds, different pause times, different environment areas and different traffic rates were also used in five suggested scenarios. The results indicated that the best performance of AODV routing protocol is with RPGM mobility model than other mobility models.

Hide Abstract

Improving the efficiency of dynamic routing problem on road network is a difficult .There is numerous works proposed for this problem and they try to solve this in different aspects. Most of the existing routing problem based on static approach. In this paper, we propose a fuzzy Dijkstra’s shortest path algorithm based on dynamic approach. The linguistic variables that qualify user parameters are quantified using fuzzy set theory that provides fuzzy numbers outputs to predict the shortest route on network. By handling the fuzzy parameter, it gives issue to compare the distance between two different paths with their edge lengths represented by fuzzy numbers. The addition of fuzzy numbers using graded mean integration representation is used to improve Dijkstra’s algorithm. A numerical example of a road network is used to illustrate the efficiency of the proposed method.

Hide Abstract

This paper aims to develop new techniques to construct a graph structure to represent the relation between the objects in movie film. The main approach includes a mechanism for many steps, first step is the Data Base Construction , which create a table consist record for each frame, and each record contain entities such as area, Perimeter, and other parameters. The second step is to calculate the number of features for any object in each frame depending on the parameters in the data base. While the third step constructs a graph structure that represent a base on the features of the objects.

Hide Abstract

The P2P routing protocol is affected from the fact that queries need to reach the largest number of peers to enhance the chances to locate the target file and messages should be low as possible We propose trust based query routing technique for P2P Networks. Initially the node with maximum trust value is chosen as cluster head. These cluster heads are designated as trust managers. Each peer maintains a trust table which gets updated once it gets feedback from the trust manager about the resource requested peer. If the update denotes that the node is reachable and trusted, the routing is performed. Otherwise its echo time is verified again to decide the re-routing process. By simulation results, we show that the proposed work offers secured and reliable routing. This peer to peer network is carried out without using a caching mechanism to store the data packets while routing. To achieve this caching mechanism we have proposed methods for caching the data packets in the peers and also to replace these data packets with the new data packets in the next routing process.

Hide Abstract