Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

In this paper, the theoretical cross section in pre-equilibrium nuclear reaction has been studied for the reaction  at energy 22.4 MeV. Ericson’s formula of partial level density PLD and their corrections (William’s correction and spin correction) have been substituted  in the theoretical cross section and compared with the experimental data for  nucleus. It has been found that the theoretical cross section with one-component PLD from Ericson’s formula when  doesn’t agree with the experimental value and when . There is little agreement only at the high value of energy range with  the experimental cross section. The theoretical cross section that depends on the one-component William's formula and on-component corrected to spi

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

Out of 150 clinical samples, 50 isolates of Klebsiella pneumoniae were identified according to morphological and biochemical properties. These isolates were collected from different clinical samples, including 15 (30%) urine, 12 (24%) blood, 9 (18%) sputum, 9 (18%) wound, and 5 (10%) burn. The minimum inhibitory concentrations (MICs) assay revealed that 25 (50%) of isolates were resistant to gentamicin (≥16µg/ml), 22 (44%) of isolates were resistant to amikacin (≥64 µg/ml), 21 (42%) of isolates were resistant to ertapenem (≥8 µg/ml), 18 (36%) of isolates were resistant to imipenem (4- ≥16µg/ml), 43 (86%) of isolates were resistant to ceftriaxone (4- ≥64 µg/ml), 42 (84%) of isolates were resistant to ceftazidime (1

Background: White spot lesion considered as irreversible tooth demineralization presenting challenge to orthodontists during treatment schedules, fluoride was the most successfully used measure to overcome this challenge. Materials and method: A total of forty sound human permanent premolars were used in the present study and categorized into four groups, in one group the teeth were bonded with stainless steel brackets using Resin-modified glass ionomer cement (RMGIC) and the other three groups the teeth were bonded with light cured composite Resilience® (Ortho technology Co., USA). Group A; Acidulated phosphate fluoride (APF) topical gel (Mfg by DEEPAK PRODUCTS, INC, USA), fluoride ion 1.23% applied on examine area for four minute. Gro