Opportunistic resource utilization networks—A new paradigm for specialized ad hoc networks

We present opportunistic resource utilization networks or oppnets, a novel paradigm of specialized ad hoc networks. We believe that applications can benefit from using specialized ad hoc networks that provide a natural basis for them, the basis more efficient and effective than what general-purpose ad hoc networks can offer. Oppnets constitute the subcategory of ad hoc networks where diverse systems, not employed originally as nodes of an oppnet, join it dynamically in order to perform certain tasks they have been called to participate in. Oppnets have a significant potential to improve a variety of applications, and to create new application niches. We categorize opportunistic networks currently known in the literature as class 1opportunistic networks that use opportunistically only communication resources, and class 2opportunistic networks or oppnets that use opportunistically all kinds of resources, including not only communication but also computation, sensing, actuation, storage, etc. After describing the oppnets and the basics of their operation, we discuss the Oppnet Virtual Machine (OVM)—a proposed standard implementation framework for oppnet applications. It is followed by a discussion of an example application scenario using the OVM primitives. Next, we discuss the design and operations of a small-scale oppnet, named MicroOppnet, originally developed as a proof of concept. MicroOppnet is now being extended to serve as a testbed for experimentation and pilot implementations of oppnet architectures and their components. We conclude with a summary and a list of some open issues for oppnets.     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

Artificial intelligence applications in Permanent Magnet Brushless DC motor drives

Permanent Magnet Brushless DC (PMBLDC) machines are more popular due its simple structure and low cost. Improvements in permanent magnetic materials and power electronic devices have resulted in reliable, cost effective PMBLDC drives, for many applications. Advances in artificial intelligent applications like neural network, fuzzy logic, Genetic algorithm etc. have made tremendous impact on electric motor drives. The brushless DC motor is a multivariable and non-linear system. In conventional PMBLDC drives speed and position sensing of brushless DC motors require high degree of accuracy. Unfortunately, traditional methods of control require detailed modelling of all the motor parameters to achieve this. The Intelligent control techniques like, fuzzy logic control/Neural network control etc. uses heuristic input–output relations to deal with vague and complex situations. This paper presents a literature survey on the intelligent control techniques for PMBLDC motor drives. Various AI techniques for PMBLDC motor drives are described. Attempt is made to provide a guideline and quick reference for the researchers and practicing engineers those are working in the area of PMBLDC motor drives.     

Oxide bound impact on hot-carrier degradation for gate electrode workfunction engineered (GEWE) silicon nanowire MOSFET

In this present work, we explore the hot carrier fidelity of gate electrode workfunction engineered silicon nanowire (GEWE-SiNW) MOSFET at 300 K using DEVEDIT-3D device editor and ATLAS device simulation software. TCAD simulation shows reduction in the hot carrier reliability of a GEWE SiNW MOSFET in terms of electron temperature, electron velocity and Hot Electron gate current for reflecting its efficacy in high power CMOS applications. Further, a comparative investigation for different values of oxide thickness and high-k has been done to analyze the performance of GEWE-SiNW MOSFET in terms of electrical parameters such as conduction band, DIBL, electric field, electron temperature, electric velocity and gate current. It has been clearly shown that with oxide thickness 0.5 nm the hot-carrier reliability and device performance improves in comparison to oxide thickness 2.5 nm. In addition, with k = 21(HfO₂) device performance in terms of hot-carrier reliability further enhanced due to increased capacitance and thus offer its effectiveness in sub-nm range analog applications.     

Repeated detection of conjunctive predicates in distributed executions

Given a conjunctive predicate ? over a distributed execution, this paper gives an algorithm to detect all interval sets, each interval set containing one interval per process, in which the local values satisfy the Definitely(?) modality. The time complexity of the algorithm is O(n³p), where n is the number of processes and p is the bound on the number of times a local predicate becomes true at any process. The paper also proves that unlike the Possibly(?) modality which admits O(pn) solution interval sets, the Definitely(?) modality admits O(np) solution interval sets. The paper also gives an on-line test to determine whether all solution interval sets can be detected in polynomial time under arbitrary fine-grained causality-based modality specifications.     

Diagnosing rediscovered software problems using symptoms

This paper presents an approach to automatically diagnosing rediscovered software failures using symptoms, in environments in which many users run the same procedural software system. The approach is based on the observation that the great majority of field software failures are rediscoveries of previously reported problems and that failures caused by the same defect often share common symptoms. Based on actual data, the paper develops a small software failure fingerprint, which consists of the procedure call trace, problem detection location, and the identification of the executing software. The paper demonstrates that over 60 percent of rediscoveries can be automatically diagnosed based on fingerprints; less than 10 percent of defects are misdiagnosed. The paper also discusses a pilot that implements the approach. Using the approach not only saves service resources by eliminating repeated data collection for and diagnosis of reoccurring problems, but it can also improve service response time for rediscoveries     

Batch RNAi selector: a standalone program to predict specific siRNA candidates in batches with enhanced sensitivity

RNA interference (RNAi) is a popular and effective method for silencing gene expression. siRNAs should be gene-specific and effective to achieve specific and potent gene silencing. However, most currently available siRNA design programs are web-based programs that either require each sequence be submitted individually, making large-batch analyses difficult to conduct, or only provide limited options for searching off-target candidates (e.g. NCBI-BLAST). We have developed a stand-alone, enhanced RNAi design program that overcomes these shortcomings. We have implemented WU-BLAST, FASTA and SSEARCH homology searches for siRNA candidates to improve gene specific siRNA selection and to identity siRNA candidates that could lead to off-target gene silencing. We also included many new features such as siRNA score calculation and calculation of siRNA internal stability to help select highly potent siRNAs. This program is freely available for academic and commercial use (), and can be installed and run on any Linux machine. Our program automates the search for siRNAs and the resulting data files including a list of siRNA primers with scores and database search results for each siRNA candidate are stored locally for easy retrieval and inspection when needed.     

Apportioning: a technique for efficient reachability analysis ofconcurrent object-oriented programs

The object-oriented paradigm in software engineering provides support for the construction of modular and reusable program components and is attractive for the design of large and complex distributed systems. Reachability analysis is an important and well-known tool for static analysis of critical properties in concurrent programs, such as deadlock freedom. It involves the systematic enumeration of all possible global states of program execution and provides the same level of assurance for properties of the synchronization structure in concurrent programs, such as formal verification. However, direct application of traditional reachability analysis to concurrent object-oriented programs has many problems, such as incomplete analysis for reusable classes (not safe) and increased computational complexity (not efficient). We propose a novel technique called apportioning, for safe and efficient reachability analysis of concurrent object-oriented programs, that is based upon a simple but powerful idea of classification of program analysis points as local (having influence within a class) and global (having possible influence outside a class). We have developed a number of apportioning-based algorithms, having different degrees of safety and efficiency. We present the details of one of these algorithms, formally show its safety for an appropriate class of programs, and present experimental results to demonstrate its efficiency for various examples     

Surface ultrastructure of the gill filaments and the secondary lamellae of the catfish, Rita rita, and the carp, Cirrhinus mrigala

Surface ultrastructures of gill filaments and secondary lamellae of Rita rita and Cirrhinus mrigala, inhabiting different ecological habitat, were investigated to unravel adaptive modifications. R. rita is a sluggish, bottom dwelling carnivorous catfish, which inhabits regions of river with accumulations of dirty water. It retains its viability for long time if taken out of water. C. mrigala is an active bottom dwelling Indian major carp, which lives in relatively clean water and dies shortly after taken out of water. In R. rita, gill septa between gill filaments are reduced. Microridges on epithelial cells covering gill filaments are often continuous and arranged concentrically. Secondary lamellae are extensive. The epithelium appears corrugated, show irregular elevations and shallow depressions, and microridges on epithelial cells appear fragmented. In C. mrigala, in contrast, the gill septa are extensive. Microridges on epithelial cells covering gill filaments are fragmented. Secondary lamellae are less extensive. The epithelium appears smooth and microridges on epithelial cells are relatively inconspicuous. These differences have been considered adaptive modification in relation to habit and ecological niches inhabited by two fish species. Presence of mucous goblet cells on gill filaments is discussed in relation to their functions including precipitation of the sediments and preventing clogging of gill filaments. Infrequent mucous goblet cells in the epithelium of secondary lamellae in two fish species are considered an adaptation, minimizing thickness of the epithelium to reduce barrier between blood and water for favoring gasses exchange with increased efficiency.     

Development of environmentally responsive hydrogels with metal affinity behavior

This work describes initial efforts to incorporate affinity ligands within an environmentally responsive hydrogel. Metal affinity ligands were chosen as model affinity groups and thermally responsive N‐isopropyl acrylamide/acrylamide copolymers were used as the base hydrogels. The ? NH₂ group of the acrylamide serves as a reactive group for functionalization with metal affinity ligands. The gels were synthesized by free radical polymerization and Cu²⁺ was bound to the gel via 1,4‐butanediol diglycidyl ether (BDE) as a linker and iminodiacetic acid (IDA) as a chelating ligand. The base acrylamide gels were also functionalized with metal affinity ligands to allow for comparison with thermally responsive affinity gels. The results show the effectiveness of this technique for both these types of gels, and an improved method to immobilize metal affinity groups on to thermally sensitive N‐isopropyl acrylamide gels was also developed. It was seen that the yields for the reaction with BDE decreased with increased reaction time in both kinds of gels, whereas reaction with IDA showed a decrease in yields with increase in temperature for N‐isoporpyl acrylamide gels and increase in yields for acrylamide gels. Further techniques were developed to overcome diffusional resistances and stresses in the thermally responsive N‐isopropyl acrylamide gels so as to improve the distribution of Cu²⁺ ions. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci, 2007