检索结果-内蒙古大学图书馆

Battery discharge characteristics of wireless sensors in building applications

学校读者我要写书评

暂无评论

Battery discharge characteristics of wireless sensors in bui...

2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012

作者： Guo, Wenqi Healy, William M. Zhou, MengChu Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States National Institute of Standards and Technology Gaithersburg MD 20899 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781467303880

Sensor nodes in wireless networks often use batteries as their source of energy, but replacing or recharging exhausted batteries in a deployed network can be difficult and costly. Therefore, prolonging battery life becomes a principal objective in the design of wireless sensor networks (WSNs). There is little published data that quantitatively analyze a sensor node's lifetime under different operating conditions. This paper presents several experiments to quantify the impact of key wireless sensor network design and environmental parameters on battery performance. Our testbed consists of MicaZ motes, commercial alkaline batteries, and a suite of techniques for measuring battery performance. We evaluate known parameters, such as communication distance, working channel and operating power that play key roles in battery performance. Through extensive real battery discharge measurements, we expect our results to serve as a quantitative basis for future research in designing and implementing battery-efficient sensing applications and protocols. © 2012 IEEE.

关键词： Zigbee

Detecting and resolving mismatches between pairs of services

学校读者我要写书评

暂无评论

Detecting and resolving mismatches between pairs of services

International Conference on Computer Science and Information Technology (CSIT)

作者： Tao Liu Guosun Zeng Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Tongji University Shanghai Shanghai CN

Facing changing environments and evolving business, service composition happens all time. However, services do not always interact properly because of mismatches between their interfaces. In this paper, we use labelled interface automata, an extension of interface automata, to illustrate mismatching interfaces and resolution approaches. We model service interfaces with labelled interface automata and propose a theorem for mismatch detecting. Then we characterize mismatches between pairs of interfaces by identifying and classifying them into six basic scenarios, and illustrate the resolution approach of mismatches. Our method formalizes the interface adaptation problem and provides convenience to detect mismatches and build adaptors for service interactions.

关键词： Automata Software

Adaptive finite time stability of delayed systems via aperiodically intermittent control and quantized control

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Xiwei Ma, Hailian Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this brief, we set up the finite time stability (FnTSta) theory for dynamical systems with bounded timevarying delays via aperiodically intermittent control (AIC) and quantized control (QC). A more general QC is designed in this brief. The bound of time-varying delay is required to be less than the infimum in AIC. Two-phases-method (2PM) is applied to solve the FnTSta for delayed system, i.e., it divides the whole proof process into two phases, one phase is that the process for the norm of system error evolving from initial values to 1, and the other is the process for the norm of system error evolving from 1 to 0. By proving that these two phases both use FnT to realize, the whole FnTSta for system is proved. We also design the adaptive rules and prove its validity rigorously. Furthermore, the obtained theories are used to discuss the finite time synchronization (FnTSyn) of neural networks as an application. Finally, some simulations are given to illustrate the effectiveness of our theoretical result. Copyright © 2020, The Authors. All rights reserved.

关键词： Dynamical systems

Adaptive finite time stability of delayed systems with applications to network synchronization

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Xiwei Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

The finite time stability (FnTSta) theory of delayed systems has not been set up until now. In this paper, we propose a two-phases-method (2PM), to achieve this object. In the first phase, we prove that the time for norm of system error evolving from initial values to 1 is finite;then in the second phase, we prove that the time for norm of the error evolving from 1 to 0 is also finite, thus FnTSta is obtained. Considering the cost and complexity of controller, we use only two simple terms to realize this aim. For the proposed 2PM, time delays can be the same or asynchronous, bounded or unbounded, etc;the norm can be 2-norm, 1-norm, ∞-norm, which show that 2PM is powerful and has a wide scope of applications. Furthermore, we also prove the adaptive finite time stability (AFnTSta) theory of delayed systems using 2PM. As an application of the obtained FnTSta theory, we consider the finite time outer synchronization (FnTOSyn) for complex networks with asynchronous unbounded time delays, corresponding criteria are also obtained. Finally, two numerical examples are given to demonstrate the validity of our theories. Copyright © 2020, The Authors. All rights reserved.

关键词： Synchronization

Finite time anti-synchronization of complex-valued neural networks with bounded asynchronous time-varying delays

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liu, Xiwei Li, Zihan Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this paper, we studied the finite time anti-synchronization of master-slave coupled complex-valued neural networks (CVNNs) with bounded asynchronous time-varying delays. With the decomposing technique and the generalized {ξ, ∞}-norm, several criteria for ensuring the finite-time anti-synchronization are obtained. The whole anti-synchronization process can be divided into two parts: first, the norm of each error state component will change from initial values to 1 in finite time, then from 1 to 0 in fixed time. Therefore, the whole time is finite. Finally, one typical numerical example is presented to demonstrate the correctness of our obtained results. key words: Anti-synchronization, asynchronous, complex-valued neural network, finite time, time-varying delay Copyright © 2019, The Authors. All rights reserved.

关键词： Time varying control systems

Prescribed-Time Synchronization of Multiweighted and Directed Complex Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xu, Linlong Liu, Xiwei Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this note, we study the prescribed-time (PT) synchronization of multiweighted and directed complex networks (MWDCNs) via pinning control. Unlike finite-time and fixed-time synchronization, the time for synchronization can be preset as needed, which is independent of initial values and parameters like coupling strength. First and foremost, we reveal the essence of PT stability by improper integral, L'Hospital rule and Taylor expansion theory. Many controllers established previously for PT stability can be included in our new model. Then, we apply this new result on MWDCNs as an application. The synchronization error at the prescribed time is discussed carefully, so, PT synchronization can be reached. The network topology can be directed and disconnected, which means that the outer coupling matrices (OCMs) can be asymmetric and not connected. The relationships between nodes are allowed to be cooperative or competitive, so elements in OCMs and inner coupling matrices (ICMs) can be positive or negative. We use the rearranging variables' order technique to combine ICMs and OCMs together to get the sum matrices, which can make a bridge between multiweighted and single-weighted networks. Finally, simulations are presented to illustrate the effectiveness of our theory. Copyright © 2022, The Authors. All rights reserved.

关键词： Synchronization

Global µ-stability and finite-time control of octonion-valued neural networks with unbounded delays✡

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Jingzhu Liu, Xiwei Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

Octonion-valued neural networks (OVNNs) are a type of neural networks for which the states and weights are octonions. In this paper, the global µ-stability and finite-time stability problems for octonion-valued neural networks are considered under unbounded and asynchronous time-varying delays. To avoid the non-communicative and non-associative multiplication feature of the octonions, we firstly decompose the OVNNs into eight real-valued neural networks (RVNNs) equivalently. Through the use of generalized norm and the Cauchy convergence principle, we obtain the sufficient criteria which assure the existence, uniqueness of the equilibrium point and global µ-stability of OVNNs. By adding controllers, the criteria to ensure the finite-time stability for OVNNs are presented by dividing the analysis of finite-time stability process into two phases. Furthermore, we also prove the adaptive finite time stability theory of above networks. At last, the simulation results of specified examples is given to substantiate the effectiveness and correctness of the theoretical results. Copyright © 2020, The Authors. All rights reserved.

关键词： Timing circuits

A Self-Learning Clustering Algorithm Based on Clustering Coefficient

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lectu...

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8786卷 79-94页

作者： Zhong, Mingjie Ding, Zhijun Sun, Haichun Wang, Pengwei The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China Department of Computer Science University of Pisa Pisa56127 Italy

This paper presents a novel clustering algorithm based on clustering coefficient. It includes two steps: First, k-nearest-neighbor method and correlation convergence are employed for a preliminary clustering. Then, the results are further split and merged according to intra-class and inter-class concentration degree based on clustering coefficient. The proposed method takes correlation between each other in a cluster into account, thereby improving the weakness existed in previous methods that consider only the correlation with center or core data element. Experiments show that our algorithm performs better in clustering compact data elements as well as forming some irregular shape clusters. It is more suitable for applications with little prior knowledge, e.g. hotspots discovery. © Springer International Publishing Switzerland 2014.

关键词： Clustering algorithms

A parallel computing model for container terminal logistics

学校读者我要写书评

暂无评论

A parallel computing model for container terminal logistics

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Bin Li Weiming Shen School of Transportation Fujian University of Technology Fuzhou China The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Existing planning and scheduling solutions for container terminal logistics systems (CTLS) are not sufficient today due to the highly complexity and uncertain environments. This paper reviews the advantages and shortcomings of the existing solutions and proposes a container terminal conceptual parallel computing model for scheduling and execution based on multi-processor systems. It is built on the computational architecture and fundamental principles of distributed, cooperative, parallel, heterogeneous, and reconfigurable computation in essence. The proposed approach is demonstrated and validated by investigating the stress testing, tailor-made processor affinity, load migration and load balancing of a typical container terminal logistics service case with comprehensive computational experiments.

关键词： Containers Computational modeling Processor scheduling Computer architecture Logistics Marine vehicles