Identified the Cluster Based Stretch and Shrink Method Based On Load Balancing Algorithm for Ad Hoc Network Topology Stability

No Abstrac

Broken Punishment Networks in Public Goods Games: Experimental Evidence

Abundant evidence suggests that high levels of contributions to public goods can be sustained through self-governed monitoring and sanctions. This experimental study investigates the effectiveness of decentralized sanctioning institutions where punishment opportunities are restricted to agents who are linked through alternative punishment networks. We find that the structure of the punishment network significantly impacts contributions to the public good, but not overall efficiencies. Contributions collapse over decision rounds in groups with limited punishment opportunities, even if the absolute punishment capacity corresponds to the complete punishment network where all agents are allowed to punish each other. However, after allowing for the costs of sanctions, efficiencies are similar across the different networks that allow for punishment and the no-punishment network.public goods experiment, punishment, cooperation, networks

Phytochemical, Toxicological and Pharmacological Studies of Asiasari Radix et Rhizoma: A Review

Herba Asari and Asiasari Radix (AR) have a centuries-old history as a folk medicine in China, Korea and Japan. AR has long been used in combination with other herbs to treat cough, toothache, headache, neuralgia, aphthous stomatitis, gingivitis, chronic bronchitis, asthma and allergies. AR from three species of the genus Asarum: A. heterotropoides Fr. Schmidt var. mandshuricum (Maxim.) Kitag., A. sieboldii Miq. var. seoulense Nakai and A. sieboldii Miq are recognized as original “Asiasari Radix et Rhizoma”. These species do not contain aristolochic acids (nephrotoxins present in the Asarum species) and therefore the roots of AR are recommended for use. Asiasari Radix is rich in volatile oils, phenylpropanoids, terpenoids, flavonoids, glycosides and lignins. The reported toxicological and pharmacological activities of AR, including antifungal, antimicrobial, antilisterial, antiallergic, acarcidal, larvicidal, anti-caries, anti-inflammatory, hepatoprotective, neuroprotective, cytotoxic and anticancer activities suggest its therapeutic potentials in drug discovery.Keywords: Asarum; Asiasarum, Asiasarum heterotropoides var. mandshuricum, Asiasarum sieboldiiHerba Asari, Folk medicine, Pharmacological, Toxicologica

Charge storage characteristics of ultra-small Pt nanoparticle embedded GaAs based non-volatile memory

Charge storage characteristics of ultra-small Pt nanoparticle embedded devices were characterized by capacitance-voltage measurements. A unique tilt target sputtering configuration was employed to produce highly homogenous nanoparticle arrays. Pt nanoparticle devices with sizes ranging from ∼0.7 to 1.34 nm and particle densities of ∼3.3–5.9 × 1012 cm−2 were embedded between atomic layer deposited and e-beam evaporated tunneling and blocking Al2O3 layers. These GaAs-based non-volatile memory devices demonstrate maximum memory windows equivalent to 6.5 V. Retention characteristics show that over 80% charged electrons were retained after 105 s, which is promising for device applications

Reveiw of effective data encryption and decryption technique

The requirements of information security within an organization have undergone two major changes in the last several decades. Before the wide spread use of data processing equipment, the security of information  felt to be valuable to an organization was provided primarily by physical and administrative means. The collection of tools designed to protect data and to thwart hacker is computer security. Network security measures are needed to protect data during their transmission. This technique for encryption and decryption process to combine two methods ceaser cipher and transposition cipher, ceaser cipher is one of the substitution techniques. A substitution technique is one in which the letters of plain text are replaced by other letter or by numbers or symbols. if the plaintext is viewed as a sequence of bits, then substitution involves replacing plaintext bit patterns with cipher text bit patterns. The encryption process is two stages first, to convert the given plaintext into cipher text using ceaser cipher text technique, second stage the cipher converted using transposition technique, the final output is cipher text, The Decryption is the reverse process of the Encryption

ALTERATION OF PHARMACOKINETIC PARAMETERS OF PROTON PUMP INHIBITORS USING TRANSDERMAL DRUG DELIVERY SYSTEM

Objective: The present study was aimed to find out the effect of transdermal patches of proton pump inhibitors pantoprazole and esomeprazole on the alteration of pharmacokinetic parameters of these drugs. Methods: The transdermal patches were formulated by the solvent evaporation technique using polymers HPMC E5 with PVP K 30 and HPMC E5 with Eudragit L100 in different ratios. The best formulation from each of the drug pantoprazole and esomeprazole was selected and administered to rabbits and the plasma drug concentration was compared with the marketed formulation. The pharmacokinetic parameters such as maximum plasma concentration (Cmax), time to reach Cmax (tmax), area under the curve (AUC), area under first moment curve (AUMC), elimination rate constant (λz), biological half-life (t1/2), and mean residence time (MRT) were determined. Results: The plasma drug concentration vs time curve shows the extended-release of the drugs pantoprazole and esomeprazole when compared with the marketed formulation. The results show that there is no change in the peak plasma concentration, but a significant difference was observed in all the pharmacokinetic parameters. The AUC showed 6 fold increase for pantoprazole from 8.91 to 55.20 μg*h/ml and 3.5 fold increase for the drug esomeprazole from 7.86 to 28.53 μg*h/ml, and the mean residence time also showed 2 fold increase for the transdermal patches when compared with the marketed formulations. Conclusion: The increase in tmax, AUC, and MRT values of the formulated transdermal patches with the values of the marketed formulation of both the drugs, revealed that the transdermal patches can be used to deliver the drug for an extended period and also can alter the pharmacokinetics of pantoprazole and esomeprazole

FORMULATION AND EVALUATION OF TRANSDERMAL PATCHES OF PANTOPRAZOLE SODIUM

Objective: The present study was an attempt to develop an alternative dosage form for the existing conventional oral, parenteral proton pump inhibitor (PPI) as transdermal patches for treating peptic ulcers. Methods: Transdermal patches of PPI were prepared using HPMC E5 with PVP K 30 and HPMC E5 with Eudragit L100 polymers in different ratios by a solvent evaporation method. All the formulated patches were subjected to various evaluation parameters such as thickness, folding endurance, weight uniformity, content uniformity, swelling index, percentage moisture content, moisture uptake, surface pH and in vitro release studies. Results: All patches exhibited satisfactory characteristics regarding integrity, flexibility, dispersion of drug, and other quality control parameters. In the in vitro release studies of transdermal patches, formulation F1 showed the prolonged release of drug (98.99 %) for 24 h, which indicates the maximum availability of the drug, and the in vitro skin permeability studies also showed that 96.26 % of drug Pantoprazole sodium permeated through the rat abdominal skin in 24 h. The kinetic studies were carried out and it was found that all the formulations follow zero-order and the release mechanism of drugs was found to be diffusion rate-limited, Non-Fickian mechanism which was confirmed by Korsmeyer–Peppas model. Conclusion: This suggests the transdermal application of Pantoprazole sodium holds the promised controlled release of the drug for an extended period of time

Optimization of Machining Parameters in Turning Operations for Surface Roughness and Materials Removal Rate on EN8 through Combined SSA GA Algorithm

For many industrial machining operations, the quality of surface finish is the prominent requirement. Nevertheless the selection of optimized cutting parameters is very essential for controlling the desired surface quality. Main aim of this attempt is to fix the set of cutting parameters combinations using optimization algorithms. Ant Colony algorithm, Scatter Search algorithm, Genetic algorithm and BAT algorithm were used for various parameters on the surface roughness to arrive a suitable combination of parameters which are optimal to meet the product quality requirement. The effectiveness of the algorithms is ordered based up on the error rate while computing and the best two algorithms are combined for more tuned outcome

Marine fish calendar. V. Kakinada

The current article provides the marine fish landing data of various gears at Kakinada landing centre, Andhrapradesh. Data of the period I98l-'85 from the trawlers and 1980-'82 from indigenous gear and published information on different species from Kakinada are used for the present fish calendar

Fully-dynamic Approximation of Betweenness Centrality

Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in large networks, several approximation algorithms have been proposed. Besides that, recent years have seen the publication of dynamic algorithms for efficient recomputation of betweenness in evolving networks. In previous work we proposed the first semi-dynamic algorithms that recompute an approximation of betweenness in connected graphs after batches of edge insertions. In this paper we propose the first fully-dynamic approximation algorithms (for weighted and unweighted undirected graphs that need not to be connected) with a provable guarantee on the maximum approximation error. The transfer to fully-dynamic and disconnected graphs implies additional algorithmic problems that could be of independent interest. In particular, we propose a new upper bound on the vertex diameter for weighted undirected graphs. For both weighted and unweighted graphs, we also propose the first fully-dynamic algorithms that keep track of such upper bound. In addition, we extend our former algorithm for semi-dynamic BFS to batches of both edge insertions and deletions. Using approximation, our algorithms are the first to make in-memory computation of betweenness in fully-dynamic networks with millions of edges feasible. Our experiments show that they can achieve substantial speedups compared to recomputation, up to several orders of magnitude