the following paper presents various applications for a robotic arm using image processing. these applications have as a basis a video camera that captures the images to be processed for either recognition and sorting...
详细信息
the Graph Evolution Tool (GET) was built to generate personal contact networks representing who can infect whom within a community. the tool is expanded in order to permit an infection scheme which divides the communi...
详细信息
ISBN:
(纸本)9781728114620
the Graph Evolution Tool (GET) was built to generate personal contact networks representing who can infect whom within a community. the tool is expanded in order to permit an infection scheme which divides the community into different districts, thus permitting within-district and between-district infections. the evolutionary algorithm comprising GET is expanded upon to simulate communities which include 512 individuals in up to eight districts, initially infecting one person in one district and spreading through a community. the overall goal is to generate communities that will maximize the length of an epidemic. the problem associated with adequately exploring the numerous parameters accompanying evolutionary algorithms is addressed using a point packing and insight from previous work. the Susceptible-Infected-Removed (SIR) model of infection was chosen as it provides a sufficient balance of simplicity and complexity for the problem.
Stencil computation is a performance critical kernel that is widely used in scientific and engineering applications. In this paper we develop a redundant computation elimination (RCE) algorithm to exploit temporal loc...
详细信息
ISBN:
(纸本)9783319495835;9783319495828
Stencil computation is a performance critical kernel that is widely used in scientific and engineering applications. In this paper we develop a redundant computation elimination (RCE) algorithm to exploit temporal locality. We implement the RCE optimization strategy using ROSE compiler infrastructure. the experiments with a benchmark of eleven stencil applications show that temporal locality of RCE averagely improves performance by 15.4% and 10.1% for benchmark without or with SIMD optimization.
the proceedings contain 10 papers. the topics discussed include: quantum time-space tradeoff for finding multiple collision pair;quantum pseudorandomness and classical complexity;sample efficient algorithms for learni...
ISBN:
(纸本)9783959771986
the proceedings contain 10 papers. the topics discussed include: quantum time-space tradeoff for finding multiple collision pair;quantum pseudorandomness and classical complexity;sample efficient algorithms for learning quantum channels in PAC model and the approximate state discrimination problem;StoqMA meets distribution testing;fault-tolerant syndrome extraction and cat state preparation with fewer qubits;a note about claw function with a small range;fast and robust quantum state tomography from few basis measurements;Pauli error estimation via population recovery;quantum probability oracles & multidimensional amplitude estimation;and quantum logarithmic space and post-selection.
this book constitutes the proceedings of the 16thinternationalconference on algorithms and computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022.
ISBN:
(数字)9783030967314
ISBN:
(纸本)9783030967307
this book constitutes the proceedings of the 16thinternationalconference on algorithms and computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022.
In this work, we propose a dynamic optimization scheme for an edge computing system with multiple users, where the radio and computational resources, and offloading decisions, can be dynamically allocated withthe var...
详细信息
In this work, we propose a dynamic optimization scheme for an edge computing system with multiple users, where the radio and computational resources, and offloading decisions, can be dynamically allocated withthe variation of computation demands, radio channels and the computation resources. Specifically, withthe objective to minimize the energy consumption of the considered system, we propose a joint computation offloading, radio and computational resource allocation algorithm based on Lyapunov optimization. through minimizing the derived upper bound of the Lyapunov drift-plus-penalty function, the main problem is divided into several sub-problems at each time slot and are addressed separately. the simulation results demonstrate the effectiveness of the proposed scheme.
A variety of real world applications fit into the broad definition of time series classi fication. Using traditional machine learning approaches such as treating the time series sequences as high dimensional vectors h...
详细信息
ISBN:
(纸本)9781450326629
A variety of real world applications fit into the broad definition of time series classi fication. Using traditional machine learning approaches such as treating the time series sequences as high dimensional vectors have faced the well known "curse of dimensionality" problem. Recently, the field of time series classi fication has seen success by using preprocessing steps that discretize the time series using a Symbolic Aggregate ApproXimation technique (SAX) and using recurring subsequences ("motifs") as features. In this paper we explore a feature construction algorithm based on genetic programming that uses SAX-generated motifs as the building blocks for the construction of more complex features. the research shows that the constructed complex features improve the classi fication accuracy in a statistically signi ficant manner for many applications.
in modem radio location systems based on passive coherent location (PCL), one of the key problems is an efficient and accurate computation of the cross ambiguity function (CAF). this function is related to the direct ...
详细信息
ISBN:
(纸本)9781424403127
in modem radio location systems based on passive coherent location (PCL), one of the key problems is an efficient and accurate computation of the cross ambiguity function (CAF). this function is related to the direct signal and signals reflected from localized targets. CAF represent power spectral density distribution of the cross-correlation between direct and reflected signals. In this paper we present an attempt to implement (numerically effective and sufficiently accurate) the CAF computation accelerator on FPGA. the results show that this accelerator could be used to compute CAF in real-time in the future PCL systems. the presented design has been implemented in PC accelerator cards based both on Xilinx Virtex IV and Altera Stratix II devices. the presented contribution gives overall information about the algorithms, accelerator architecture design and achieved performance. the possibilities of the future enhancements are discussed.
Two simple block diagonal preconditioners are derived for the preconditioned conjugate gradient algorithm based on the structure of a matrix resulting from the discretizaton of the linearized, nonhydrostatic Navier-St...
详细信息
ISBN:
(纸本)1880653664
Two simple block diagonal preconditioners are derived for the preconditioned conjugate gradient algorithm based on the structure of a matrix resulting from the discretizaton of the linearized, nonhydrostatic Navier-Stokes equations. Using a sloshing free-surface wave as a test case, we demonstrate how the effectiveness of the preconditioners is strongly dependent on the grid aspect ratio. the effect of different initial conditions on the convergence behavior of the conjugate gradient and preconditioned conjugate gradient algorithms is also presented.
the proliferation of location-based social networks allows people to access location-based services as a group. We address Group Optimal Sequenced Route (GOSR) queries that enable a group to plan a trip with a minimum...
详细信息
ISBN:
(纸本)9781479999729
the proliferation of location-based social networks allows people to access location-based services as a group. We address Group Optimal Sequenced Route (GOSR) queries that enable a group to plan a trip with a minimum aggregate trip distance. the trip starts from the source locations of the group members, goes via a predefined sequence of different point of interests (POIs) such as a restaurant, shopping center and movie theater, and ends at the destination locations of the group members. the aggregate trip distance can be the total or the maximum trip distance of the group members. We introduce a novel approach to efficiently compute group optimal sequenced routes in road networks. We exploit elliptical properties to refine the POI search space and develop efficient algorithms for GOSR queries. Experiments show that our approach outperforms a naive approach significantly in terms of processing time and I/Os.
暂无评论