磁流变阻尼器内部流体动能的能量采集

为了构建自供能式磁流变阻尼器内部实时状态监测传感系统,本文介绍了一种针对磁流变阻尼器内部流体能的能量采集装置。该装置被安装于磁流变阻尼器活塞顶端并为检测阻尼器内部工作参数的无线传感模块1供电。根据能量守恒定律,推导出磁流变阻尼器中磁流变液流动能的理论模型。通过实验测试分析了在不同的外界激励下能量采集装置的工作情况,证明了采集的电能随着活塞的运动频率增加而增加,而与磁流变阻尼器的磁流变特性没有明显的关系。测试表明利用此装置能较好的采集到来自于磁流变阻尼器内部流体流动产生的能量,为无线传感模块供电。     

IR Spectroscopic Study of the Organic Component of Ultrafine Diamond Produced by Detonation Synthesis

IR spectra of ultrafine diamonds produced by different teams of researchers are studied. The effects of heating and radiation on the properties of ultrafine diamonds are studied. Quantitative assumptions on the kinetics of formation of ultrafine diamonds are made from analysis of IR spectra.     

基于Wiener结构的软测量模型及辨识算法

Wiener模型结构能有效地表征系统的动态和静态特性, 因此这里首先基于这一结构建立软测量模型, 利用动态与静态子模型分别建立辅助变量与主导变量间的动态与静态关系, 并说明该软测量模型的可行性, 给出模型具体表达式. 其次, 针对所提模型, 提出分步辨识方式获得最优模型参数, 说明其可行性. 再次, 为了减少计算和实现模型在线更新, 这里提出参数辨识递推算法, 并给出软测量模型参数的收敛性结论. 通过实例仿真, 可以看出本文提出模型的可行性, 以及分步辨识方式与递推算法的有效性.     

Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.     

A parallel algorithm with enhancements via partial objective value cuts for cluster-based wireless sensor network design

In this paper, we develop a parallel algorithm for the solution of an integrated topology control and routing problem in Wireless Sensor Networks (WSNs). After presenting a mixed-integer linear optimization formulation for the problem, for its solution, we develop an effective parallel algorithm in a Master–Worker model that incorporates three parallelization strategies, namely low-level parallelism, domain decomposition, and multiple search (both cooperative and independent) in a single Master–Worker framework.     

Time-optimized contextual information forwarding in mobile sensor networks

We study on the forwarding of quality contextual information in mobile sensor networks (MSNs). Mobile nodes form ad-hoc distributed processing networks that produce accessible and quality-stamped information about the surrounding environment. Due to the dynamic network topology of such networks the context quality indicators seen by the nodes vary over time. A node delays the context forwarding decision until context of better quality is attained. Moreover, nodes have limited resources, thus, they have to balance between energy conservation and quality of context. We propose a time-optimized, distributed decision making model for forwarding context in a MSN based on the theory of optimal stopping. We compare our findings with certain context forwarding schemes found in the literature and pinpoint the advantages of the proposed model.