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

international conference on Industrial Informatics

作者： Imad Sanduka Roman Obermaisser Airbus Group Innovations 81663 Munich Germany University of Siegen H?lderlinstr 3 57068 Siegen Germany

ISBN: (纸本)9781479966509

the development of Systems-of-Systems (SoS) architectures is challenged by the inherent characteristics of SoS such as operational independence, heterogeneity of constituent systems, emergent behavior and large-scale distribution. At present, the resulting complexity restricts the design space exploration of SoS architectures to be focused on cost and functionality. In this paper we extend our previous work on timing analysis and optimization in early SoS design phases by supporting reliability requirements in the generated SoS architecture. Our approach defines a SoS architecture development methodology that applies an architecture optimization method based on concise modeling with architecture patterns, timing and reliability requirements, and extensions to the Unified Profile for DoDAF and MODAF (UPDM). optimization using Mixed integer Linear programming (MILP) is used to satisfy the real-time and reliability requirements and optimization results are back annotated to UPDM models.

关键词： architecture optimization architecture patterns system reliability reliability engineering constituent systems system of systems UPDM model

来源：评论

学校读者我要写书评

暂无评论

Cognitive Context-aware Distributed Storage optimization in Mobile Cloud Computing: A Stable Matching based Approach 37

Cognitive Context-aware Distributed Storage Optimization in ...

引用

37th IEEE international conference on Distributed Computing Systems (ICDCS)

作者： Han, Dong Yan, Ye Shu, Tao Yang, Liuqing Cui, Shuguang Oakland Univ Dept Comp Sci & Engn Rochester MI 48309 USA Auburn Univ Dept Comp Sci & Software Engn Auburn AL 36849 USA Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80523 USA Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

ISBN: (纸本)9781538617915

Mobile cloud storage (MCS) is being extensively used nowadays to provide data access services to various mobile platforms such as smart phones and tablets. For cross-platform mobile apps, MCS is a foundation for sharing and accessing user data as well as supporting seamless user experience in a mobile cloud computing environment. However, the mobile usage of smart phones or tablets is quite different from legacy desktop computers, in the sense that each user has his/ her own mobile usage pattern. therefore, it is challenging to design an efficient MCS that is optimized for individual users. In this paper, we investigate a distributed MCS system whose performance is optimized by exploiting the fine-grained context information of every mobile user. In this distributed system, lightweight storage servers are deployed pervasively, such that data can be stored closer to its user. We systematically optimize the data access efficiency of such a distributed MCS by exploiting three types of user context information: mobility pattern, network condition, and data access pattern. We propose two optimization formulations: a centralized one based on mixed-integer linear programming (MILP), and a distributed one based on stable matching. We then develop solutions to both formulations. Comprehensive simulations are performed to evaluate the effectiveness of the proposed solutions by comparing them against their counterparts under various network and context conditions.

关键词： Mobile communication Distributed databases optimization Context modeling Mobile handsets Encoding Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Berth allocation and vessel shifting optimization in terminals with irregular layouts

Berth allocation and vessel shifting optimization in termina...

引用

13th international conference on Transportation and Traffic Engineering (ICTTE 2024)

作者： Yun Ji Xiaolin Zhu College of Science Shanghai Maritime University Shanghai People's Republic of China

ISBN: (数字)9781837242931

this paper addresses the continuous berth allocation problem for different types of vessels arriving during a fixed period at bulk terminals with irregular layouts, such as “L” and “F” shaped coastlines. Considering the priority of large vessels in utilizing deep-water berths and berth utilization saturation, a dynamic optimization-based strategy for cargo reduction and vessel shifting is proposed. A mixed-integer programming model is formulated with the objective of minimizing the total time vessels spend in port, and a multi-layer encoded particle swarm optimization algorithm is designed for solving the problem. Berth allocation and cargo reduction shifting plans for different types of vessels are provided. through numerical experiments, the proposed scheme is compared with two other schemes—one involving fixed cargo reduction shifting and the other without shifting. the results indicate that the proposed strategy has significant advantages in improving berth utilization and reducing total vessel port time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advances in discrete optimization

引用

optimization 2013年第8期62卷 1003-1006页

作者： Sifaleras, Angelo Paparrizos, Konstantinos Demyanov, Vladimir F. Univ Macedonia Dept Technol Management Naousa Greece Univ Macedonia Dept Appl Informat Thessaloniki Greece St Petersburg State Univ Dept Appl Math & Control Proc St Petersburg 199034 Russia

We are presenting in this special issue selected, peer-reviewed, papers that were presented at the 1st international Symposium and 10th Balkan conference on Operational Research (BALCOR 2011), which was held during Se... 详细信息

关键词： mathematical programming combinatorial optimization network optimization integer programming 90C27 65K05 90B10 90C10 91A90

来源：评论

学校读者我要写书评

暂无评论

Structural Identifiability in Low-Rank Matrix Factorization

Structural Identifiability in Low-Rank Matrix Factorization

引用

14th Annual international conference on Computing and Combinatorics (COCOON 2008)

作者： Fritzilas, Epameinondas Milanic, Martin Rahmann, Sven Rios-Solis, Yasmin A. Univ Bielefeld Fac Technol Bielefeld Germany Univ Primorska Fac Math Nat Sci & Informat Technol Koper Slovenia Tech Univ Dortmund Dortmund Germany UANL Grad Program Syst Engn Monterrey Mexico

In many signal processing and data mining applications, we need to approximate a given matrix Y with a low-rank product Ya parts per thousand AX. Both matrices A and X are to be determined, but we assume that from the specifics of the application we have an important piece of a-priori knowledge: A must have zeros at certain positions. In general, different AX factorizations approximate a given Y equally well, so a fundamental question is whether the known zero pattern of A contributes to the uniqueness of the factorization. Using the notion of structural rank, we present a combinatorial characterization of uniqueness up to diagonal scaling (subject to a mild non-degeneracy condition on the factors), called structural identifiability of the model. Next, we define an optimization problem that arises in the need for efficient experimental design. In this context, Y contains sensor measurements over several time samples, X contains source signals over time samples and A contains the source-sensor mixing coefficients. Our task is to monitor the signal sources with the cheapest subset of sensors, while maintaining structural identifiability. Firstly, we show that this problem is NP-hard. Secondly, we present a mixed integer linear program for its exact solution together with two practical incremental approaches. We also propose a greedy approximation algorithm. Finally, we perform computational experiments on simulated problem instances of various sizes.

关键词： Low-rank matrix factorization Structural rank Bipartite matching Computational complexity integer programming Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

A mickey-mouse decomposition theorem 4th

A mickey-mouse decomposition theorem

引用

4th international conference on integer programming and combinatorial optimization, IPCO 1995

作者： Conforti, Michele Cornuéjols, Gérard Kapoor, Ajai Vuškovic, Kristina Dipartimento di Matematica Para eci Applicata Università di Padova Via Belzoni 7 Padova35131 Italy Carnegie Mellon University Schenley Park PittsburghPA15213 United States Department of Combinatorics and Optimization University of Waterloo WaterlooONN2L 3G1 Canada

A graph is signable to be without, odd holes if we can assign labels "even" or "odd" to its edges in such a way that the number of edges labelled "odd" in every triangle is odd and the nu... 详细信息

ISBN: (纸本)9783540594086

A graph is signable to be without, odd holes if we can assign labels "even" or "odd" to its edges in such a way that the number of edges labelled "odd" in every triangle is odd and the number of edges labelled "odd" in every chordless cycle of length greater than three is even. Note that a graph has no odd holes if it is signed to be without odd holes with every edge having an "odd5’ label. We derive a co-NP characterization of such graphs. A mickey-mouse M is a cycle C = Xi,..,, Xn,Xi with two chords x,Xj and Xi+Xj (indices taken modulo n). the chordless cycles Cj = Xj,..., Xi,, Xj and C2 = Xi+1,…,Xj, Xi+1 are the ears of the mickey-mouse. A mickey-mouse has big ears if both Ci and C2 have length greater than three. In this paper we show that if a graph G is signable to be without odd holes and contains a mickey-mouse with big ears, with chords Xi,Xj and Xi+Xj, then the removal of the nodes adjacent to Xj, together with the nodes adjacent to both Xi, and Xi+i disconnects G. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Bi-objective orienteering: Towards a dynamic multi-objective evolutionary algorithm 10th

Bi-objective orienteering: Towards a dynamic multi-objective...

引用

10th international conference on Evolutionary Multi-Criterion optimization, EMO 2019

作者： Bossek, Jakob Grimme, Christian Meisel, Stephan Rudolph, Günter Trautmann, Heike Department of Information Systems University of Münster Leonardo-Campus 3 Münster48149 Germany Department of Computer Science TU Dortmund University Otto-Hahn-Str. 14 Dortmund44227 Germany

ISBN: (纸本)9783030125974

We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. the goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies. © Springer Nature Switzerland AG 2019.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A comparison of a global approach and a decomposition method for frequency assignment in multibeam satellite systems 4th

A comparison of a global approach and a decomposition method...

引用

4th international conference on Operations Research and Enterprise Systems, ICORES 2015

作者： Camino, Jean-thomas Artigues, Christian Houssin, Laurent Mourgues, Stéphane Telecommunication Systems Department Airbus Defence and Space Space Systems 31 Rue des Cosmonautes Toulouse31402 France CNRS LAAS 7 Avenue du Colonel Roche Toulouse31400 France Université de Toulouse LAAS Toulouse31400 France Université de Toulouse UPS LAAS Toulouse31400 France

ISBN: (纸本)9783319276793

As a result of the continually growing demand for multimedia content and higher throughputs in wireless communication systems, the telecommunication industry has to keep improving the use of the bandwidth resources. this access to the radiofrequency spectrum is both limited and expensive, which has naturally lead to the definition of the generic class of combinatorial optimization problems known as "Frequency Assignment Problems" (FAP). In this article, we present a new extension of these problems to the case of satellite systems that use a multibeam coverage. With the models we propose, we make sure that for each frequency plan produced there exists a corresponding satellite payload architecture that is cost-efficient and decently complex. Two approaches are presented and compared: a global constraint program that handles all the constraints simultaneously, and a decomposition method that involves both constraint programming and integer linear programming. For the latter approach where two subproblems are studied, we show that one of them can be modeled as a multiprocessor scheduling problem while the other can either be seen as a path-covering problem or a multidimensionnal bin-packing problem depending on the assumptions made. these analogies are used to prove that both the subproblems addressed in the decomposition method belong to the category of NP-hard problems. We also show that, for the most common class of interference graphs in multibeam satellite systems, the maximal cliques can all be enumerated in polynomial time and their number is relatively low, therefore it is perfectly acceptable to rely on them in the scheduling model that we derived. Our experiments on realistic scenarios show that the decomposition method proposed can indeed provide a solution of the problem when the global CP model does not. © Springer international Publishing Switzerland 2015.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Targeted End-to-End Knowledge Graph Decomposition 1

引用

28th international conference on Inductive Logic programming (ILP)

作者： Skrlj, Blaz Kralj, Jan Lavrac, Nada Jozef Stefan Int Postgrad Sch Jamova 39 Ljubljana 1000 Slovenia Jozef Stefan Inst Jamova 39 Ljubljana 1000 Slovenia Univ Nova Gorica Vipavska 13 Nova Gorica 5000 Slovenia

ISBN: (数字)9783319999609

ISBN: (纸本)9783319999609;9783319999593

Knowledge graphs are networks with annotated nodes and edges, representing different relations between the network nodes. Learning from such graphs is becoming increasingly important as numerous real-life systems can be represented as knowledge graphs, where properties of selected types of nodes or edges are learned. this paper presents a fully autonomous approach to targeted knowledge graph decomposition, advancing the state-of-the-art HINMINE network decomposition methodology. In this methodology, weighted edges between the nodes of a selected node type are constructed via different typed triplets, each connecting two nodes of the same type through an intermediary node of a different type. the final product of such a decomposition is a weighted homogeneous network of the selected node type. HINMINE is advanced by reformulating the supervised network decomposition problem as a combinatorial optimization problem, and by solving it by a differential evolution approach. the proposed approach is tested on node classification tasks on two real-life knowledge graphs. the experimental results demonstrate that the proposed end-to-end learning approach is much faster and as accurate as the exhaustive search approach.

关键词： Knowledge graphs Network analysis Supervised machine learning

来源：评论

学校读者我要写书评

暂无评论

the semidefinite relaxation of the k-partition polytope is strong

The semidefinite relaxation of the k-partition polytope is s...

引用

9th international integer programming and combinatorial optimization conference, IPCO 2002

作者： Eisenblätter, Andreas Takustr. 7 BerlinD-14195 Germany

ISBN: (纸本)9783540478676

Radio frequency bandwidth has become a very scarce resource. this holds true in particular for the popular mobile communication system GSM. Carefully planning the use of the available frequencies is thus of great importance to GSM network operators. Heuristic optimization methods for this task are known, which produce frequency plans causing only moderate amounts of disturbing interference in many typical situations. In order to thoroughly assess the quality of the plans, however, lower bounds on the unavoidable interference are in demand. the results obtained so far using linear programming and graph theoretic arguments do not suffice. By far the best lower bounds are currently obtained from semidefinite programming. the link between semidefinite programming and the bound on unavoidable interference in frequency planning is the semidefinite relaxation of the graph minimum k-partition problem. Here, we take first steps to explain the surprising strength of the semidefinite relaxation. this bases on a study of the solution set of the semidefinite relaxation in relation to the circumscribed k-partition polytope. Our focus is on the huge class of hypermetric inequalities, which are valid and in many cases facet-defining for the k-partition polytope. We show that a "slightly shifted version" of the hypermetric inequalities is implicit to the semidefinite relaxation. In particular, no feasible point for the semidefinite relaxation violates any of the facet-defining triangle inequalities for the k-partition polytope by more than √2 - 1 or any of the (exponentially many) facet-defining clique constraints by 1/2 or more. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：