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

2014 IEEE International Conference on Automation Science and Engineering, CASE 2014

作者： Li, Sisi Deng, Kun Zhou, Meng Chu Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07012 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Coordinated Science Laboratory University of Illinois at Urbana-Champaign UrbanaIL61801 United States

Occupants' comfort is the primary target in a building operation. However their efforts are often neglected and ruled out from traditional control strategies of energy-efficient building management systems. Occupant-engaged control strategies have recently attracted many research attentions and demonstrated great potentials for energy saving. With them, occupants' behavior is incorporated into the closed-loop control methods in which their initiatives actively contribute to building services and energy utility by explicitly expressing their preferences. This work proposes an occupant-engaged demand response (DR) strategy for building automation in which occupants are actively engaged to adapt their energy consumption in response to incentive opportunities designed by facility managers. A model-based study and a Nash-Equilibrium-based solution are provided to assist facility managers with the design of social incentive policies to promote occupant participation, along with the guarantee of lucrativeness for a DR event. © 2014 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Implementation and test of human-operated and human-like adaptive impedance controls on Baxter robot

Implementation and test of human-operated and human-like ada...

引用

15th Annual Conference on Advances in Autonomous Robotics systems, TAROS 2014

作者： Liang, Peidong Yang, Chenguang Wang, Ning Li, Zhijun Li, Ruifeng Burdet, Etienne Centre for Robotics and Neural Systems School of Computing and Mathematics Plymouth University United Kingdom MOE Key Lab. of Autonomous System and Network Control College of Automation Science and Engineering South China University of Technology China State Key Laboratory of Robotics and System Harbin Institute of Technology China Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Department of Bioengineering Imperial College of Science Technology and Medicine London United Kingdom

ISBN: (纸本)9783319104003

This paper presents an improved method to teleoperate impedance of a robot based on surface electromyography (EMG) and test it experimentally. Based on a linear mapping between EMG amplitude and stiffness, an incremental stiffness extraction method is developed, which uses instantaneous amplitude identified from EMG in a high frequency band, compensating for non-linear residual error in the linear mapping and preventing muscle fatigue from affecting the control. Experiments on one joint of the Baxter robot are carried out to test the approach in a disturbance attenuation task, and to compare it with automatic human-like impedance adaptation. The experimental results demonstrate that the new human operated impedance method is successful at attenuating disturbance, and results similarly to as automatic disturbance attenuation, thus demonstrating its efficiency. © 2014 Springer International Publishing.

关键词： Stiffness

来源：评论

学校读者我要写书评

暂无评论

Dynamically tolerating and detecting asymmetric races

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2014年第8期51卷 1748-1763页

作者： Wang, Wenwen Wu, Chenggang Ratanaworabhan, Paruj Yuan, Xiang Wang, Zhenjiang Li, Jianjun Feng, Xiaobing Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China Faculty of Engineering Kasetsart University Bangkok10900 Thailand

Asymmetric races are a common type of data races. They are triggered when a thread accesses a shared variable in a critical section, and another thread accesses the same shared variable not in any critical section, or in a critical section guarded by a different lock. Asymmetric races in multi-threaded programs are usually harmful. To solve the problem introduced by asymmetric races, ARace is proposed. ARace utilizes shared variable protecting and write buffer to dynamically tolerate and detect asymmetric races. Shared variable protecting is used to protect shared variables that are read-only and read-before-write in critical sections, and these shared variables should not be modified out of critical sections;write buffer is used to buffer the writing operations to shared variables in critical sections. ARace can not only tolerate asymmetric races triggered by shared variable accesses in and out of critical sections, but also detect asymmetric races triggered by shared variable accesses in concurrent critical sections. ARace can be directly applied to binary code and requires neither additional compiler support nor hardware support. In addition, an implementation based on dynamic binary instrumentation is also proposed. The experimental results demonstrate that ARace guarantees the tolerance and detection of asymmetric races while incurring acceptable performance and memory overhead.

关键词：非对称数据竞争容忍和检测写缓冲区页保护动态二进制插桩

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of single-arm multi-cluster tools with two-space buffering modules

Optimal scheduling of single-arm multi-cluster tools with tw...

引用

2014 IEEE International Conference on Automation Science and Engineering, CASE 2014

作者： Yang, Fajun Wu, Naiqi Qiao, Yan Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China Institute of Systems Engineering Macau University of Science and Technology China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

A multi-cluster tool is composed of a number of single-cluster tools linked by buffering modules. The capacity of a buffering module can be one or two. Aiming at finding an optimal one-wafer cyclic schedule, this work explores the effect of two-space buffering modules on the performance of a multi-cluster tool. The tool is modeled by a kind of Petri nets. The dynamic behavior of robot waiting and tasks, process modules, and buffers is well captured by the net model. With the model, this work shows that there is always a one-wafer cyclic schedule that reaches the lower bound of the cycle time of a process-dominant tool. Furthermore, a constant-time algorithm is revealed to find such a schedule for the first time for such multi-cluster tools. An illustrative example is given to show the application and power of this new method. © 2014 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Automated web service composition supporting conditional branch structures

引用

Enterprise Information systems 2014年第1期8卷 121-146页

作者： Wang, Pengwei Ding, Zhijun zhijun_ding@*** Jiang, Changjun Zhou, Mengchu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of “Embedded System and Service Computing” Ministry of Education Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 USA

The creation of value-added services by automatic composition of existing ones is gaining a significant momentum as the potential silver bullet in service-oriented architecture. However, service composition faces two aspects of difficulties. First, users' needs present such characteristics as diversity, uncertainty and personalisation; second, the existing services run in a real-world environment that is highly complex and dynamically changing. These difficulties may cause the emergence of nondeterministic choices in the process of service composition, which has gone beyond what the existing automated service composition techniques can handle. According to most of the existing methods, the process model of composite service includes sequence constructs only. This article presents a method to introduce conditional branch structures into the process model of composite service when needed, in order to satisfy users' diverse and personalised needs and adapt to the dynamic changes of real-world environment. UML activity diagrams are used to represent dependencies in composite service. Two types of user preferences are considered in this article, which have been ignored by the previous work and a simple programming language style expression is adopted to describe them. Two different algorithms are presented to deal with different situations. A real-life case is provided to illustrate the proposed concepts and methods. [ABSTRACT FROM AUTHOR]

关键词： conditional branch structure control construct service composition user preference web service

来源：评论

学校读者我要写书评

暂无评论

SeaBase: An Implementation of Cloud Database

SeaBase: An Implementation of Cloud Database

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Shusheng Guo Zimu Yuan Li Zha Zhiwei Xu State Key Laboratory of Computer System and Architecture University of Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479967162

Cloud database usually refers to a database based on the cloud computing technology. However, as far as we know, pre-existing solutions of cloud database cannot integrate the data from multi-sourced heterogeneous databases, only supplying an isolated homogeneous database cluster. This paper presents a new implementation approach for cloud database: Sea Base, which integrates various data types into a unified one, based on the CCEVP(Cloud computing-based Effective-Virtual-Physical) model. The results of our experiments show that Sea Base is feasible and practical.

关键词： Databases Cloud computing Computational modeling Data integration computers computer architecture Data models

来源：评论

学校读者我要写书评

暂无评论

On-Chip Generating FPGA Configuration Bitstreams to Reduce Applycation-Independent Test Time

On-Chip Generating FPGA Configuration Bitstreams to Reduce A...

引用

The 4th International Workshop on Advanced Technologies in Programmable system on Chip(第四届片上可编程系统前沿技术研讨会)

作者： Da Wang Fei Wang Paolo Ienne Yu Hu Dongrui Fan Haigang Yang Key Laboratory of Computer System and Architecture Institute of Computing TechnologyCASBeijing100190China System on Programmable Chip Research DepartmentInstitute of ElectronicsCASBeijing100190China Processor Architecture LaboratoryEPFLLausanneSwitzerland

FPGA application independent test is very time-consuming due to repetitively loading of test configuration bitstreams into the FPGA and applying test *** shows that over 95%of FPGA application independent test time is spent on loading the test configuration ***,reducing the number of loading times could significantly reduce the FPGA test *** this paper,a new approach which can significantly reduce the FPGA test time will be *** this new approach,a configuration SRAM routing strategy is used first to enhance the correlation of the test bitstream configurations,then,on-chip test configuration generation structures are designed to transform a test bitstream configuration into other ones within limited *** results show that the proposed technique can at least reduce the configuration loading time by 81%,while getting 100%test *** hardware overhead is less than 1.2%upon the whole chip without any performance penalty.

关键词： FPGA test test configuration generation design-for-testability

来源：评论

学校读者我要写书评

暂无评论

A New Class of Learning Automata for Selecting an Optimal Subset

A New Class of Learning Automata for Selecting an Optimal Su...

引用

IEEE International Conference on systems, Man, and Cybernetics

作者： JunQi Zhang ZeZhou Li Qi Kang MengChu Zhou Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Department of Control Science and Engineering Tongji University Department of Electrical and Computer Engineering New Jersy Institute of Technology

ISBN: (纸本)9781479938414

Interacting with a random environment, Learning Automata (LAs) are automata that, generally, have the task of learning the optimal action based on responses from the environment. Distinct from the traditional goal of Learning Automata to select only the optimal action out of a set of actions, this paper considers a multiple-action selection problem and proposes a novel class of Learning Automata for selecting an optimal subset of actions. Their objective is to identify the optimal subset: the top k out of r actions. Based on conventional continuous pursuit and discretized pursuit learning schemes, this paper introduces four pursuit learning schemes for selecting the optimal subset, called continuous equal pursuit, discretized equal pursuit, continuous unequal pursuit and discretized unequal pursuit learning schemes, respectively. In conjunction with a reward-inaction learning paradigm, the above four schemes lead to four versions of pursuit Learning Automata for selecting the optimal subset. The simulation results present a quantitative comparison between them.

关键词： Learning Automata Optimal subset Pursuit algorithm

来源：评论

学校读者我要写书评

暂无评论

A 0.8V, 560fJ/bit, 14Gb/s injection-locked receiver with input duty-cycle distortion tolerable edge-rotating 5/4X sub-rate CDR in 65nm CMOS

A 0.8V, 560fJ/bit, 14Gb/s injection-locked receiver with inp...

引用

28th IEEE Symposium on VLSI Circuits, VLSIC 2014

作者： Li, Hao Chen, Shuai Yang, Liqiong Bai, Rui Hu, Weiwu Zhong, Freeman Y. Palermo, Samuel Chiang, Patrick Yin School of Electrical Engineering and Computer Science Oregon State University Corvallis OR 97331 United States Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Texas A and M University College Station TX 77843 United States State Key Laboratory of ASIC and System Fudan University Shanghai 200433 China LSI Corporation San Jose CA 95131 United States

ISBN: (纸本)9781479933273

A quarter-rate forwarded-clock receiver utilizes an edge-rotating 5/4X sub-rate CDR for improved jitter tolerance with low power overhead relative to conventional 2X oversampling CDR systems. Low-voltage operation is achieved with efficient quarter-rate clock generation from an injection-locked oscillator (ILO) and through automatic independent phase rotator control that optimizes timing margin of each input quantizer in the presence of receive-side clock static phase errors and transmitter duty-cycle distortion (DCD). Fabricated in GP 65nm CMOS, the receiver operates up to 16Gb/s with a BER-12, achieves a 1MHz phase tracking bandwidth, tolerates ±50%UIpp DCD on input data, and has 14Gb/s energy efficiency of 560fJ/bit at V DD=0.8V. © 2014 IEEE.

关键词： Clocks

来源：评论

学校读者我要写书评

暂无评论

Dynamics of Interacting Diseases

引用

Physical Review X 2014年第4期4卷 041005-041005页

作者： Joaquín Sanz Cheng-Yi Xia Sandro Meloni Yamir Moreno Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza Zaragoza 50018 Spain Department of Theoretical Physics University of Zaragoza Zaragoza 50009 Spain Key Laboratory of Computer Vision and System (Ministry of Education) and Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 People’s Republic of China Complex Networks and Systems Lagrange Lab Institute for Scientific Interchange Turin 10126 Italy

Current modeling of infectious diseases allows for the study of complex and realistic scenarios that go from the population to the individual level of description. However, most epidemic models assume that the spreading process takes place on a single level (be it a single population, a metapopulation system, or a network of contacts). In particular, interdependent contagion phenomena can be addressed only if we go beyond the scheme-one pathogen-one network. In this paper, we propose a framework that allows us to describe the spreading dynamics of two concurrent diseases. Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and compute the temporal evolution characterizing the unfolding dynamics. Results show that there are regions of the parameter space in which the onset of a disease’s outbreak is conditioned to the prevalence levels of the other disease. Moreover, we show, for the susceptible-infected-susceptible scheme, that under certain circumstances, finite and not vanishing epidemic thresholds are found even at the limit for scale-free networks. For the susceptible-infected-removed scenario, the phenomenology is richer and additional interdependencies show up. We also find that the secondary thresholds for the susceptible-infected-susceptible and susceptible-infected-removed models are different, which results directly from the interaction between both diseases. Our work thus solves an important problem and paves the way toward a more comprehensive description of the dynamics of interacting diseases.

关键词： Complex systems Interdisciplinary physics Statistical physics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：