We introduce an optimization model of the support vector regression with the group lasso regularization and develop a class of efficient two-step fixed-point proximity algorithms to solve it numerically. To overcome the difficulty brought by the non-differentiability of the group lasso regularization term and the loss function in the proposed model, we characterize its solutions as fixed-points...

Test-program generators play a key role in hardware functional verification of large scale processors. However, in the DSP domain, the usage of full-blown test-program generators is much less popular, mainly due to the limited resources (time and money) available when developing such systems. This paper describes a work-model for the fast, low cost construction of a test-program generator for D...

A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every function and parameterizing the semantics by this choice we abstract from the parameterpassing mechanism. Thus common and distinguishing features of a...

We introduce a notion of category with feedback-withdelay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain ...

‎The concept of self-similarity on subsets of algebraic varieties‎ ‎is defined by considering algebraic endomorphisms of the variety‎ ‎as `similarity' maps‎. ‎Self-similar fractals are subsets of algebraic varieties‎ ‎which can be written as a finite and disjoint union of‎ ‎`similar' copies‎. ‎Fractals provide a framework in which‎, ‎one can‎ ‎unite some results and conjectures in Diophantine g...

Online addition and multiplication of streaming data is of prime importance in real time processing of digital signals.The choice of data representation varies from fixedpoint for improved precision and reduced complexity to floatingpoint for increased dynamic range. The bit level granularity of FPGAs permits the choice of standard and nonstandard number representations for hardware accelerator...

High-level synthesis is a novel method to generate a RTlevel hardware description automatically from a high-level language such as C, and is used at recent digital circuit design. Floating-point to fixedpoint conversion with bit-length optimization is one of the key issues for the area and speed optimization in high-level synthesis. However, the conversion task is a rather tedious work for desi...

The problem of reducing the fragility of digital controllers and filters implemented using finite-precision, floating-point arithmetic is considered. Floating-point arithmetic parameter uncertainty is multiplicative, unlike parameter uncertainty resulting from fixedpoint arithmetic. Based on first-order eigenvalue sensitivity analysis, an upper bound on the eigenvalue perturbations is derived. ...

in this paper, vector ultrametric spaces are introduced and a fixed point theorem is given forcorrespondences. our main result generalizes a known theorem in ordinary ultrametric spaces.

‎Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces‎, ‎and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$‎. ‎We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ ‎related to these grills, and present a simple proof to this theorem‎. ‎This immediately yields the classical theorem...