The purpose of extracting of Bio-Medical Entities is to recognize the particular entities, whether word or phrases, from the unstructured data contained in the text. This work proposes different approaches and methods, i.e. Machine Learning Hybrid Classification, Rule Based Non-tested Generalized Exemplars and Partial Decision Tree (PART) Learners for Bio-Medical Named Entity Recognition. The Prime objective is to consider, preferably, simple characteristics, such as, affixes and context. In addition, orthographic, Parts of Speech (POS) tags and N-grams are given secondary importance as for as their comparison with affixes and context is concerned. Further, for the very purpose of Bio-medical Diseased Named Recognition, proposal of Rule Based Classifiers along with the Statistical Machine Learning is given. Also, this paper proposes the blend of both preceding methods that jointly construct Hybrid Classification algorithm. Precision, Recall and F-measure – standard metrics- has been put into practice for the evaluation. The results prove that the technique used has far better performance results than the method used before - state-of-art Disease NER (Named Entity Recognition).
A subset of vertices of a graph G is called a decycling set of G if its deletion results in an acyclic subgraph. The cardinality of a minimum decycling set is called the decycling number of G. This paper presents an approach to construct an acyclic subgraph of CQ n and proves that for any integer n ≥ 2, the decycling number of CQ n is 2 n-1 ·(1-c/n-1), cϵ[0,1].
As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph G is called k-fault-tolerant edge-pancyclic if after deleting any faulty set F of k vertices and/or edges from G, every correct edge in the resulting graph lies in a cycle of every length from g to |V (G - F )|, inclusively, where g is the girth of G, the length of a shortest cycle in G. The n-dimensional Mobius cube MQn is an important variant of the hypercube Qn, which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of MQn, and shows that if MQn(n ≥ 3) contains at most n - 3 faulty vertices and/or edges then, for any fault-free edge uv, there is a fault-free cycle of every length from 6 to |V (MQn - F )| containing the edge uv. The result is optimal in some senses.
1
1 January 2018 in International Journal of Advanced Computer Science and Applications
Recently, Wireless Sensor Networks (WSNs) are getting more fame because of low cost and easy to manage and maintain. WSNs consists of sensor nodes and a Base Station (BS). Sensor nodes are responsible to sense, transmit and receive the data packets from sensing field, and the BS is responsible to collect this data and covert it into readable form. The main issue in this network is lack of power resources. As sensor nodes are restricted to limited energy, so researchers always aims to produce an energy efficient clustered routing protocol. To make the efficient routing protocol, heterogeneity of sensor nodes is a best possible solution. ‘Stable Election Protocol’ was the first heterogeneous network and proposed two level of heterogeneity. SEP Protocol not only improved the network lifetime but also improved the stability of sensor nodes. In order to maximize the network lifetime, we propose the scalability of SEP routing protocol (S-SEP) to check the reliability in large scale networks for traffic engineering. We compare the results of standard SEP routing protocol with fourth level of heterogeneity. Simulation results proves that S-SEP protocol works more better in larger networks.