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

IEEE International Conference on Robotic Computing (IRC)

作者： Sujin Park Sanguk Park Hyeonggun Lee Minji Hyun Eunsuh Lee Jeonghyeon Ahn Lauren Featherstun Yongho Kim Eric Matson College of Software Sungkyunkwan University Suwon South Korea Department of Computer Science and Engineering Sogang University Seoul South Korea Department of Computer Science and Engineering Pusan National University Pusan South Korea Department of Computer Science and Engineering Ewha Womans University Seoul South Korea Department of Software Konkuk University Seoul South Korea Department of Computer and Information Technology Purdue University West Lafayette Indiana USA

Distributed multiagent systems consist of multiple agents which perform related tasks. In this kind of system, the tasks are distributed amongst the agents by an operator based on shared information. The information used to assign tasks includes not only agent's capability, but also agent's state, the goal's state, and conditions from the surrounding environments. Distributed multi agent systems are usually constrained by uncertain information about nearby agents, and by limited network availability to transfer information to the operator. Given these constraints of using an operator, a better designed system might allow agents to distribute tasks on their own. This paper proposes a goal distribution strategy for collaborative distributed multi agent systems where agents distribute tasks amongst themselves. In this strategy, a goal model is shared amongst all participating agents, enabling them to synchronize in order to achieve complex goals that require sequential executions. Agents in this system are capable of transferring information over the network where all others belong to. The approach was tested and verified using StarCraft II APIs, introduced by Blizzard and Google Deepmind.

关键词： Task analysis Synchronization Multi-agent systems Organizations Robots Collaboration computer science

来源：评论

学校读者我要写书评

暂无评论

Pipeline Representation Using Generic Parallel Algorithms in Heterogeneous Parallel Computing. A comparative analysis 36

Pipeline Representation Using Generic Parallel Algorithms in...

引用

36th European Modeling and Simulation Symposium, EMSS 2024, Held at the 21st International Multidisciplinary Modeling and Simulation Multiconference, I3M 2024

作者： Rossainz-López, Mario Sánchez-Rinza, Bárbara López-Sosa, Zuriel Capel-Tuñon, Manuel Faculty of Computer Science Autonomous University of Puebla Av. San Claudio and 14 Sur Street San Manuel PueblaC.P. 72570 Mexico Software Engineering Department College of Informatics and Telecommunications ETSIIT University of Granada Daniel Saucedo Aranda s/n Granada18071 Spain

ISBN: (纸本)9791281988026

Using Parallel Objects and Structured Parallel Programming, the parallel representation of the Communication Pattern between Processes called Pipeline is shown, whose implementation is carried out through different models of Generic Parallel Algorithms within Heterogeneous Parallel Computing (HPC): As a Parallel Design Pattern or PDP, as High-Level Parallel Composition or HLPC and as Flow Graph Interfaces or FGI through programming with message passing. An original and effective development methodology for new programmers in parallelism is proposed for each of them. In these three proposals for Generic Parallel Algorithms, the same problem-example is solved as a case study, and a comparative analysis of their models and designs is carried out, as well as the performance obtained in the execution of said proposals and demonstrate their usefulness, programmability, and performance. The objective of this work is to provide the programmer and/or novice user with different multicore programming approaches so that without much effort they can develop their programs according to a sequential programming style, obtaining automatically, easily and the counterpart parallelization of your code with the help of a specific programming environment like the one proposed. © 2024 The Authors.

关键词： Structured programming

来源：评论

学校读者我要写书评

暂无评论

A new dynamic multicast routing model and its immune optimization algorithm in integrated network

A new dynamic multicast routing model and its immune optimiz...

引用

International Workshop on Networking, Architecture, and Storages (IWNAS)

作者： Wang Jiang-qing Qin Jun Kang Li-shan The State Key Laboratory of Software Engineering Wuhan University of China Wuhan China College of computer science South Central University of Nationalities Wuhan China

A new dynamic multicast routing model was proposed in this paper. Specifically, we firstly considered two possible changes in integrated network: node movements and the change of link delay. Next, a mechanism called local rearrangement is used to handle changes in integrated networks. We designed an artificial immune algorithm based on clone process for optimizing the multicast sub-tree within the range of local rearrangement. In order to improve the effectiveness of our algorithm, we introduced gene library to meet the real-time requirement in online multicast routing fields. The simulation results indicated our algorithm balances better in three metrics compared with other two popular dynamic multicast routing algorithms

关键词： Routing Multicast algorithms Intelligent networks Delay Laboratories software engineering Heuristic algorithms Wireless networks Quality of service Costs

来源：评论

学校读者我要写书评

暂无评论

A software Execution Data Component Identification Algorithm Based on Spectral Clustering

A Software Execution Data Component Identification Algorithm...

引用

International Conference on Dependable Systems and Their Applications (DSA)

作者： Yahui Tang Mengqi Rao Qingjie Wei Feng Chen Xin Liu School of Software Engineering Chongqing University of Posts and Telecommunications ChongQing China College of Computer Science and Technology Chongqing University of Posts and Telecommunications ChongQing China

In order to understand the architecture of software system and facilitate the future maintenance of the software, we can reconstruct the software system as a component-based software system. To obtain the component information of the software, it is necessary to identify components based on the information contained in the software execution data. This paper presents a software Execution data component identification algorithm based on Spectral Clustering (SESC). The input of the algorithm is the software execution event log, and the output is an evaluation report on the quality of the identified components, yielding the log of software execution events with component information. By using four software execution event logs, we compare the proposed SESC with five component identification algorithms based on the community detection algorithm. SESC takes the number of calls between classes into consideration, so it can identify components more accurately, and has certain advantages in time performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Minimization of Wired and Wireless Traffic for Content Delivery by Multicast Pushing

Joint Minimization of Wired and Wireless Traffic for Content...

引用

作者： Chen, Zhao Tao, Xiaoming Jiang, Chunxiao Leung, Victor C.M. Beijing National Research Center for Information Science and Technology Department of Electronics Engineering Tsinghua University Beijing100084 China Beijing Innovation Center for Future Chip Tsinghua University Beijing100084 China Tsinghua Space Center Tsinghua University Beijing100084 China BNRist Tsinghua University Beijing100084 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

As more mobile users become subscribers of content services, their subscribed content can be directly pushed from the content provider into the user equipment after the content is generated. In current and future network paradigms, a joint wired and wireless transmission design for this pushing is needed to guarantee the user experience without the extra deployment of communication infrastructures or consumption of resources. In this paper, we investigate a joint wired and wireless content delivery system that incorporates wired and wireless multicast. The users in the same group are served by wireless multicast from a base station (BS), while the BSs of the same content form a multicast tree in a backbone wired network. The sum of wired and wireless traffic is minimized by a joint design of user grouping, subchannel allocation, wired routing, and wired link usage. Exploiting the monotonicity of wired and wireless traffic with regard to the wired hop count, the original problem is converted for searching the optimal hop count vector that achieves the minimum sum of both types of traffic, which is solved by a monotonic optimization (MO)-based iterative algorithm. Compared with existing schemes and according to the numerical results, a reduction in total traffic of 43% can be achieved by our approach. © 2019 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Real-Time Detection of UAV Small Target's Infrared Imaging via OSTD-YOLOv8

Real-Time Detection of UAV Small Target's Infrared Imaging v...

引用

2024 IEEE URUCON, URUCON 2024

作者： Dahri, Fida Hussain Laghari, Asif Ali Dahri, Nisar Ahmed Abro, Ghulam E Mustafa Estrela, Vania V. De Oliveira, G.G. Iano, Y. Chuma, Euclides L. Southeast University School of Computer Science and Engineering Nanjing China Shenyang Normal University Software College Shenyang China University Teknologi Malaysia Faculty of Educational Sciences and Technology Johor Bahru Malaysia King Fahd University of Petroleum and Minerals Interdisciplinary Research Centre for Aviation and Space Exploration Dhahran Saudi Arabia Department of Telecommunications Niteroi Brazil School of Electrical and Computer Engineering Campinas Brazil School of Technology Limeira Brazil

ISBN: (纸本)9798350355383

Unmanned aerial vehicles (UAVs) have boosted modern living. Tiny, frail high-density targets, low resolution, complicated backgrounds, noise, and poor real-time exposure performance have augmented due to UAV firms. Realtime recognition in high-altitude (HA) infrared thermal images is intricate. Our fresh OSTD-YOLOv8 is a multi-class target recognition tactic to tackle these issues and spot and classify objects on the HIT-UAV dataset. YOLOv8 is an effective advanced object detection model. Our OSTD-YOLOv8 model detects small objects in HA thermal images with 90% precision, 91.5% recall, 90.5% F1-score, 89.1% AP, and 98% mAP. Our unique approach delivers effective object recognition in difficult thermal imaging conditions. Consequently, this distinctive UAV-focused HA, thermal, target detection scheme can be used. © 2024 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Customer Value-based HW/SW Partitioning Decision in Embedded Systems

Customer Value-based HW/SW Partitioning Decision in Embedded...

引用

ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Neunghoe Kim Taek Lee Donghyun Lee Keun Lee Hoh Peter In Department of Computer Science and Engineering College of Information and Communications Korea University South Korea Software Laboratory Samsung Electronics Company Limited South Korea

ISBN: (纸本)9780769532636

In launching a product, requirement change is always risk to an embedded system designer. Including requirements change, limited resources (e.g. development time and cost) are also risk factors to designing a system. However, the time to market constraint among several limitations is most critical especially to embedded system products (e.g. cellular phone, PDA, etc.). For that reason, many strategy makers try to find effective way to a HW/SW partitioning decision in early designing phase. Only ideal way to reduce requirements change and satisfy customers is reflecting their value to decision making steps in early phase prior to fixing HW and SW component design. In this paper, Customer Value based Partitioning Decision (CVPD) method is proposed to identify, analyze, and calculate the value of the customerspsila requirements, reflecting the value on the partitioning decision making process.

关键词： software Correlation Embedded system Customer satisfaction Time to market Hardware Chromium

来源：评论

学校读者我要写书评

暂无评论

Age of information in physical-layer network coding enabled two-way relay networks

arXiv

引用

arXiv 2021年

作者： Pan, Haoyuan Chan, Tse-Tin Leung, Victor C.M. Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computing The Hang Seng University of Hong Kong Hong Kong

This paper investigates the information freshness of two-way relay networks (TWRN) operated with physical-layer network coding (PNC). Information freshness is quantified by age of information (AoI), defined as the time elapsed since the generation time of the latest received information update. PNC reduces communication latency of TWRNs by turning superimposed electromagnetic waves into network-coded messages so that end users can send update packets to each other via the relay more frequently. Although sending update packets more frequently is potential to reduce AoI, how to deal with packet corruption has not been well investigated. Specifically, if old packets are corrupted in any hop of a TWRN, one needs to decide the old packets to be dropped or to be retransmitted, e.g., new packets have recent information, but may require more time to be delivered. We study the average AoI with and without automatic repeat request (ARQ) in PNC-enabled TWRNs. We first consider a non-ARQ scheme where old packets are always dropped when corrupted, referred to as once-lost-then-drop (OLTD), and a classical ARQ scheme with no packet lost, referred to as reliable packet transmission (RPT). Interestingly, our analysis shows that neither the non-ARQ scheme nor the pure ARQ scheme achieves good average AoI. We then put forth an uplink-lost-then-drop (ULTD) protocol that combines packet drop and ARQ. Experiments on software-defined radio indicate that ULTD significantly outperforms OLTD and RPT in terms of average AoI. Although this paper focuses on TWRNs, we believe the insight of ULTD applies generally to other two-hop networks. Our insight is that to achieve high information freshness, when packets are corrupted in the first hop, new packets should be generated and sent (i.e., old packets are discarded);when packets are corrupted in the second hop, old packets should be retransmitted until successful reception. Copyright © 2021, The Authors. All rights reserved.

关键词： Drops

来源：评论

学校读者我要写书评

暂无评论

Search-based techniques applied to optimization of project planning for a massive maintenance project

Search-based techniques applied to optimization of project p...

引用

International Conference on software Maintenance (ICSM)

作者： G. Antoniol M. Di Penta M. Harman RCOST-Research Centre on Software Technology Department of Engineering University of Sannio Benevento Italy Department of Computer Science King''s College London UK

This paper evaluates the use of three different search-based techniques, namely genetic algorithms, hill climbing and simulated annealing, and two problem representations, for planning resource allocation in large massive maintenance projects. In particular, the search-based approach aims to find an optimal or near optimal order in which to allocate work packages to programming teams, in order to minimize the project duration. The approach is validated by an empirical study of a large, commercial Y2K massive maintenance project, which compares these techniques with each other and with a random search (to provide base line comparison data). Results show that an ordering-based genome encoding (with tailored cross over operator) and the genetic algorithm appear to provide the most robust solution, though the hill climbing approach also performs well. The best search technique results reduce the project duration by as much as 50%.

关键词： software maintenance Resource management Genetic algorithms software engineering Optimal scheduling Programming profession Simulated annealing Packaging Large-scale systems Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Integrative computing method for the prediction of zinc-binding sites in proteins

Integrative computing method for the prediction of zinc-bind...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Hui Li Dechang Pi Yinghong Liang Chuanming Chen Yongzhi Liu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Shool of Software Engineering Jinling Institute of Technology Nanjing Jiangsu China

ISBN: (纸本)9781509061839

A large number of metalloproteins contained in Protein Data Bank, taking metal ions as cofactors, have important biological functions. As the second most abundant bound trace metal elements in organism, zinc ion plays an important regulatory role in the biological growth and development, disease control, DNA synthesis. So, research on the area of zinc-binding protein sites has an important significance. Because of the availability of protein sequence information, a series of predictive tools based on sequence for zinc-binding sites in proteins have been developed. But presently, there is little research on the integration of these tools. Based on this, an integrative predictor termed meta-zincPrediction is presented in the paper to combine the predictive tools. The linear regression method is used in the integrated approach to combine the scores of different prediction tools, the parameters are adjusted and optimized until to the optimal. Tested on the non-redundant Zhao_dataset, AURPC value of meta-zincPrediction reached nearly 0.9, an increase of 2% -9% than other three predictors, and other performance indexes were also improved mostly. Moreover, the prediction ability of meta-zincPrediction was better than other three predictors, regardless of zinc-binding sites for all four types of residues, or zinc-binding sites for a single type of residues. Our method can not only be applied to large-scale identification of zinc-binding sites based on sequence information, but also be useful for the inference of protein function.

关键词： Proteins Tools Ions Metals Linear regression Machine learning algorithms Predictive models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：