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

Discovery of association rules between factors affecting user satisfaction in software project by FP-GROWTH Algorithm 18

Discovery of association rules between factors affecting use...

引用

18th International Conference on Electrical engineering/Electronics, computer, Telecommunications and Information Technology, ECTI-CON 2021

作者： Kaewbanjong, Katawut Intakosum, Sarun King Mongkut's Institute of Technology Ladkrabang Software System Engineering Laboratory Department of Computer Science Faculty of Science Bangkok Thailand

ISBN: (纸本)9780738111278

The main objective of this work was to find the association rules between factors affecting user satisfaction in software project by using an association rule discovery technique. Data from 191 software projects were collected and association rules between 15 Selected factors were discovered by FP-growth algorithm. Primarily, 281 association rules were discovered. Rules that were not directly related to user satisfaction were filtered out by simple criteria. In the end, 11 final association rules that passed those criteria were obtained with an average confidence value of 65.30%. These rules can incorporated in the planning and administration of a software project to gain utmost user satisfaction © 2021 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computing

Container lifecycle-aware scheduling for serverless computin...

引用

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Spatio-temporal load shifting for truly clean computing

arXiv

引用

arXiv 2024年

作者： Riepin, Iegor Brown, Tom Zavala, Victor M. Department of Digital Transformation in Energy Systems TU Berlin Germany Department of Chemical and Biological Engineering University of Wisconsin-Madison United States Mathematics and Computer Science Division Argonne National Laboratory United States

Companies with datacenters are procuring significant amounts of renewable energy to reduce their carbon footprint. There is increasing interest in achieving 24/7 Carbon-Free Energy (CFE) matching in electricity usage, aiming to eliminate all carbon footprints associated with electricity consumption on an hourly basis. However, the variability of renewable energy resources poses significant challenges for achieving this goal. We explore the impact of shifting computing jobs and associated power loads both in time and between datacenter locations. We develop an optimization model to simulate a network of geographically distributed datacenters managed by a company leveraging spatio-temporal load flexibility to achieve 24/7 CFE matching. We isolate three signals relevant for informed use of load flexiblity: varying average quality of renewable energy resources, low correlation between wind power generation over long distances due to different weather conditions, and lags in solar radiation peak due to Earth's rotation. We illustrate that the location of datacenters and the time of year affect which signal drives an effective load-shaping strategy. The energy procurement and load-shifting decisions based on informed use of these signals facilitate the resource-efficiency and cost-effectiveness of clean computing-the costs of 24/7 CFE are reduced by 1.29±0.07 e/MWh for every additional percentage of flexible load. We provide practical guidelines on how companies with datacenters can leverage spatio-temporal load flexibility for truly clean computing. Our results and the open-source optimization model can also be useful for a broader variety of companies with flexible loads and an interest in eliminating their carbon *** Codes 90-10, 91-10 © 2024, CC BY.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

Learning the continuous-time optimal decision law from discrete-time rewards

引用

National Science Open 2024年第5期3卷 130-147页

作者： Ci Chen Lihua Xie Kan Xie Frank Leroy Lewis Yilu Liu Shengli Xie School of Automation Guangdong University of TechnologyGuangdong Key Laboratory of IoT Information TechnologyGuangzhou 510006China Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of EducationGuangzhou 510006China School of Electrical and Electronic Engineering Nanyang Technological UniversitySingapore 639798Singapore 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou 510006China UTA Research Institute the University of Texas at ArlingtonFort Worth 76118USA Department of Electrical Engineering and Computer Science University of TennesseeKnoxville 37996USA Oak Ridge National Laboratory Oak Ridge 37830USA Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou 510006China

The concept of reward is fundamental in reinforcement learning with a wide range of applications in natural and social *** an interpretable reward for decision-making that largely shapes the system's behavior has always been a challenge in reinforcement *** this work,we explore a discrete-time reward for reinforcement learning in continuous time and action spaces that represent many phenomena captured by applying physical *** find that the discrete-time reward leads to the extraction of the unique continuous-time decision law and improved computational efficiency by dropping the integrator operator that appears in classical results with integral *** apply this finding to solve output-feedback design problems in power *** results reveal that our approach removes an intermediate stage of identifying dynamical *** work suggests that the discrete-time reward is efficient in search of the desired decision law,which provides a computational tool to understand and modify the behavior of large-scale engineering systems using the optimal learned decision.

关键词： continuous-time state and action decision law learning discrete-time reward dynamical systems reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Virtual-Source and Virtual-Swarm-Based Particle Swarm Optimizer for Large-Scale Multi-Source Location via Robot Swarm

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Zhang, JunQi Lin, YuXuan Zhou, MengChu Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Multi-source location is a significant application in the field of robot swarm and is required to find all sources whose number and distribution are unknown in advance. With few parameters and fast search, Particle Swarm Optimizer (PSO) variants that have certain grouping capability have been applied to address multi-source location problems by dividing a swarm such that every source has robots to locate. However, they are difficult to predetermine the exact number of groups, require a big number of robots, and are easily trapped in the no-signal areas when the proportion of no-signal areas is high. This work proposes a Virtual-source and Virtual-swarm-based PSO (VVPSO) to divide a search area into multiple cells equally, each of which has a virtual source in its center. Then, instead of robots grouping, only one group of robots is employed to traverse all virtual sources, and search their corresponding cells to locate real sources by a new PSO called Real-virtual mapping PSO (RMPSO). RMPSO asymmetrically maps a robot into a particle swarm with multiple virtual particles to perform PSO, which greatly reduces the requirements for the number of robots. Experimental results show that VVPSO has great search scalability and can solve large-scale multi-source location problems than two state-of-the-art grouping methods and three representative multimodal PSO variants, even with only one robot. Hence, this work greatly advances the field of multi-source location by using mobile robot swarm. IEEE

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Optical spatiotemporal vortices

引用

eLight 2023年第1期3卷 156-168页

作者： Chenhao Wan Andy Chong Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China School of Optical and Electronic Information and Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074HubeiChina Department of Physics Pusan National UniversityGeumjeong-GuBusan 46241South Korea Zhangjiang Laboratory 100 Haike RoadShanghai 201204China Shanghai Key Lab of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

Spatiotemporal vortices of light,featuring transverse orbital angular momentum(OAM)and energy circulation in the spatiotemporal domain,have received increasing attention *** experimental realization of the controllable generation of spatiotemporal vortices triggers a series of research in this *** review article covers the latest developments of spatiotemporal vortices of light ranging from theoretical physics,experimental generation schemes,and characterization methods,to applications and future *** new degree of freedom in photonic OAM endowed by spatiotemporal vortices paves the way to the discovery of novel physical mechanisms and photonic applications in light science.

关键词： Spatiotemporal optical vortex Orbital angular momentum Spin-orbit interaction Linear momentum density Toroidal vortex Topological charge

来源：评论

学校读者我要写书评

暂无评论

Multimodal Joint Prediction of Traffic Spatial-Temporal Data with Graph Sparse Attention Mechanism and Bidirectional Temporal Convolutional Network

SSRN

引用

SSRN 2024年

作者： Zhang, Dongran Yan, Jiangnan Polat, Kemal Alhudhaif, Adi Li, Jun Guangdong Provincial Key Laboratory of Intelligent Transportation System School of Intelligent Systems Engineering Sun Yat-sen University Shenzhen518107 China Department of Electrical and Electronics Engineering Faculty of Engineering Bolu Abant Izzet Baysal University Bolu Turkey Department of Computer Science College of Computer Engineering and Sciences Prince Sattam bin Abdulaziz University Al-Kharj11942 Saudi Arabia

Traffic flow prediction plays a crucial role in the management and operation of urban transportation systems. While extensive research has been conducted on predictions for individual transportation modes, there is relatively limited research on joint prediction across different transportation modes. Furthermore, existing multimodal traffic joint modeling methods often lack flexibility in spatial-temporal feature extraction. To address these issues, we propose a method called Graph Sparse Attention Mechanism with Bidirectional Temporal Convolutional Network (GSABT) for multimodal traffic spatial-temporal joint prediction. First, we use a multimodal graph multiplied by self-attention weights to capture spatial local features, and then employ the Top-U sparse attention mechanism to obtain spa-tial global features. Second, we utilize a bidirectional temporal convolutional network to enhance the temporal feature correlation between the output and input data, and extract inter-modal and intra-modal temporal features through the share-unique module. Finally, we have designed a multimodal joint prediction framework that can be flexibly extended to both spatial and temporal dimensions. Extensive experiments conducted on three real datasets indicate that the proposed model consistently achieves state-of-the-art predictive performance. © 2024, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Multimodal Joint Prediction of Traffic Spatial-Temporal Data with Graph Sparse Attention Mechanism and Bidirectional Temporal Convolutional Network

arXiv

引用

arXiv 2024年

Traffic flow prediction plays a crucial role in the management and operation of urban transportation systems. While extensive research has been conducted on predictions for individual transportation modes, there is relatively limited research on joint prediction across different transportation modes. Furthermore, existing multimodal traffic joint modeling methods often lack flexibility in spatial-temporal feature extraction. To address these issues, we propose a method called Graph Sparse Attention Mechanism with Bidirectional Temporal Convolutional Network (GSABT) for multimodal traffic spatial-temporal joint prediction. First, we use a multimodal graph multiplied by self-attention weights to capture spatial local features, and then employ the Top-U sparse attention mechanism to obtain spatial global features. Second, we utilize a bidirectional temporal convolutional network to enhance the temporal feature correlation between the output and input data, and extract inter-modal and intra-modal temporal features through the share-unique module. Finally, we have designed a multimodal joint prediction framework that can be flexibly extended to both spatial and temporal dimensions. Extensive experiments conducted on three real datasets indicate that the proposed model consistently achieves state-of-the-art predictive performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

Adapting the Simulated Annealing Algorithm to Enhance the Performance of the LEACH Protocol

Adapting the Simulated Annealing Algorithm to Enhance the Pe...

引用

International Conference on computer and Applications (ICCA)

作者： Mohammed Benhadji Kaddi Mohammed Omari Mohammed Material Sciences Department Laboratory of Energy Environment and Information System (LEESI) University of Adrar Algeria Mathematics and Computer Science Department LDDI Laboratory University of Adrar Algeria Computer Science and Engineering Department American University of Ras Al Khaimah Ras Al Khaimah United Arab Emirates

ISBN: (数字)9798350367560

ISBN: (纸本)9798350367577

In parallel with the proliferation and extension of wireless sensor networks (WSNs), as well as the diversity of their applications, such networks continue to fail to operate for lengthy periods of time due to node failure and the inability to replace sensor batteries in most circumstances. This hinders the networks' ability to remain operational over extended periods. That necessitates making the best and most efficient use of the nodes' energy. Hierarchical clustering methods augmented with metaphysical algorithms have produced amazing benefits in terms of network longevity. One of the most significant of these algorithms that draws inspiration from nature and yields excellent results is the simulated annealing technique. In this research, we report on our analysis of this method and how it performs best when used to optimize routing in WSN.

关键词： Wireless sensor networks Protocols Heuristic algorithms Metaheuristics Energy conservation Clustering algorithms Simulated annealing Spread spectrum communication Routing Testing

来源：评论

学校读者我要写书评

暂无评论

Noise-Optimized Signal Processing for TENG-Based Touch Sensing Using I2C Integrated Circuits

引用

IEEE Sensors Journal 2025年

作者： Moger, Gourav Kakim, Alibek Mubarak, Assem Bushanov, Yersaiyn Kalimuldina, Gulnur Yeshmukhametov, Azamat Nazarbayev University Department of Robotics Engineering Astana Kazakhstan Nazarbayev University School of Engineering and Digital Sciences Department of Mechanical and Aerospace Engineering Astana Kazakhstan LLP MiraiTech Astana Kazakhstan Nazarbayev University Institute of Smart Systems and Artificial Intelligence Advanced Robotics and Mechatronics System laboratory Astana Kazakhstan

Triboelectric nanogenerator (TENG) sensors efficiently convert mechanical stimuli into electrical signals, making them well-suited for touch sensing due to their high sensitivity, durability, and self-powered operation. However, conventional signal acquisition methods introduce noise, affecting measurement accuracy. This paper presents a compact, Inter-Integrated Circuit (I2C)-based signal processing circuit designed to enhance signal fidelity while minimizing noise interference. The system’s performance was evaluated by analyzing sensor response across varying contact areas (50 mm² to 576 mm²) and drop heights, demonstrating a consistently high signal-to-noise ratio (SNR) across impact conditions. A high-frequency impact experiment further confirmed the PCB’s ability to distinguish sensor output from noise. Comparison with direct analog acquisition showed a significant enhancement in SNR, validating the PCB’s effectiveness in noise reduction. The system exhibited a rise time of 3.27 milliseconds, ensuring rapid detection of mechanical stimuli. Additionally, the measured latency of 88.9 ms between impact and signal detection falls within acceptable limits for realtime applications. These results establish the proposed PCB-based signal processing method as a practical solution for improving TENG sensor performance in touch-sensing applications requiring high accuracy and noise resilience. The compact, low-power design further enhances its suitability for integration into wearable electronics, interactive surfaces, and space-constrained systems where conventional bulky processing units are impractical. © 2001-2012 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：