In this paper, critical path of multiple constant multiplication (MCM) block is analysed precisely and optimized for high-speed and low-complexity implementation. A delay model based on signal propagation path is proposed for more precise estimation of critical path delay of MCM blocks than the conventional adder depth and the number of cascaded full adders. A dual objective configuration optim...

A situation where J blocks of variables are observed on the same set of individuals is considered in this paper. A factor analysis logic is applied to tables instead of individuals. The latent variables of each block should well explain their own block and in the same time the latent variables of same rank should be as positively correlated as possible. In the first part of the paper we describ...

In this work we consider computing a smooth path for a (block) singular value decomposition of a full rank matrix valued function. We give new theoretical results and then introduce and implement several algorithms to compute a smooth path. We illustrate performance of the algorithms with a few numerical examples.

the purpose of this study was to describe the association between grain yield and its components. the experiment was conducted in a randomized complete block design with three replicatsions. results of analysis showed that similar trends were observed for genotypic and phenotypic correlations and in most cases, the value for genetic correlation was greater than phenotypic value. 100-seed weight...

The Internet of Things offers a wide range possibilities that can be exploited more or less explicitly for user authentication, ranging from specifically designed systems including biometric devices to environmental sensors opportunistically used feed behavioural authentication systems. How integrate all this information in reliable way get continuous service presents several open challenges. A...

We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and prove that it incurs no more than O ` N B1/2− + N B logN ́ block transfers on a graph with N vertices. This is the first cache-oblivious algorithm for this problem that incurs o(N) block transfers.

This paper addresses the problem of accurately computing the delay of a combinational logic circuit in the floating mode of operation. (In this mode the state of the circuit is considered to be unknown when a vector is applied at5 the inputs.) It is well known that using the length of the topologically longest path as an estimate of circuit delay may be pessimistic since this path may be false,...

High-performance multiprocessor systems are built around out-oforder processors with aggressive branch predictors. Despite their relatively high branch prediction accuracies, these processors execute many memory instructions on mispredicted paths. Previous studies that focused on uniprocessors systems showed that these wrong-path memory references may pollute the caches by bringing in data that...

In this paper, an active control structure used piezoelectric stack actuator is built to suppress vibration due to internal incentive in gear transmission. Because the gear system is timevariant and unknown, an offline modeling technique is unable to tracking the changes in the secondary path, an adaptive filter algorithm used online secondary path modeling method is proposed to the active vibr...

In this paper, we propose an implementation scheme of source routing function, one of the characteristics, in applying PNNI protocol to ATM switching system. The proposed substance is a PNNI routing software structure design and source routing algorithm. The software structure guarantee maximal independence among blocks by keeping a function manager, composing a handling block separately, worki...