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

A novel hybrid dynamic programming algorithm for a two-stage supply chain scheduling problem

8th International Conference on Learning and intelligent OptimizatioN, LION 2014

作者： Pei, Jun Liu, Xinbao Fan, Wenjuan Pardalos, Panos M. Liu, Lin School of Management Hefei University of Technology Hefei 230009 China Center for Applied Optimization Department of Industrial and Systems Engineering University of Florida Gainesville FL 32601 United States Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education Hefei 230009 China Department of Computer Science North Carolina State University Raleigh NC 27695-7534 United States

ISBN: (纸本)9783319095837

This study addresses a two-stage supply chain scheduling problem, where the jobs need to be processed on the manufacturer's serial batching machine and then transported by vehicles to the customer for further processing. The size and processing time of the jobs are varying due to the differences of types, and setup time is needed before processing one batch. For the problem with minimizing the makespan, we formalize it as a mixed integer programming model. In addition, the structural properties and lower bound of the problem are provided. Based on the analysis above, a novel hybrid dynamic programming algorithm, combining dynamic programming and heuristics, is proposed to solve the problem. Furthermore, its time complexity is also analyzed. By comparing the experimental results of our proposed algorithm with the heuristics B F F and L F F , we demonstrate that our proposed algorithm has better performance and can solve the problem in a reasonable time. © 2014 Springer International Publishing.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

SpongeDirectory: Flexible sparse directories utilizing multi-level memristors

SpongeDirectory: Flexible sparse directories utilizing multi...

引用

International Conference on Parallel Architecture and Compilation Techniques (PACT)

作者： Lunkai Zhang Dmitri Strukov Hebatallah Saadeldeen Dongrui Fan Mingzhe Zhang Diana Franklin Department of Computer Science ICT Chinese Academy of Sciences Electrical and Computer Engineering State Key Laboratory of Computer Architecture ICT Chinese Academy of Sciences ICT Key Lab of Intelligent Information Processing

ISBN: (纸本)9781509066070

Cache-coherent shared memory is critical for programmability in many-core systems. Several directory-based schemes have been proposed, but dynamic, non-uniform sharing make efficient directory storage challenging, with each giving up storage space, performance or energy. We introduce SpongeDirectory, a sparse directory structure that exploits multi-level memristory technology. SpongeDirectory expands directory storage in-place when needed by increasing the number of bits stored on a single memristor device, trading latency and energy for storage. We explore several SpongeDirectory configurations, finding that a provisioning rate of 0.5× with memristors optimized for low energy consumption is the most competitive. This optimal SpongeDirectory configuration has performance comparable to a conventional sparse directory, requires 18× less storage space, and consumes 8× less energy.

关键词： Memristors Coherence Resistance Benchmark testing system-on-chip Random access memory Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Measurement of the Inelastic Proton-Proton Cross Section at s=13 TeV with the ATLAS Detector at the LHC

引用

Physical Review Letters 2016年第18期117卷 182002-182002页

作者： M. Aaboud G. Aad B. Abbott J. Abdallah O. Abdinov B. Abeloos R. Aben O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya L. Adamczyk D. L. Adams J. Adelman S. Adomeit T. Adye A. A. Affolder T. Agatonovic-Jovin J. Agricola J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli H. Akerstedt T. P. A. Åkesson A. V. Akimov G. L. Alberghi J. Albert S. Albrand M. J. Alconada Verzini M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali M. Aliev G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani M. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio K. Amako Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos A. Amorim S. Amoroso G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders G. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi P. Anger A. Angerami F. Anghinolfi A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque A. T. H. Arce F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi B. Åsman L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos M. A. Baak A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes M. Backhaus P. Bagiacchi P. Bagnaia Y. Bai J. T. Baines O. K. Baker E. M. Baldin P. Balek T. Balestri F. Balli W. K. Balunas E. Banas Sw. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S Barisits T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Basalaev A. Bassalat R. L. Bates S. J. Batista J. R. Batley M. Battaglia M. Bauce F. Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA University of Iowa Iowa City Iowa USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Nikhef National Institute for Subatomic Physics and University of Amsterdam Amsterdam Netherlands Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene Oregon USA Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Physics Department Brookhaven National Laboratory Upton New York USA Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Oliver Lodge Laboratory University of Liverpool Liverpool United Kingdom Institute of Physics University of Belgrade Belgrade Serbia II Physikalisches Institut Georg-August-Universität Göttingen Germany Laboratório de Instrumentação e Física Experimental de Partículas—LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos and CAFPE Universidad de Granada Granada Spain Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nu

This Letter presents a measurement of the inelastic proton-proton cross section using 60 μb−1 of pp collisions at a center-of-mass energy s of 13 TeV with the ATLAS detector at the LHC. Inelastic interactions are selected using rings of plastic scintillators in the forward region (2.07<|η|<3.86) of the detector. A cross section of 68.1±1.4 mb is measured in the fiducial region ξ=MX2/s>10−6, where MX is the larger invariant mass of the two hadronic systems separated by the largest rapidity gap in the event. In this ξ range the scintillators are highly efficient. For diffractive events this corresponds to cases where at least one proton dissociates to a system with MX>13 GeV. The measured cross section is compared with a range of theoretical predictions. When extrapolated to the full phase space, a cross section of 78.1±2.9 mb is measured, consistent with the inelastic cross section increasing with center-of-mass energy.

关键词： Particle interactions Particle production Quark & gluon jets Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ProvenanceLens: Service provenance management in the cloud

ProvenanceLens: Service provenance management in the cloud

引用

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

作者： Tao Li Ling Liu Xiaolong Zhang Kai Xu Chao Yang Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System School of Computer Wuhan University of Science and Technology School of Computer Science. Georgia Institute of Technology Atlanta GA USA Computer Science and Information Engineering Hubei University Wuhan China

ISBN: (纸本)9781479953288

Service provenance can be defined as a profile of service execution history. Queries of service provenance data can answer questions such as when and by whom a server is invoked? which services operate on this data? What might be the root cause for the service failure? Most of the organizations today collect and manage their own service provenance in order to trace service execution failures, locate service bottlenecks, guide resource allocation, detect and prevent abnormal behaviors. As services become ubiquitous, there is an increasing demand for proving service provenance management as a service. This paper describes ProvenanceLens, a two-tier service provenance management framework. The top tier is the service provenance capturing and storage subsystem and the next tier provides analysis and inference capabilities of service provenance data, which are value-added functionality for service health diagnosis and remedy. Both tiers are built based on the service provenance data model, an essential and core component of ProvenanceLens, which categorizes all service provenance data into three broad categories: basic provenance, composite provenance and application provenance. In addition, ProvenanceLens provides a suite of basic provenance operations, such as select, trace, aggregate. The basic provenance data is collected through a light-weight service provenance capturing subsystem that monitors service execution workflows, collects service profiling data, encapsulates service invocation dependencies. The composite and application provenance data are aggregated through a selection of provenance operations. We demonstrate the effectiveness of ProvenanceLens using a real world educational service currently in operation for a dozen universities in China.

关键词： Silicon Analytical models Data models Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Evolutionary membrane computing: A comprehensive survey and new results

Evolutionary membrane computing: A comprehensive survey and ...

引用

作者： Zhang, Gexiang Gheorghe, Marian Pan, Linqiang Pérez-Jiménez, Mario J. School of Electrical Engineering Southwest Jiaotong University Chengdu 610031 China Department of Computer Science University of Sheffield Regent Court Portobello Street Sheffield S1 4DP United Kingdom Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China Department of Computer Science and Artificial Intelligence University of Sevilla Avda. Reina Mercedes s/n Sevilla 41012 Spain

Evolutionary membrane computing is an important research direction of membrane computing that aims to explore the complex interactions between membrane computing and evolutionary computation. These disciplines are receiving increasing attention. In this paper, an overview of the evolutionary membrane computing state-of-the-art and new results on two established topics in well defined scopes (membrane-inspired evolutionary algorithms and automated design of membrane computing models) are presented. We survey their theoretical developments and applications, sketch the differences between them, and compare the advantages and limitations. © 2014 Elsevier Inc. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Protein folding structure optimization based on GAPSO algorithm in the off-lattice model

Protein folding structure optimization based on GAPSO algori...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiaoli Lin Xiaolong Zhang Department of City College Wuhan University of Science and Technology Wuhan China Hubei Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479956708

Predicting the spacial folding structure of a protein, given its sequence of amino acids, is one of the central problems in computational biology field. This paper studies the AB off-lattice model with two species of monomers, called hydrophobic (A) and hydrophilic (B). Based on this simplified model, the low energy configurations are searched by using the GAPSO. A kind of optimization about the mutation mechanism and the Euclidean interference mechanism are presented, where a novel local adjustment strategy is also used to enhance the searching ability of the global minimum within the AB off-lattice model. Starting from random conformations, the GAPSO method can find the low-energy conformation of the Fibonacci sequences and the real protein sequences. Compared with other optimization methods, the proposed novel method could converge to the lower energy folds. It appears that the proposed method can used for solving protein folding problem, which is based on the thermodynamic hypothesis.

关键词： Proteins Amino acids Interference Particle swarm optimization Optimization Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of single-arm multi-cluster tools with two-space buffering modules

Optimal scheduling of single-arm multi-cluster tools with tw...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Calculation of Fisher Criterion Score for Informative Gene Selection

Privacy Preserving Calculation of Fisher Criterion Score for...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Suxin Guo Sheng Zhong Aidong Zhang Department of Computer Science and Engineering State University of New York at Buffalo State Key Laboratory for Novel Software Technology Nanjing University

ISBN: (纸本)9781479975037

Informative gene selection is an important topic in the field of bioinformatics which has attracted intensive interest in recent years. It aims to identify the genes which are differentially expressed in different groups, and thus are informative for the classification between the groups. For this purpose, many micro array experiments have been conducted by various medical institutes on their own sets of patients and test subjects. For those institutes who have conducted experiments regarding the same type of disease, it would be beneficial to all of them if they learn on the union of their data to find the informative genes instead of learn just on their own datasets, since the amount of data each institute holds is very limited. However, in many cases, the institutes are not allowed to share their data with others because micro array datasets contain private information about the patients and test subjects. In this paper, we focus on this problem and propose a privacy preserving algorithm that allows multiple parties to perform the widely used informative gene selection method, the Fisher criterion, on the union of their data, without revealing each party's data to others. Basically, we utilize the homomorphic cryptographic system to protect the data during the calculations. Experimental results on real world datasets show the effectiveness of the proposed method.

关键词： Data privacy Encryption Protocols Distributed databases Accuracy Privacy

来源：评论

学校读者我要写书评

暂无评论

Dominant Skyline Query Processing over Multiple Time Series

引用

Journal of computer science & technology 2013年第4期28卷 625-635页

作者：汪浩王朝坤徐亚军宁苑池 Department of Computer Science and Technology Tsinghua University Tsinghua National Laboratory for Information Science and Technology Key Laboratory for Information System Security Ministry of Education School of Software Tsinghua University

Multiple time series （MTS）, which describes an object in multi-dimensions, is based on single time series and has been proved to be useful. In this paper, a new analytical method called α/β-Dominant-Skyline on MTS and a formal definition of the α/β-dominant skyline MTS are given. Also, three algorithms, called NL, BC and MFB, are proposed to address the α/β-dominant skyline queries over MTS. Finally experimental results on both synthetic and real data verify the correctness and effectiveness of the proposed method and algorithms.

关键词： multiple time series α/β-dominant skyline skyline query processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：