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

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

来源：评论

学校读者我要写书评

暂无评论

Aptitude-Based Methodology for Agent-Oriented Software Engineering

Aptitude-Based Methodology for Agent-Oriented Software Engin...

引用

2010 IEEE International Conference on Sofetware Engineering and Service sciences(2010 软件工程与服务科学国际学术会议 ICSESS)

作者： Chaoming Li Kenwen Wang Department of Computer Science Sun Yat-sen UniversityGuangZhou China Key laboratory of High Confi Department of Information Technology Griffith University Brisbane Australia

In order to build dynamic and open MultiAgent systems (MAS) for heterogeneous intelligent entities, we define aptitude model to abstract the intelligent properties for heterogeneous entities, and present an aptitude-based methodology (ABM). By the aptitude model and the methodology, dynamic agent model can be built as a platform and different kinds of entities can implement the agent model to act roles in application domain. In the MAS constructed by ABM, the organization is dynamic by different implementation for roles. In addition, we set a human-machine cooperative gobang system at example. As far as we know, ABM is the first Agent-Oriented Methodology to build dynamic and open MAS for heterogeneous intelligent entities.

关键词： Agent-Oriented Aptitude-based methodology dynamic opening

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Logic-Based Frame for Knowledge Reasoning in Real-time security Analysis

A Logic-Based Frame for Knowledge Reasoning in Real-time Sec...

引用

2010 IEEE International Conference on Sofetware Engineering and Service sciences(2010 软件工程与服务科学国际学术会议 ICSESS)

Continuous time Markov chains (CTMCs) have been used in real-time dependability and security analysis. However, existing approaches assume that the system is fully observable to a system attacker, which is not feasible for current large network systems. In this paper, we present a frame to model and specify the knowledge of attacker with partial observations. Firstly, we combine CTMCs and interpretation system as basic model. Then, a logic is defined to specify the knowledge for agents in the stochastic model. Further, we discuss the properties under different assumption for the model and agent. Finally, we present the model checking algorithms with a particular assumption and apply the frame to model the knowledge of attacker in intrusion-tolerant system.

关键词： CTMCs security analysis probabilistic knowledge logic partial observation

来源：评论

学校读者我要写书评

暂无评论

On the Power Allocation for Relay Networks with Finite-Alphabet Constraints

On the Power Allocation for Relay Networks with Finite-Alpha...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Weiliang Zeng Mingxi Wang Chengshan Xiao Jianhua Lu State Key Laboratory on Microwave and Digital Communications Tsinghua National Laboratory of Information Science and Technology Department of Electronic Engineering Tsinghua University Beijing China Department of Electrical & Computer Engineering Missouri University of Science and Technology MO USA

In this paper, we investigate the optimal power allocation scheme for relay networks with finite-alphabet constraints. It has been shown that the previous work utilizing various design criteria with the Gaussian inputs assumption may lead to significant loss for a practical system with finite constellation set constraint, especially when signal-to-noise ratio (SNR) is in medium-to-high regions, or when the channel coding rate is medium to high. An optimal power allocation scheme is proposed to maximize the mutual information for the relay networks under discrete-constellation input constraint. Numerical examples show that significant gain can be obtained compared to the conventional counterpart for nonfading channels and fading channels. At the same time, we show that the large performance gain on the mutual information will also represent the large gain on the bit-error rate (BER), i.e., the benefit of the power allocation scheme predicted by the mutual information can indeed be harvested and can provide considerable performance gain in a practical system.

关键词： Mutual information Relays Resource management Peer to peer computing Signal to noise ratio Array signal processing Performance gain

来源：评论

学校读者我要写书评

暂无评论

Hybrid uniform distribution of particle swarm optimizer

引用

IEICE Transactions on Fundamentals of Electronics, Communications and computer sciences 2010年第10期E93-A卷 1782-1791页

作者： Zhang, Junqi Tan, Ying Ni, Lina Xie, Chen Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Qingdao China Tongji University Shanghai 200092 China Key Laboratory of Machine Perception Ministry of Education Qingdao China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

Particle swarm optimizer (PSO) is a stochastic global optimization technique based on a social interaction metaphor. Because of the complexity, dynamics and randomness involved in PSO, it is hard to theoretically analyze the mechanism on which PSO depends. Statistical results have shown that the probability distribution of PSO is a truncated triangle, with uniform probability across the middle that decreases on the sides. The "truncated triangle" is also called the "Maya pyramid" by Kennedy. However, very little is known regarding the sampling distribution of PSO in itself. In this paper, we theoretically analyze the "Maya pyramid" without any assumption and derive its computational formula, which is actually a hybrid uniform distribution that looks like a trapezoid and conforms with the statistical results. Based on the derived density function of the hybrid uniform distribution, the search strategy of PSO is defined and quantified to characterize the mechanism of the search strategy in PSO. In order to show the significance of these definitions based, on the derived hybrid uniform distribution, the comparison between the defined search strategies of the classical, linear decreasing weight based PSO and the canonical constricted PSO suggested by Clerc is illustrated and elaborated. Copyright © 2010 The Institute of Electronics, information and Communication Engineers.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Reliability-based CBM system design for feed water pump

RETRACTED ARTICLE: Reliability-based CBM system design for f...

引用

作者： Qin, Jinlei Niu, Yuguang Li, Zheng Information and Network Management Center North China Electric Power University Baoding China Key Laboratory of Condition Monitoring and Control for Power Plant Equipment Ministry of Education North China Electric Power University Beijing China Department of Computer Science and Technology North China Electric Power University Beijing China

ISBN: (纸本)9781424455386

The condition-based maintenance (CBM) technique has been widely used in the power plant in China. Feed water pump is one of the most important general requirements in the power plant. its reliability plays an important part in the safety of the complete running. On the basis of practical situation in one power plant, a system for condition-based maintenance of the feed water pump in said power plant has been designed. Taking the reliability as the center, and based on failure mode and effects analysis (FMEA) maintenance scheme can be made and initiative maintenance can be carried out. Practical operation shows that the said system can fully enhance the reliability of equipment, ensuring the safe operation of generating units to improve the economic benefits of power plants. © 2010 IEEE.

关键词： Outages

来源：评论

学校读者我要写书评

暂无评论

LEEN: Locality/Fairness-Aware key Partitioning for MapReduce in the Cloud

LEEN: Locality/Fairness-Aware Key Partitioning for MapReduce...

引用

IEEE International Conference on Cloud Computing technology and science (CloudCom)

作者： Shadi Ibrahim Hai Jin Lu Lu Song Wu Bingsheng He Li Qi Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China School of Computer Engineering Nanyang Technological University Singapore Information and Technology Department China Development Bank Beijing China

This paper investigates the problem of Partitioning Skew in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence of partitioning skew causes a huge amount of data transfer during the shuffle phase and leads to significant unfairness on the reduce input among different data nodes. As a result, the applications experience performance degradation due to the long data transfer during the shuffle phase along with the computation skew, particularly in reduce phase. We develop a novel algorithm named LEEN for locality-aware and fairness-aware key partitioning in MapReduce. LEEN embraces an asynchronous map and reduce scheme. All buffered intermediate keys are partitioned according to their frequencies and the fairness of the expected data distribution after the shuffle phase. We have integrated LEEN into Hadoop-0.18.0. Our experiments demonstrate that LEEN can efficiently achieve higher locality and reduce the amount of shuffled data. More importantly, LEEN guarantees fair distribution of the reduce inputs. As a result, LEEN achieves a performance improvement of up to 40% on different workloads.

关键词： Partitioning algorithms Distributed databases Cloud computing Performance evaluation Time factors Degradation Kernel

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Data Access Control systems with User Accountability in Cloud Computing

Fine-Grained Data Access Control Systems with User Accountab...

引用

IEEE International Conference on Cloud Computing technology and science (CloudCom)

作者： Jin Li Gansen Zhao Xiaofeng Chen Dongqing Xie Chunming Rong Wenjun Li Lianzhang Tang Yong Tang School of Computer Science and Educational Software Guangzhou University China School of Software Sun Yat-sen University China School of Computer Science Guangzhou University China Key Laboratory of Computer Networks and Information Security Xidian University China Department of Electrical Engineering and Computer Science Stavenger University Norway

Cloud computing is an emerging computing paradigm in which IT resources and capacities are provided as services over the Internet. Promising as it is, this paradigm also brings forth new challenges for data security and access control when users outsource sensitive data for sharing on cloud servers, which are likely outside of the same trust domain of data owners. To maintain the confidentiality of, sensitive user data against untrusted servers, existing work usually apply cryptographic methods by disclosing data decryption keys only to authorized users. However, in doing so, these solutions inevitably introduce heavy computation overhead on the data owner for key distribution and data management when fine-grained data access control is desired, and thus do not scale well. In this paper, we present a way to implement, scalable and fine-grained access control systems based on attribute-based encryption (ABE). For the purpose of secure access control in cloud computing, the prevention of illegal key sharing among colluding users is missing from the existing access control systems based on ABE. This paper addresses this challenging open issue by defining and enforcing access policies based on data attributes and implementing user accountability by using traitor tracing. Furthermore, both the user grant and revocation are efficiently supported by using the broadcast encryption technique. Extensive analysis shows that the proposed scheme is highly efficient and provably secure under existing security models.

关键词： Access control Servers Encryption Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Functional analysis and security tests of online collaborative working platform for Shanghai EXPO 2010

引用

Journal of information and Computational science 2010年第7期7卷 1561-1570页

作者： Wang, Yong Deng, Liwen Ruan, Da Jin, Jian Department of Computers Science and Technology Shanghai University of Electric Power Laboratory of Power System Network Security Shanghai 200090 China Chang Jiang Computer Group Corporation Shanghai China Ghent University 2400 Mol 9000 Gent Belgium Department of Computers Science and Technology East China Normal University Shanghai 200241 China

The paper presents functional analysis and security tests of online collaborative working platform for 2010 Shanghai EXPO participants. Under the framework of the computer supported cooperative work (CSCW) platform, we illustrate the project development procedure including operating environments, development environments, and document designs. All the design procedures obey on the online Shanghai EXPO requirements. After the platform is established, we make functional analysis and security tests by both our team and a third party. The experimental results show that the online Shanghai Expo CSCW platform is secure and efficient for distributed participant services. Copyright © 2010 Binary information Press.

关键词： Functional analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：