Research and Design of Network Management Construction Based on Mobile AGENT

The technical characters of mobile agent （MA） originated in the distributional artificial intelligence domain is introduced. A network management construction based on agent （NMCA） is then proposed. The NMCA structure features are elaborated in detail. A prototype design of NMCA is given by using the jKQML programming. The establishment of NMCA platform will be helpful to reduce the correspondence load of network management and improves the efficiency and the expansion ability of network management systems.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

移动IP的关键技术

本详细描述了移动IP的工作过程，并介绍了移动IP的隧道技术和IPSec，最后对移动IP技术中存在几个热点问题进行了讨论。     

有限元节点编号优化

从分析最简单最优的矩形单元节点编号着手，分析其特点，得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列。总结出一种新型的有限元节点重编号方法，并举例说明该算法能减少有限元的带宽。     

��������ϵ�Դϵͳ����������ʵ���о�

HT-7中性束诊断电源系统的计算机控制系统由PLC、工控机、逻辑控制和定时单元等组成。对起弧、束流引出等实验进行了研究。在多种参数下,通过调节弧压、进气量等观察了其对弧流的影响。初步实验结果表明,在高压35kV、弧流80A的情况下,束电流可以达到3.6A,引出的中性束流功率可以稳定地达到50kW以上。     

Drug metabolite cluster centers-based strategy for comprehensive profiling of Neomangiferin metabolites in vivo and in vitro and network pharmacology study on anti-inflammatory mechanism

Neomangiferin (NMF) is an extremely special xanthone that could be simultaneously attributed to C-glycoside and O-glycoside with a variety of biological activities, such as anti-inflammatory, antitumor, antipyretic, and so on. So far as we know, the metabolism profiling has been insufficient until now. Herein, Drug Metabolite Cluster Centers (DMCCs)-based Strategy has been developed to profile the NMF metabolites in vivo and in vitro. Firstly, the DMCCs was proposed depending on literature-related and preliminary analysis results. Secondly, the specific metabolic rule was implemented to screen the metabolites of candidate DMCCs from the acquired Ultra High Performance Liquid Chromatography Quadrupole Exactive Orbitrap Mass Spectrometry (UHPLC-Q-Exactive Orbitrap MS) data by extracted ion chromatography (EIC) method. Thirdly, candidate metabolites were accurately and tentatively identified according to the pyrolysis law of mass spectrometry, literature reports, comparison of reference substances, and especially the diagnostic product ions (DPIs) deduced preliminarily. Finally, network pharmacology was adopted to elucidate the anti-inflammatory action mechanism of NMF on the basis of DMCCs. As a result, 3 critical metabolites including NMF, Mangiferin (MF) and Norathyriol (NA) were proposed as DMCCs, and a total of 61 NMF metabolites (NMF included) were finally screened and characterized coupled with 3 different biological sample preparation methods including solid phase extraction (SPE), acetonitrile precipitation and methanol precipitation. Among them, 32 metabolites were discovered in rat urine, 30 in rat plasma, 12 in rat liver, 9 metabolites in liver microsomes and 8 in rat faeces, respectively. Our results also illustrated that NMF primarily underwent deglucosylation, glucuronidation, methylation, sulfation, dihydroxylation and their composite reactions in vivo and in vitro. Additionally, network pharmacology analysis based on DMCCs revealed 85 common targets of disease-metabolites, and the key targets were TNF, EGFR, ESR1, PTGS2, HIF1A, IL-2, PRKCA and PRKCB. They exerted anti-inflammatory effects mainly through the pathways of inflammatory response, calcium-dependent protein kinase C activity, nitrogen metabolism, pathways in cancer and so on. In general, our study constructed a novel strategy to comprehensive elucidate the biotransformation pathways of NMF in vivo and in vitro, and provided vital reference for further understanding its anti-inflammatory action mechanism. Moreover, the established strategy could be generalized to the metabolism and action mechanism study of other natural products.     

Thermostability of landscape phage probes

Immunoassays have traditionally relied on antibodies as diagnostic probes. Their use outside of a laboratory, however, may be problematic because antibodies are often unstable in severe environmental conditions. Environmental monitoring requires thermostable probes, such as landscape phage, that carry thousands of foreign peptides on their surfaces, are superior to antibodies, and can operate in non-controlled conditions. While parent wild-type phage are known to be extremely stable in various media at high temperatures, no work has been done to demonstrate the stability of landscape phage probes. We examined the thermostability of a landscape phage probe and a monoclonal antibody specific for -galactosidase in parallel in an enzyme-linked immunosorbent assay (ELISA) format. They were both stable for greater than six months at room temperature, but at higher temperatures the antibody degraded more rapidly than the phage probe. Phage retained detectable binding ability for more than six weeks at 63 °C, and three days at 76 °C. The activation energy of phage degradation was determined to be 1.34×10⁵ J/mol. These results confirm that phage probes are highly thermostable and can function even after exposure to high temperatures during shipping, storage and operation.     

A path planning model based on nested regular hexagons using weighted centroid localization

In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non-collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered.     

The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data

Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes.