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

Optimistic data consistency maintenance method based on data dependence

Jisuanji Xuebao/Chinese Journal of Computers 2008年第5期31卷 741-753页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection 31

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chen, Kang Wen, Ming Jia, Haoxiang Wu, Rongxin Jin, Hai Wuhan430074 China Jin YinHu Laboratory Wuhan430074 China School of Informatics Xiamen University Xiamen361005 China School of Computer Science and Technology HUST Wuhan430074 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China

ISBN: (纸本)9798350330663

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL-F I are effective that contribute significantly to its overall performance. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

General audio tagging with ensembling convolutional neural networks and statistical features

arXiv

引用

arXiv 2018年

作者： Xu, Kele Zhu, Boqing Kong, Qiuqiang Mi, Haibo Ding, Bo Wang, Dezhi Wang, Huaimin National Key Laboratory of Parallel and Distributed Processing Changsha China College of Computer National University of Defense Technology Changsha China University of Surrey United Kingdom College of Meteorology and Oceanography National Univ. of Defense Tech Changsha China

Audio tagging aims to infer descriptive labels from audio clips. Audio tagging is challenging due to the limited size of data and noisy labels. In this paper, we describe our solution for the DCASE 2018 Task 2 general audio tagging challenge. The contributions of our solution include: We investigated a variety of convolutional neural network architectures to solve the audio tagging task. Statistical features are applied to capture statistical patterns of audio features to improve the classification performance. Ensemble learning is applied to ensemble the outputs from the deep classifiers to utilize complementary information. a sample reweight strategy is employed for ensemble training to address the noisy label problem. Our system achieves a mean average precision (mAP@3) of 0.958, outperforming the baseline system of 0.704. Our system ranked the 1st and 4th out of 558 submissions in the public and private leaderboard of DCASE 2018 Task 2 challenge. Copyright © 2018, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimistic data consistency maintenance method based on key-attributes

引用

Ruan Jian Xue Bao/Journal of Software 2008年第8期19卷 2114-2126页

作者： Zhou, Jing Wang, Yi-Jie Li, Si-Kun National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, the update of key-attributes is separated from user update requests. key-Updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to the nodes having maximum or minimum latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including buffer preprocessing and update-log processing is applied to detect and reconcile conflicts, and then conflicts are solved by policies as last-writer-win and divide-and-rule. Lastly, update-log management method and maintenance method brought by node failure and network partitioning are discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency maintenance method, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.

关键词： Maintenance

来源：评论

学校读者我要写书评

暂无评论

Human Motion Recognition by Three-view Kinect Sensors in Virtual Basketball Training

Human Motion Recognition by Three-view Kinect Sensors in Vir...

引用

IEEE Region 10 International Conference TENCON

作者： Baoqi Yao Hui Gao Xin Su Key Laboratory of Trustworthy Distributed Computing and Service Beijing University of Posts and Telecommunications Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China

ISBN: (数字)9781728184555

ISBN: (纸本)9781728184562

In recent years, human action recognition has received a considerable amount of research attention because of it's potential in a variety of applications, such as video surveillance, human-computer interaction, and virtual reality (VR). However, many researches on human action recognition performed in single-camera or double-camera system, which achieve reduced performance due to vulnerability to partial occlusion and miss-recognition of back. Some works on human action recognition use multiple cameras but are too complex for practical application. In this paper, we propose a new human action recognition system using triple Kinect sensors for VR application. Particularly, we design a mark detection method to determine the front of user and fusion skeleton data in real time. Features are extracted from three-dimensional (3D) skeleton data sequences, and divided into five parts according to body parts. A classification model based on the part-aware long short-term memory networks is proposed to recognize human motion. Finally, we demonstrate the system with a virtual reality basketball application and the results of experiment validate the feasibility of the proposed system.

关键词： Skeleton Sensors Cameras Sensor systems Feature extraction Face recognition Shoulder

来源：评论

学校读者我要写书评

暂无评论

Beamforming for Secure Two-Way Relay Networks with Physical Layer Network Coding

Beamforming for Secure Two-Way Relay Networks with Physical ...

引用

IEEE Global Communications Conference

作者： Cong Zhang Hui Gao Tiejun Lv Yueming Lu Xin Su Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education School of Information and Communication Engineering Beijing University of Posts and Telecommunications Tsinghua National Laboratory for Information Science and Technology Tsinghua University

ISBN: (纸本)9781479935130

We investigate the secrecy beamforming in two-way relay channels (TWRC) with physical layer network coding (PNC). The multi-antenna relay broadcasts the superimposed signal of two user messages with secrecy beamforming after receiving the signals transmitted by the two legitimate users. We first propose a lower bound of the secrecy sum rate to quantify the secrecy performance of the TWRC with PNC. Because the maximization of the lower bound is non-convex under total power constraint, we propose a joint beamforming and power allocation scheme, in which the problem is successively approximated by several convex semidefinite programs. In order to reduce the complexity, we further propose an suboptimal scheme with closed-form solution. Numerical results indicate that the proposed schemes with PNC achieve much better secrecy sum-rate performance than the traditional AF schemes.

关键词： array signal processing network coding optimisation relay networks (telecommunication) TWRC convex semidefinite programs joint beamforming and multiantenna relay broadcasts physical layer network coding power allocation scheme secrecy beamforming suboptimal scheme two-way relay channels two-way relay networks Approximation methods Array signal processing Optimization Protocols Relays Resource management Vectors

来源：评论

学校读者我要写书评

暂无评论

F3A: Fairness-Aware AI-Workloads Allocation Considering Multidimensional User Demands in JointCloud

F3A: Fairness-Aware AI-Workloads Allocation Considering Mult...

引用

IEEE International Conference on Joint Cloud computing (JCC)

作者： Jiacheng Yang Guodong Yi Fei Gao Peichang Shi Huaimin Wang National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

With the rapid growth of large language models, cloud computing has become an indispensable component of the AI industry. Cloud service providers(CSPs) are establishing AI data centers to service AI workloads. In the face of this surging need for AI computing power, building a connected computing environment across various clouds and forming a JointCloud presents an attractive solution. However, scheduling AI tasks across multiple AI data centers within a JointCloud environment presents a significant challenge: how to balance users’ demands while ensuring CSPs’ fairness in scheduling. Existing research primarily focuses on optimizing scheduling quality with limited consideration for fairness. Therefore, this paper proposes a Fairness-Aware AI-Workloads Allocation method (F3A), a fair cross-cloud allocation technique for AI tasks. F3A utilizes Point and Token to reflect both the resource status and historical task allocations of AI data centers, enabling the consideration of users’ multidimensional demands and facilitating fair task allocation across multiple centers. In order to better assess the fairness of scheduling, we also devised a fairness indicator(FI), based on the Gini coefficient to measure the fairness of task allocation. The experimental results demonstrate that F3A consistently maintains FI within 0.1 across various cluster sizes and different task quantities, representing an improvement of 76.45% compared to classical fair scheduling algorithms round-robin. F3A exhibits commendable performance in ensuring fairness in task allocation while also demonstrating effectiveness in cost reduction and enhancing user satisfaction.

关键词： Industries Data centers Cloud computing Job shop scheduling Costs Scheduling algorithms Large language models

来源：评论

学校读者我要写书评

暂无评论

An effective control scheme to ensure real-time causal order in large-scale distributed interactive simulations

An effective control scheme to ensure real-time causal order...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Hangjun Zhou Sha Fu Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan China Department of Information Management Hunan University of Finance and Economics Changsha Hunan China

When a large-scale distributed interactive simulation system is running on WAN, the sites usually disperse over a wide area in geography, which results in the simulation clock of each site is hardly to be accurately synchronized with that of other sites. The asynchronous clocks and large transmission latency on WAN bring on a problem for the large-scale simulations to preserve the real-time causal order delivery of received events at each site. In this article, we analyze the indirect way to compare the values of asynchronous simulation clocks at first, and then propose a novel scheme which can select the reconstructible causal control information for each message so as to ensure the causal ordering of events in real time. Experiments demonstrate that the scheme can weaken the effect of network latency, reduce the overhead of the transmission amount of control information and improve the causal order consistency in asynchronous distributed simulations.

关键词： Clocks Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Relativity between gene expression level and combinatorial regulatory relationship

Relativity between gene expression level and combinatorial r...

引用

第五届中国蛋白质组学大会暨首届粤港蛋白质组学学术交流会

作者： Liu Wan-Lin Li Dong Liu Qi-Jun Zhu Yun-Ping He Fu-Chu State Key Laboratory of Proteomics Beijing Proteome Research CenterBeijing Institute of Radiation MedicineBeijingChina100850 State Key Laboratory of ProteomicsBeijing Proteome Research CenterBeijing Institute of Radiation MedicineBeijingChina100850 National Key Laboratory for Parallel & Distributed Processing National University of Deference and TechnologyChangshaChina410073

来源：评论

学校读者我要写书评

暂无评论

Intention oriented itinerary recommendation by bridging physical trajectories and online social networks

引用

Ruan Jian Xue Bao/Journal of Software 2012年第SUPPL.期23卷 159-168页

作者： Meng, Xiang-Xu Wang, Xiao-Dong Zhou, Xing-Ming National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha 410073 China

Human itineraries are often initiated by some general intentions and will be optimized after considering all kinds of constraints and available information. This paper proposes a category-based itinerary recommendation framework to help the user transfer from intentions to itinerary planning, which join physical trajectories and information of location based social networks. The main contributions are: (1) Build the category based activity scheduling model;(2) Design and implement the category tree based POI (point or interest) query strategy and algorithm;(3) Propose the Voronoi graph based GPS trajectory analysis method to build traffic information networks;(4) Combine social networks with traffic information networks to implement category based recommendation by ant colony algorithm. The study conducts experiments on datasets from FourSquare and GeoLife project. A test on satisfaction of recommended items is also performed. Results show that the satisfaction reaches 80% in average.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：