ppxscal/embedding_network huggingface dataset:
Compositional verification of retiming and sequential optimizations
Authors: In-Ho Moon
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Once a design is both retimed and sequentially optimized, sequential equivalence verification becomes very hard since retiming breaks the equivalence of the retimed sub-blocks although the design equivalence is preserved. This paper presents a novel compositional algorithm to verify sequential equivalence of large designs that are not only retimed but also optimized sequentially and combinationally. With a new notion of conditional equivalence in the presence of retiming, the proposed compositional algorithm performs hierarchical verification by checking whether each sub-block is conditionally equivalent, then checking whether the conditions are justified on their parent block by temporal equivalence. This is the first compositional algorithm handling both retiming and sequential optimizations hierarchically. The proposed approach is completely automatic and orthogonal to any existing sequential equivalence checker. The experimental results show that the proposed algorithm can handle large industrial designs that cannot be verified by the existing methods on sequential equivalence checking.
Computable Riesz Representation for Locally Compact Hausdorff Spaces
Authors: Hong Lu, Klaus Weihrauch
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

By the Riesz Representation Theorem for locally compact Hausdorff spaces, for every positive linear functional I on K(X) there is a measure @m such that I(f)=@!fd@m, where K(X) is the set of continuous real functions with compact support on the locally compact Hausdorff space X. In this article we prove a uniformly computable version of this theorem for computably locally compact computable Hausdorff spaces X. We introduce a representation of the positive linear functionals I on K(X) and a representation of the Borel measures on X and prove that for every such functional I a measure @m can be computed and vice versa such that I(f)=@!fd@m.
On certain Hamiltonian cycles in planar graphs
Authors: T. Böhme, J. Harant, M. Tkáč
Venue: Journal of Graph Theory (1999)

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that must be present in a 5-connected graph that is embedded into the plane or into the projective plane with face-width at least five. Especially, we show that every 5-connected plane or projective plane triangulation on n vertices with no non-contractible cyles of length less than five contains at least $2^{{\cal O}(n^{1/4})}$ distinct Hamiltonian cycles. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 81&ndash;96, 1999
Redesigning remote system administration paradigms for enhanced security and flexibility
Authors: Marco Prandini, Marco Ramilli
Venue: Computer Standards Interfaces (2008)

Remote system administration is usually performed according to the standard client-server model. However, important security and flexibility limitations, arising from the usage of a predictable access port for such a critical application, prevent a satisfactory trade-off between authentication strength and service availability. We illustrate an alternative solution, based on an additional system placed in between the remote server and its administrator. Our design ensures that the new component's role does not weaken the existing security mechanisms already in place, but it can instead enhance them, and provide a very effective decoupling between a server and its visible management ports.
On Image Registration in Magnetic Resonance Imaging
Authors: Peihua Qiu, Tram Nguyen
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Image registration is used in many fields for mapping one image to another. In magnetic resonance imaging (MRI) applications, one of the main uses isfor correction of motion-induced artifacts so that subsequent image analysiswould be more reliable. This paper gives an introduction to some image registration problems in MRI and functional MRI applications, describes certain commonly used image registration procedures, and discusses their major features. Two potential research topics for improving current image registration procedures are also discussed.
Complex brackets, balanced complex differences, and applications in symbolic geometric computing
Authors: Hongbo Li, Lei Huang
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

In advanced invariant algebras such as null bracket algebra (NBA), symmetries of algebraic operators are the most important devices of encoding and employing syzygies of advanced geometric invariants. The larger the symmetry group, the more powerful the computing devices. In this paper, the largest symmetry group of the two kinds of bracket operators in the NBA of plane geometry is found. An algorithm of complexity O(N log N) is proposed to reduce a bracket of length N to its normal form, and then decide the congruence of two brackets of length N. By writing the two bracket operators as the real and pure imaginary parts of a complex bracket operator, their normal forms can be translated into a class of complex polynomials whose variables are first-order differences, called balanced complex difference (BCD) polynomials. BCD polynomials provide a complex-numbers-based invariant language for advanced algebraic manipulations of geometric problems. A simplification algorithm is proposed for making symbolic geometric computing with NBA and BCD polynomials, with the unique feature of controlling the expression size by avoiding multilinear expansions of the first-order difference variables of complex polynomials.
A new technique to remove false topographic perception phenomenon and its impacts in image interpretation
Authors: A. K. Saraf, S. T. Sinha, P. Ghosh, S. Choudhury
Venue: International Journal of Remote Sensing (2007)

All Sun-synchronous remote sensing satellites, during day passes always acquire images when the illumination source (i.e. Sun position) is from the SE direction. The typical solar-illumination-source-observer position creates a false topographic perception phenomenon (FTPP) in the images of any rugged terrain (e.g. Himalayas, Alps etc.). Due to the presence of FTPP, valleys appear as ridges and vice versa, especially in rugged terrain. The correction of FTPP is necessary because it creates confusion in the minds of interpreters due to inherent inverse topographic perception. This paper explains the development of a new approach to remove FTPP. It has been successfully demonstrated using an IRS-1D-LISS-III image of part of the Himalayas, which represents highly rugged terrain. In this newly developed image-processing technique; a red-green-blue (RGB) image is first transformed into intensity-hue-saturation (IHS) channels, then the original intensity channel is inverted and later retransformed back from an IHS to a RGB image. After this retransformation, the RGB image is then colour balanced with original false colour composite. The final image product is free from FTPP and also contains almost the same image information. This method is an easy and quicker method to remove FTPP in comparison to the already available methods (e.g. image rotation by 180°; creating an image negative; using an opposite illuminated shaded relief model as an intensity image during IHS to RGB retransformation) for FTPP correction. Further, this paper discusses the relative advantages of this new method in comparison to previous methods in light of image classification and lineament interpretation carried out using images with and without FTPP.
Mining sequential patterns across time sequences
Authors: Gong Chen, Xindong Wu, Xingquan Zhu
Venue: New Generation Computing (2008)

In this paper, we deal with mining sequential patterns in multiple time sequences. Building on a state-of-the-art sequential pattern mining algorithm PrefixSpan for mining transaction databases, we propose MILE (MIning in muLtiple sEquences), an efficient algorithm to facilitate the mining process. MILE recursively utilizes the knowledge of existing patterns to avoid redundant data scanning, and therefore can effectively speed up the new patterns' discovery process. Another unique feature of MILE is that it can incorporate prior knowledge of the data distribution in time sequences into the mining process to further improve the performance. Extensive empirical results show that MILE is significantly faster than PrefixSpan. As MILE consumes more memory than PrefixSpan, we also present a solution to trade time efficiency in memory constrained environments.
Sharp Figures, Fuzzy Purpose
Authors: Simson Garfinkel
Venue: IEEE Security and Privacy (2008)

Simson Garfinkel reviews Security Data Visualization: Graphical Techniques for Network Analysis by Greg Conti.
How to let instruction set processor beat ASIC for low power wireless baseband implementation: a system level approach
Authors: Min Li, Bruno Bougard, David Novo, Liesbet Van Der Perre, Francky Catthoor
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Nowadays, mobile devices are integrating an increasing variety of wireless communication standards, and each standard demands a multitude of modes. This tremendous diversity, combined with the increasing development-cost of deep-submicron silicon, desires highly flexible baseband implementations. The tier-2 SDR (Software Defined Radio) paradigm, where the entire baseband runs on programmable architectures, is very attractive to obtain the desired flexibility. Parallel ISP (Instruction Set Processor) based SDR baseband platforms have attracted extensive interest in recent years. However, such implementations typically come with a much lower energy-efficiency than traditional implementations as ASICs (Application Specific Integrated Circuits). This energy efficiency gap remains to be bridged in order to make SDR more pervasive. Importantly, the gap is becoming even more and more challenging in emerging high rate communication standards, such as 3GPP LTE, Mobile WiMAX and 802.11n. This situation demands disruptive innovations.
Bolasso: model consistent Lasso estimation through the bootstrap
Authors: Francis R. Bach
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We consider the least-square linear regression problem with regularization by the l1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptotic analysis of model consistency of the Lasso. For various decays of the regularization parameter, we compute asymptotic equivalents of the probability of correct model selection (i.e., variable selection). For a specific rate decay, we show that the Lasso selects all the variables that should enter the model with probability tending to one exponentially fast, while it selects all other variables with strictly positive probability. We show that this property implies that if we run the Lasso for several bootstrapped replications of a given sample, then intersecting the supports of the Lasso bootstrap estimates leads to consistent model selection. This novel variable selection algorithm, referred to as the Bolasso, is compared favorably to other linear regression methods on synthetic data and datasets from the UCI machine learning repository.
A Pilot Study of a Thermal Display Using a Miniature Tactor for Upper Extremity Prosthesis
Authors: Keehoon Kim, J. Edward Colgate, Michael A. Peshkin
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We have been developing a miniature multi-function haptic device -a tactor -that generates the sense of pressure, vibration, shear force, and temperature for upper extremity amputees, especially those who have undergone targeted nerve reinnervation surgery. This paper discusses first the design of the thermal display portion of the tactor, second a pilot study of a thermal display using the tactor.
A quasi-synchronous checkpointing algorithm that prevents contention for stable storage
Authors: D. Manivannan, Q. Jiang, Jianchang Yang, M. Singhal
Venue: Information Sciences: an International Journal (2008)

Checkpointing and rollback recovery are established techniques for handling failures in distributed systems. Under synchronous checkpointing, each process involved in the distributed computation takes checkpoint almost simultaneously. This causes contention for network stable storage and hence degrades performance as processes may have to wait for long time for the checkpointing operation to complete. In this paper, we propose a staggered quasi-synchronous checkpointing algorithm which reduces contention for network stable storage without any synchronization overhead.
A yield-driven gridless router
Authors: Qiang Zhou, Yi-Ci Cai, Duo Li, Xian-Long Hong
Venue: Journal of Computer Science and Technology (2007)

A new gridless router to improve the yield of IC layout is presented. The improvement of yield is achieved by reducing the critical areas where the circuit failures are likely to happen. This gridless area router benefits from a novel cost function to compute critical areas during routing process, and heuristically lays the patterns on the chip area where it is less possible to induce critical area. The router also takes other objectives into consideration, such as routing completion rate and nets length. It takes advantage of gridless routing to gain more flexibility and a higher completion rate. The experimental results show that critical areas are effectively decreased by 21% on average while maintaining the routing completion rate over 99%.
Optimal power and noise allocation for analog and digital sections of a low power radio receiver
Authors: Kannan Aryaperumal Sankaragomathi, Manodipan Sahoo, Satyam Dwivedi, Bharadwaj S. Amrutur, Navakanta Bhat
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We determine the optimal allocation of power between the analog and digital sections of an RF receiver, while meeting the BER constraint. Unlike conventional RF receiver designs, we treat the SNR at the output of the analog front end (SNRAD) as a design parameter rather than a specification to arrive at this optimal allocation. We first determine the relationship of the SNRAD to the resolution and operating frequency of the digital section. We then use power models for the analog and digital sections to solve the power minimization problem. As an example, we consider a 802.15.4 compliant low-IF receiver operating at 2.4 GHz in 0.13μm technology with 1.2 V power supply. We find that the overall receiver power is minimized by having the analog front end provide an SNR of 1.3dB and the ADC and the digital section operate at 1-bit resolution with 18MHz sampling frequency while achieving a power dissipation of 7mW.
3D posture estimation using geodesic distance maps
Authors: Pedro Correa, Ferran Marqués, Xavier Marichal, Benoit Macq
Venue: Multimedia Tools and Applications (2008)

This paper presents a novel technique for three-dimensional (3D) human motion capture using a set of two non-calibrated cameras. The user's five extremities (head, hands and feet) are extracted, labeled and tracked after silhouette segmentation. As they are the minimal number of points that can be used in order to enable whole body gestural interaction, we will henceforth refer to these features as crucial points. Features are subsequently labelled using 3D triangulation and inter-image tracking. The crucial point candidates are defined as the local maxima of the geodesic distance with respect to the center of gravity of the actor region that lie on the silhouette boundary. Due to its low computational complexity, the system can run at real-time paces on standard personal computers, with an average error rate range between 4% and 9% in realistic situations, depending on the context and segmentation quality.
Dynamic clustering of interval data using a Wasserstein-based distance
Authors: Antonio Irpino, Rosanna Verde
Venue: Pattern Recognition Letters (2008)

Interval data allow statistical units to be described by means of intervals of values, whereas their representation by means of a single value appears to be too reductive or inconsistent. In the present paper, we present a Wasserstein-based distance for interval data, and we show its interesting properties in the context of clustering techniques. We show that the proposed distance generalizes a wide set of distances proposed for interval data by different approaches or in different contexts of analysis. An application on real data is performed to illustrate the impact of using different metrics and the proposed one using a dynamic clustering algorithm.
Assessing water quality management options in the Upper Litani Basin, Lebanon, using an integrated GIS-based decision support system
Authors: Hamed Assaf, Mark Saadeh
Venue: Environmental Modelling Software (2008)

The widespread and relentless discharge of untreated wastewater into the Upper Litani Basin (ULB) river system in Lebanon has reached staggering levels rendering its water unfit for most uses especially during the drier times of the year. Despite the call by governmental and non-governmental agencies to develop several wastewater treatment plants and sewage networks in an effort to control this problem, these efforts do not seem to be coordinated or based on comprehensive and integrated assessments of current and projected conditions in the basin. This paper provides an overview of the development and implementation of an integrated decision support system (DSS) designed to help policy makers and other stakeholders have a clearer understanding of the key factors and processes involved in the sewage induced degradation of surface water quality in the ULB, and formulate, assess and evaluate alternative management plans. The DSS is developed based on the WEAP model, which provides a GIS based and visual simulation environment and scenario management and analysis capabilities. The DSS was used to assess two main water quality management plans taking into consideration hydrological, spatial and seasonal variabilities. An incremental cost-effectiveness analysis was conducted to identify best buy plans. The results have confirmed the gravity of this problem and demonstrated the importance of taking immediate action on curbing this onslaught on this valuable and scarce fresh water resource.
SAFELI: SQL injection scanner using symbolic execution
Authors: Xiang Fu, Kai Qian
Venue: Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications (2008)

This paper presents the current progress, main algorithm, and the open problems of a tool set called "SAFELI," for detecting SQL Injection vulnerabilities resident in Web applications. SAFELI instruments the bytecode of Java Web applications and utilizes symbolic execution to statically inspect security vulnerabilities. At each location that submits SQL query, an equation is constructed to find out the initial values of Web controls that lead to the breach of database security. The equation is solved by a hybrid string solver where the solution obtained is used to construct test cases. SQL injection attacks are replayed by SAFELI to designers, step by step. We also raise open problems on more powerful string solver techniques that work at the semantics level.
Primitive elements in the matroid-minor Hopf algebra
Authors: Henry Crapo, William Schmitt
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

We introduce the matroid-minor coalgebra C, which has labeled matroids as distinguished basis and coproduct given by splitting a matroid into a submatroid and complementary contraction in all possible ways. We introduce two new bases for C; the first of these is related to the distinguished basis by Möbius inversion over the rank-preserving weak order on matroids, the second by Möbius inversion over the suborder excluding matroids that are irreducible with respect to the free product operation. We show that the subset of each of these bases corresponding to the set of irreducible matroids is a basis for the subspace of primitive elements of C. Projecting C onto the matroid-minor Hopf algebra H, we obtain bases for the subspace of primitive elements of H.
Optimizing overlay topology by reducing cut vertices
Authors: Xiaomei Liu, Li Xiao, Andrew Kreling, Yunhao Liu
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

Overlay networks provide base infrastructures for many areas including multimedia streaming and content distributions. Since most overlay networks are highly decentralized and self-organized, cut vertices may exist in such systems due to the lack of centralized management. A cut vertex is defined as a network node whose removal increases the number of network components. Failure of these nodes can break an overlay into a large number of disconnected components and greatly downgrade the upper layer services like media streaming. We propose here a distributed mechanism, CAM, which efficiently detects the cut vertices before they fail and neutralizes them into normal overlay nodes with slight overhead so that the possibility of network decomposition is minimized after they fail. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations.
A dual coordinate descent method for large-scale linear SVM
Authors: Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin, S. Sathiya Keerthi, S. Sundararajan
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In many applications, data appear with a huge number of instances as well as features. Linear Support Vector Machines (SVM) is one of the most popular tools to deal with such large-scale sparse data. This paper presents a novel dual coordinate descent method for linear SVM with L1-and L2-loss functions. The proposed method is simple and reaches an &epsilon;-accurate solution in O(log(1/&epsilon;)) iterations. Experiments indicate that our method is much faster than state of the art solvers such as Pegasos, TRON, SVMperf, and a recent primal coordinate descent implementation.
On an aperiodic stochastic resonance signal processor and its application in digital watermarking
Authors: Shuifa Sun, Bangjun Lei
Venue: Signal Processing (2008)

In this paper, an aperiodic stochastic resonance (ASR) signal processor for communication systems based on a bistable dynamic mechanism is proposed for detecting base-band binary pulse amplitude modulation (PAM) signals in communication systems. All parameters in the processor can be adjusted when needed. The adjustment mechanism is explained from the perspective of the conventional noise-induced nonlinear signal processing. To demonstrate this processor's usability, a digital image-watermarking algorithm in the discrete cosine transform (DCT) domain is implemented. In this algorithm, the watermark and the DCT alternating current (ac) coefficients of the image are viewed as the input signal and the channel noise, respectively. In conventional watermarking systems, it is difficult to explain why the detection bit error ratio (BER) of a watermarking system suffering from certain attacks is lower than that of the system not suffering from any attack. In the new watermarking algorithm, this phenomenon is systematically analyzed. It is shown that the DCT ac coefficients of an image as well as the noise imposed by the attacks can cooperate within the bistable system to improve the performance of the watermark detection.