This article discusses the role of psychiatrists in determining the treatment of sexually violent predators (SVP). Instead of being released at the end of their prison sentences, sex offenders in the USA who are judged mentally disordered and dangerous are being confined in secure "treatment facilities" for indeterminate terms. This novel and aggressive legislative tactic—embodied in US sexuall...

This discussion paper explores the problems of operating systems support when implementing concurrency controls at the level of the instruction set in processors designed for multiand manycore chips. It introduces the SVP model and its implementation in DRISC processors to a level of detail required to understand these problems. The major contribution of the paper is in analysing the issues fac...

In 2014, the orthogonalized integer representation was proposed independently by Ding et al. using genetic algorithm and Fukase et al. using sampling technique to solve SVP. Their results are promising. In this paper, we consider sparse orthogonalized integer representations for shortest vectors and propose a new enumeration method, called orthognalized enumeration, by integrating such a repres...

Ajtai recently found a random class of lattices of integer points for which he could prove the following worst-case/average-case equivalence result: If there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice from the class, then there is also a probabilistic polynomial time algorithm which solves several problems related to the shortest lattice vector pro...

Floral patterning in Arabidopsis requires activation of floral homeotic genes by the floral meristem identity gene, LEAFY (LFY). Here we show that precise activation of expression of class B and C homeotic genes in floral meristems is regulated by three flowering time genes, SHORT VEGETATIVE PHASE (SVP), SUPPRESSOR OF OVEREXPRESSION OF CONSTANS 1 (SOC1), and AGAMOUS-LIKE 24 (AGL24), through dir...

Major substep in a lattice sieve algorithm which solves the Euclidean shortest vector problem (SVP) is the computation of sums and Euclidean norms of many vector pairs. Finding a solution to the SVP is the foundation of an attack against many lattice based crypto systems. We optimize the main subfunction of a sieve for the regular main processor and for the co-processor to speed up the algorith...

Abstract. The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since ov...

Fuel conservation and carbon reduction are important issues in current naval operations. Optimal ship route (i.e. minimum fuel consumption) depends on specific ship platform characteristics and near real-time environment such as weather, ocean waves, and ocean currents. The environmental impact of shipping can be measured on different spatial and temporal scales. As a vital component of the sma...

Software value prediction (SVP) is an effective and powerful compilation technique helping to expose thread-level speculative parallelism. With the help of value analysis and profiling, the compiler identifies critical and predictable variable values and generates speculatively parallelized programs with appropriate value prediction and misprediction recovery code. In this paper, we examine thi...

Electronic payment systems for wireless devices need to take into account the limited computational and storage ability of such devices. Micropayment schemes seem well suited to this scenario since they are specifically designed for efficient operation. Most micropayment schemes require a digital signature and therefore users must support public key operations and, furthermore, a public key inf...