基于模糊神经网络水下机器人直接自适应控制

提出了基于广义动态模糊神经网络的水下机器人直接自适戍控制方法,该控制方法既不需要预先知道模糊神经结构,也不需要预先的训练阶段,完全通过在线自适应学习算法构建水下机器人的逆动力学模型.首先,本文提出了基于这种网络结构的水下机器人直接自适应控制器,然后,利用Lyapunov稳定理论,证明了基于该控制器的水下机器人控制系统闭环稳定性,最后,采用某水下机器人模型仿真验证了该控制方法的有效性。

基于数字海图的自主水下机器人路径规划研究

为了解决远程自主水下机器人(LAUV)路径规划问题,提出一种基于数字海图的路径规划算法.该算法对传统人工势场法进行了有效改进,克服了传统人工势场法固有的缺点和不足,可以用于LAUV离线和在线路径规划.其有效性已在半物理实时仿真平台上得到了验证.

一种基于神经网络的生产调度方法

提出解决具有开、完工期限制的约束Ｊｏｂ－ｓｈｏｐ生产调度问题的一种神经网络方法．该方法通过约束神经网络，描述各种加工约束条件，并对不满足约束的开工时间进行相应调节，得到可行调度方案；然后由梯度搜索算法优化可行调度方案，直至得到最终优化可行调度解．理论分析、仿真实验表明了方法的有效性。

油田高含水期剩余油分布规律研究

After systemic investigation of the techniques，route lines and mechanisms about the remaining oil，the dynamic migration and congregation behavior of the remaining oil are discussed on base of interaction between flowing and enriching of water and oil.After the micro-scope modeling of the fluid flow in porous media and the changes in petrol-physical properties of the flowing system, the characters of fluid fields and the dynamic distribution of oil are discussed, among which the preference-flowing is focused on. Based on the preference-flowing in porous media, the concept of the preference-flowing channels is developed. According to above, heterogeneous distribution of water and oil in the field and dynamic mechanism of remaining oil are all obvious. media can be divided into three kinds, directional, stochastic, arbitrary porous media. The main research results are as following: 1. Treating the characteristic parameters such as permeability, porosity and wettability as regional parameter, the fluid field with high water-cut has been established by geostatistical method, among which the difference of flowing pores and the changes of its petrol-physical properties during flooding are studied. 2. The flow process of water and oil are recurrent in physical simulation experiments, in which the mechanisms and phenomena are caught and analyzed. Fluid flow mechanics in porous media with preference-flowing channels have been studied. 3. The mutual coupling between water and oil is induced and the mathematical evolution equations including this interaction were built. . 4. Through coupling effect between flowing water and oil, the dynamic migration and congregation behavior of remaining oil depend upon this coupling. 5. Coupling between water and oil act as driving force and trapping force for the remaining oil. The coupling model of thesis has been verified by simplified the numerical model and compared results with Ng35 oil reservoir in Gudao oil field, it has important theoretical and application values for improving precision of remaining oil and production performance prediction, and is a new method for studying the mechanics of remaining oil in channeled porous media has been established. Key words：flow field，high water-cut，coupling，dominant flow in porous media，remaining oil

东营凹陷成藏组合体研究与勘探实践

With the development of petroleum exploration, subtle reservoir has become the main exploration object in Dongying Depression, which requires some new technologies and methods to further reveal the geological characteristics in step with the mature exploration stage. In this paper, on the references to the studies of petroleum system and multiple oil-gas accumulation belt with flexible maneuverability, and the application of systematic theory, the concept of reservoir assemblage is initially defined as "the association of active source rock(s) and hydrocarbon reservoir(s) that are genetically related, with the bridge of pathway system in an oil and gas bearing basin". Compared with the theories of petroleum system and multiple oil-gas accumulation belts, it emphasizes on the processes of petroleum migration and accumulation and the correlation among active source rock, trapped hydrocarbon and migration pathway, and has been confirmed to be more suitably applied to high maturely explored basin. In the first study of this paper, sequence stratigraphy and subtle analytical technology of source rock have been employed to find that two categories of source rock with their characteristic types of organic matter and substantial states occurred in Dongying Depression. The first category, consisting of the oil shales within the third-order sequences of lacustrine expanding system tracts in the upper interval of the fourth Member of Shahejie Formation and both in the middle and lower intervals of the third Member of Shahejie Formation, is featured with the highest abundance of total organic matter (TOC) and the strongest abilities of hydrocarbon generation and expulsion, which is classified into the standard of good hydrocarbon source rock. Exploration assessment confirmed that about 70-80% of hydrocarbon in Dongying Depression came from this set of source rock for which the low sedimentary rate and strong oxygen-free environment would play the key role during its generation. The second category, composed of organic matter of dark mudstone in high stand system tracts in the upper and middle intervals of the third Member of Shahejie Formation, has been characterized by low content of total organic matter which mostly dispersedly distributes, and formed in the pre-delta to delta front environments. In classification, it belongs to the ordinary standard of source rocks. In the second research part, through the studies of high frequency sequence stratigraphy, fault geometry and active history combining with geochemistry of fluid inclusion and nitrogen compound and simulation test of hydrocarbon migration and accumulation, the faults have been thought to be the principal conduits, and the sandy bodies and unconformities might played the complementary pathways for hydrocarbon migration and accumulation in Dongying Depression of the continental faulted basin. Therefore, the fault activities may mainly constrain on the development of hydrocarbon pathways in space and time. Even more, using homogenization temperatures of fluid inclusion in digenetic minerals, three critical moments for hydrocarbon accumulation have been determined as well in Dongying Depression, which happened during the late stage of Dongying Formation (Ed), the early stage of Guantao Formation (Nig) and the early stage of Minghuazhen Formation (Nim), respectively. Comparatively, the last stage is looked as the main forming-reservoir period, which has also been supported by the results of geochemical analysis and simulation experiments of hydrocarbon generation and expulsion. Clearly, the times of hydrocarbon migration and accumulation are consistent with those of the fault activities in Dongying Depression, which indicate that tectonic activities would control the forming-reservoir. A conceptual model of faulting-episodic expulsion coupled with episodic forming-reservoir has then been established in this study. In the third part of this paper, some focusing areas were selected for the fine descriptions of pathway distribution and forming-reservoir, which has given four types of reservoir assemblage in terms of the main pathway and its correlation with the reservoir and trap: (1) mainly consisted of sandy bodies; (2) mainly consisted of faults; (3) mainly consisted of unconformities; and (4) their complex with two or three types of pathways. This classified criteria has also been applied to access the risk of some prospected traps in Dongying Depression. Finally, through the application of reservoir assemblage integrated with pathway distribution to all the prospective targets in Dongying Depression, the new favorably hydrocarbon accumulated belts have been figured out, and more subtle reservoirs have also been found. For examples, during 2000 and 2002, in the mature exploration areas, such as Liangjialou and Shengtuo structural closures etc., newly proved reserves were 2274 * 104t, and forecasted oil reserves 5660-5860xl04t; and in the predicted favorable areas, newly additional controlled oil reserves was 3355xl04t. Besides those, many other favorable exploration areas need to be further appraised.

Intelligence in Scientific Computing

Combining numerical techniques with ideas from symbolic computation and with methods incorporating knowledge of science and mathematics leads to a new category of intelligent computational tools for scientists and engineers. These tools autonomously prepare simulation experiments from high-level specifications of physical models. For computationally intensive experiments, they automatically design special-purpose numerical engines optimized to perform the necessary computations. They actively monitor numerical and physical experiments. They interpret experimental data and formulate numerical results in qualitative terms. They enable their human users to control computational experiments in terms of high-level behavioral descriptions.

Convergence Results for the EM Approach to Mixtures of Experts Architectures

The Expectation-Maximization (EM) algorithm is an iterative approach to maximum likelihood parameter estimation. Jordan and Jacobs (1993) recently proposed an EM algorithm for the mixture of experts architecture of Jacobs, Jordan, Nowlan and Hinton (1991) and the hierarchical mixture of experts architecture of Jordan and Jacobs (1992). They showed empirically that the EM algorithm for these architectures yields significantly faster convergence than gradient ascent. In the current paper we provide a theoretical analysis of this algorithm. We show that the algorithm can be regarded as a variable metric algorithm with its searching direction having a positive projection on the gradient of the log likelihood. We also analyze the convergence of the algorithm and provide an explicit expression for the convergence rate. In addition, we describe an acceleration technique that yields a significant speedup in simulation experiments.

Inorganic glasses, glass-forming liquids and amorphizing solids

Greaves, George; Sen, S., (2007) 'Inorganic glasses, glass-forming liquids and amorphizing solids', Advances in Physics 56(1) pp.1-166 RAE2008

Temporal Locality in Web Request Streams: Sources, Characteristics, and Caching Implications

Temporal locality of reference in Web request streams emerges from two distinct phenomena: the popularity of Web objects and the {\em temporal correlation} of requests. Capturing these two elements of temporal locality is important because it enables cache replacement policies to adjust how they capitalize on temporal locality based on the relative prevalence of these phenomena. In this paper, we show that temporal locality metrics proposed in the literature are unable to delineate between these two sources of temporal locality. In particular, we show that the commonly-used distribution of reference interarrival times is predominantly determined by the power law governing the popularity of documents in a request stream. To capture (and more importantly quantify) both sources of temporal locality in a request stream, we propose a new and robust metric that enables accurate delineation between locality due to popularity and that due to temporal correlation. Using this metric, we characterize the locality of reference in a number of representative proxy cache traces. Our findings show that there are measurable differences between the degrees (and sources) of temporal locality across these traces, and that these differences are effectively captured using our proposed metric. We illustrate the significance of our findings by summarizing the performance of a novel Web cache replacement policy---called GreedyDual*---which exploits both long-term popularity and short-term temporal correlation in an adaptive fashion. Our trace-driven simulation experiments (which are detailed in an accompanying Technical Report) show the superior performance of GreedyDual* when compared to other Web cache replacement policies.

GreedyDual* Web Caching Algorithm: Exploiting the Two Sources of Temporal Locality in Web Request Streams

The relative importance of long-term popularity and short-term temporal correlation of references for Web cache replacement policies has not been studied thoroughly. This is partially due to the lack of accurate characterization of temporal locality that enables the identification of the relative strengths of these two sources of temporal locality in a reference stream. In [21], we have proposed such a metric and have shown that Web reference streams differ significantly in the prevalence of these two sources of temporal locality. These finding underscore the importance of a Web caching strategy that can adapt in a dynamic fashion to the prevalence of these two sources of temporal locality. In this paper, we propose a novel cache replacement algorithm, GreedyDual*, which is a generalization of GreedyDual-Size. GreedyDual* uses the metrics proposed in [21] to adjust the relative worth of long-term popularity versus short-term temporal correlation of references. Our trace-driven simulation experiments show the superior performance of GreedyDual* when compared to other Web cache replacement policies proposed in the literature.

Mistreatment in Distributed Caching Groups: Causes and Implications

Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node’s resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage of each node. Motivated by content networking applications – including web caching, CDNs, and P2P – this paper extends our previous work on the off-line version of the problem, which was limited to object replication and was conducted under a game-theoretic framework. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache replacement/redirection/admission policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that online cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. When this becomes possible, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to the exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the “outlier” characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes.

Distributed Selfish Coaching

Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node's resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage at each node. Motivated by content networking applications -- including web caching, CDNs, and P2P -- this paper extends our previous work on the on-line version of the problem, which was conducted under a game-theoretic framework, and limited to object replication. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache management policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that on-line cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. To appear in a substantial manner, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the "outlier" characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. Our framework utilizes a simple control-theoretic approach to dynamically parameterize the cache management scheme. We show performance evaluation results that quantify the benefits from instantiating such a framework, which could be substantial under skewed demand profiles.

Amorphous Placement and Retrieval of Sensory Data in Sparse Mobile Ad-Hoc Networks

Abstract—Personal communication devices are increasingly being equipped with sensors that are able to passively collect information from their surroundings – information that could be stored in fairly small local caches. We envision a system in which users of such devices use their collective sensing, storage, and communication resources to query the state of (possibly remote) neighborhoods. The goal of such a system is to achieve the highest query success ratio using the least communication overhead (power). We show that the use of Data Centric Storage (DCS), or directed placement, is a viable approach for achieving this goal, but only when the underlying network is well connected. Alternatively, we propose, amorphous placement, in which sensory samples are cached locally and informed exchanges of cached samples is used to diffuse the sensory data throughout the whole network. In handling queries, the local cache is searched first for potential answers. If unsuccessful, the query is forwarded to one or more direct neighbors for answers. This technique leverages node mobility and caching capabilities to avoid the multi-hop communication overhead of directed placement. Using a simplified mobility model, we provide analytical lower and upper bounds on the ability of amorphous placement to achieve uniform field coverage in one and two dimensions. We show that combining informed shuffling of cached samples upon an encounter between two nodes, with the querying of direct neighbors could lead to significant performance improvements. For instance, under realistic mobility models, our simulation experiments show that amorphous placement achieves 10% to 40% better query answering ratio at a 25% to 35% savings in consumed power over directed placement.

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.

Partial agonism, neutral antagonism, and inverse agonism at the human wild-type and constitutively active cholecystokinin-2 receptors

Cholecystokinin receptor-2 (CCK2R) is a G protein receptor that regulates a number of physiological functions. Activation of CCK2R and/or expression of a constitutively active CCK2R variant may contribute to human diseases, including digestive cancers. Search for antagonists of the CCK2R has been an important challenge during the last few years, leading to discovery of a set of chemically distinct compounds. However, several early-discovered antagonists turned out to be partial agonists. In this context, we carried out pharmacological characterization of six CCK2R antagonists using COS-7 cells expressing the human CCK2R or a CCK2R mutant having a robust constitutive activity on inositol phosphates production, and we investigated the molecular mechanisms which, at a CCK2R binding site, account for these features. Results indicated that three compounds, 3R(+)-N-(2,3-dihydro-1-methyl-2-oxo-5-phenyl-1H-1,4-benzodiazepin-3- yl)-N'-(3-methylphenyl)urea (L365,260), 4-{[2-[[3-(lH-indol-3-yl)-2- methyl-1-oxo-2-[[[1.7.7-trimethyl-bicyclo[2.2.1]hept-2-yl)-oxy]carbonyl]amino] propyl]amino]-1-phenylethyl]amino-4-oxo-[lS-la.2[S*(S*)]4a]} -butanoate N-methyl-D-glucamine (PD135, 158), and (R)-1-naphthalenepropanoic acid, b-[2-[[2-(8-azaspiro-[4.5]dec-8-ylcarbonyl)-4,6-dimethylphenyl]amino]-2- oxoethyl] (CR2945), were partial agonists; one molecule, 1-[(R)-2,3-dihydro-1- (2,3-dihydro-1-(2-methylphenacyl)-2-oxo-5-phenyl-1H-1,4-benzodiazepin-3-yl] -3-(3-methylphenyl)urea (YM022), was a neutral antagonist; and two compounds, N-(+)-[1-(adamant-1-ylmethyl)-2,4-dioxo-5-phenyl2,3,4,5-tetrahydro-1H-1, 5-benzodiazepin-3-yl]-N'-phenylurea (GV150,013X) and ([(N-[methoxy-3 phenyl] N-[N-methyl N-phenyl carbamoylmethyl], carbomoylmethyl)-3 ureido]-3-phenyl)2-propionic acid (RPR101,048), were inverse agonists. Furthermore, target- and pharmacophore-based docking of ligands followed by molecular dynamic simulation experiments resulted in consistent motion of aromatic residues belonging to a network presumably important for activation, thus providing the first structural explanations for the different pharmacological profiles of tested compounds. This study confirms that several referenced so-called antagonists are in fact partial agonists, and because of this undesired activity, we suggest that newly generated molecules should be preferred to efficiently block CCK2R-related physiological effects. Furthermore, data on the structural basis for the different pharmacological features of CCK2R ligands will serve to further clarify CCK2R mechanism of activation. Copyright © 2006 The American Society for Pharmacology and Experimental Therapeutics.