博電競菠菜平臺 www.rrkuhedt.buzz Sohaib Ahmad, Faheem Khan, Mukhtar Ahmad , Shazia Naeem, M.N .Khalid and Asia Begum

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

In general, Security techniques pursue two defense lines: one preventive and the second
one is reactive6. The first one offers techniques to circumvent any type of Attack, as firewalls and
cryptographic systems. The second consists in getting act on demand to lessen Intrusions, as
Intrusion Detection systems. This paper observes Survivable approaches whose purpose is to
facilitate network s to complete their functions properly and significantly even In the presence of
Intrusions. preventive, reactive techniques and Tolerance defense lines. This paper established
Survivability concepts and its association with preventive, reactive and Tolerance defense lines.
Survivable MANETs will be capable to accomplish their purposes and aims by means of the
cooperation between those three defense lines. Key Properties of Survivability as resistance,
acknowledgment, recovery and adaptability were thorough, and Survivability needs for MANETs
were examined. In conclusion, this function highlights that a completely Survivable MANET be
supposed to be appropriate cooperatively the three defense lines as an alternative of only one or
two lines separately.

Hide Abstract

Views 
   PDF Download PDF Downloads: 253



Mukhtar Ahmad, Faheem Khan, Sohaib Ahmad, Shazia Naeem, M.N.Khalid and Shehzad Rizwan

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

In this paper, we are showing two Intrusion Detection Techniques for MANET as we know that Data accessibility in a MANETs is influenced by Mobility and Power constrain of the Servers and Clients, and the data in MANETSs be replicated. In this paper we exercise two methods for transferring of Communication among the Nodes. The first method is planned for finding of malevolent Nodes in a Neighborhood of Nodes in which each pair of Nodes in the Neighborhood are contained by the Radio range within Each other.. The next method is to planned for the exposure of malevolent Nodes in a Neighborhood of Nodes, where every pair of Nodes will not be in the Radio range of one another but a Node among them having all the other Nodes in its one count range or one-hop vicinity. In this paper we exercise Intrusion Detection System(IDS) for finding Malevolent Node and the two method known as Clique and Cluster as shown in[8]. To Summarize, it can be seen from ADCLI Algorithm indeed Detects the Malevolent Nodes effectively with a towering proportion of accurateness when at most k malevolent Nodes are present in a set of n (n 3 4k + 1) Nodes, Even when there is a practical proportion of Packet collision (Message destruction). Moreover, standard false Detection is also minimum in such a situation. on the other hand for the situations where more than k malevolent Nodes are present, the result might be volatile. The proof of accuracy show that the Algorithm functions properly at all times for a consistent channel. In situation of the ADCLU Algorithm, Algorithm functions well Even in an unpredictable channel where the proportion of collision is around 5 %. The two methods known as Clique and Cluster as shown in [8].In these methods a Node call the Monitor Node commences the discovering procedure. Depend on the Communications, which is accepted through the Detection course of action, every Node decides the Nodes it believes to be malevolent and drive a Message to the Monitor Node. The Monitor Node ahead examining the Message to decide the malevolent Nodes among the Suspected Nodes. In this paper, we are showing two Intrusion Detection Techniques for MANET.The first method is planned for finding of malevolent Nodes in a Neighborhood of Nodes zzzzin which each pair of Nodes in the Neighborhood are contained by the Radio range within Each other. This kind of Nodes in the Neighborhood is called a Clique8 . The next method is to planned for the exposure of malevolent Nodes in a Neighborhood of Nodes, where every pair of Nodes will not be in the Radio range of one another but a Node among them having all the other Nodes in its one count range or one-hop vicinity. Such Neighborhood is alike to a Cluster as shown in8. The above two methods exercise Communication transferring among the Nodes. A Node call the Monitor Node commences the discovering procedure. Depend on the Communications, which is accepted through the Detection course of action, every Node decides the Nodes it believes to be malevolent and drive a Message to the Monitor Node. The Monitor Node ahead examining the Message to decide the malevolent Nodes among the Suspected Nodes.

Hide Abstract

Views 
   PDF Download PDF Downloads: 248



Saad Aljebori1?and Alaa Taima2

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

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 MANET maintains continuously the information required to properly route traffic. This paper presents the mathematical model to select the best mobility model for any MANET using Network Simulator version 2 (NS-2) with respect to four performance metrics (Throughput, Packet Delivery Fraction (PDF), Average End-to-end Delay(AED), and Normalize Routing Load (NRL)) for different scenarios such as different number of nodes, different speeds, different pause times, different environment area and different traffic rates. The weights of these performance metrics are assigned according to user need. We use Ad-hoc On-demand Distance Vector (AODV) as routing protocol and four mobility models (Random Waypoint(RWP), Reference Point Group Model (RPGM), Gauss Markov Model (GMM), Manhattan Grid Model (MGM)). The results indicate that this model is efficient and flexible to select the best mobility model because the weights of performance metrics are determined according to user’s need.

Hide Abstract

Views 
   PDF Download PDF Downloads: 257



U. Abdulwahab and M. I. M. Wahab*

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

In this paper, we have devised a real-time, workable model for solving the practical problems associated with responsible blood platelet inventory. These problems include how to eciently dispense, organize, store, and order platelets that become unusable after 6 days. Stochastic demand and supply, as well as deterministic lead times, are congured into their model. Any shortages or outdates of the 8 major blood types are penalized in this proposal, with revenuw in conjunction with a further emphasis on the age of platelets will maximize ecency as well. A combined model of linear programing and approximate dynamic programming (ADP) was deployed while constructing their practical model. In an environment which emphasizes the need for realtime judgements, this new policy, as advanced here, will lead to substantial shortage, outdate, and cost reductions of these time-stamped platelets. The experimental application of this model produced shortages in the range of apporximately 4.7% with outdates at 5.5%, a vast improvement over existing methods. An ADP approach was found to be practical during this research, and additionally the model showed much promise with respect to enhancing a reward system that simultaneously decreases shortages and the number of expired platelets.

Hide Abstract

Views 
   PDF Download PDF Downloads: 320



N. Jaswanth, J. Durga and D. Kiran Kumar

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Now a days the healthcare industry is facing significant pressures to lower the costs associated with providing healthcare, adopt new systems that support electronic medical records (EMR), and share data quickly and securely with other healthcare and government agencies and complainces like HIPAA. the healthcare industry has not been quick to adopt new technologies as it relates to infrastructure to support back-office operations. This paper enriches in focusing the health care sectors and its adoptions to cloud technology especialy in IaaS. Creating awarness and embeding the health care firms to the most smarter cloud technology this proposed approaches focus on discussing various cloud benefits to kickstart the health care firms as per their changing demands most effectively.

Hide Abstract

Views 
   PDF Download PDF Downloads: 266



A.F.Sheik Subani

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Thesis is devoted to network with WiMAX. It is claimed that WiMAX provides a perfect opportunity for an alternative network development. Discussion is based on five main aspects of WiMAX network implementation. Establishment and development of Base Stations (BS), Access Service Network Gateway (ASNG), and Connectivity Service Network (CSN), Base Station Controllers (BSC) and an Analogous Option (AO) to the GSM model are taken into account. The above mentioned entities are considered as integrative parts of WiMAX network establishment and implementation. Starting from 2011 the system was updated and rate was up to 1 Gigabits for fixed stations. The main emphasis in thesis is made on alternative nature of WiMAX.

Hide Abstract

Views 
   PDF Download PDF Downloads: 247



Saad Talib Hasson1?and Alyaa. A. Al-Monaaem Al-Najar2

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Recently Wireless sensor Networks (WSNs) takes interesting researches due to there important and crucial applications. WSNs have limited energy so all researches focused in designing routing algorithms to save energy and to make each one operating for longer possible time. Based Random Efficient Energy (BREERA) is one of WSNs routing algorithms saved energy of the whole network because its sensor nodes needn’t to know any information about their sensor nodes neighbors. This paper suggests two approaches to modify the performance of the routing algorithm BREERA and make a comparison between the performance of the original BREERA and the performance of the modified BREERA. The first suggested method was called weights method which improved the performance of BREERA with the average received messages, lost messages, PDF, and average total energy. Weights method used two cases of energy weights (w1= 0.1 and w1= 0.8). With the value of the energy weight equal to 0.1 obtained higher received messages average, higher PDF average, less lost messages average and less died nodes average. While with the value of the energy weight equal to 0.8, a higher total energy was obtained. The second suggested approach is to limit the number of members for each cluster head which improves the performance of BREERA in received messages, lost messages, died nodes, PDF and total energy .The simulator Net Logo version 4.1.3 was used to design the simulation program of the routing algorithm BREERA.

Hide Abstract

Views 
   PDF Download PDF Downloads: 245



Al.Shraideh Khaled

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

To solve the problems of modeling telecommunications networks currently used by a large number of different methods. All of them can be divided into two classes1-5. First class combines methods of physical modeling in which, instead of the real system uses its simplified physical counterparts. In view of the significant limitations of these methods, they are rarely The second class includes methods of mathematical modeling, using appropriate analytical tools to describe transfer processes in the network. Depending on the used product are mathematical methods based on statistical (simulation) modeling, and theoretical and analytical methods Statistical and physical modeling to obtain accurate results, but because of the high labor intensity, considerable time and low degree of flexibility is of limited use.

Hide Abstract

Views 
   PDF Download PDF Downloads: 312



T. Kalaichelvi1 and P. Rangarajan2

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Protein folding is considered as a significant confrontation in biological and protein research. This confrontation is interrelated to the fact that the conventional computational approaches are not potent enough to search for the appropriate structure in the large conformational space of protein. This insufficiency of the computational methods is a major hindrance in facing the protein folding problem. Trying to solve the problem, many researchers have examined the efficiency of the protein threading technique. Perhaps, parallel evolutionary methods for protein fold recognition have also been used. Typically, protein folding accredits to how a protein amino acid sequences with respect to the physiological conditions, folds into a three-dimensional structure called as native state. In this paper, various algorithms that have been framed for protein structure prediction. Furthermore, a survey of parallel evolutionary models for protein fold recognition has also been provided. The result of this survey showed that evolutionary methods can be effectively used to resolve the protein folding problems.

Hide Abstract

Views 
   PDF Download PDF Downloads: 293



Saksham Srivastava

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

The random numbers have been generated by the GCC compiler and tested for their randomness. The code used by the library function of GCC compiler to generate random numbers is also presented. Chi-square test, Runs test below and above median, and Reverse arrangement test have been conducted to test the randomness. It has been shown that the Random numbers generated by GCC compiler have successfully passed these tests.

Hide Abstract

Views 
   PDF Download PDF Downloads: 349



K. Jeyakanth

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

QCA is one of the innovating technologies for Nano scale computation. With the present difficulties in reduction of sizes in transistor circuits, QCA has been proposed as a kind of replacement for such instances Researchers have developed several models for defect characterization and design to minimize the uncertainty of proper circuit operation. This uncertainty of the circuit aids in developing a probabilistic model for analysis. One such model is the Bayesian network (BN) modeling6 , which exploits the causal relationships in clocked QCA circuits to obtain a model with low complexity. It is based on density matrix formulations and also takes the dependencies induced by clocking of cells. One of the many interesting features of BN is that it not only captures the dependencies existing between two QCA cells, but can also be used to conduct steady stateoperations without the need for temporal computation of quantum mechanical equations.

Hide Abstract

Views 
   PDF Download PDF Downloads: 268



A. Arockia Eucharista and K. Haribaskar

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Access control is the process of mediating requests to data and services maintained a system, determining which requests should be granted or denied. Significant research has focused on providing formal representation of access control models. Role Based Access Control (RBAC) has become the norm in most organizations. This success is greatly due to its simplicity: a role identifies a set of Permissions; users in turn are assigned to roles based on their responsibilities. To implement a RBAC system, it is important to devise a complete set of roles. This design task, known as role engineering, has been recognized as the costliest part of a RBAC – oriented project. We propose a new role engineering approach to Role – Based Access Control (RBAC) referred to as visual role mining. The main aim is to graphically represent user – permission assignments to enable quick analysis and elicitation of meaningful roles. We propose two algorithms: VISRODE (VISualize Roles using DicE) and EXTRACT (Exception Tolerant Role ACTualizer). A heuristic algorithm VISRODE is used to sort the users and permissions matrix to avoid the large gaps between items using DicE coefficient. EXTRACT is a probabilistic algorithm and it generates a list of pseudo roles. This paper offers a graphical way to effectively navigate the result so that it reduces the time complexity in visualizing the roles.

Hide Abstract

Views 
   PDF Download PDF Downloads: 345



T. Ravi Kumar1?and K. Raghava Rao2

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Harvesting the benefits of a sensor-rich world presents many data analysis and management challenges. Recent advances in research and industry aim to address these challenges. Modern sensors and information technologies make it possible to continuously collect sensor data, which is typically obtained as real-time and real valued numerical data. Examples include vehicles driving around in cities or a power plant generating electricity, which can be equipped with numerous sensors that produce data from moment to moment. Though the data gathering systems are becoming relatively mature, a lot of innovative research needs to be done on knowledge discovery from these huge repositories of data. The data management techniques and analysis methods are required to process the increasing volumes of historical and live streaming data sources simultaneously. Analysts need improved techniques are needed to reduce an analyst’s decision response time and to enable more intelligent and immediate situation awareness. Faster analysis of disparate information sources may be achieved by providing a system that allows analysts to pose integrated queries on diverse data sources without losing data provenance. This paper proposed to develop abstractions that make it easy for users and application developers to continuously apply statistical modeling tools to streaming sensor data. Such statistical models can be used for data cleaning, prediction, interpolation, anomaly detection and for inferring hidden variables from the data, thus addressing many of the challenges in analysis and managing sensor data. Current archive data and streaming data querying techniques are insufficient by themselves to harmonize sensor inputs from large volumes of data. These two distinct architectures (push versus pull) have yet to be combined to meet the demands of a data-centric world. The input of sensor streaming data from multiple sensor types further complicates the problem.

Hide Abstract

Views 
   PDF Download PDF Downloads: 267



H.B. Basanth Kumar

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Now a day’s World Wide Web has become very popular and interactive for transferring of information. The web is huge, diverse and active and thus increases the scalability, multimedia data and temporal matters. The growth of the web has outcome in a huge amount of information that is now freely offered for user access. The several kinds of data have to be handled and organized in a manner that they can be accessed by several users effectively and efficiently. So the usage of data mining methods and knowledge discovery on the web is now on the spotlight of a boosting number of researchers. Web usage mining is a main research area in Web mining focused on learning about Web users and their interactions with Web sites. The motive of mining is to find users’ access models automatically and quickly from the vast Web log data, such as frequent access paths, frequent access page groups and user clustering. Through web usage mining, the server log, registration information and other relative information left by user access can be mined with the user access mode which will provide foundation for decision making of organizations. This paper presents brief overview of web usage mining and business intelligence.

Hide Abstract

Views 
   PDF Download PDF Downloads: 258



Shweta Sharan, Kamini and Neha Mahajan

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

Information and Communication Technology (ICT) in agriculture is an emerging field focussing on the enhancement of agricultural and rural development in India. It involves innovative applications using ICT in the rural domain. The advancement of ICT can be utilized for providing accurate and timely relevant information and services to the farmers, thereby facilitating an environment for remunerative agriculture. This paper describes a mobile based application – Krishi Ville which would take care of the updates of the different agricultural commodities, weather forecast updates, agricultural news updates. The application has been designed taking Indian farming in consideration.

Hide Abstract

Views 
   PDF Download PDF Downloads: 239



Trushar. B Patel1?and Premal Soni2

[ View:    Abstract ] [ HTML Full Text] [ PDF ] [ XML ]

The process of identification, analysis and either acceptance or mitigation of uncertainty in investment decisionmaking. Essentially, risk management occurs anytime an investor or fund manager analyzes and attempts to quantify the potential for losses in an investment and then takes the appropriate action (or inaction) given their investment objectives and risk tolerance. Inadequate risk management can result in severe consequences for companies as well as individuals.

Hide Abstract

Views 
   PDF Download PDF Downloads: 250