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

Fractional Order Differential Evolution

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Wang, Kaiyu Gao, Shangce Zhou, MengChu Zhan, Zhi-Hui Cheng, Jiujun Faculty of Engineering University of Toyama Toyama-shi Japan Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA College of Artificial Intelligence Nankai University Tianjin China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Differential evolution (DE) is a widely recognized method to solve complex optimization problems as shown by many researchers. Yet, non-adaptive versions of DE suffer from insufficient exploration ability and uses no historical information for its performance enhancement. This work proposes Fractional Order Differential Evolution (FODE) to enhance DE performance from two aspects. Firstly, a bi-strategy co-deployment framework is proposed. The population-based and parameter-based strategies are combined to leverage their respective advantages. Secondly, the fractional order calculus is first applied to the differential vector to enhance DE’s exploration ability by using the historical information of populations, and ensures the diversity of population in an evolutionary process. We use the 2017 IEEE Congress on Evolutionary Computation (CEC) test functions, and CEC2011 real-world problems to evaluate FODE’s performance. Its sensitivity to parameter changes is discussed and an ablation study of multi-strategies is systematically performed. Furthermore, the variations of exploration and exploitation in FODE are visualized and analyzed. Experimental results show that FODE is superior to other state-of-the-art DE variants, the winners of CEC competitions, other fractional order calculus-based algorithms, and some powerful variants of classic algorithms. IEEE

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

New tight upper bounds on the capacity for general deterministic dissemination in wireless ad hoc networks

New tight upper bounds on the capacity for general determini...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Cheng Wang Jieren Zhou Tianci Liu Lu Shao Huiya Yan Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science Tongji University Shanghai China School of Software Tsinghua University Beijing China Mathematics Department University of Wisconsin-La Crosse La Crosse WI

In this paper, we study capacity scaling laws of the deterministic dissemination (DD) in random wireless networks under the generalized physical model (GphyM). This is truly not a new topic. Our motivation to readdress this issue is two-fold: Firstly, we aim to propose a more general result to unify the network capacity for general homogeneous random models by investigating the impacts of different parameters of the system on the network capacity. Secondly, we target to close the open gaps between the upper and the lower bounds on the network capacity in the literature. We derive the general upper bounds on the capacity for the arbitrary case of (λ, nd, ns) by introducing the Poisson Boolean model of continuum percolation, where λ, nd, and ns are the general node density, the number of destinations for each session, and the number of sessions, respectively. We prove that the derived upper bounds are tight according to the existing general lower bounds constructed in the literature.

关键词： Roads Mathematics Unicast Signal to noise ratio Interference

来源：评论

学校读者我要写书评

暂无评论

Design issues in ZigBee-based sensor network for healthcare applications

Design issues in ZigBee-based sensor network for healthcare ...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jin Soo Choi Meng Chu Zhou Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China ECE Department New Jersey Institute of Technology Newark NJ USA

IEEE 802.15.4/ZigBee sensor networks support small power consumption and node expansion compared to other network standards for WSN. Body sensor networks (BSN) require a number of sensors for sensing medical information from human body, and low power consumption to monitor a patient's status for a long time. However, ZigBee has limited bandwidth and is thus hard to support real time data transmission because of the adoption of CSMA-CA as its medium access control (MAC) protocol. In this paper, we will analyze the reasonable number of nodes, size of payload and packet interval for best QoS for such network. It is found that an appropriate MAC parameters setting can improve the QoS compared to the default setting in IEEE 802.15.4 specification. The effective data rate, average end-to-end delay and packet delivery ratio are found via simulation for various network settings. The results are useful for the construction of ZigBee networks for patient monitoring and care.

关键词： Delay IEEE 802.15 Standards Zigbee Monitoring Payloads Medical services Data models

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable.

关键词： TV Wireless sensor networks Power capacitors Blogs Lattices

来源：评论

学校读者我要写书评

暂无评论

Distributed Computation Offloading using Deep Reinforcement Learning in Internet of Vehicles

Distributed Computation Offloading using Deep Reinforcement ...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Chen Chen Zheng Wang Qingqi Pei Ci He Zhibin Dou State Key Laboratory of Integrated Services Networks Xidian University Xi'an P.R.China Key Laboratory of Industrial Internet of Things & Networked Control Ministry of Education Chongqing China The Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education Shanghai China The 54th Research Institute of China Electronics Technology Group Corporation Shijiazhuang China

ISBN: (数字)9781728173276

ISBN: (纸本)9781728173283

In this paper, we first take the moving vehicles as a RP (resource pool), by which we proposed a distributed computation offloading scheme to fully utilize the available resources and reduce task execution time in I0V (Internet of Vehicles). After that, we divide a complex task into many sub-tasks and indicate that how to assign these small tasks to satisfy the task execution time in RP is a NP problem. The executing time of a task is modeled as the longest calculation time among all small tasks, which is actually a min-max problem. For a dynamically vehicular environment, a distributed computing offloading strategy based on deep reinforcement learning is proposed to find the best offloading scheme to minimize the execution time of a task. Numerical results demonstrate that our scheme is better than Partial Flooding Algorithm and can make full use of the available computing resources of surrounding vehicles by considering the mobility of vehicles, the delay of communication transmission, and the separability of the tasks, thus greatly reducing the execution time of the computing tasks.

关键词： Computational modeling Simulation Reinforcement learning User experience Delays Internet Task analysis

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

Neurological rehabilitation of stroke patients via motor imaginary-based brain-computer interface technology

引用

Neural Regeneration Research 2011年第28期6卷 2198-2202页

作者： Hongyu Sun Yang Xiang Mingdao Yang Department of Computer Science and Technology Tongji University Shanghai 201804 China College of Information and Electrical Engineering Shandong University of Science and Technology China Key Laboratory of Embedded System and Service Computing Ministry of Education of the People＇s Republic of China Tongji University Shanghai 201804 China Qingdao Economic ＆ Technical Development Area First People＇s Hospital Qingdao 266555 Shangdong Province China

The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classification were significantly greater at 4 weeks after treatment （P 〈 0.01）, which suggested that motor imaginary-based brain-computer interface technology improved balance and walking in stroke patients.

关键词： brain-computer interface motor cortex neuronal plasticity rehabilitation stroke neural regeneration

来源：评论

学校读者我要写书评

暂无评论

Conflict Analysis for Pythagorean Fuzzy Information systems with Group Decision Making

arXiv

引用

arXiv 2017年

作者： Lang, Guangming Department of Computer Science and Technology Tongji University Shanghai201804 China School of Mathematics and Statistics Changsha University of Science and Technology Changsha Hunan410114 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

Pythagorean fuzzy sets provide stronger ability than intuitionistic fuzzy sets to model uncertainty information and knowledge, but little effort has been paid to conflict analysis of Pythagorean fuzzy information systems. In this paper, we present three types of positive, central, and negative alliances with different thresholds, and employ examples to illustrate how to construct the positive, central, and negative alliances. Then we study conflict analysis of Pythagorean fuzzy information systems based on Bayesian minimum risk theory. Finally, we investigate group conflict analysis of Pythagorean fuzzy information systems based on Bayesian minimum risk theory. Copyright © 2017, The Authors. All rights reserved.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

Verification of web service protocols by logic of knowledge

引用

Journal of Information and Computational Science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Response Policies to Process Module Failure in Single-Arm Cluster Tools Subject to Wafer Residency Time Constraints

Response Policies to Process Module Failure in Single-Arm Cl...

引用

作者： Qiao, Yan Pan, Chun-Rong Wu, Nai-Qi Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China School of Mechatronics and Electrical Engineering Jiangxi University of Science and Technology Ganzhou341000 China Institute of Systems Engineering Macau University of Science and Technology Taipa 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

In semiconductor manufacturing, wafer residency time constraints make the scheduling problem of cluster tools complicated. A process module (PM) in cluster tools is prone to failure. It is crucial to deal with any such failure in a proper and timely manner. If there are feasible periodic schedules in operating a cluster tool before and after a PM failure, it is desired to make it operate continuously when such a failure occurs. However, due to wafer residency time constraints, it is highly challenging to control a tool such that it can be correctly transferred from a feasible schedule before failure to another after it. To solve this problem, a Petri net model is developed to describe the dynamic behavior of a single-arm cluster tool and failure response policies are proposed. The proposed policies are formulated via simple control laws for their easy implementation. Examples are given to show them. © 2015 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：