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

2014 IEEE International Conference on Automation Science and Engineering, CASE 2014

作者： Yang, Fajun Wu, Naiqi Qiao, Yan Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China Institute of Systems Engineering Macau University of Science and Technology China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

A multi-cluster tool is composed of a number of single-cluster tools linked by buffering modules. The capacity of a buffering module can be one or two. Aiming at finding an optimal one-wafer cyclic schedule, this work explores the effect of two-space buffering modules on the performance of a multi-cluster tool. The tool is modeled by a kind of Petri nets. The dynamic behavior of robot waiting and tasks, process modules, and buffers is well captured by the net model. With the model, this work shows that there is always a one-wafer cyclic schedule that reaches the lower bound of the cycle time of a process-dominant tool. Furthermore, a constant-time algorithm is revealed to find such a schedule for the first time for such multi-cluster tools. An illustrative example is given to show the application and power of this new method. © 2014 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

PICEA-g using an enhanced fitness assignment method

PICEA-g using an enhanced fitness assignment method

引用

IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, MCDM

作者： ZhiChao Shi Rui Wang Tao Zhang College of Information System and Management State Key Laboratory of High Performance Computing National University of Defense Technology ChangSha Hunan P.R. China

ISBN: (纸本)9781479944668

The preference-inspired co-evolutionary algorithm using goal vectors (PICEA-g) has been demonstrated to perform well on multi-objective problems. The superiority of PICEA-g originates from the smart fitness assignment, that is, candidate solutions are co-evolved with goal vectors along the search. In this study, we identify a limitation of this fitness assignment method, and propose an enhanced fitness assignment method which considers both the performance of goal vectors and the Pareto dominance rank on the fitness calculation of candidate solutions. Experimental results show that PICEA-g with the enhanced approach is effective, especially for bi-objective problems.

关键词： Vectors Evolutionary computation Pareto optimization Benchmark testing Sociology

来源：评论

学校读者我要写书评

暂无评论

SeaBase: An Implementation of Cloud Database

SeaBase: An Implementation of Cloud Database

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Shusheng Guo Zimu Yuan Li Zha Zhiwei Xu State Key Laboratory of Computer System and Architecture University of Chinese Academy of Sciences Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479967162

Cloud database usually refers to a database based on the cloud computing technology. However, as far as we know, pre-existing solutions of cloud database cannot integrate the data from multi-sourced heterogeneous databases, only supplying an isolated homogeneous database cluster. This paper presents a new implementation approach for cloud database: Sea Base, which integrates various data types into a unified one, based on the CCEVP(Cloud computing-based Effective-Virtual-Physical) model. The results of our experiments show that Sea Base is feasible and practical.

关键词： Databases Cloud computing Computational modeling Data integration Computers Computer architecture Data models

来源：评论

学校读者我要写书评

暂无评论

On-Chip Generating FPGA Configuration Bitstreams to Reduce Applycation-Independent Test Time

On-Chip Generating FPGA Configuration Bitstreams to Reduce A...

引用

The 4th International Workshop on Advanced Technologies in Programmable system on Chip(第四届片上可编程系统前沿技术研讨会)

作者： Da Wang Fei Wang Paolo Ienne Yu Hu Dongrui Fan Haigang Yang Key Laboratory of Computer System and Architecture Institute of Computing TechnologyCASBeijing100190China System on Programmable Chip Research DepartmentInstitute of ElectronicsCASBeijing100190China Processor Architecture LaboratoryEPFLLausanneSwitzerland

FPGA application independent test is very time-consuming due to repetitively loading of test configuration bitstreams into the FPGA and applying test *** shows that over 95%of FPGA application independent test time is spent on loading the test configuration ***,reducing the number of loading times could significantly reduce the FPGA test *** this paper,a new approach which can significantly reduce the FPGA test time will be *** this new approach,a configuration SRAM routing strategy is used first to enhance the correlation of the test bitstream configurations,then,on-chip test configuration generation structures are designed to transform a test bitstream configuration into other ones within limited *** results show that the proposed technique can at least reduce the configuration loading time by 81%,while getting 100%test *** hardware overhead is less than 1.2%upon the whole chip without any performance penalty.

关键词： FPGA test test configuration generation design-for-testability

来源：评论

学校读者我要写书评

暂无评论

Automated web service composition supporting conditional branch structures

引用

Enterprise Information systems 2014年第1期8卷 121-146页

作者： Wang, Pengwei Ding, Zhijun zhijun_ding@*** Jiang, Changjun Zhou, Mengchu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of “Embedded System and Service Computing” Ministry of Education Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 USA

The creation of value-added services by automatic composition of existing ones is gaining a significant momentum as the potential silver bullet in service-oriented architecture. However, service composition faces two aspects of difficulties. First, users' needs present such characteristics as diversity, uncertainty and personalisation; second, the existing services run in a real-world environment that is highly complex and dynamically changing. These difficulties may cause the emergence of nondeterministic choices in the process of service composition, which has gone beyond what the existing automated service composition techniques can handle. According to most of the existing methods, the process model of composite service includes sequence constructs only. This article presents a method to introduce conditional branch structures into the process model of composite service when needed, in order to satisfy users' diverse and personalised needs and adapt to the dynamic changes of real-world environment. UML activity diagrams are used to represent dependencies in composite service. Two types of user preferences are considered in this article, which have been ignored by the previous work and a simple programming language style expression is adopted to describe them. Two different algorithms are presented to deal with different situations. A real-life case is provided to illustrate the proposed concepts and methods. [ABSTRACT FROM AUTHOR]

关键词： conditional branch structure control construct service composition user preference web service

来源：评论

学校读者我要写书评

暂无评论

Research of feature selection and comparison in AdaBoost based object detection system

引用

Journal of Computational Information systems 2013年第22期9卷 8947-8954页

作者： Ju, Yucui Zhang, Hua Xue, Yanbing Key Laboratory of Computer Vision and System Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China

Selecting appropriate features for object representation to get high detection rate is quite challenging in object detection system. AdaBoost based object detection framework proposed by Viola and Jones is a milestone in object detection area. The problem of their work is high false alarm rate in complicated environment. To solve this problem, in this paper, HAAR features, MB-LBP features and HOG features are selected to be used in AdaBoost algorithm to compare the result of different features. We propose the ways to construct the weak classifier of MB-LBP and HOG features, so that the two features can apply to AdaBoost algorithm. We do experiments on indoor landmark detection which have different illumination and shape deformation caused by different views. Experiment shows that HAAR features have a higher detection rate and a higher false alarm rate, MB-LBP features can obtain a lower false alarm rate and a lower detection rate and HOG features can not only have high detection rate but also a lower false alarm rate. © 2013 Binary Information Press.

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

Team of Bayesian optimization algorithms to solve task assignment problems in heterogeneous computing systems

Team of Bayesian optimization algorithms to solve task assig...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Jie Li JunQi Zhang Qi Kang ChangJun Jiang Ministry of Education China Key Laboratory of Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai Department of Control Science and Engineering Tongji University Shanghai China

ISBN: (纸本)9781479938414

A Bayesian optimization algorithm (BOA) belongs to estimation of distribution algorithms (EDAs). It is characterized by combining a Bayesian network and evolutionary algorithms to solve nearly decomposable optimization problems. BOA is less popularly applied to solve high dimensionality complex optimization problems. A key reason is that the cost of training all dimensions by BOA becomes expensive with the increase of problem dimensionality. Since data are relatively sparse in a high dimensional space, even though BOA can train all dimensions simultaneously, the interdependent relations between different dimensions are difficult to learn. Its search ability is thus significantly reduced. In this paper, we propose a team of Bayesian optimization algorithms (TBOA) to search and learn dimensionality. TBOA consists of multiple BOAs, in which each BOA corresponds to a dimension of the solution domain and it is responsible for the search of this dimension's value region. The proposed TBOA is used to solve the real problem of task assignment in heterogeneous computing systems. Extensive experiments demonstrate that the computational cost of the overall training in TBOA is decreased very significantly while keeping high solution accuracy.

关键词： Bayes methods Sociology Statistics Optimization Computational efficiency Joints Probability distribution

来源：评论

学校读者我要写书评

暂无评论

A New Class of Learning Automata for Selecting an Optimal Subset

A New Class of Learning Automata for Selecting an Optimal Su...

引用

IEEE International Conference on systems, Man, and Cybernetics

作者： JunQi Zhang ZeZhou Li Qi Kang MengChu Zhou Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Department of Control Science and Engineering Tongji University Department of Electrical and Computer Engineering New Jersy Institute of Technology

ISBN: (纸本)9781479938414

Interacting with a random environment, Learning Automata (LAs) are automata that, generally, have the task of learning the optimal action based on responses from the environment. Distinct from the traditional goal of Learning Automata to select only the optimal action out of a set of actions, this paper considers a multiple-action selection problem and proposes a novel class of Learning Automata for selecting an optimal subset of actions. Their objective is to identify the optimal subset: the top k out of r actions. Based on conventional continuous pursuit and discretized pursuit learning schemes, this paper introduces four pursuit learning schemes for selecting the optimal subset, called continuous equal pursuit, discretized equal pursuit, continuous unequal pursuit and discretized unequal pursuit learning schemes, respectively. In conjunction with a reward-inaction learning paradigm, the above four schemes lead to four versions of pursuit Learning Automata for selecting the optimal subset. The simulation results present a quantitative comparison between them.

关键词： Learning Automata Optimal subset Pursuit algorithm

来源：评论

学校读者我要写书评

暂无评论

Topic search ranking algorithm based on user's query intent

引用

Journal of Computational Information systems 2013年第17期9卷 6955-6962页

作者： Zhao, Dexin Zhang, Meizhen Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin 300384 China Tianjin Key Laboratory of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin 300384 China

It is a hot issue that how to achieve information retrieval rapidly and accurately in accordance with the user's query intent on the internet information retrieval research. In order to solve the theme drift problem existing in PageRank algorithms, this paper presents a topic sorting algorithm named as SC-PageRank, which is based on the user's query analysis. We use Markov chain model to compute the correlation between the user's query intent and the website theme. Simulation results demonstrate the effectiveness of the proposed method. © 2013 Binary Information Press.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection based on rough set and BP neural network for android system

引用

Journal of Information and Computational Science 2013年第11期10卷 3463-3468页

作者： Wang, Chundong Zhou, Yan Zeng, Qinghui Zhang, Yaohui Wang, Huaibin Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 China

As the Android smart phone becomes more and more popular, its security problems stands out increasingly. According to the advantages and the problems existing in rough sets and neural network, this paper presents a new method which can be used in the Android system anomaly detection. This method simplifies the rough set data based on their attributes, and then use the data as training data to establish a classification model. The experiment results show that: for Android phones, this method has a high recognition rate and detection rate of abnormal behaviors. © 2013 Binary Information Press.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：