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

21st IEEE International Conference on High Performance computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Zhu, Lei Liu, Yan Zhang, Zaimei Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha Hunan410082 China School of Economics and Management Changsha University of Science and Technology Changsha Hunan410076 China

ISBN: (纸本)9781728120584

Compared with traditional hard disk drives (HDD), solid state drives (SDD) have distinct characteristics, such as efficient continuous access and random reading capability. Using of SSD is greatly limited due to the out-of-place update and endurance problem. Many flash-aware buffer schemes have been proposed to reduce write and erase operations. However, a good buffer management scheme should reduce the effects of random writes and suit access patterns. In this paper, we propose an access characteristic write buffer management scheme (ACWB) on flash memory that integrates write buffer and cost regulation based on access characteristic. Experimental results show that ACWB increases the response time by 35%, reduces erase times by 25%, and improves the hit ratio by 27% on the average compared with current flash-aware write buffer schemes. © 2019 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

A Real-Time CAN-CAN Gateway with Tight Latency Analysis and Targeted Priority Assignment

A Real-Time CAN-CAN Gateway with Tight Latency Analysis and ...

引用

Real-Time Systems Symposium (RTSS)

作者： Guoqi Xie Haijie Gong Yunbo Han Samarjit Chakraborty Wanli Chang College of Computer Science and Electronic Engineering Hunan University China Key Laboratory for Embedded and Network Computing of Hunan Province China Future Network Lab CSIG Tencent China University of North Carolina at Chapel Hill USA University of York UK

ISBN: (数字)9781728183244

ISBN: (纸本)9781728183251

There is a demand in the automotive industry to connect two CAN-based subsystems. The commercial CAN-CAN gateway supports basic message forwarding with no real-time behavior. To address this issue, a new gateway architecture is described, on which we present a novel worst-case latency analysis. Specifically, we bound the arrival of the messages at the gateway, which is then used by the Pointer Reachability Exploration (PRE) to derive the interfering message jobs. Our analysis computes a safe gateway latency tighter than the conventional one applied in CAN. Furthermore, we propose a Targeted Priority Assignment (TPA) algorithm that targets at the priorities assigned at the CAN bus and runs a reordering at the gateway to enhance the schedulability. TPA performs better than DMPO (Deadline Monotonic Priority Ordering), while OPA (Audsley's Optimal Priority Assignment) cannot be applied in this context. Evaluation over real-life and scalable CAN message sets is conducted. The reported analysis and priority assignment algorithm are developed for dynamic use to improve the acceptance ratio and can also be deployed statically to provide timing guarantees. This work can be easily extended to support multiple CAN subsystems.

关键词： Heuristic algorithms Prototypes Computer architecture Logic gates Real-time systems Timing Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

An Evidence Combination Method based on DBSCAN Clustering

引用

Computers, Materials & Continua 2018年第11期57卷 269-281页

作者： Kehua Yang Tian Tan Wei Zhang College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan ProvinceHunan UniversityChangshaHunan410082China Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State UniversityVirginiaBlacksburg24060USA

Dempster-Shafer(D-S)evidence theory is a key technology for integrating uncertain information from multiple ***,the combination rules can be paradoxical when the evidence seriously conflict with each *** the paper,we propose a novel combination algorithm based on unsupervised Density-Based Spatial Clustering of Applications with Noise(DBSCAN)density *** the proposed mechanism,firstly,the original evidence sets are preprocessed by DBSCAN density clustering,and a successfully focal element similarity criteria is used to mine the potential information between the evidence,and make a correct measure of the conflict ***,two different discount factors are adopted to revise the original evidence sets,based on the result of DBSCAN density ***,we conduct the information fusion for the revised evidence sets by D-S combination *** results show that the proposed method can effectively solve the synthesis problem of high-conflict evidence,with better accuracy,stability and convergence speed.

关键词： D-S evidence theory information fusion DBSCAN combination rules

来源：评论

学校读者我要写书评

暂无评论

A decomposition based evolutionary algorithm with angle penalty selection strategy for many-objective optimization 9th

A decomposition based evolutionary algorithm with angle pena...

引用

9th International Conference on Swarm Intelligence, ICSI 2018

作者： Li, Zhiyong Lin, Ke Nouioua, Mourad Jiang, Shilong Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha China PKU-HKUST Shenzhen-HongKong Institution Shenzhen China

ISBN: (纸本)9783319938141

Evolutionary algorithms (EAs) based on decomposition have shown to be promising in solving many-objective optimization problems (MaOPs). First, the population (or objective space) is divided into K subpopulations (or subregions) by a group of uniform distribution reference vectors. Later, subpopulations are optimized simultaneously. In this paper, we propose a new decomposition based evolutionary algorithm with angle penalty selection strategy for MaOPs (MOEA-APS). In the environmental selection process, in order to prevent the solutions located around the boundary of the subregion from being simultaneously selected into the next generation which will affect negatively on the performance of the algorithm, a new angle similarity measure (AS) is calculated and used to punish the dense solutions. More precisely, after selecting a good solution x for a sub population, the solutions whose angle similarity with x exceeding η or pareto dominated by x will be directly punished. Moreover, The threshold η is not fixed, but decided by the distribution of the solutions around x. This mechanism allows to improve diversity of population. The experimental results on DTLZ benchmark test problems show that the results of the proposed algorithm are very competitive comparing with four other state-of-the-art EAs for MaOPs. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Compressed Classification for Energy Efficient Activity Recognition in Wireless Body Sensor networks

Adaptive Compressed Classification for Energy Efficient Acti...

引用

International Conference on Big Data computing and Communications (BIGCOM)

作者： Ling Xiao Yu Meng Kai Wu Key Laboratory for Embedded and Network Computing of Hunan Province China

Energy efficiency for activity recognition is a challenging task in the long-term health monitoring applications. To save the energy in wireless body sensor networks, the adaptive compressed classification framework for activity recognition is proposed. The proposed mechanism estimates the minimum activity-specific compression ratio subject to given recognition accuracy and adaptively adjusts the number of samples taken by sensor nodes based on the feedback from the result of activity recognition. A brute force algorithm is utilized to quickly find the optimal trade-off the power consumption and classification performance. With experiments on real-world activity datasets, we demonstrate 90.5% recognition accuracy with energy consumption reduced 28%.

关键词： Activity recognition Energy consumption Optimized production technology Wireless communication Base stations Body sensor networks

来源：评论

学校读者我要写书评

暂无评论

New binary artificial bee colony for the 0-1 knapsack problem 9th

New binary artificial bee colony for the 0-1 knapsack proble...

引用

9th International Conference on Swarm Intelligence, ICSI 2018

作者： Nouioua, Mourad Li, Zhiyong Jiang, Shilong The College of Computer Science and Electronic Engineering Hunan University Changsha China Key Laboratory for Embedded and Network Computing of Hunan Province Changsha China PKU-HKUST Shenzhen-HongKong Institution Shenzhen China

ISBN: (纸本)9783319938141

The knapsack problem is one of the well known NP-Hard optimization problems. Because of its appearance as a sub-problem in many real world problems, it attracts the attention of many researchers on swarm intelligence and evolutionary computation community. In this paper, a new binary artificial bee colony called NB-ABC is proposed to solve the 0-1 knapsack problem. Instead of the search operators of the original ABC, new binary search operators are designed for the different phases of the ABC algorithm, namely the employed, the onlooker and the scout bee phases. Moreover, a novel hybrid repair operator called (HRO) is proposed to repair and improve the infeasible solutions. To assess the performance of the proposed algorithm, NB-ABC is compared with two other existing algorithms, namely GB-ABC and BABC-DE, for solving the 0-1 knapsack problem. Based on a set of 15 0-1 high dimensional knapsack problems classified in three categories. the experimental results in view of many criteria show the efficiency and the robustness of the proposed NB-ABC. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

The EDF with Dual Virtual Deadline Algorithm for Mixed Criticality Task System

The EDF with Dual Virtual Deadline Algorithm for Mixed Criti...

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Lining Zeng Cheng Xu Renfa Li Key Laboratory for Embedded and Network Computing Hunan University Changsha Hunan Province China

ISBN: (纸本)9781538665664;9781538665657

In the area of real-time embedded systems, one of the hot topics is scheduling the mixed-criticality tasks to execute the LO tasks better when guaranteeing the correctness of HI tasks. In this paper, we research the schedule mechanism for dual-criticality tasks. Firstly, we modify the correctness condition of MC scheduling. Then, we present an optimized MC scheduling algorithm EDF -DVD, which assigns scale factors for both HI jobs and LO jobs. We analyze the different situation based on system utilizetion and present the strategy of calculating the value of scale factor corresponding to the utilization. The experiments show that our mechanism has better performance in scheduling the dual-criticality tasks.

关键词： Task analysis Schedules Scheduling embedded systems Switches Scheduling algorithms Real-time systems

来源：评论

学校读者我要写书评

暂无评论

System-Level Energy-Aware Design Methodology Towards End-To-End Response Time Optimization

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2019年

作者： Xie, Guoqi Huang, Jing Li, Yan Liu Renfa Li, Keqin Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha Hunan 410082 China. College of Computer Science and Electronic Engineering Hunan University China 410082 China and also is with the Department of Computer Science State University of New York New Paltz New York 12561 USA.

Energy provision is known and limited for battery-constrained/powered systems (e.g., mobile phones, electric cars, robots, and wireless sensor networks). System-level energy-aware design methodologies have been proposed to control energy usage for energy provision guarantee, and to optimize the end-to-end response time for high-performance in heterogeneous energy-aware systems, where energy pre-assignment strategies are considered as their main contributions. However, when pre-assigning energy to tasks, these strategies either are overly pessimistic or adopt an average manner without a customizable approach to specific tasks. In this paper, we propose an effective algorithm called ratio-based energy pre-assignment (REP) to be customizable to split the available energy according to the energy ratios of individual tasks. Experiments confirm that REP outperforms the state-of-the-art three algorithms of the same type. After REP is used, we further propose a new innovation algorithm called energy surplus reduction (ESR) to reduce the execution time of small partial tasks, thereby optimizing the end-to-end response time within its energy provision. Experiments confirm ESR can reduce the energy usages of small partial tasks to achieve sufficient response time optimization. IEEE

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

JDAS: a software development framework for multidatabases

JDAS: a software development framework for multidatabases

引用

作者： Xie, Guoqi Chen, Yuekun Liu, Yan Fan, Chunnian Li, Renfa Li, Keqin College of Computer Science and Electronic Engineering Hunan University China Key Laboratory for Embedded and Network Computing of Hunan Province China Nanjing University of Information Science and Technology China Department of Computer Science State University of New York New PaltzNY United States

Modern software development for services computing and cloud computing software systems is no longer based on a single database but on existing multidatabases and this convergence needs new software architecture and framework design. Most current popular frameworks are not designed for multidatabases, and many practical problems in development arise. This study designs and implements a software development framework called Java data access service (JDAS) for multidatabases using the object-oriented programming language Java. The JDAS framework solves related problems that arise when other frameworks are employed in practical software development with multidatabases by presenting and introducing design methods. JDAS consists of the modules of the database abstract, object relational mapping, connection pools management, configuration management, data access service, and inversion of control. Results and case study reveal that the JDAS framework effectively reduces development complexity and improves development efficiency of the software systems with multidatabases. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A novel combination method for conflicting evidence in open frame of discernment 17

A novel combination method for conflicting evidence in open ...

引用

2017 International Conference on Data Mining, Communications and Information Technology, DMCIT 2017

作者： Yang, Kehua Liu, Youfang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronics Hunan University Changsha China

ISBN: (纸本)9781450352185

Dempster-Shafer theory is a useful method in data fusion. To avoid counter-intuitive result of classical Dempster-Shafer's combination rule dealing with highly conflict evidences, many improved combination methods have been proposed through modifying the classical Dempster-Shafer's rule or original evidence by using a certain measure of the degree of conflict or uncertain data. However, usually the frame of discernment is incomplete, the current methods have limitation in handling this *** order to solve this problem, an improved combination method for conflicting evidence in open frame of discernment is proposed. In this paper, according to information theory the information entropy of each evidence is calculated and assigned to the unknown proposition which is added into the frame of discernment. Then reliability degree of evidences obtained by the Jousselme distance is used to revise source evidences. Finally, Dempster-Shafer's rule is applied to combine the mean of revised evidences several times. One numerical example is employed and in comparison with the existing alternatives, the proposed approach can effectively solve the conflicting problem and the incompleteness of frame. © 2017 Association for computing Machinery.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：