A fast branch-and-prune algorithm for the position analysis of spherical mechanisms

The final publication is available at link.springer.comDifferent branch-and-prune schemes can be found in the literature for numerically solving the position analysis of spherical mechanisms. For the prune operation, they all rely on the propagation of motion intervals. They differ in the way the problem is algebraically formulated. This paper exploits the fact that spherical kinematic loop equations can be formulated as sets of 3 multi-affine polynomials. Multi-affinity has an important impact on how the propagation of motion intervals can be performed because a multi-affine polynomial is uniquely determined by its values at the vertices of a closed hyperbox defined in its domain.Peer ReviewedPostprint (author's final draft

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al

2014 Conference Abstracts: Annual Undergraduate Research Conference at the Interface of Biology and Mathematics

Conference schedule and abstract book for the Sixth Annual Undergraduate Research Conference at the Interface of Biology and Mathematics Date: November 1-2, 2014Plenary Speakers: Joseph Tien, Associate Professor of Mathematics at The Ohio State University; and Jeremy Smith, Governor\u27s Chair at the University of Tennessee and Director of the University of Tennessee/Oak Ridge National Lab Center for Molecular Biophysic

A novel fast algorithm based on SMDWT for visual processing applications

[[abstract]]This work presents a fast algorithm, namely 2-D symmetric mask-based discrete wavelet transform (SMDWT), to address some critical issues of the 2-D discrete wavelet transform (DWT). Unlike the traditional DWT involving dependent decompositions, the SMDWT itself is subband processing independent, which can significantly reduce complexity. Moreover, DWT cannot directly obtain target subbands, which leads to an extra wasting in transpose memory, critical path, and operation time. These problems can be fully improved with the proposed SMDWT. Nowadays, many applications employ DWT as the core transformation approach, the problems indicated above have motivated researchers to develop fast algorithms for DWT. The proposed SMDWT has been proved as a highly efficient independent processing to yield target subbands which can be applied to real-time visual applications, such as moving object detection and tracking, texture segmentation, image/video compression, and any DWT-based applications.[[notice]]需補會議日期、性質、主辦單位[[conferencedate]]20090524~2009052

2016 Conference Abstracts: Annual Undergraduate Research Conference at the Interface of Biology and Mathematics

Schedule and abstract book for the Eighth Annual Undergraduate Research Conference at the Interface of Biology and Mathematics Date: October 8-9, 2016Location: UT Conference Center, KnoxvillePlenary Speaker: Jorge X. Velasco Hernández, Universidad Nacional Autónoma de MéxicoFeatured Speaker: Judy Day, University of Tennessee, Knoxvill

2011 Conference Abstracts: Annual Undergraduate Research Conference at the Interface of Biology and Mathematics

Abstract book for the Third Annual Undergraduate Research Conference at the Interface of Biology and Mathematics Date: October 21-22, 2011Plenary speaker: J. Carl Panetta, Department of Pharmaceutical Sciences, St. Jude Children\u27s Research HospitalFeatured Speaker: John Jungck, Mead Chair of the Sciences and Professor of Biology, Beloit Colleg

Temporal structures for Fast and Slow Speech Rate

The rhythmic component in speech synthesis often remains rather rudimentary, despite recent major efforts in the modeling of prosodic models. The European COST Action 258 has identified this problem as one of the next challenges for speech synthesis. This paper is a contribution to a new, promising approach that was tested on a French temporal model