We give a proximal bundle method for minimizing a convex function f over R+. It requires evaluating f and its subgradients with a possibly unknown accuracy ε ≥ 0, and maintains a set of free variables I to simplify its prox subproblems. The method asymptotically finds points that are ε-optimal. In Lagrangian relaxation of convex programs, it allows for ε-accurate solutions of Lagrangian subprob...

Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...

Objective. The main aim of this study was to verify the sensitivity and specificity of Addenbrooke's Cognitive Examination-Revised (ACE-R) in discriminating between Parkinson's disease (PD) with normal cognition (PD-NC) and PD with mild cognitive impairment (PD-MCI) and between PD-MCI and PD with dementia (PD-D). We also evaluated how ACE-R correlates with neuropsychological cognitive tests in ...

We investigate cut points of subcontinua of βR \ R. We find, under CH, the topologically smallest type of subset of R that can support such a cut point. On the other hand we answer Question 66 of Hart and van Mill’s Open problems on βω [Open Problems in Topology (J. van Mill and G. M. Reed, eds.), North-Holland, Amsterdam, 1990, pp. 97–125] by showing that it is consistent that all cut points a...

Abstract – Modeling of the cascode switching structure used in Flyback converter for achieving fast startup in the deeply dimmed phase-cut LED driver is presented in this paper. The cascode structure’s inherent instability and oscillation issue is modeled and analyzed quantitatively. Three solutions are proposed to stabilize the structure and suppress the unstable voltage oscillation. Solutions...

Here we present a center-cut algorithm for convex mixed-integer nonlinear programming (MINLP) that can either be used as a primal heuristic or as a deterministic solution technique. Like many other algorithms for convex MINLP, the center-cut algorithm constructs a linear approximation of the original problem. The main idea of the algorithm is to use the linear approximation differently in order...

New spectral methods for ratio cut partitioning and clustering. A general purpose multi-way partitioning, Proc. We introduced a new natural metric, Via-Count, to better estimate inter-partition delays for evaluating partitioning solutions. We presented K-VIA-FM, an algorithm that iteratively improve solutions for the new metric. We compared the performance of K-VIA-FM with other algorithms, bot...

This note shows by means of simple counterexamples that some key results presented by He and Lemmon on the liveness verification and enforcing of Petri nets using unfolding are incorrect. As a result, the applicability of unfolding for Petri net supervision is still an open issue. 1 Introduction Recently, He and Lemmon have presented an original approach for the analysis and control of bounded ...

We consider the bifurcation of periodic solutions from an equilibrium point of the given equation: x =F(x,?) , where x ? R , ? is a vector of real parameters ? , ? , ... , ? and F:R x R ->R has at least second continuous derivations in variables

Consider a dynamic set of multidimensional objects S, that evolves over time. A temporal membership query asks whether an object with given key attributes was in the set S at some time t. This paper provides efficient solutions to this temporal query. In particular, we present partially persistent extensions to (i) a hashing based scheme the BANG file and (ii) the hB -tree. The performance of b...