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

41st IEEE Real-Time Systems Symposium (RTSS)

作者： Reusch, Niklas Pop, Paul Craciunas, Silviu S. Tech Univ Denmark Lyngby Denmark TTTech Computertech AG Vienna Austria

ISBN: (纸本)9781728183244

Time-Sensitive Networking (TSN) extends IEEE 802.1 Ethernet for safety-critical and real-time applications in several areas, e.g., automotive, aerospace or industrial automation. However, many of these systems also have stringent security requirements, and security attacks may impair safety. Given a TSN-based distributed architecture, a set of applications with tasks and messages, as well as a set of security and redundancy requirements, we are interested to synthesize a system configuration such that the real-time, safety and security requirements are satisfied. We use the Timed Efficient Stream Loss-Tolerant Authentication (TESLA) low-resource multicast authentication protocol to guarantee the security requirements, and redundant disjunct message routes to tolerate link failures. We consider that the tasks are scheduled using static cyclic scheduling and that the messages use the time-sensitive traffic class in TSN, which relies on schedule tables (called Gate Control Lists, GCLs) in the network switches. A configuration consists of the schedule tables for tasks as well as the disjoint routes and GCLs for messages. We propose a constraint programming-based formulation for this problem and we evaluate it on several test cases.

关键词： 802.1CB 802.1Qbv constraint programming real time redundancy safety critical TESLA TSN

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Dynamic Arity Search Heuristic for constraint programming 32

A Hybrid Dynamic Arity Search Heuristic for Constraint Progr...

引用

32nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Xia, Wei Yap, Roland H. C. Natl Univ Singapore Sch Comp Singapore Singapore

ISBN: (纸本)9781728192284

Effective and robust search heuristics are critical for solving constraint satisfaction or optimization problems. In this paper, we propose a new hybrid heuristic which uses the idea of reducing the dynamic arity of constraints, called constraintArity-Reduction (CAR). The hybrid heuristic is formed with a base heuristic which switches to CAR using a switching heuristic. We experimented with hybrids of CAR combining existing stateof-the-art search heuristics. Experimental results on a variety of structured benchmarks show that hybrid CAR heuristics is an effective and competitive strategy, which can successfully reduce the search space and improve the performance of existing heuristics on a variety of problems.

关键词： search heuristics adaptive heuristics CSP constraint solver constraint programming

来源：评论

学校读者我要写书评

暂无评论

Temperature-Aware Core Mapping for Heterogeneous 3D NoC Design Through constraint programming 28

Temperature-Aware Core Mapping for Heterogeneous 3D NoC Desi...

引用

28th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP)

作者： Derniriz, Ayhan Ahangari, Hamzeh Ozturk, Ozcan Gebze Tech Univ TR-41400 Kocaeli Turkey Bilkent Univ TR-06800 Ankara Turkey

ISBN: (数字)9781728165820

ISBN: (纸本)9781728165820

In the context of Network-on-Chip (NoC) based Chip Multiprocessor (CMP) design, core mapping for application specific systems is a challenging problem. In such designs, various decisions have to be made that affect performance and power consuinption. Moreover, in emerging 3D NoC systems, by intensification of cooling issues, temperature constraints on hot-spots are added, and problem becomes more complicated. In this paper, an earlier constraint programming (('P) methodology for heterogeneous 2D NoC design is extended to 3D model, while critical temperature constraints are accounted. In a single stage, our approach can choose core types from a set of low, medium and high power, and assign them to appropriate places on the mesh which minimizes the overall computation time and communication cost while satisfying the temperature constraints. To achieve our objective, in addition to cores placement problem, tasks should also be scheduled on corresponding cores with matching performance levels to minimize the overall completion time (makespan). Experimental results show that task completion times are more dependent on the mesh structure for our benchmark data. 3D mesh structures may yield shorter task completion times, without compromising thermal constraints. On the other hand, restricting the peak temperature naturally requires the usage of low-performance computing elements which inherently may delay the processing time.

关键词： Network-on-Chip 3D Integration Heterogeneous Core Mapping Task Scheduling constraint programming

来源：评论

学校读者我要写书评

暂无评论

Synthesizing invariants: a constraint programming approach based on zonotopic abstraction: Synthèse d'invariants: une approche programmation par contraintes basée sur l'abstraction zonotopique

Synthesizing invariants: a constraint programming approach b...

引用

作者： Kabi, Bibek Institut polytechnique de Paris

学位级别：博士

Les systèmes dynamiques sont des modèles mathématiques pour décrire l'évolution temporelle de l'état d'un système. Il y a deux classes de systèmes dynamiques pertine... 详细信息

Les systèmes dynamiques sont des modèles mathématiques pour décrire l'évolution temporelle de l'état d'un système. Il y a deux classes de systèmes dynamiques pertinentes à cette thèse : les systèmes discrets et les systèmes continus. Dans les systèmes dynamiques discrets (ou les programmes informatiques classiques), l'état évolue avec un pas de temps discrets. Dans les systèmes dynamiques continus, l'état du système est fonction du temps continu, et son évolution caractérisée par des équations différentielles. Étant donné que ces systèmes peuvent prendre des décisions critiques, il est important de pouvoir vérifier des propriétés garantissant leur sûreté. Par exemple, sur un programme, l'absence de débordement arithmétique. Dans cette thèse, nous développons un cadre pour la vérification automatique des propriétés de sûreté des programmes. Un élément clé de cette vérification est la preuve de propriétés invariantes. Nous développons ici un algorithme pour synthétiser des invariants inductifs (des propriétés vraies pour l'état initial, qui sont stables dans l'évolution des états du programme, donc sont toujours vraies par récurrence) pour des programmes numériques. L’interprétation abstraite (IA) est une approche traditionnelle pour la recherche d’invariants inductifs des programmes numériques. L'IA interprète les instructions du programme dans un domaine abstrait (par exemple intervalles, octogones, polyèdres, zonotopes), domaine qui est choisi en fonction des propriétés à prouver. Un invariant inductif peut être calculé comme limite possiblement infinie des itérées d'une fonctionnelle croissante. L'analyse peut recourir aux opérateurs d'élargissement pour forcer la convergence, au détriment de la précision. Si l'invariant n'est pas prouvé, une solution standard est de remplacer le domaine par un nouveau domaine abstrait davantage susceptible de représenter précisément l'*** programmation par contraintes (PPC) est une approche alternative pour synthétiser d

关键词： Systèmes dynamiques Vérification de programme Génération d'invariants Interprétation abstraite Programmation par contraintes Zonotopes Dynamical systems Program verification Invariant generation Abstract interpretation constraint programming Zonotopes 004

来源：评论

学校读者我要写书评

暂无评论

Developing a Production Scheduling System for Modular Factory Using constraint programming 28th

Developing a Production Scheduling System for Modular Factor...

引用

28th International Conference on Robotics in Alpe-Adria-Danube Region (RAAD)

作者： Park, Hoonseok Um, Jumyung Jung, Jae-Yoon Ruskowski, Martin Kyung Hee Univ Dept Ind & Management Syst Engn 1732 Deogyeong Daero Yongin Gyeonggi Do South Korea German Res Ctr Artificial Intelligence DFKI GmbH IFS Innovat Factory Syst Trippstadter Str 122 D-67663 Kaiserslautern Germany

ISBN: (纸本)9783030196486;9783030196479

This paper presents a production scheduling system that optimizes operations of a modular factory. The proposed system consists of a database, a scheduling optimizer and an interface connecting two other components. A scheduling model for optimal schedules plays a key role in the scheduling system. In this research, we aim to develop the scheduling model using constraint programming, and design a data mart storing the related operational data. In particular, we set the modular factory environment to the hybrid flow shop and apply the constraint programming for scheduling. We provide a case study to test the performance of the proposed scheduling model with the synthesized dataset based on a modular factory environment in SmartFactory(KL).

关键词： Smart factory Flexible manufacturing Production scheduling Hybrid flow shop constraint programming

来源：评论

学校读者我要写书评

暂无评论

An Efficient Schedule Synthesis Method based on constraint programming Technology for Time-Triggered Ethernet 5

An Efficient Schedule Synthesis Method based on Constraint P...

引用

IEEE 5th International Conference on Computer and Communication Systems (ICCCS)

作者： Yuan, Haiying Zheng, Tong Zhang, Kai Wang, Yichen Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China

ISBN: (纸本)9781728161365

Time-Triggered Ethernet (TTEthernet) efficiently integrates distributed applications with different security levels and real-time requirements in the mixed-criticality system. The key of TTEthernet is the time-triggered mechanism that is achieved by following statically time slot schedule. In the paper, the network model and constraint model are mathematically detailed and exemplified. constraint programming technology based on ILOG CPLEX is applied innovatively in solve the TTEthernet schedule synthesis problem. Finally, three topologies and two message density scenarios are set up to evaluate the performance of the algorithm in variables, constraint, memory occupancy, and synthesis time dimensions. Numerous experiment results show that the schedule synthesis method is well qualified for the schedules synthesis tasks of TTEthernet.

关键词： Time-Triggered Ethernet schedule synthesis constraint programming statically schedule

来源：评论

学校读者我要写书评

暂无评论

constraint programming Based on Matrix-Like Representation of Qualitative constraints

Constraint Programming Based on Matrix-Like Representation o...

引用

28th International Conference on Information Modelling and Knowledge Bases (EJC)

作者： Zuenko, Alexander Oleynik, Yirii Russian Acad Sci Inst Informat & Math Modelling KSC Apatity Russia

ISBN: (纸本)9781614999331;9781614999324

The paper proposes an original approach to solving the problem of ineffective processing of qualitative constraints of a subject domain using the constraint programming technique. The approach is based on the use of specialized matrix-like structures providing a "compressed" representation of constraints over finite domains, as well as on the use of the authors' inference techniques on these structures. In comparison with the prototypes using the typical representation of multi-place relations in the form of a table, the techniques make it possible to more efficiently reduce the search space. The paper presents practical aspects of implementation of user-developed types of constraints and corresponding algorithmspropagators, with the help of constraint programming libraries. The algorithms performance has been assessed by means of the above matrix structures to clearly demonstrate the advantages of representation and processing of qualitative constraints of a subject domain.

关键词： constraint satisfaction problem constraint programming constraint prop gation matrix-like representation of constraints qualitative constraints compressed representation of relations

来源：评论

学校读者我要写书评

暂无评论

Abstract Domains for constraint programming with Differential Equations 9

Abstract Domains for Constraint Programming with Differentia...

引用

9th International Workshop on Numerical and Symbolic Abstract Domains (NSAD)

作者： Ziat, Ghiles Mullier, Olivier Sandretto, Julien Alexandre Dit Garion, Christophe Chapoutot, Alexandre Thirioux, Xavier Univ Toulouse ISAE SUPAERO Toulouse France ENSTA Paris Inst Polytech Paris Palaiseau France

ISBN: (纸本)9781450381871

Cyber-physical systems (CPSs), as cruise control systems, involve life-critical or mission critical functions that must be validated. Formal verification techniques can bring high assurance level but have to be extended to embrace all the components of CPSs. Physical part models of CPSs are usually defined from ordinary differential equations (ODEs) and reachability methods can be used to compute safe over-approximation of the solution set of ODEs. However, additional constraints, as obstacle avoidance have also to be considered to validate CPSs. To meet this need, we propose in this paper a framework, based on abstract domains, for solving constraint satisfaction problems where the objects manipulated are described by ODEs. We use a form of disjunctive completion for which we provide a split operator and an efficient constraint filtering mechanism that takes advantage of the continuity aspect of ODEs. We illustrate the benefits of our method on a real-world application of trajectory validation of a swarm of drones, for which the main property we aim to prove is the absence of collisions between drone trajectories. Our work has been concretized in the form of a cooperation between the DynIbex library, used for the abstraction of ODEs, and the AbSolute constraint solver, used for the constraint resolution. Experiments show promising results.

关键词： constraint programming Abstract Domains Ordinary Differential Equations Cyber-physical systems Abstract Interpretation

来源：评论

学校读者我要写书评

暂无评论

constraint programming for flexible Service Function Chaining deployment 52

Constraint programming for flexible Service Function Chainin...

引用

52ndHawaii International Conference on System Sciences (HICSS)

作者： Liu, Tong Callegati, Franco Cetroni, Walter Contoli, Chiara Gabbrielli, Maurizio Giallorenzo, Saverio Univ Bologna Bologna Italy INRIA Le Chesnay France Univ Southern Denmark Odense Denmark

ISBN: (纸本)9780998133126

Network Function Virtualization (NFV) and Software Defined Networking (SDN) are technologies that recently acquired a great momentum thanks to their promise of being a flexible and cost-effective solution for replacing hardware-based, vendor-dependent network middleboxes with software appliances running on general purpose hardware in the cloud. Delivering end-to-end networking services across multiple NFV/SDN network domains by implementing the so-called Service Function Chain (SFC) i.e., a sequence of Virtual Network Functions (VNF) that composes the service, is a challenging task. In this paper we address two crucial sub-problems of this task: i) the language to formalize the request of a given SFC to the network and ii) the solution of the SFC design problem, once the request is received. As for i) in our solution the request is built upon the intent-based approach, with a syntax that focuses on asking the user "what" she needs and not "how" it should be implemented, in a simple and high level language. Concerning ii) we define a formal model describing network architectures and VNF properties that is then used to solve the SFC design problem by means of constraint programming (CP), a programming paradigm which is often used in Artificial Intelligence applications. We argue that CP can be effectively used to address this kind of problems because it provides very expressive and flexible modeling languages which come with powerful solvers, thus providing efficient and scalable performance. We substantiate this claim by validating our tool on some typical and non trivial SFC design problems.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Multi-objective evolutionary search strategies in constraint programming

引用

OPERATIONS RESEARCH PERSPECTIVES 2021年 8卷

作者： Bennetto, Robert van Vuuren, Jan H. Stellenbosch Univ Stellenbosch Unit Operat Res Dept Ind Engn Stellenbosch South Africa

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of constraint Satisfaction Problems (CSPs) in constraint programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting techniques with a view to develop search strategies to classes of CSPs. A hierarchical scheme is employed to select a candidate strategy from the Pareto frontier for final evaluation. The results demonstrate that multi-objective optimisation significantly outperforms the single objective scheme in the same number of objective evaluations. In situations where strategies developed for a class of problems fail to extend to unseen problem instances of the same class, it is found that the structure of the underlying CSPs do not resemble those employed in the training process.

关键词： Combinatorial optimization Multi-objective optimization Genetic algorithms constraint programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：