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

作者： Huang, Liusheng Xu, Hongli Wan, Yingyu Wu, Junmin Li, Hong Department of Computer Science and Technology University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

Time synchronisation is a critical topic in wireless sensor networks for its wide applications, such as data fusion, TDMA scheduling and cooperated sleeping, etc. In this paper, we present an Accurate Time Synchronisation (ATS) protocol based on linear least square for sensor networks. Unlike the previous protocols, all nodes aren't synchronised to some reference nodes or sink node, but to a virtual clock. Moreover, each pair of the nodes is synchronised to each other. The main advantages of ATS are simplicity and accuracy. Especially, the variance of the synchronised drift error is less than Dsδ/ 2β 2, where Ds, δ and β are the depth of the network, the maximal variance of the link delay and the sampling interval, respectively. The experiments show that ATS protocol has achieved at least 37% performance enhancement than the previous pairwise algorithm. Copyright © 2007 Inderscience Enterprises Ltd.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Dynamic Scheduling Policy for Patient Flow in a Smart Environment

引用

Chinese Journal of Electronics 2017年第3期26卷 530-536页

作者： CHEN Xiao DING Jie Nigel Thomas School of Computer Science and Communication Engineering Jiangsu University State Key Laboratory of Software Development Environment Beihang University School of Information Engineering Yangzhou University School of Computing Science Newcastle University

Given the popularity of smart environment in a hospital involving the participation of a large group of patients,scheduling of patients towards their desired destination is still being a challenging *** the development of Internet of Things(Io T),smart environments are increasingly being deployed in various public scenarios and in particular,hospitals are an important target environment for smart *** paper models a dynamic scheduling policy based on a patient flow scenario in order to solve the queuing issue and facilitate people’s *** dynamic scheduling policy aims to forward incoming patients to dissolve jams especially at the peaks by giving accurate predication of appointment *** main modelling technique is a formal method—Performance evaluation process algebra(PEPA).The findings show that the dynamic scheduling policy is able to efficiently improve the patient flow.

关键词： Dynamic scheduling Patient flow Smart environment Formal method Performance evaluation process algebra(PEPA)

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Load Balancing Method of Cloud-Center Based on SDN

引用

China communications 2016年第2期13卷 130-137页

作者： WANG Yong TAO Xiaoling HE Qian KUANG Yuwen Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology School of Information and Communication Guilin University of Electronic Technology

In order to balancing based on data achieve dynamic load flow level, in this paper, we apply SDN technology to the cloud data center, and propose a dynamic load balancing method of cloud center based on SDN. The approach of using the SDN technology in the current task scheduling flexibility, accomplish real-time monitoring of the service node flow and load condition by the OpenFlow protocol. When the load of system is imbalanced, the controller can allocate globally network resources. What＇s more, by using dynamic correction, the load of the system is not obvious tilt in the long run. The results of simulation show that this approach can realize and ensure that the load will not tilt over a long period of time, and improve the system throughput.

关键词： SDN cloud computing data center dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

Nonlinear characteristics and qualitative analysis of sleep EEG

Nonlinear characteristics and qualitative analysis of sleep ...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Shao, Chenxi Fan, Jinfeng Li, Shaobin Department of Computer Science and Technology USTC Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China Department of Computer Science and Technology USTC Hefei Anhui 230027 China

ISBN: (纸本)1424411203

Correlation dimension (CD) and the largest Lyapunov exponent (LLE), which are two most important nonlinear invariant measures of nonlinear system, are adopted to characterize the complexity and stability of human brain during all sleep stages. In order to And an optimal embedding to reconstruct phase space, the C-C method and Cao's algorithm were thoroughly analyzed and implemented in efficient ways. Additionally, the G-P algorithm and Kantz's algorithm are also implemented for calculation of CD and LLE respectively. Eight normal sleep EEG records are acquired from MIT-BIH sleep-EDF database for this study. The values of CD and LLE for 30s epochs are calculated, and their mean and standard deviation values are evaluated as well. The results indicate that CD and LLE decrease from the waking stage to stages I, II and III-IV, and they have large values during rapid eye movement (REM) sleep stage. Then, a qualitative conclusion may be drawn that during waking stage and REM sleep stage, brain activity has higher complexity and lower stability than during other stages. © 2007 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Tuning linux's load balancing algorithm for CMT system

Tuning linux's load balancing algorithm for CMT system

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Test case generation based on program invariant and adaptive random algorithm

Test case generation based on program invariant and adaptive...

引用

2011 International Conference on Computer Science and Education, CSE 2011

作者： Yuan, Yuan Fanping, Zeng Guanmiao, Zhu Chaoqiang, Deng Neng, Xiong Department of Computer University of Science and Technology of China China Anhui Province Key Lab. of Software in Computing and Communication Hefei Anhui China

ISBN: (纸本)9783642224171

Testing is a critical activity to find software errors. And choosing an effective test suite is the key problem in software testing area. Program invariant, as an attribute of program, can record the implementation state of test case very well and reveal the coverage of program data. In this paper, we integrate adaptive random testing and invariant technology, and present a new method which makes full use of the feedback information of program invariant and invalid case suite to generate the next case. Experiment results show that, compared with other similar methods, running for the same time, our method can achieve higher coverage and faster convergence speed. © 2011 Springer-Verlag.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Quantitative and qualitative forecasting applied to supply-chain inventory

Quantitative and qualitative forecasting applied to supply-c...

引用

2010 2nd International Conference on MultiMedia and Information Technology, MMIT 2010

作者： Shao, Chenxi Wang, Lizhong Computer Science and Technology School of University of Science and Technology of China Hefei China Anhui Province Key Laboratory Software in Computing and Communication Hefei 230027 China MOE-Microsoft Key Laboratory Multimedia Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9780769540085

In the process of supply chain (SC) management, time inventory management problem is extremely important. In terms of academic methods, quantitative methods are very popular as the researchers could calculate the inventory if they got the historic data of some SC. However, based on quantitative methods and the results cannot too be convincible. This paper considered a supply chain system includes several kinds of products. As to the historic suppliers' demand data of this SC system, firstly we applied a quantitative forecasting analysis method to it;secondly we made a qualitative analysis to improve the complex system's inventory management performance. According to the comparison between quantitative method and the method used in this paper, we find that the accuracy is more perfect. Not only the inventory cost is lower, also the forecasting accuracy is better. © 2010 IEEE.

关键词： Supply chain management

来源：评论

学校读者我要写书评

暂无评论

MLFuse: Multi-Scenario Feature Joint Learning for Multi-Modality Image Fusion

引用

IEEE Transactions on Multimedia 2025年

作者： Lei, Jia Li, Jiawei Liu, Jinyuan Wang, Bin Zhou, Shihua Zhang, Qiang Wei, Xiaopeng Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Dalian University of Technology School of Mechanical Engineering Dalian116024 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1010 New Zealand Ulster University Intelligent Systems Research Center LondonderryBT52 1SA United Kingdom

Multi-modality image fusion (MMIF) entails synthesizing images with detailed textures and prominent objects. Existing methods tend to use general feature extraction to handle different fusion tasks. However, these methods have difficulty breaking fusion barriers across various modalities owing to the lack of targeted learning routes. In this work, we propose a multi-scenario feature joint learning architecture, MLFuse, that employs the commonalities of multi-modality images to deconstruct the fusion progress. Specifically, we construct a cross-modal knowledge reinforcing network that adopts a multipath calibration strategy to promote information communication between different images. In addition, two professional networks are developed to maintain the salient and textural information of fusion results. The spatial-spectral domain optimizing network can learn the vital relationship of the source image context with the help of spatial attention and spectral attention. The edge-guided learning network utilizes the convolution operations of various receptive fields to capture image texture information. The desired fusion results are obtained by aggregating the outputs from the three networks. Extensive experiments demonstrate the superiority of MLFuse for infrared-visible image fusion and medical image fusion. The excellent results of downstream tasks (i.e., object detection and semantic segmentation) further verify the high-quality fusion performance of our method. The code is publicly available at https://***/jialei-sc/MLFuse. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Local reputation for P2P MMOG design

Local reputation for P2P MMOG design

引用

18th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2007

作者： Shanshan, Liu Jinlong, Li Xufa, Wang Anhui Key Laboratory of Software in Computation and Communication Computer Science Department University of Science and Technology of China

ISBN: (纸本)0769530494

The assignment of the computation and communication is one of the important problems in the design of peer-to-peer (P2P) Massively Multi-player Online Game (MMOG). A reputation mechanism for P2P MMOG is proposed in this paper to avoid the problems in P2P design. The communications among peers are described by whether the messages are received timely and correctly in the process of synchronization, and then the reliabilities of peers are quantified. The concept of local reputation is proposed, based on which the adaptive adjusting algorithm for the function of peers and the algorithm for getting update peer selecting reliable computing peers are brought forward to assign the computation and communication of the system. According to the experiments, the algorithms are effective for the distribution of the computation and communication. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

On the self representation based on the adaptive self radius

On the self representation based on the adaptive self radius

引用

4th International Workshop on Advanced Computational Intelligence, IWACI 2011

作者： Zhang, Jie Luo, Wenjian School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9781612843735

Self representation problem is very important for the negative selection algorithms. In this paper, two methods, named as K-NN-ASR and B-NN-ASR, are proposed to calculate the self radius of a self sample in the continuous space. As for the K-NN-ASR, the self radius of a self sample is calculated according to the distances from itself to the surrounding self samples. In the B-NN-ASR, both the position of the self sample and the distances to the surrounding self samples are considered. Experiments are done to test the performance of the proposed methods. Experimental results demonstrate that the proposed methods are competitive, and the B-NN-ASR is better. © 2011 IEEE.

关键词： selection algorithm Self tuning CONTINUOUS SPACE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：