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

A service-oriented priority-based resource scheduling scheme for virtualized utility computing 08

Proceedings of the 15th international conference on High performance computing

作者： Ying Song Yaqiong Li Hui Wang Yufang Zhang Binquan Feng Hongyong Zang Yuzhong Sun Key Lab. of Computer System and Architecture Inst. of Computing Techn. Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China and Graduate Univ. of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China

ISBN: (纸本)9783540898931

In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility computing. In RAINBOW, we present a priority-based resourcescheduling scheme including resource flowing algorithms (RFaVM) to optimizeresource allocations amongst services. The principle of RFaVM is preferentiallyensuring performance of some critical services by degrading of others to someextent when resource competition arises. Based on our prototype, we evaluateRAINBOW and RFaVM. The experimental results show that RAINBOWwithout RFaVM provides 28%-324% improvements in service performance,and 26% higher the average CPU utilization than traditional service computingframework (TSF) in typical enterprise environment. RAINBOW with RFaVMfurther improves performance by 25%-42% for those critical services whileonly introducing up to 7% performance degradation to others, with 2%-8%more improvements in resource utilization than RAINBOW without RFaVM.

关键词： resource scheduling utility computing virtualization

来源：评论

学校读者我要写书评

暂无评论

Multi-period decision for HRP of an employee leasing center with one type of employees

Multi-period decision for HRP of an employee leasing center ...

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Mei Han Junqing Sun Institute of Technology for the Deaf Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology School of Computer Science Tianjin University of Technology Tianjin China

This paper studies the issue of human resource plan in an employee leasing center. The center is engaged in the business of leasing its own contract employees and acting as an agent for flexible employees outside the center. The employees considered in this paper belong to one type of employees that are high-ranked and important for the firms. But this type of employees can be classified into two parts: the contract employees in the employee leasing center and the temporary employees in the manpower market. At first we take into account recruitment/dismissal factors and propose stochastically optimal multi-period decision model of the problem. In the model there are stochastic constraint conditions and the decision (control) in each period is the number of the contract employees that are recruited or dismissed by the center and the objective is to maximize the overall expected net revenue of the center over planning horizon. Then we transform the stochastic optimal control problem into the determined optimal control problem by transforming stochastic constraint conditions into determined constraint conditions. Furthermore we analyze the limits of the states in each period, develop a dynamic programming algorithm to search for an optimal solution to the problem and a heuristic approximate algorithm to find out an approximate optimal solution. Analyzing reveals that the heuristic algorithm is superior to the dynamic programming in time complexity. Finally, we use two algorithms to solve some simulating data case. The results reveal that the error between the two solutions is no more than 5% for each case.

关键词： Human resource management Paper technology Contracts Stochastic processes Optimal control Dynamic programming Heuristic algorithms Robotics and automation Intelligent robots Sun

来源：评论

学校读者我要写书评

暂无评论

On reducing both shift and capture power for sean-based testing

On reducing both shift and capture power for sean-based test...

引用

2008 Asia and South Pacific Design Automation Conference, ASP-DAC

作者： Li, Jia Xu, Qiang Hu, Yu Li, Xiaowei Key Laboratory of Computer System and Architecture ICT Chinese Academy of Sciences Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing 100080 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Center for Intelligent System and Biomimetics Institute of Advanced Integration Technology CAS/CUHK Shenzhen 518067 China

ISBN: (纸本)9781424419227

Power consumption in scan-based testing is a major concern nowadays. In this paper, we present a new X-filling technique to reduce both shift power and capture power during scan tests, namely LSC-filling. The basic idea is to use as few as possible X-bits to keep the capture power under the peak power limit of the circuit under test (CUT), while using the remaining X-bits to reduce the shift power to cut down the CUT's average power consumption during scan tests as much as possible. In addition, by carefully selecting the X-filling order, our X-filling technique is able to achieve lower capture power when compared to existing methods. Experimental results on ISCAS'89 benchmark circuits show the effectiveness of the proposed methodology. ©2008 IEEE.

关键词： Filling

来源：评论

学校读者我要写书评

暂无评论

Mahalanobis distance based Polynomial Segment Model for Chinese Sign Language Recogniton

Mahalanobis distance based Polynomial Segment Model for Chin...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yu Zhou Xilin Chen Debin Zhao Hongxun Yao Wen Gao School of Computer Science and Technology Harbin Institute of Technology Harbin China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Institute of Digital Media Peking University Beijing China

Sign Language Recognition (SLR) systems are mostly based on Hidden Markov Model (HMM) and have achieved excellent results. However, the assumption of frame independence in HMM makes it inconsistent with the characteristic of strong temporal correlation in sign language signals. Polynomial Segment Model (PSM) explicitly represents the temporal evolution of sign language features as a Gaussian process with time-varying parameters. In this paper PSM is first introduced to SLR framework to solve the temporal correlation problem. Considering the correlation among the coefficients of polynomial trajectorypsilas different orders, Mahalanobis distance is used as the classification criterion to evaluate the likelihood of test data. Experimental results show that our method outperform the conventional HMM methods by 6.81% in recognition accuracy.

关键词： Hidden Markov models Handicapped aids Distance measurement Trajectory Vocabulary Euclidean distance Polynomials

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallelization of a Protein Sequence Comparison Algorithm on Manycore architecture

Efficient Parallelization of a Protein Sequence Comparison A...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Xiaochun Ye Van Hoa Nguyen Dominique Lavenier Dongrui Fan Chinese Academy of Sciences Beijing China Key Lab of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China CNRS IRISA/INRIA Rennes France

This paper introduces the Godson-T manycore architecture and demonstrates the efficiency of its synchronization mechanism through a computation intensive bioinformatics application: the comparison of protein banks. The parallel part of the protein sequence comparison algorithm can nearly get a linear speed-up thanks to a fine tuning of the synchronization mechanism provided by the Godson-T chip.

关键词： Protein sequence Bioinformatics computer architecture Genomics Databases Tiles computer displays Scanning probe microscopy Distributed computing Application software

来源：评论

学校读者我要写书评

暂无评论

Segmentation of SAR image based on the incremented SOFM network and multiscale autoregressive model

引用

Journal of Information and Computational Science 2008年第1期5卷 233-239页

作者： Wen, Xianbin Zhang, Hua Zhang, Peng School of Computer Science and Technology Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin 300191 China Information Institute Tianjin Academy of Agricultural Sciences Tianjin 300192 China

An efficient multiscale approach for segmentation of the synthetic aperture radar images is presented based on combining the multiscale feature of SAR image with the self-organizing feature map (SOFM) network. Firstly, we employ multiscale autoregressive model for extracting the feature of SAR image, which is the input of the network. Secondly, SOFM networks are trained and applied to SAR image segmentation by using the algorithm we have proposed. Experiments of SAR image segmentation are shown to validate the procedure.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Multiscale unsupervised segmentation of SAR imagery using genetic-based em algorithm

引用

Journal of Information and Computational Science 2008年第1期5卷 367-374页

作者： Wen, Xianbin Zhang, Peng School of Computer Science and Technology Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin 300191 China Information Institute Tianjin Academy of Agricultural Sciences Tianjin 300192 China

A valid multiscale unsupervised segmentation of synthetic aperture radar (SAR) imagery is proposed by combining Expectation Maximization with the genetic algorithm (GA). The mixture multiscale stochastic model is introduced to characterize and exploit the scale-to-scale statistical variations and statistical variations in same scale in SAR imagery due to radar speckle, and segmentation method is given by combining the GA algorithm with EM algorithm. The algorithm is capable of selecting the number of components of the model by using the minimum description length criterion. Our approach benefits from the properties of Genetic algorithms and the EM algorithm by combination of both into a single procedure. The experiments on the SAR images show that the proposed method outperforms the EM method.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast slide mark compact algorithm

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2008年第10期36卷 1955-1960页

作者： Zou, Qiong Zhang, Long-Bing Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Allocation order is the best for locality, which slide mark compact algorithm is based on. But traditional design made the algorithm's overhead too large. We proposed a fast slide mark compact algorithm, which reduces the overhead by mark bit table, live block pool and offset table. The results show that it achieves up to 8.9% speedup in industry-standard benchmark SPEC JVM98 on the Pentium 4, 11% improvement in dtlb miss numbers and 13.6% reduce with L2 cache miss numbers.

关键词： Garbage collection Live block pool Mark bit table Mark compact Offset table

来源：评论

学校读者我要写书评

暂无评论

A low-cost pedestrian-detection system with a single optical camera

A low-cost pedestrian-detection system with a single optical...

引用

作者： Cao, Xian-Bin Qiao, Hong Keane, John IEEE Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China Laboratory of Complex Systems and Intelligent Science Institute of Automation Chinese Academy of Sciences Beijing 100080 China School of Informatics University of Manchester M60 1QD Manchester United Kingdom University of Manchester M13 9PL Manchester United Kingdom

The ultimate purpose of a pedestrian-detection system (PDS) is to reduce pedestrian-vehicle-related injury. Most such systems tend to adopt expensive sensors, such as infrared devices, in expectation of better performance. In comparison, a low-cost optical-camera-based system has much potential practical value, including a greater detection range, and can easily be trained to detect other objects. However, such low-cost systems are difficult to design (e.g., little original information can be collected, and the scene is very complex). To address these problems, an effective and reliable classifier is needed. The classifier should have a proper structure, its features need to be well selected, and a large number of high-quality samples are necessary for training. In this paper, we present a low-cost PDS which only uses a single optical camera. We design a cascade classifier to achieve an effective and reliable detection. First, our system scans two sequential frames at each zoom scale with a sliding window. Second, with each window, both appearance and motion features are extracted. A well-trained cascade classifier, combining statistical learning with a decomposed support-vector-machine classifier, then determines whether the window contains a human body. At the same time, to provide as much information as possible about the pedestrian, a small-scale weighted template tree trained by a coevolutionary algorithm is adopted to identify each pedestrian's direction, and the distance of each from the vehicle is also provided using an estimation algorithm. During the training procedure, we select key features by using the AdaBoost algorithm and a large number of high-quality samples. Experimental results demonstrate that the system is suitable for pedestrian detection in city traffic: The detection speed is more than 10 ft/s, the detection rate reaches 80%, and the false positive rate is no more than 0.3‰. © 2008 IEEE.

关键词： Pedestrian safety

来源：评论

学校读者我要写书评

暂无评论

Capacity-shared heterogeneous CMP cache

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2008年第5期45卷 877-885页

作者： Gao, Xiang Zhang, Longbing Hu, Weiwu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China

The characteristics of advanced integrated circuit technologies require architects to look for new ways to utilize large numbers of gates and mitigate the effects of high interconnect delays. Chip multiprocessors (CMPs) exploit increasing transistor counts by placing multiple processors on a single die. As the chip multiprocessors (CMPs) have become the trend of high performance microprocessors, the target workloads become more and more diversified. Due to the wire delay problem and diversity of applications, neither private nor shared caches can provide both large capacity and fast access in CMPs. A novel CMP cache design, the heterogeneous CMP cache (HCC) is presented, in which chips are constructed by tiles of two different categories. L2 caches of private tiles provide lowest hit latency and L2 cache of shared tiles increases the effective cache capacity for shared data. Incorporating indirect-index cache technology to share capacity between different hierarchies, HCC provide a both capacity-effective and access-fast on-chip memory subsystem. Detailed full-system simulations are used to analyze the HCC performance for various programs, including SPEC CPU2000, SPLASH2 and commercial workloads. The result shows that HCC improves performance by 16% for single-threaded benchmarks and 9% for multi-thread benchmarks. HCC is easy to implement and the design ideas will be used in the future multi-core processors of Godson series.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：