In this paper we present a parameter-based approach for synthesizing systolic architectures from uniform recurrence equations. The scheme presented is a generalization of the Parameter Method proposed by Li and Wah 1]. The approach synthesizes optimal arrays of any lower dimension from a general uniform recurrence description of the problem. In other previous attempts for mapping uniform recurr...

For more features massive data sets efficiently reduction problems, to enhance the data uniformity of the near target instance, reduce the errors of represented neighbors, improve the effect of dimension reduction, proposed a dynamic K value method of massive data reduction based on improved LLE algorithm. Utilized the search algorithms based center point, searched an example neighborly, to ens...

To investigate whether attentional capture by salient visual stimuli is mediated by current task sets, we measured the N2pc component as a marker of the spatial locus of visual attention during visual search. In each trial, a singleton stimulus that could either be a target (color task: red circle; shape task: green diamond) or a nontarget (blue circle or green square) was presented among unifo...

We study the smoothness of quasi-uniform bivariate subdivision. A quasi-uniform bivariate scheme consists of different uniform rules on each side of the y-axis, far enough from the axis, some different rules near the y-axis, and is uniform in the y-direction. For schemes that generate polynomials up to degree m, we derive a sufficient condition for C continuity of the limit function, which is s...

Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the most natural statistical questions for three canonical probabilistic models of networks: (i) community detection in the stochastic block model, (ii) finding the embedding of a random geometric graph, and (iii) finding...

We present an incremental configuration space (CS) construction algorithm for mechanisms described as collections of subassemblies of rigid parts. The inputs are the initial subassembly configurations and the subassembly CSs partitioned into uniform motion regions in which part contacts are constant and motions are monotonic. The output is a partition of the mechanism CS into uniform motion reg...

Time series forecasting by fuzzy inference systems based on optimal non-uniform attractor embedding in the multidimensional delay phase space is analyzed in this paper. A near-optimal set of time lags is identified by evolutionary algorithms after the optimal dimension of the reconstructed phase space is determined by the FNN (false nearest neighbors) algorithm. The fitness function is construc...

There have been extensive studies on non-uniform Gabor bases and frames in recent years. But interestingly there have not been a single example of a compactly supported orthonormal Gabor basis in which either the frequency set or the translation set is non-uniform. Nor has there been an example in which the modulus of the generating function is not a characteristic function of a set. In this pa...

Graphene is one of the ideal nanomaterials to be paired with silicon, and their complementary properties can be exploited in field emission (FE) devices. We reported an efficient way to produce and adjust the dimension of uniform protrusions within graphene. First, a multistep template replication process was utilized to fabricate highly periodic and well-aligned silicon nanowires (SiNWs) of di...

Abstract We present an incremental configuration space (CS) construction algorithm for mechanisms described as collections of subassemblies of rigid parts . The inputs are the initial subassembly configurations and the subassembly CSs partitioned into uniform motion regions in which part contacts are constant and motions are monotonic . The output is a partition of the mechanism CS into uniform...