Search results for "Putin"
showing 10 items of 25297 documents
Using Inverse Reinforcement Learning with Real Trajectories to Get More Trustworthy Pedestrian Simulations
2020
Reinforcement learning is one of the most promising machine learning techniques to get intelligent behaviors for embodied agents in simulations. The output of the classic Temporal Difference family of Reinforcement Learning algorithms adopts the form of a value function expressed as a numeric table or a function approximator. The learned behavior is then derived using a greedy policy with respect to this value function. Nevertheless, sometimes the learned policy does not meet expectations, and the task of authoring is difficult and unsafe because the modification of one value or parameter in the learned value function has unpredictable consequences in the space of the policies it represents…
Towards Shipping 4.0. A preliminary gap analysis
2020
Abstract The paradigm of Industry 4.0 involves a substantial innovation to the value creation approach thought the supply chain and the application of digital enabling technologies like the Internet of Things (IoT), Big Data Analytics (BDA) and cloud computing. The fourth industrial revolution is thus expected to have a disruptive impact on maritime transport and shipping sectors, where smart ships and autonomous vessels well be part of a new and fully interconnected maritime ecosystem. Specific hardware components, such as sensors, actuators, or processors will be embedded in the ship’s key systems in order to provide valuable information to increase the efficiency, sustainability and safe…
Damage identification of a jacket support structure for offshore wind turbines
2020
Offshore jacket structures are regarded as a suitable type of support structure for offshore wind turbines in immediate water depths. Because of the welded tubular members used and environmental conditions, offshore jackets are often subjected to fatigue damages during their service life. Underwater sensors can provide measurements of the structural vibration signals and provide an efficient way to detect damages at early stages. In this work, simplified forms of the damages are assumed, random damages are imposed on the jacket structure, and damaged indicators are established from combination of modal shapes. Then, a response surface is constructed mapping the damage indicators and damages…
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
2018
This paper presents a novel Artificial Bee Colony (ABC) approach for supervised classification of remote sensing images. One proposes to apply an ABC algorithm to optimize the coefficients of the set of polynomial discriminant functions. We have experimented the proposed ABC-based classifier algorithm for a Landsat 7 ETM+ image database, evaluating the influence of the ABC model parameters on the classifier performances. Such ABC model parameters are: numbers of employed/onlooker/scout bees, number of epochs, and polynomial degree. One has compared the best ABC classifier Overall Accuracy (OA) with the performances obtained using a set of benchmark classifiers (NN, NP, RBF, and SVM). The re…
A flexible robotic cell for in-process inspection of multi-pass welds
2020
Welds are currently only inspected after all the passes are complete and after allowing sufficient time for any hydrogen cracking to develop, typically over several days. Any defects introduced between passes are therefore unreported until fully buried, greatly complicating rework and also delaying early corrections to the weld process parameters. In-process inspection can provide early intervention but involves many challenges, including operation at high temperatures with significant gradients affecting acoustic velocities and, hence, beam directions. Reflections from the incomplete parts of the weld would also be flagged as lack-of-fusion defects, requiring the region of interest (ROI) t…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
Tabu Search to Plan Schedules in a Multiskill Customer Contact Center
2006
International audience; We have studied a realistic case of scheduling problem in a customer contact center, dealing with multiskill agents. Our model combines the last two steps of the standard approach by determining shifts and by assigning them to agents at the same time (scheduling and rostering). Moreover, we have considered realistic vacations, according to legal constraints and preferences of agents. We have envisioned entire weeks of work, with variable meal times and meal durations, without overtime. In this paper, we define the problem and describe a Tabu search based solution.
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.