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

International Conference on services systems and services Management, ICSSSM

作者： Zhiyang You Zhigang Sun Xibin Zhao Daxin Zang Department of Computer Science and Technology Tsinghua University Beijing China School of Software Tsinghua University Beijing China Key Laboratory of Information System Security Ministry of Education School of Software Tsinghua University Beijing China Software Engineering Institute Beijing Aeronautics and Astronautics University Beijing China

Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimization obtained, the robust schedule is more stable in execution. The vast majority of the researches on robust scheduling concentrate on the development of the robustness and stabilization with an optimization target that minimizes makespan. However, other optimization targets are needed in reality, and in this paper, we introduce another optimization target that maximizes the payload of the machine, which can reflect the capacity of machine. This work applies a two-step way to achieve a robust schedule. A baseline schedule in the deterministic environment is generated first, which pursues standard optimization criterions, and then the temporal buffers are inserted into the baseline schedule which make the schedule absorb some level of unexpected disruption without rescheduling. According to the payload of each machine which should be close to the maximum at any time in execution, we can get each size of the temporal buffers inserted into the different operations. An extensive experiment is used to show the relative performance of the proposed robust schedule. It is shown that the schedule is robust and stable under the stochastic disturbance coupling with minimal makespan tardiness and symmetry payload.

关键词： Robustness Payloads Job shop scheduling Uncertainty Processor scheduling Dynamic scheduling Stochastic processes Switches computer science Space technology

来源：评论

学校读者我要写书评

暂无评论

A collaborative framework for privacy protection in online social networks

A collaborative framework for privacy protection in online s...

引用

International Conference on Collaborative computing: Networking, Applications and Worksharing (CollaborateCom)

作者： Yan Zhu Zexing Hu Huaixi Wang Hongxin Hu Gail-Joon Ahn Key Laboratory of Network and Software Security Assurance Ministry of Education Peking University China Institute of Computer Science and Technology Peking University Beijing China School of Mathematical Sciences Peking University Beijing China Laboratory of Security Engineering for Future Computing (SEFCOM) Arizona State University Tempe AZ USA

With the wide use of online social networks (OSNs), the problem of data privacy has attracted much attention. Several approaches have been proposed to address this issue. One of privacy management approaches for OSN leverages a key management technique to enable a user to simply post encrypted contents so that only users who can satisfy the associate security policy can derive the key to access the data. However, the key management policies of existing schemes may grant access to unauthorized users and cannot efficiently determine authorized users. In this paper, we propose a collaborative framework which enforces access control for OSN through an innovative key management focused on communities. This framework introduces a community key management based on a new group-oriented convergence cryptosystem, as well as provides an efficient privacy preservation needed in a private OSN. To prove the feasibility of our approach, we also discuss a proof-of-concept implementation of our framework. Experimental results show that our construction can achieve the identified design goals for OSNs with the acceptable performance.

关键词： Cryptography Servers Kernel Data privacy Social network services Communities Collaboration

来源：评论

学校读者我要写书评

暂无评论

PARBLO:Page-Allocation-Based DRAM Row Buffer Locality Optimization

引用

Journal of computer science & technology 2009年第6期24卷 1086-1097页

作者：米伟冯晓兵贾耀仓陈莉薛京灵 Key Laboratory of Computer System and Architecture Institution of Computing Technology Chinese Academy of Sciences Graduate University of Chinese Academy of Sciences Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales

DRAM row buffer conflicts can increase memory access latency significantly. This paper presents a new pageallocation-based optimization that works seamlessly together with some existing hardware and software optimizations to eliminate significantly more row buffer conflicts. Validation in simulation using a set of selected scientific and engineering benchmarks against a few representative memory controller optimizations shows that our method can reduce row buffer miss rates by up to 76% （with an average of 37.4%）. This reduction in row buffer miss rates will be translated into performance speedups by up to 15% （with an average of 5%）.

关键词： DRAM row buffer page allocation locality optimization

来源：评论

学校读者我要写书评

暂无评论

QoS Requirement Generation and Algorithm Selection for Composite Service Based on Reference Vector

引用

Journal of computer science & technology 2009年第2期24卷 357-372页

作者：吴邦欲支志雄徐世杰顾明孙家广 School of Software Tsinghua University Key Laboratory for Information System Security Ministry of Education of China Department of Computer Science and Technology Tsinghua University

Under SOA （Service-Oriented Architecture）, composite service is formed by aggregating multiple component services together in a given workflow. One key criterion of this research topic is QoS composition. Most work on service composition mainly focuses on the algorithms about how to compose services according to assumed QoS, without considering where the required QoS comes from and the selection of user preferred composition algorithm among those with different computational cost and different selection results. In this paper, we propose to strengthen current service composition mechanism by generation of QoS requirement and its algorithm selection based on the QoS reference vectors which are calculated optimally from the existing individual services＇ QoS by registry to represent QoS overview about the best QoS, the worst （or most economical） QoS, or the average QoS of all composite services. To implement QoS requirement, which is determined according to QoS overview, this paper introduces two selection algorithms as two kinds of experiment examples, one aiming at the most accurate service selection and the other chasing for trade-off between selection cost and result. Experimental results show our mechanism can help the requester achieve his expected composite service with appropriate QoS requirement and customized selection algorithm.

关键词： service-oriented architecture service composition quality of services service selection

来源：评论

学校读者我要写书评

暂无评论

Risk analysis of physical protection system based on evidence theory

引用

Journal of Information and Computational science 2010年第13期7卷 2871-2878页

作者： Xu, Peida Su, Xiaoyan Wu, Jiyi Sun, Xiaohong Zhang, Yajuan Deng, Yong College of Computer and Information Sciences Southwest University Chongqing 400715 China Hangzhou Key Lab of E-Business and Information Security Hangzhou Normal University Zhejiang 310036 China College of Food Science and Technology Shanghai Ocean University Shanghai 201306 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China Key Subject Laboratory of National defense for Radioactive Waste and Environmental Security Southwest University of Science and Technology Mianyang 621010 China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai 200240 China

Risk evaluation is very important to the design and improvement of physical protection systems. In this paper, an evaluation method of multi-source information fusion is proposed based on the D-S evidence theory. In the proposed method, each individual component of the protection system in the simulated plane is modeled. Then, the threat report of each component according to the specific tactics is determined based on its real environment. Finally, the comprehensive threat distribution is obtained based on through the D-S evidence theory to combine multi-sources information. The proposed method can easily applied to the evaluation of the effectiveness of the protection system. We make the total threat of the protection system lowest through changes of the protection resources allocation. A numerical example is used to illustrate the efficiency of the proposed method. Copyright © 2010 Binary Information Press.

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

Co-optimization of Dynamic/Static Test PoWer in Scan Test

引用

电子学报(英文版) 2009年第1期18卷 54-58页

作者： WANG Wei HAN Yinhe LI Xiaowei FANG Fang School of Computer and Information Hefei University of Technology Hefei 230009 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China School of Management Hefei University of Technology Hefei 230009 China

Low-power design has become a challenge of test. We propose an effective low-power scan architecture named PowerSluice to minimize power consumption during scan test, which is based on scan chain modifications. On one hand, a kind of blocking logic is inserted into the scan chain to reduce the dynamic power and two kinds of controlling units are also inserted to decrease the leakage power during the shift cycle. On the other hand, using genetic algorithm, the exact values of control signals are found out to control the process. Experiments results indicate that this architecture can effectually reduce power during scan test with probably minimum area cost.

关键词：低功耗设计扫描测试静态测试动态优化合作控制单元电力消耗动态功耗

来源：评论

学校读者我要写书评

暂无评论

Client visor: Leverage COTS OS functionalities for power management in virtualized desktop environment 09

Client visor: Leverage COTS OS functionalities for power man...

引用

2009 ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, VEE'09

作者： Huacai, Chen Hai, Jin Zhiyuan, Shao Ke, Yu Kun, Tian Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Intel Corporation Shanghai 200241 China

ISBN: (纸本)9781605583754

As an emerging trend, virtualization is more and more widely used in today's computing world. But, the introduction of virtual machines bring trouble for the power management (PM for short), since the operating system can not directly access and control the hardware as before. Solutions were proposed to manage the power in the server consolidation case. However, such solutions are VMM-centric: the VMM gathers the PM decisions of the guests as hints, and makes the final decision to manipulate the hardware. These solutions do not fit well for the virtualized desktop environment, which is highly interactive with the users. In this paper, we propose a novel solution, called ClientVisor, to manage the power in the virtualized desktop environment. The key idea of our scheme is to leverage the functionalities of the Commercial-Off-The-Shelf (COTS) operating system, which actually interacts with the user, to manage the power of the processor and the peripheral devices in all possible cases. VMM coordinates the PM decisions of the guests only at the key points. By prototype implementation and experiments, we find our scheme results in 22% lower power consumption in the static power usage scenario, and about 8% lower in the dynamic scenario than the corresponding cases of Xen. Moreover, the experimental data shows that the deployment of our scheme will not deteriorate the user experience. Copyright © 2009 ACM.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A bipartite model for load balancing in grid computing environments

引用

中国高等学校学术文摘·计算机科学 2009年第4期3卷 503-523页

作者： Wenchao JIANG Matthias BAUMGARTEN Yanhong ZHOU Hai JIN School of Computer Science and Technology Hubei bioinformatics and molecular imaging key laboratoryHuazhong University of Science and TechnologyWuhan 430074China Information Engineering College of Faculty of Computing and Engineering University of UlsterShore RoadNewtownabbey BT37 0QBUK School of Computer Science and Technology Hubei bioinformatics and molecular imaging key laboratoryHuazhong University of Science and TechnologyWuhan 430074China

In this paper,a bipartite model for load balanchag (LB) in grid computing environments,called Transverse viewpoint-based Bi-Tier model (TBT),is *** can efficiently eliminate topology mismatching between overlay-and physical-networks during the load transfer *** an implementation of TBT,a novel LB policy called M~2ON (Min-cost and Max-flow Channel based Overlay Network) is *** M~2ON,the communication capability is denoted as M~2C (Min-cost and Max-flow Channel) which is obtained using a Labeled Tree Probing (LTP) *** computing capacity is denoted as the Idle Factor (IF) which is obtained from the semantic *** higher-and lower-level characteristics are combined into an Integrated Impacting Factor (IIF) using a Double Linear Inserting (DLI) *** on IIF,optimal topology matching can be achieved in the LB *** experiments and simulations have been performed and will be *** results show that M~2ON achieves more accurate topology matching with a minimum increment in the overall locating time yet achieving higher system performance as a whole.

关键词： grid computing load balancing (LB) min-cost and max-flow channel (M2C) topology mismatching labeled tree probing (LTP) double linear inserting (DLI)

来源：评论

学校读者我要写书评

暂无评论

ClientVisor: Leverage COTS OS functionalities for power management in virtualized desktop environment

ClientVisor: Leverage COTS OS functionalities for power mana...

引用

作者： Chen, Huacai Jin, Hai Shao, Zhiyuan Hu, Kan Yu, Ke Tian, Kun Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Intel Corporation Shanghai 200241 China

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Games on Weighted Newman-Watts Small-World Networks

引用

Chinese Physics Letters 2009年第5期26卷 255-258页

作者：杜文博曹先彬赵琳周宏 Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230026 School of Life Sciences University of Science and Technology of China Hefei 230026

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.

关键词： PRISONER'S dilemma game COOPERATIVENESS INCOME distribution SIMULATION methods & models GINI coefficient NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：