Proton-transport catalysis, proton abstraction, and proton exchange in HF+HOC⁺ and H₂O+HOC⁺ and analogous deuterated reactions

Classical simulations of the reactions of HF and H₂O with HOC⁺ have been carried out on interpolatedab initiopotential energy surfaces. Rearrangement (X+HOC⁺→OCH⁺+X), abstraction (X+HOC⁺→XH⁺+OC), (X=HF or H₂O), exchange (e.g., DY+HOC⁺→HY+DOC⁺), and exchange-rearrangement (e.g., DY+HOC⁺→OCD⁺+YH) (Y=F or HO or DO) reactions are observed. However, the abstraction reaction is dominant for both the HF+HOC⁺ and H₂O+HOC⁺ systems

A knowledge-based system with learning for computer communication network design

Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving this problem is presented. This approach is particularly recommended for large packet switched communication networks, in the sense that it permits a high degree of reliability and offers a very flexible environment dealing with many relevant design parameters such as link cost, link capacity, and message delay

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

Ad hoc categories

People construct ad hoc categories to achieve goals. For example, constructing the category of “things to sell at a garage sale” can be instrumental to achieving the goal of selling unwanted possessions. These categories differ from common categories (e.g., “fruit,” “furniture”) in that ad hoc categories violate the correlational structure of the environment and are not well established in memory. Regarding the latter property, the category concepts, concept-to-instance associations, and instance-to-concept associations structuring ad hoc categories are shown to be much less established in memory than those of common categories. Regardless of these differences, however, ad hoc categories possess graded structures (i.e., typicality gradients) as salient as those structuring common categories. This appears to be the result of a similarity comparison process that imposes graded structure on any category regardless of type

Toward an efficient solution for dynamic ad hoc network interoperability

An ad hoc network is formed by an impromptu grouping of network capable nodes. The nodes forming the network have unconstrained mobility, and so provide a dynamic network topology. Current work in this research area has focused on designing routing protocols capable of efficiently forwarding packets in these dynamic network environments. This has led to several designs for ad hoc routing protocols based on various routing algorithms, each suited to specific usage characteristics. This paper will discuss issues relating to routing in ad hoc networks. We will describe an active networking based solution that provides dynamic routing protocol interoperability and enables migration of nodes between ad hoc groups. Our design is motivated by a squad and base scenario which consists of two groups wishing to communicate. These groups have contrasting deployment characteristics and so use different routing protocols