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

IEEE International Conference on Communications (IEEE ICC)

作者： Han, Chong Ding, Leilei Sun, Lijuan Guo, Jian Nanjing Univ Posts & Telecommun Coll Comp Nanjing 210023 Peoples R China Jiangsu High Technol Res Key Lab Wireless Sensor Nanjing 210023 Peoples R China

ISBN: (纸本)9781538674628

By using directional sensor nodes such as cameras, wireless multimedia sensor networks are typically used in traffic monitoring, target tracking and other fields. However, most sensor nodes powered by batteries are strictly limited in energy and cannot achieve long-term frontal tracking and monitoring of moving objects. To solve these problems, a model of directed sensor nodes with solar energy harvesting is introduced in this paper, where the energy of such nodes is no longer limited to batteries and the directed sensing area enables better frontal tracking. On this basis, we propose a distributed algorithm for directional task assignment called EN-DADA. EN-DADA is a task assignment algorithm with energy harvesting and orientation awareness, including a task classification phase and node bidding phase. The task is first classified to determine the candidate node set that can execute the task, and then the task assignment is determined according to the monitoring income of each node in the candidate node set. Experimental results show that the proposed task assignment algorithm has advantages in terms of task revenue and network lifetime when using the same energy harvesting model.

关键词： Wireless multimedia sensor network task assignment algorithm energy harvesting directed sensing model

来源：评论

学校读者我要写书评

暂无评论

Dependent task assignment algorithm based on particle swarm optimization and simulated annealing in ad-hoc mobile cloud

引用

Journal of Southeast University(English Edition) 2018年第4期34卷 430-438页

作者： Huang Bonan Xia Weiwei Zhang Yueyue Zhang Jing Zou Qian Yan Feng Shen Lianfeng National Mobile Communications Research Laboratory Southeast UniversityNanjing 210096China

In order to solve the problem of efficiently assigning tasks in an ad-hoc mobile cloud( AMC),a task assignment algorithm based on the heuristic algorithm is proposed. The proposed task assignment algorithm based on particle swarm optimization and simulated annealing( PSO-SA) transforms the dependencies between tasks into a directed acyclic graph( DAG) model. The number in each node represents the computation workload of each task and the number on each edge represents the workload produced by the transmission. In order to simulate the environment of task assignment in AMC,mathematical models are developed to describe the dependencies between tasks and the costs of each task are defined. PSO-SA is used to make the decision for task assignment and for minimizing the cost of all devices,which includes the energy consumption and time delay of all ***-SA also takes the advantage of both particle swarm optimization and simulated annealing by selecting an optimal solution with a certain probability to avoid falling into local optimal solution and to guarantee the convergence speed. The simulation results show that compared with other existing algorithms,the PSO-SA has a smaller cost and the result of PSO-SA can be very close to the optimal solution.

关键词： ad-hoc mobile cloud task assignment algorithm directed acyclic graph particle swarm optimization simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A task assignment algorithm Based on Particle Swarm Optimization and Simulated Annealing in Ad-hoc Mobile Cloud 9

A Task Assignment Algorithm Based on Particle Swarm Optimiza...

引用

9th International Conference on Wireless Communication and Signal Processing (WCSP)

作者： Huang, Bonan Xia, Weiwei Zhang, Yueyue Zhang, Jing Zou, Qian Yan, Feng Shen, Lianfeng Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781538620625

An Ad-hoc mobile cloud can be constructed upon local devices, where devices work together and share resources. However, the deployment of Ad-hoc mobile cloud is hindered by the limitation of mobile devices, such as storage capacities and relatively short battery lives. To overcome such problem, this paper proposes a task assignment algorithm based on particle swarm optimization and simulated annealing (PSO-SA) in Ad-hoc mobile cloud. The main contribution of our work is considering the fairness of resource utilization of all devices and total energy consumption of all devices under the constraint of time delay. We also combine particle swarm optimization and simulated annealing to avoid falling into local optimal solution and guarantee the convergence speed. PSO-SA is used to make the decision for task assignment to achieve two main objectives which include minimizing total energy consumption and balancing the fairness of resource utilization of all devices. Through the simulation, it is shown that compared with other population-based optimization algorithms PSO-SA has less energy consumption and the result of PSO-SA can be close to the optimal solution.

关键词： Ad-hoc mobile cloud task assignment algorithm cloud particle swarm optimization simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Development of a dedicated process simulator for the digital twin in apparel manufacturing: a case study

引用

INTERNATIONAL JOURNAL OF CLOTHING SCIENCE AND TECHNOLOGY 2024年第4期36卷 629-645页

作者： Kim, Minsuk Kim, Sungmin Korea Inst Ind Technol Res Inst Convergence Technol Ansan South Korea Seoul Natl Univ Dept Fash & Text Seoul South Korea

PurposeThe purpose of this study is to introduce a dedicated simulator to automatically generate and simulate a balanced apparel assembly line, which is critical to the digital twin concept in apparel manufacturing. Given the low automation level in apparel manufacturing, this is a first step toward the implementation of a smart factory based on cyber-physical ***/methodology/approachThe mixed task assignment algorithm was implemented to automatically generate a module-based apparel assembly line in the developed simulator. To validate the developed simulator, a case study was conducted using process analysis data of technical jackets obtained from an apparel manufacturer. The case study included three scenarios: calculating the number of workers, selecting orders based on factory capacity and managing unexpected worker *** developed simulator is approximately 97.2% accurate in assigning appropriate tasks to workstations using the mixed task assignment algorithm. The simulator was also found to be effective in supporting decision-making for production planning, order selection and apparel assembly line management. In addition, the module-based line generation algorithm made it easy to modify the assembly ***/valueThis study contributes a novel approach to address the challenge of low automation levels in apparel manufacturing by introducing a dedicated simulator. This dedicated simulator improves the efficiency of virtual apparel assembly line generation and simulation, which distinguishes it from existing commercial simulation software.

关键词： Simulation task assignment algorithm Line balancing Apparel assembly line Automatic assembly line generation Apparel manufacturing Digital twin Case study

来源：评论

学校读者我要写书评

暂无评论

Investigations on System Modeling Simulations for Solving Heterogeneous WSN task assignment Problem using Multilayer Feed Forward Neural Networks

引用

Materials Today: Proceedings 2020年 24卷 2439-2448页

作者： Titus Issac Salaja Silas Elijah Blessing Rajsingh Dept of Computer Science & Engineering Karunya Institute of Technology & Sciences Karunya NagarCoimbatore India

In the modern smart era, various real-time applications are achieved through Heterogeneous Wireless Sensor Networks (HeWSN) comprising a set of multi-functional wireless sensor nodes. In comparison to legacy nodes, the contemporary nodes are smaller and faster with multi-sensing capabilities. The real-time application missions are achieved by effectively assigning tasks to the ideal nodes in the HeWSN by employing a task assignment algorithm. Though various WSN tasks assignment algorithms have been proposed from time to time, it requires maximal human intervention to achieve the application missions. To mitigate human intervention, the task assignment in WSN could be powered by machine learning techniques. Despite the technological advancements, WSN is still assumed to be resource-constrained and employing a powerful machine learning technique may not be ideal. Investigations of the existing machine learning techniques catering to the needs of the WSN have been carried out and have led to the selection of Multilayer Feed Forward Network (MLFFN). Further, a HeWSN application is modelled and simulated to train the system. A total of 39,000 individual experimentations was performed by varying the hidden layers and training sets. Performance analysis was performed on the successful task assignment ratio. Investigations performed are (i) finding the highest successful task assignment ratio, (ii) configuration of the hidden layer and training set ranges in which the maximum successful task assignment ratio is obtained. In a nutshell, in-depth discussions to adapt MLFFN in a HeWSN application has been presented along with the future scope of the work

关键词： Machine Learning Technique Artificial Intelligence Feed Forward Neural Network Wireless Sensor Network task assignment algorithm

来源：评论

学校读者我要写书评

暂无评论

Communication-aware task assignment algorithm for MPSoC using shared memory

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2010年第7期56卷 233-241页

作者： Lee, Ser-Hoon Yoon, Yeo-Chan Hwang, Sun-Young Sogang Univ Seoul 121742 South Korea

In a Multi-Processor System-on-a-Chip (MPSoC) based on Network-on-Chip (NoC), which processes massive data in a distributed fashion, communication is concentrated on shared memory. This paper proposes an assignment algorithm that can minimize the total power consumption for data communication in executing application programs and a switch structure that can reduce communication congestion resulting from simultaneous accesses to the shared memory. The proposed assignment algorithm gives higher priority to the tasks transferring a larger amount of data to shared memory, so that these tasks can be assigned to the PEs close to shared memory. The proposed switch structure was designed to support multi-port memory, which is often used for shared memory. The ports of the proposed switch are dedicated to be connected with in/out ports of shared memory in order to increase communication bandwidth between PEs and shared memories. By adopting the proposed scheme, the congestion caused by the concentrated requests to the memory can be reduced. Experimental results show that power consumption for transferring data in High-Definition (HD) H.264 decoder, Motion-JPEG decoder, MP3 decoder and 2D Wavelet transform codes has been reduced by 23.9% on the average, when compared with the cases of applying the well-known FC. BN and SA algorithms. The area has been slightly increased by 1.7% compared to conventional NoC structures. Crown Copyright (C) 2010 Published by Elsevier B.V. All rights reserved.

关键词： MPSoC NoC task assignment algorithm Shared memory Data partitioning Contention

来源：评论

学校读者我要写书评

暂无评论

Efficient Scheduling of Independent tasks Using Modified Heuristics

Efficient Scheduling of Independent Tasks Using Modified Heu...

引用

International Conference on Computing and Communications Technologies ((ICCCT)

作者： Atique, Mohammad Sant Gadge Baba Amravati Univ Post Grad Dept Comp Sci & Engn Amravati India

ISBN: (纸本)9781479976232

In heterogeneous computing systems MinMin and MaxMin are widely used in assigning independent tasks to processors. For N tasks to be assigned to N processors these approaches are known to run in O (KN2) time. An algorithmic improvement that asymptotically decreases the running time complexity of MinMin to O(KN logN) without affecting its solution quality is proposed in [1]. The newly proposed MinMin algorithm is combined with MaxMin, resulting in two hybrid algorithms [1]. The first hybrid algorithm address the drawback of MaxMin in solving problem instances with highly skewed cost distributions while also improving the running time performance of MaxMin. The second hybrid algorithm improves the running time performance without degrading its solution quality. The proposed algorithms are easy to implement. For the large datasets used in the various experiments, MinMin and MaxMin, as well as recent state-of-the-art heuristics, require days, weeks, or even months to produce a solution, whereas the proposed algorithms in this paper produce solutions within only two or three minutes. The new modified algorithms namely MinMax and MinMax+ are proposed and implemented. These algorithms are compared with the existing algorithms MinMin and MaxMin on single objective cases.

关键词： heterogeneous computing systems independent task scheduling real time systems task assignment algorithm

来源：评论

学校读者我要写书评

暂无评论

A*-Based task assignment algorithm for Context-Aware Mobile Patient Monitoring Systems

A*-Based Task Assignment Algorithm for Context-Aware Mobile ...

引用

15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Mei, Hailiang van Beijnum, Bert-Jan Pawar, Pravin Widya, Ing Hermens, Hermie Univ Twente Telemed Grp Fac Elect Engn Math & Comp Sci NL-7500 AE Enschede Netherlands

ISBN: (纸本)9780769537870

Mobile Patient Monitoring System (MPMS) is positioned to provide high quality healthcare services in the near future. The gap between its application demands and resource supplies, however, still remains and may hinder this process. Dynamic context-aware adaptation mechanisms are required in order to meet the stringent requirements on such mission critical applications. The fundamental model underlying an MPMS includes a set of biosignal data processing tasks distributed across a set of networked devices. In our earlier work, we designed and validated a task distribution framework to support dynamic system reconfiguration of MPMS by means of task redistribution. This paper focuses on its decision-making component that can calculate the optimal task assignment by taking into account the reconfiguration costs. This paper has three major contributions. Firstly, we study a context-aware scenario and derive the design requirements for a task assignment algorithm in MPMS. Secondly, using a graph-based system model, we proposed an A*-based task assignment algorithm that minimizes the system end-to-end delay while guaranteeing required system battery lifetime and availability. We introduce a set of node expansion rules and a pre-processing procedure to calculate the heuristic function (h(n)). Thirdly, we evaluate the algorithm performance with experiments and compare this A*-based algorithm with other heuristic approaches, e.g. greedy and bounded A*.

关键词： context-aware task assignment algorithm mobile patient monitoring system battery lifetime availability end-to-end delay A* algorithm dynamic reconfiguration

来源：评论

学校读者我要写书评

暂无评论

A-Based task assignment algorithm for Context-Aware Mobile Patient Monitoring Systems

A-Based Task Assignment Algorithm for Context-Aware Mobile P...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Hailiang Mei Bert-Jan van Beijnum Pravin Pawar Ing Widya Hermie Hermens Telemedicine Group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente The Netherlands

ISBN: (纸本)9781424449316

关键词： Context-aware task assignment algorithm Mobile patient monitoring system Battery lifetime Availability End-to-end delay A* algorithm Dynamic reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Research on task assignment Based on Agents in Grid Computing

Research on Task Assignment Based on Agents in Grid Computin...

引用

4th International Conference on Ubiquitous Information Technologies

作者： Li, FuFang Xie, DongQing Luo, Fei Qi, DeYu Hu, JingLin Guangzhou Univ Sch Comp Sci & Educ Software Guangzhou 510006 Guangdong Peoples R China South China Univ Technol Coll Automat Sci & Engn Guangzhou 510006 Guangdong Peoples R China South China Univ Technol Sch Engn & Comp Sci Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781424451319

In hybrid heterogeneous and dynamically changing distributed grid environment, how to assign tasks to appropriate resources is one of the most challenging techniques. In this paper, we present a novel grid task assignment model and corresponding algorithm based on Agents, Small-world Network model Theory, and Power-Law. With the help of Agents to assign tasks, the proposed model and algorithm can exactly assign grid tasks to suitable resources in real time. The proposed model and algorithm are also designed applying with the two basic rule of complex networks, which makes the nodes of the grid system more searchable, and thus helps the task assignment Agents to find needed resources for specific tasks more quickly and efficiently. Simulation experiments show that the model and algorithm can make sound load balance and performance improvement compared with other traditional method.

关键词： Grid Computing task assignment algorithm Agents Small-world Network model Theory Power-Law

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：