Contribution to the evaluation and optimization of passengers' screening at airports

Security threats have emerged in the past decades as a more and more critical issue for Air Transportation which has been one of the main ressource for globalization of economy. Reinforced control measures based on pluridisciplinary research and new technologies have been implemented at airports as a reaction to different terrorist attacks. From the scientific perspective, the efficient screening of passengers at airports remain a challenge and the main objective of this thesis is to open new lines of research in this field by developing advanced approaches using the resources of Computer Science. First this thesis introduces the main concepts and definitions of airport security and gives an overview of the passenger terminal control systems and more specifically the screening inspection positions are identified and described. A logical model of the departure control system for passengers at an airport is proposed. This model is transcribed into a graphical view (Controlled Satisfiability Graph-CSG) which allows to test the screening system with different attack scenarios. Then a probabilistic approach for the evaluation of the control system of passenger flows at departure is developped leading to the introduction of Bayesian Colored Petri nets (BCPN). Finally an optimization approach is adopted to organize the flow of passengers at departure as best as possible given the probabilistic performance of the elements composing the control system. After the establishment of a global evaluation model based on an undifferentiated serial processing of passengers, is analyzed a two-stage control structure which highlights the interest of pre-filtering and organizing the passengers into separate groups. The conclusion of this study points out for the continuation of this theme

An integer programming approach for the satisfiability problems.

by Lui Oi Lun Irene.Thesis (M.Phil.)--Chinese University of Hong Kong, 2001.Includes bibliographical references (leaves 128-132).Abstracts in English and Chinese.List of Figures --- p.viiList of Tables --- p.viiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Satisfiability Problem --- p.1Chapter 1.2 --- Motivation of the Research --- p.1Chapter 1.3 --- Overview of the Thesis --- p.2Chapter 2 --- Constraint Satisfaction Problem and Satisfiability Problem --- p.4Chapter 2.1 --- Constraint Programming --- p.4Chapter 2.2 --- Satisfiability Problem --- p.6Chapter 2.3 --- Methods in Solving SAT problem --- p.7Chapter 2.3.1 --- Davis-Putnam-Loveland Procedure --- p.7Chapter 2.3.2 --- SATZ by Chu-Min Li --- p.8Chapter 2.3.3 --- Local Search for SAT --- p.11Chapter 2.3.4 --- Integer Linear Programming Method for SAT --- p.12Chapter 2.3.5 --- Semidefinite Programming Method --- p.13Chapter 2.4 --- Softwares for SAT --- p.15Chapter 2.4.1 --- SAT01 --- p.15Chapter 2.4.2 --- "SATZ and SATZ213, contributed by Chu-Min Li" --- p.15Chapter 2.4.3 --- Others --- p.15Chapter 3 --- Integer Programming --- p.17Chapter 3.1 --- Introduction --- p.17Chapter 3.1.1 --- Formulation of IPs and BIPs --- p.18Chapter 3.1.2 --- Binary Search Tree --- p.19Chapter 3.2 --- Methods in Solving IP problem --- p.19Chapter 3.2.1 --- Branch-and-Bound Method --- p.20Chapter 3.2.2 --- Cutting-Plane Method --- p.23Chapter 3.2.3 --- Duality in Integer Programming --- p.26Chapter 3.2.4 --- Heuristic Algorithm --- p.28Chapter 3.3 --- Zero-one Optimization and Continuous Relaxation --- p.29Chapter 3.3.1 --- Introduction --- p.29Chapter 3.3.2 --- The Roof Dual expressed in terms of Lagrangian Relaxation --- p.30Chapter 3.3.3 --- Determining the Existence of a Duality Gap --- p.31Chapter 3.4 --- Software for solving Integer Programs --- p.33Chapter 4 --- Integer Programming Formulation for SAT Problem --- p.35Chapter 4.1 --- From 3-CNF SAT Clauses to Zero-One IP Constraints --- p.35Chapter 4.2 --- From m-Constrained IP Problem to Singly-Constrained IP Problem --- p.38Chapter 4.2.1 --- Example --- p.39Chapter 5 --- A Basic Branch-and-Bound Algorithm for the Zero-One Polynomial Maximization Problem --- p.42Chapter 5.1 --- Reason for choosing Branch-and-Bound Method --- p.42Chapter 5.2 --- Searching Algorithm --- p.43Chapter 5.2.1 --- Branch Rule --- p.44Chapter 5.2.2 --- Bounding Rule --- p.46Chapter 5.2.3 --- Fathoming Test --- p.46Chapter 5.2.4 --- Example --- p.47Chapter 6 --- Revised Bound Rule for Branch-and-Bound Algorithm --- p.55Chapter 6.1 --- Revised Bound Rule --- p.55Chapter 6.1.1 --- CPLEX --- p.57Chapter 6.2 --- Example --- p.57Chapter 6.3 --- Conclusion --- p.65Chapter 7 --- Revised Branch Rule for Branch-and-Bound Algorithm --- p.67Chapter 7.1 --- Revised Branch Rule --- p.67Chapter 7.2 --- Comparison between Branch Rule and Revised Branch Rule --- p.69Chapter 7.3 --- Example --- p.72Chapter 7.4 --- Conclusion --- p.73Chapter 8 --- Experimental Results and Analysis --- p.80Chapter 8.1 --- Experimental Results --- p.80Chapter 8.2 --- Statistical Analysis --- p.33Chapter 8.2.1 --- Analysis of Search Techniques --- p.83Chapter 8.2.2 --- Discussion of the Performance of SATZ --- p.85Chapter 9 --- Concluding Remarks --- p.87Chapter 9.1 --- Conclusion --- p.87Chapter 9.2 --- Suggestions for Future Research --- p.88Chapter A --- Searching Procedures for Solving Constraint Satisfaction Problem (CSP) --- p.91Chapter A.1 --- Notation --- p.91Chapter A.2 --- Procedures for Solving CSP --- p.92Chapter A.2.1 --- Generate and Test --- p.92Chapter A.2.2 --- Standard Backtracking --- p.93Chapter A.2.3 --- Forward Checking --- p.94Chapter A.2.4 --- Looking Ahead --- p.95Chapter B --- Complete Results for Experiments --- p.96Chapter B.1 --- Complete Result for SATZ --- p.96Chapter B.1.1 --- n =5 --- p.95Chapter B.1.2 --- n = 10 --- p.98Chapter B.1.3 --- n = 30 --- p.99Chapter B.2 --- Complete Result for Basic Branch-and-Bound Algorithm --- p.101Chapter B.2.1 --- n二5 --- p.101Chapter B.2.2 --- n = 10 --- p.104Chapter B.2.3 --- n = 30 --- p.107Chapter B.3 --- Complete Result for Revised Bound Rule --- p.109Chapter B.3.1 --- n = 5 --- p.109Chapter B.3.2 --- n = 10 --- p.112Chapter B.3.3 --- n = 30 --- p.115Chapter B.4 --- Complete Result for Revised Branch-and-Bound Algorithm --- p.118Chapter B.4.1 --- n = 5 --- p.118Chapter B.4.2 --- n = 10 --- p.121Chapter B.4.3 --- n = 30 --- p.124Bibliography --- p.12

Methoden und Beschreibungssprachen zur Modellierung und Verifikation vonSchaltungen und Systemen: MBMV 2015 - Tagungsband, Chemnitz, 03. - 04. März 2015

Der Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV 2015) findet nun schon zum 18. mal statt. Ausrichter sind in diesem Jahr die Professur Schaltkreis- und Systementwurf der Technischen Universität Chemnitz und das Steinbeis-Forschungszentrum Systementwurf und Test. Der Workshop hat es sich zum Ziel gesetzt, neueste Trends, Ergebnisse und aktuelle Probleme auf dem Gebiet der Methoden zur Modellierung und Verifikation sowie der Beschreibungssprachen digitaler, analoger und Mixed-Signal-Schaltungen zu diskutieren. Er soll somit ein Forum zum Ideenaustausch sein. Weiterhin bietet der Workshop eine Plattform für den Austausch zwischen Forschung und Industrie sowie zur Pflege bestehender und zur Knüpfung neuer Kontakte. Jungen Wissenschaftlern erlaubt er, ihre Ideen und Ansätze einem breiten Publikum aus Wissenschaft und Wirtschaft zu präsentieren und im Rahmen der Veranstaltung auch fundiert zu diskutieren. Sein langjähriges Bestehen hat ihn zu einer festen Größe in vielen Veranstaltungskalendern gemacht. Traditionell sind auch die Treffen der ITGFachgruppen an den Workshop angegliedert. In diesem Jahr nutzen zwei im Rahmen der InnoProfile-Transfer-Initiative durch das Bundesministerium für Bildung und Forschung geförderte Projekte den Workshop, um in zwei eigenen Tracks ihre Forschungsergebnisse einem breiten Publikum zu präsentieren. Vertreter der Projekte Generische Plattform für Systemzuverlässigkeit und Verifikation (GPZV) und GINKO - Generische Infrastruktur zur nahtlosen energetischen Kopplung von Elektrofahrzeugen stellen Teile ihrer gegenwärtigen Arbeiten vor. Dies bereichert denWorkshop durch zusätzliche Themenschwerpunkte und bietet eine wertvolle Ergänzung zu den Beiträgen der Autoren. [... aus dem Vorwort

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field

Evolutionary Search Techniques with Strong Heuristics for Multi-Objective Feature Selection in Software Product Lines

Software design is a process of trading off competing objectives. If the user objective space is rich, then we should use optimizers that can fully exploit that richness. For example, this study configures software product lines (expressed as feature models) using various search-based software engineering methods. Our main result is that as we increase the number of optimization objectives, the methods in widespread use (e.g. NSGA-II, SPEA2) perform much worse than IBEA (Indicator-Based Evolutionary Algorithm). IBEA works best since it makes most use of user preference knowledge. Hence it does better on the standard measures (hypervolume and spread) but it also generates far more products with 0 violations of domain constraints. We also present significant improvements to IBEA\u27s performance by employing three strong heuristic techniques that we call PUSH, PULL, and seeding. The PUSH technique forces the evolutionary search to respect certain rules and dependencies defined by the feature models, while the PULL technique gives higher weight to constraint satisfaction as an optimization objective and thus achieves a higher percentage of fully-compliant configurations within shorter runtimes. The seeding technique helps in guiding very large feature models to correct configurations very early in the optimization process. Our conclusion is that the methods we apply in search-based software engineering need to be carefully chosen, particularly when studying complex decision spaces with many optimization objectives. Also, we conclude that search methods must be customized to fit the problem at hand. Specifically, the evolutionary search must respect domain constraints

VLSI Design

This book provides some recent advances in design nanometer VLSI chips. The selected topics try to present some open problems and challenges with important topics ranging from design tools, new post-silicon devices, GPU-based parallel computing, emerging 3D integration, and antenna design. The book consists of two parts, with chapters such as: VLSI design for multi-sensor smart systems on a chip, Three-dimensional integrated circuits design for thousand-core processors, Parallel symbolic analysis of large analog circuits on GPU platforms, Algorithms for CAD tools VLSI design, A multilevel memetic algorithm for large SAT-encoded problems, etc