The least squares problem is formulated in terms of lp quasi-norm regularization (0 < p < 1). Two formulations are considered: (i) an lp-constrained optimization and (ii) an lp-penalized (unconstrained) optimization. Due to the nonconvexity of the lp quasi-norm, the solution paths of the regularized least squares problem are not ensured to be continuous. A critical path, which is a maximal cont...

This paper proposes “path mapping”, a method of delay estimation for technology independent combinational circuits. Path mapping provides fast and accurate delay estimation using the common ideas with the tree covering based technology mapping. First, path mapping does technology mapping for all paths in the circuit with minimum delay. Then, it finds the most critical path among all the paths i...

this study aimedat investigating the difference between male and female iranian upper-intermediate efl learners in terms of critical thinking, meta-cognitive awareness listening strategies, and selection of meta- cognitive listening strategies. to this end, one hundred and fifty language learners (including males and females with average age of 26.5) were selected through homogenised process to...

Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and has been extensively studied. Many proposed source routing algorithms tackle this problem by transforming it into the shortest path selection problem, which is P-complete, with an integrated cost function that maps the multi-constraints of each link into a single cost. However, how to select an ap...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying...

Recent work has shown that SAT can be theoretically more powerful than heuristic search provided the heuristic used by search is implemented as a set of clauses on which unit propagation simulates the evaluation of the heuristic. The h heuristic has been shown to be implemented trivially by the empty set of clauses. This paper presents an implementation of h, a generalization of h.

The paper investigates the effects of technology scaling on area/delay characteristics of registertransfer level (RTL) designs. Based on experimental modeling of RTL components and interconnect, whose feature sizes have been scaled down from 1.5 m to 0.25 m, we evaluate the critical path delay and area of several data-paths and report on efficiency of layout and RTL optimization techniques at t...

In this paper, we address the challenging problem of selecting tuning parameters for high-dimensional sparse regression. We propose a simple and computationally efficient method, called path thresholding (PaTh), that transforms any tuning parameter-dependent sparse regression algorithm into an asymptotically tuning-free sparse regression algorithm. More specifically, we prove that, as the probl...