The proceedings contain 22 papers. The topics discussed include: morphological edge detection for oceanographic images;genetic algorithms for terrain categorization of landsat images;region-of-interest detection for f...
The proceedings contain 22 papers. The topics discussed include: morphological edge detection for oceanographic images;genetic algorithms for terrain categorization of landsat images;region-of-interest detection for fingerprint classification;spatial-spectral processing for hyperspectral imagery using neural networks;pixel-level object segmentation from multispectral sensor imagery;hierarchical polynomial network approach to automated target recognition;and intensified cameras: a method of image-quality optimization for visual observation.
The proceedings contain 32 papers. The special focus in this conference is on Soft Computing Models in Industrial applications. The topics include: Hybrid Dynamic Planning Mechanism for Virtual Organizations;a Multiob...
ISBN:
(纸本)9783642131608
The proceedings contain 32 papers. The special focus in this conference is on Soft Computing Models in Industrial applications. The topics include: Hybrid Dynamic Planning Mechanism for Virtual Organizations;a Multiobjective Variable Neighborhood Search for Solving the Motif Discovery Problem;Combinatorial Auctions for Coordination and Control of Manufacturing MAS: Updating Prices Methods;Solving the Routing and Wavelength Assignment Problem inWDM Networks by Using a Multiobjective Variable Neighborhood Search Algorithm;a Software Tool for Harmonic Distortion Simulation Caused by Non-linear Household Loads;Scalable Intelligence and Adaptation in Scheduling DSS;optimization of Parallel Manipulators Using Evolutionary algorithms;iGenda: An Event Scheduler for Common Users and Centralised Systems;a Parallel Cooperative Evolutionary Strategy for Solving the Reporting Cells Problem;multi-criteria Manipulator Trajectory optimization Based on Evolutionary algorithms;a Decision Support System for Logistics Operations;combining Heuristics Backtracking and Genetic Algorithm to Solve the Container Loading Problem withWeight Distribution;greenhouse Heat Load Prediction Using a Support Vector Regression Model;evaluating the Low Quality Measurements in Lighting Control Systems;GRASP Algorithm for optimization of Grids for Multiple Classifier System;soft Computing Models for an Environmental Application;a Scatter Search Based Approach to Solve the Reporting Cells Problem;fuzzy optimization of Start-Up Operations for Combined Cycle Power Plants;multi-Network-Feedback-Error-Learning with Automatic Insertion;catalog Segmentation by Implementing Fuzzy Clustering and Mathematical Programming Model;an Optimized 3D Surface Reconstruction Method Using Spatial Kalman Filtering of Projected Line Patterns;the Gene Expression Programming Applied to Demand Forecast;decision Making and Quality-of-Information;brain Magnetic Resonance Spectroscopy Classifiers.
We give a new family of Lovász Local Lemmas (LLL), with applications. Shearer has given the most general condition under which the LLL holds, but the original condition of Lovász is simpler and more practica...
详细信息
Autonomous driving will reshape transportation networks, offering at the same time many benefits such as safety, reliable vehicle-to-vehicle communication, and extended telecommunications. For a self-driving vehicle t...
详细信息
ISBN:
(纸本)9798350334081
Autonomous driving will reshape transportation networks, offering at the same time many benefits such as safety, reliable vehicle-to-vehicle communication, and extended telecommunications. For a self-driving vehicle to navigate freely and perceive its environment, it is necessary to be equipped with many sensors. Automotive radars and antenna arrays that operate at 76-81 GHz have been proposed as key elements in future autonomous vehicles. In this work, an aperture-coupled bowtie antenna is designed utilizing hunger games search optimization. The proposed element achieves quite satisfactory values of return loss and gain, as well as broadband operation at 76 GHz - 81 GHz.
The proceedings contain 12 papers. The topics discussed include: a novel finite element method assembler for co-processors and accelerators;the energy case for graph processing on hybrid CPU and GPU systems;a syntheti...
ISBN:
(纸本)9781450325035
The proceedings contain 12 papers. The topics discussed include: a novel finite element method assembler for co-processors and accelerators;the energy case for graph processing on hybrid CPU and GPU systems;a synthetic task model for HPC-grade optical network performance evaluation;maximizing the performance of irregular applications on multithreaded, NUMA;analysis of computing and energy performance of multicore, NUMA, and manycore platforms for an irregular application;in-memory data compression for sparse matrices;on the GPU performance of cell-centered finite volume method over unstructured tetrahedral meshes;nonzero pattern analysis and memory access optimization in GPU-based sparse LU factorization for circuit simulation;register level sort algorithm on multi-core SIMD processors;parallel sparse FFT;an AMR computation and communication dependency and analysis methodology;and parallel implementations of ensemble data assimilation for atmospheric prediction.
Portfolio selection is one of the most common problem in the field of finance. Many investors would like to allocate their funds in such way that ratio between return and risk will be as high as possible. Up to today,...
详细信息
ISBN:
(纸本)9789612640682
Portfolio selection is one of the most common problem in the field of finance. Many investors would like to allocate their funds in such way that ratio between return and risk will be as high as possible. Up to today, the problem has been solved with various approaches based on genetic algorithm technique and GA has proved to be suitable. In this paper we applied two different approaches based on genetic algorithm technique in order to solve the problem. First is single objective approach and second is multi objective one (NSGA-II). Results are showing that there is no significant difference between approaches.
Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in...
详细信息
ISBN:
(纸本)9783642124495
Video-on-Demand (VoD) services require frequent updates in file configuration on the storage subsystem, so as to keep up with the frequent changes in movie popularity. This defines a natural reconfiguration problem in which the goal is to minimize the cost of moving from one file configuration to another. The cost is incurred by file replications performed throughout the transition. The problem shows up also in production planning, preemptive scheduling with set-up costs, and dynamic placement of Web applications. We show that the reconfiguration problem is NP-hard already on very restricted instances. We then develop algorithms which achieve the optimal cost by using servers whose load capacities are increased by O(1), in particular, by factor 1 + delta for any small 0 < delta < I when the number of servers is fixed, and by factor of 2 + epsilon for arbitrary number of servers, for some epsilon is an element of [0, 1). To the best of our knowledge, this fundamental optimization problem is studied here for the first time.
Recent advances and applications of machine learning algorithms are becoming more common in different fields. It is expected that some applications require the processing of large datasets with those algorithms, which...
详细信息
ISBN:
(纸本)9781450384414
Recent advances and applications of machine learning algorithms are becoming more common in different fields. It is expected that some applications require the processing of large datasets with those algorithms, which leads to high computational costs. Massively parallel GPU methods can be applied to surpass this limitation and reduce the execution time of these algorithms. The construction of approximate K-Nearest Neighbor Graphs (K-NNG) is frequently required for similarity search or other applications such as the t-SNE dimensionality reduction technique. The K-NNG represents the K closest points (neighbors) for each point in a set. In this paper, we propose and analyze an all-points K-Nearest Neighbor Graph construction algorithm on GPU called Warp-centric K-NNG (w-KNNG), which is based on the Random Projection Forest method. Usually, the construction or search for k-NN sets for high dimensional points presents challenges for its implementation on many-core processing units, due to the space limitation in maintaining these sets in high speed shared memory. We present three warp-centric approaches for our algorithm that efficiently search and maintain the k-NN high dimensional point sets in global memory. In our experiments, the new methods allows the algorithm to achieve up to 639% faster execution when compared to the state-of-the-art FAISS library, considering an equivalent accuracy of approximate K-NNG. One of the new strategies (w-KNNG atomic) is more successful when applied to a smaller number of dimensions, while the tiled w-KNNG approach was successful in general scenarios for higher dimensional points.
This volume contains the edited texts of the lectures presented at the workshop on Nonlinear optimization: Theory and applications, held in Erice at the "G. Stampacchia" School of Mathematics of the "E....
详细信息
ISBN:
(数字)9781489902894
ISBN:
(纸本)9780306453168;9781489902917
This volume contains the edited texts of the lectures presented at the workshop on Nonlinear optimization: Theory and applications, held in Erice at the "G. Stampacchia" School of Mathematics of the "E. Majorana" international Centre for Scientific Culture June 13-21, 1995. The meeting was conceived to review and discuss recent advances and promising research trends concerning theory, algorithms, and innovative applications in the field This is a field of mathematics which is providing viable of Nonlinear optimization. tools in engineering, in economics and in other applied sciences, and which is giving a great contribution also in the solution of the more practiced linear optimization prob lems. The meeting was attended by approximately 70 people from 18 countries. Besides the lectures, several formal and informal discussions took place. The result was a broad exposure providing a wide and deep understanding of the present research achievements in the field. We wish to express our appreciation for the active contributions of all the partici pants in the meeting. Our gratitude is due to the Ettore Majorana Center in Erice, which offered its facilities and stimulating environment: its staff was certainly instrumental for the success of the meeting. Our gratitude is also due to Francisco Facchinei and Massino Roma for the time spent in the organization of the workshop, and to Giuliana Cai for the careful typesetting of this volume.
The proceedings contain 42 papers. The special focus in this conference is on algorithms and Data Structures, Invited Lecture The topics include: Discrepancy Theory and Computational Geometry;Dynamic Motion Planning i...
ISBN:
(纸本)3540633073
The proceedings contain 42 papers. The special focus in this conference is on algorithms and Data Structures, Invited Lecture The topics include: Discrepancy Theory and Computational Geometry;Dynamic Motion Planning in Low Obstacle Density Environments;Visibility-Based Pursuit-Evasion in a Polygonal Environment;Maintaining the Extent of a Moving Point Set;Finding Cores of Limited Length;On Bipartite Crossings, Largest Biptanar Subgraphs, and the Linear Arrangement Problem;Approximation algorithms for a Genetic Diagnostics Problem;Cartographic Line Simplification and Polygon CSG Formulae in O(n Log'n) Time;Constrained TSP and Low-Power Computing;On-Line Load Balancing for Related Machines;A Linear-Time Algorithm for the 1-Mismatch Problem;On Some Geometric optimization Problems in Layered Manufacturing;New TSP Construction Heuristics and Their Relationships To The 2-Opt;Pattern Matching in Hypertext;Multiple Approximate String Matching;Applied Computational Geometry;Checking the Convexity of Polytopes and the Planarity of Subdivisions;Voronoi Diagrams for Polygon-Offset Distance Functions;Randomized algorithms for that Ancient Scheduling Problem;Optimal Parallel algorithms for Proximate Points, with applications;An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments;On Geometric Path Query Problems;On-Line Scheduling with Hard Deadlines;Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access;Parallel vs. Parametric Complexity;Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons;Dynamic Data Structures for Fat Objects and Their applications and Intractability of Assembly Sequencing: Unit Disks in the Plane.
暂无评论