International Journal of Computational Intelligence Techniques

01-05

Authors: Chakrabarti P., Basu J.K

Purpose of this paper is to addresses the problem of information discovery in large collections of text. For users, one of the key problems in working with such collections is determining where to focus their attention. Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use for answering precise queries or for running data mining tasks. We explore a technique for extracting such tables from document collections that requires only a handful of training examples from users. These examples are used to generate extraction patterns that in turn result in new tuples being extracted from the document collection. In selecting documents for examination, users must be able to formulate reasonably precise queries. Queries that are too broad will greatly reduce the efficiency of information discovery efforts by overwhelming the users with peripheral information. In order to formulate efficient queries, a mechanism is needed to automatically alert users regarding potentially interesting information contained within the collection. The idea can better be explained into two sub topics. One is extraction of relations from natural plain text and another is frame discovery and formation of word-net from language text. In this paper we have tried to explain how to extract the different kind of relationship between the words with the help of a frame net analysis diagram of an annotation layer software.

10-14

Authors: Geetha Devasena M.S., Valarmathi M.L

Software testing is inescapable activity of software development and crucial to the software quality. It is widely deployed by programmers and tester but it is difficult due to the complexity of software. The program with the moderate complexity cannot be tested completely. Innovative methods are emerging to perform testing as a whole and unit testing in particular with minimum effort and time. Unit testing is mostly done by developers under a lot of schedule pressure since the software companies find a compromise among functionality, time to market and quality. Thus there is a need for reducing unit testing time by optimizing and automating the process. Test suite generation is an errorprone, tedious and time consuming part of unit testing. A novel technique is proposed to automatically generate test cases from the input domain using metaheuristic search technique tabu search for branch coverage criteria with respect to cyclomatic complexity measure.

18-21

Authors: Gollagi S.G., Ankaliki S.G. , Zinage H.R

The 802.11 family uses a MAC layer known as CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance) contention resolution mechanism for sharing the wireless medium. In this environment, hosts can not trusted and selfish host that fails to adhere to the medium access policies may obtain an unfair throughput share. For instance, IEEE 802.11 requires host competing for access to the medium to wait for backoff interval, randomly selected from the specified range, before initiating a next transmission. Selfish station may wait for smaller backoff interval than well-behaved station, thereby obtaining an unfair advantage of channel. In this paper, an attempt is made to capture the behavior of misbehaving station and diagnosis such hosts in the network. Further, we discover the penalty scheme for punishing selfish hosts. Simulation results under this misbehavior model have indicated that, proposed scheme provides fairly accurate diagnosis and effective in restricting the throughput of selfish station to a fair share and hence successful in handling Medium Access Control (MAC) misbehavior in the wireless Network. The NetSim-2(simulator) had used for the simulation: CBR flow with rate 2Mbps, Packet size: 512 bytes and simulation time per run is 50 second.