The proceedings contain 14 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Automated vertebral segmentation from CT images for computation of lumbolumba...
ISBN:
(纸本)9788132219842
The proceedings contain 14 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Automated vertebral segmentation from CT images for computation of lumbolumbar angle;an overlay cognitive radio model exploiting the polarization diversity and relay cooperation;effect of source selection, deployment pattern, and data forwarding technique on the lifetime of data aggregating multi-sink wireless sensor network;performance of incremental redundancy-based data transmission in randomly deployed wireless sensor network;trust-based routing for vehicular Ad Hoc network and study on handover mechanism in cellular network.
The proceedings contain 11 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Non-functional property aware brokerage approach for cloud service discovery;...
ISBN:
(纸本)9788132219873
The proceedings contain 11 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Non-functional property aware brokerage approach for cloud service discovery;a DWT-based digital watermarking scheme for image tamper detection, localization, and restoration;a novel biometric template encryption scheme using Sudoku puzzle;an efficient algorithm for reducing wire length in three-layer channel routing;a new move toward parallel assay operations in a restricted sized chip in digital microfluidics and a 2D guard zone computation algorithm for reassignment of sub circuits to minimize the overall chip area.
We study a scenario in which n mobile robots with a limited viewing range are distributed in the Euclidean plane and have to solve a formation problem. The formation problems we consider are the GATHERING problem and ...
详细信息
We study a scenario in which n mobile robots with a limited viewing range are distributed in the Euclidean plane and have to solve a formation problem. The formation problems we consider are the GATHERING problem and the CHAIN-FORMATION problem. In the GATHERING problem, the robots have to gather in one (not predefined) point, while in the CHAIN-FORMATION problem they have to form a connected communication chain of minimal length between two stationary base stations. Each robot may base its decisions where to move only on the current relative positions of neighboring robots (that are within its viewing range);that is, besides having a limited viewing range, the robots are oblivious (they do not use information from the past), have none or only very limited identities, and they do not have a common sense of direction. Variants of these problems (especially for the GATHERING problem) have been studied extensively in different discrete time models. In contrast, our work focuses on a continuous time model;that is, the robots continuously sense the positions of other robots within their viewing range and continuously adapt their speed and direction according to some simple, local rules. Hereby, we assume that the robots have a maximum movement speed of one. We show that this idealized idea of continuous sensing allows us to solve the mentioned formation problems in linear time O(n) (which, given the maximum speed of one, immediately yields a maximum traveled distance of O(n)). Note that in the more classical discrete time models, the best known strategies need at least O(n2) or even O(n2 log n) timesteps to solve these problems. For the GATHERING problem, our analysis solves a problem left open by Gordon et al. [2004], where the authors could prove that gathering in a continuous model is possible in finite time, but were not able to give runtime bounds. Apart from these linear bounds, we also provide runtime bounds for both formation problems that relate the runtime of o
Dozens of novel natural interaction techniques are proposed every year to enrich interactive eco-systems with multitouch gestures, motion gestures, full body in motion, etc. We present a novel investigation of the com...
详细信息
Modern scientific simulations divide work between parallel processors by decomposing a spatial domain of mesh cells, particles, or other elements. A balanced assignment of the computational load is critical for parall...
详细信息
ISBN:
(纸本)9781450332057
Modern scientific simulations divide work between parallel processors by decomposing a spatial domain of mesh cells, particles, or other elements. A balanced assignment of the computational load is critical for parallel performance. If the computation per element changes over the simulation time, simulations can use dynamic load balance algorithms to evenly redistribute work to processes. Graph partitioners are widely used and balance very effectively, but they do not strong scale well. Typical SPMD simulations wait while a load balance algorithm runs on all processors, so a poorly scaling algorithm can itself become a bottleneck. We observe that the load balance algorithm is separate from the main application computation and has its own scaling properties. We propose to decouple the load balance algorithm from the application, and to offload the load balance computation so that it runs concurrently with the application on a smaller number of processors. We demonstrate the costs of decoupling and offloading the load balancing algorithm from a Barnes-Hut application.
A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with it...
详细信息
The proceedings contain 20 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Design and development of marathi speech interface system;fusion-based noisy ...
ISBN:
(纸本)9788132226512
The proceedings contain 20 papers. The special focus in this conference is on applied Computation and Security Systems. The topics include: Design and development of marathi speech interface system;fusion-based noisy image segmentation method;an approach for automatic indic script identification from handwritten document images;writer verification on bangla handwritten characters;face recognition in video using deformable parts model with scale invariant feature transform;registration of range images using a novel technique of centroid alignment;an investigation into effective test coverage;resource management in native languages using dynamic binary instrumentation;a study on software risk management strategies and mapping with SDLC;a new service discovery approach for community-based web;data-flow analysis-based approach of database watermarking;a new framework for configuration management and compliance checking for component-based software development;cad-based analysis of power distribution network for soc design;a new hybrid mutual exclusion algorithm in the absence of majority consensus;a comprehensive sudoku instance generator;implementing software transactional memory using STM haskell;comparative analysis of genetic algorithm and classical algorithms in fractional programming;an algorithm to solve 3D guard zone computation problem;multistep ahead groundwater level time-series forecasting using gaussian process regression and ANFIS and anomaly detection and three anomalous coins problem.
We study rectangular dissections of an n × n lattice region into rectangles of area n, where n = 2k for an even integer k. We show that there is a natural edge-flipping Markov chain that connects the state space....
详细信息
暂无评论