ppxscal/embedding_network huggingface dataset:
A service-based approach to components for effective business-IT alignment
Authors: Zoran Stojanovic, Ajantha Dahanayake
Venue: Practicing software engineering in the 21st century (2003)

Although Component-Based Development (CBD) platforms and technologies, such as CORBA, COM+/.NET and Enterprise Java Beans (EJB), are now de facto standards for implementation and deployment of complex enterprise distributed systems, the full benefit of the component way of thinking has not yet been gained. Current CBD approaches and methods treat components mainly as binary-code implementation packages or as larger grained business objects in system analysis and design. Little attention has been paid to the potential of the component way of thinking in filling the gap between business and information technology (IT) issues. This chapter proposes a service-based approach to the component concept representing the point of convergence of business and technology concerns. The approach defines components as the main building blocks of business-driven service-based system architecture that provides effective business-IT alignment.
Protecting Sensitive Knowledge By Data Sanitization
Authors: Stanley R. M. Oliveira, Osmar R. Zaïane
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we address the problem of protecting somesensitive knowledge in transactional databases. The challengeis on protecting actionable knowledge for strategicdecisions, but at the same time not losing the great benefitof association rule mining. To accomplish that, we introducea new, efficient one-scan algorithm that meets privacyprotection and accuracy in association rule mining, withoutputting at risk the effectiveness of the data mining per se.
3-D tele-direction interface using video projector
Authors: Shinsaku Hiura, Kenji Tojo, Seiji Inokuchi
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

We developed a direction system for assisting the work in a real world from a distant site. At first, the 3-D shape of the object is measured and sent to the distant PC. A supervisor at the distant site can observe the CG of the object and draw annotation figures on it. The figures of the direction message are projected onto the object using projectors. The worker is free from any wearing equipment, ex. HMD, and multi projectors avoid the problem of occlusion by the worker body.
Optimization of scannable latches for low energy
Authors: Victor Zyuban
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

This paper covers a range of issues in the design of latches and flip-flops for low-power applications. First it revisits, extends, and improves the energy-performance optimization methodology, attempting to make it more formal and comprehensive. The data-switching factor and the glitching activity are taken into consideration, using a formal analytical approach, then a notion of an energy-efficient family of configurations is introduced to make the comparison of different latch styles in the energy-performance space more fair. A recently proposed methodology for balancing hardware intensity in processor pipelines is applied to latch design to facilitate the selection of the objective function for tuning transistor sizes. The power dissipation of the clock distribution is taken into account, supported by simulations of extracted netlists for multibit datapath registers. Practical issues of building a low overhead scan mechanism are considered, and the power overhead of the scannable design is analyzed. A low-power level-sensitive scan mechanism is proposed, and results of a comparative study of scannable latches are shown. The applicability of the proposed scan mechanism to a wide variety of latches is demonstrated.
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Authors: Federico Angiolini, Luca Benini, Alberto Caprara
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main challenge in SPM design is mapping memory locations to scratchpad locations. This paper describes an algorithm to optimally solve such a mapping problem by means of Dynamic Programming applied to a synthesizable hardware architecture. The algorithm works by mapping segments of external memory to physically partitioned banks of an on-chip SPM; this architecture provides significant energy savings. The algorithm does not require any user-set bound on the number of partitions and takes into account partitioning overhead. Improving on previous solutions, execution time is polynomial in the input size. Strategies to optimize memory requirements and speed of the algorithm are exploited. Additionally, we integrate this algorithm in a complete and automated design, simulation and synthesis flow.
Mesh Generation and Refinement of Polygonal Data Sets
Authors: V. Savchenko, I. Semenova, N. Kojekine, O. Egorova, M. Savchenko, I. Hagiwara
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

This paper presents work in progress andcontinues a project devoted to developing shapemodeling system based on implementation of radialbased function (RBF) technology. In this paper, westudy the opportunities offered by this technology tocomputer-aided design and computer graphicscommunities by looking at the problems of surfacegeneration and enhancement. Experimental resultsare included to demonstrate the functionality of ourmesh-modeling tool.
Silhouette Analysis-Based Gait Recognition for Human Identification
Authors: Liang Wang, Tieniu Tan, Huazhong Ning, Weiming Hu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--Human identification at a distance has recently gained growing interest from computer vision researchers. Gait recognition aims essentially to address this problem by identifying people based on the way they walk. In this paper, a simple but efficient gait recognition algorithm using spatial-temporal silhouette analysis is proposed. For each image sequence, a background subtraction algorithm and a simple correspondence procedure are first used to segment and track the moving silhouettes of a walking figure. Then, eigenspace transformation based on Principal Component Analysis (PCA) is applied to time-varying distance signals derived from a sequence of silhouette images to reduce the dimensionality of the input feature space. Supervised pattern classification techniques are finally performed in the lower-dimensional eigenspace for recognition. This method implicitly captures the structural and transitional characteristics of gait. Extensive experimental results on outdoor image sequences demonstrate that the proposed algorithm has an encouraging recognition performance with relatively low computational cost.
Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
Authors: Dudley Stark
Venue: Combinatorics, Probability and Computing (1999)

Assemblies are decomposable combinatorial objects characterized by a sequence mi that counts the number of possible components of size i. Permutations on n elements, mappings from a set containing n elements into itself, 2-regular graphs on n vertices, and set partitions on a set of size n are all assemblies with natural decompositions. Logarithmic assemblies are characterized by constants &theta; > 0 and &kappa;0 > 0 such that mi&kappa;i0&#x002F; (i&minus;1)! &rarr; &theta;. Random mappings, permutations and 2-regular graphs are all logarithmic assemblies, but set partitions are not.Given a logarithmic assembly, all representatives having total size n are chosen uniformly and a component counting process C(n) = (C1(n), C2(n), &hellip;, Cn(n)) is defined, where Ci(n) is the number of components of size i. Our results also apply to C(n) distributed as the Ewens sampling formula with parameter &theta;. Denote the component counting process up to size at most b by Cb(n) = (C1(n), C2(n), &hellip;, Cb(n)). It is natural to approximate Cb by Zb = (Z1, Z2, &hellip;, Zb), the b-dimensional process of independent Poisson variables Zi for which the ith variable has expectation &Eopf;Zi = mi&kappa;i0 exp((1&minus;&theta;)i&#x002F;n)&#x002F;i!. We find asymptotics for the total variation distance between Cb(n) and Zb.
Material modification of the patterned wafer during dry etching and strip determined by XPS
Authors: Y. Furukawa, M. Patz, T. Kokubo, J. H. M. Snijders
Venue: Microelectronic Engineering (2003)

XPS analysis on single damascene (SD) patterned wafers was performed to study the modification of materials, especially the sidewall, during etching and strip. LKD-5109, MSQ-type materials (k≈2.2) were used as ILD, SiC/SiO2 as top hard mask (HM), and SiC as bottom liner. The etching in Ar/CF4/CH2F2/O2 creates a CFx polymer passivation layer on all patterned surfaces. The etched sidewall surface consists of two regions; a thin skin layer of CFx polymer and CF-rich SiOC layer behind. An N2/O2 strip removes CFx polymer and CF-rich layer efficiently (less than 1 at.% fluorine content). Instead of fluorine, CN-rich layers containing 11-20 at.% nitrogen were observed for all surfaces. After N2/O2 strip, the sidewall consists of two regions; a few nanometers of CN rich SiOC layer at the surface and several tens of nanometers of a C-depleted oxide type layer. N2/H2 strip provides a thinner C-depleting oxide type layer than either N2/O2 and CF4/O2 strips. However, the N2/H2 strip cannot eliminate fluorine contamination more than the N2/O2 strip.
GRAAL -- A Development Framework for Embedded Graphics Accelerators
Authors: D. Crisu, S. D. Cotofana, S. Vassiliadis, P. Liuha
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper presents a versatile hardware/software cosimulation and co-design environment for embedded 3D graphics accelerators. The GRAphics AcceLerator design exploration framework (GRAAL) is an open system which offers a coherent development methodology based on an extensive library of SystemC RTL models of graphics pipeline components. GRAAL incorporates tools to assist in the visual debugging of the graphics algorithms implemented in hardware, and to estimate the performance in terms of throughput, power consumption, and area.
Matrix bidiagonalization: implementation and evaluation on the Trident processor
Authors: Mostafa I. Soliman, Stanislav G. Sedukhin
Venue: Neural, Parallel Scientific Computations (2003)

This paper discusses the parallel implementation and evaluation of the reduction of a dense matrix to bidiagonal form on the Trident processor. The standard Golub and Kahan Householder bidiagonalization algorithm, which is rich in matrix-vector operations, and the LAPACK subroutine _GEBRD, which is rich in a mixture of vector, matrix-vector, and matrix operations, are simulated on the Trident processor. We show how to use the Trident parallel execution units, ring, and communication registers to effectively perform vector, matrix-vector, and matrix operations needed for bidiagonalizing a matrix. The number of clock cycles per FLOP is used as a metric to evaluate the performance of the Trident processor. Our results show that the high-efficiency is attained by using as much as possible matrix-vector and matrix operations because of reducing the ratio of memory accesses to FLOP. On a 32K×32K matrix and 128 Trident lanes, the speedup of using matrix-vector operations on the standard Golub and Kahan algorithm over using only vector operations on one lane is around 190 times (superlinear) and on 128 lanes is around two times. However, using matrix operations on the _GEBRD subroutine gives speedup around 307 times (superlinear) over using vector operations on one lane, 3.2 times over using vector operations on 128 lanes, and 1.3 times over using matrix-vector operations.
Tail behaviour of Gaussian processes with applications to the Brownian pillow
Authors: Alex J. Koning, Vladimir Protasov
Venue: Journal of Multivariate Analysis (2003)

In this paper we investigate the tail behaviour of a random variable S which may be viewed as a functional T of a zero mean Gaussian process X, taking special interest in the situation where X obeys the structure which is typical for limiting processes occurring in nonparametric testing of (multivariate) independency and (multivariate) constancy over time. The tail behaviour of S is described by means of a constant a and a random variable R which is defined on the same probability space as S. The constant a acts as an upper bound, and is relevant for the computation of the efficiency of test statistics converging in distribution to S. The random variable R acts as a lower bound, and is instrumental in deriving approximation for the upper percentage points of S by simulation.
Eliminating redundant search space on backtracking for forward chaining theorem proving
Authors: Lifeng He, Yuyan Chao, Hidenori Itoh
Venue: Journal of Computer Science and Technology (2003)

This paper introduces some improvements on the intelligent backtracking strategy for forward chaining theorem proving. How to decide a minimal useful consequent atom set for a refutation derived at a node in a proof tree is discussed. In most cases, an unnecessary non-Horn clause used for forward chaining will be split only once. The increase of the search space by invoking unnecessary forward chaining clauses will be nearly linear, not exponential anymore. In this paper, the principle of the proposed method and its correctness are introduced. Moreover, some examples are provided to show that the proposed approach is powerful for forward chaining theorem proving.
Transparent Surface Modeling from a Pair of Polarization Images
Authors: Daisuke Miyazaki, Masataka Kagesawa, Katsushi Ikeuchi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--We propose a method for measuring surface shapes of transparent objects by using a polarizing filter. Generally, the light reflected from an object is partially polarized. The degree of polarization depends upon the incident angle, which, in turn, depends upon the surface normal. Therefore, we can obtain surface normals of objects by observing the degree of polarization at each surface point. Unfortunately, the correspondence between the degree of polarization and the surface normal is not one to one. Hence, to obtain the correct surface normal, we have to solve the ambiguity problem. In this paper, we introduce a method to solve the ambiguity by comparing the polarization data in two objects, i.e., normal position and tilted with small angle position. We also discuss the geometrical features of the object surface and propose a method for matching two sets of polarization data at identical points on the object surface.
Model-based talking face synthesis for anthropomorphic spoken dialog agent system
Authors: Tatsuo Yotsukura, Shigeo Morishima, Satoshi Nakamura
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Towards natural human-machine communication, interface technologies by way of speech and image information have been intensively developed. An anthropomorphic dialog agent is an ideal system, which integrates spoken dialog and natural facial expressions. This paper reports on our project aiming to create a general-purpose toolkit for building an easily customizable anthropomorphic agent. There have been almost no tools so far such as intuitive, easy to understand, fully interactive, and open source. Our anthropomorphic agent is designed to fulfill these requirements. This toolkit consists four modules, multi modal dialog integration, speech recognition, speech synthesis, and face image synthesis. These modules are highly modularized and interlinked by a simple communication protocols.In this paper, we focus on the construction of an agent's face image synthesis. For this part lip movement control synchronous to the speech signal and facial emotion expression are the most important parts. We developed the face image synthesis module (FSM) that only requires one frontal face image, and can be used by any skill level of users. A user's original agent can be generated by easy adjustment of the frontal face image and the generic wire-frame model. The paper describes overall system diagram and specifically the agent's face image synthesis part.
A constructive count of rotation symmetric functions
Authors: Pantelimon Stanica, Subhamoy Maitra
Venue: Information Processing Letters (2003)

In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). This helps in constructing rotation symmetric Boolean functions by respecting the rules we present here.
A family of optimized Runge-Kutta methods with five stages and fourth order for IVPS with oscillating solutions
Authors: Z. A. Anastassi, T. E. Simos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this paper we present a family of explicit Runge-Kutta methods of 4th algebraic order with 5 stages for the efficient solution of problems with oscillating solutions. The main purpose is to achieve better results by minimizing the dispersion and dissipation of the method, while maintaining constant algebraic order.
RDF metadata for XML access control
Authors: Vaibhav Gowadia, Csilla Farkas
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

In this paper we present an access control framework that provides flexible security granularity for XML documents. RDF statements are used to represent security objects and to express security policy. The concepts of simple security object and association security object are defined. Our model allows to express and enforce access control on XML trees and their associations. Access control rules, corresponding to (s, o, &plusmn;a) triples, are represented as RDF statements with properties access type, user, and object. A history file is maintained for each user that allows decision-making using temporal data.
Efficient higher-order algorithms for solving reaction-diffusion equations
Authors: Wenyuan Liao
Venue:  (2003)

In this dissertation, we will focus on developing efficient higher order algorithms for solving systems of nonlinear reaction-diffusion equations with Dirichlet, Neumann and Robin boundary conditions. The equations are widely used in modeling and simulations of numerous important processes in science and engineering. We will start from Crank-Nicolson algorithm, which is second order accurate in both temporal and spatial dimensions and unconditional stable, to develop higher order efficient algorithms using approximate factorization and Richardson's extrapolation. The new algorithms are fourth order accurate in both temporal and spatial dimensions and only require a three-point stencil in each dimension. The main objectives of this dissertation include: (1) To develop efficient implicit higher-order algorithms for solving systems of two and three-dimensional nonlinear reaction-diffusion equations. (2) To develop efficient methods to approximate Dirichlet, Neumann and Robin boundary conditions. (3) To conduct stability analyses for the new algorithms. (4) To carry out numerical experiments to demonstrate the accuracy and stability of the new algorithms.
Color Imaging by using of DSP Implementation of Different Filters
Authors: A. J. Rosales Silva, V. I. Ponomaryov
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Non linear filtering techniques are presented tosuppress impulsive noise and preserve fine imagedetails. Directional processing, non parametricapproach and order statistics filters have beeninvestigated. The before presented novel algorithmMM-KNN is adapted to color imaging. Differentcriterions have been used to characterize theperformances of color imaging such as impulsive noisesuppression, edge and detail preservation. Theanalyzed algorithms have been implemented on DSPTexas Instruments to obtain the values of processingtime when different intensity noise corrupts the colorimage.
Correlating synchronous and asynchronous data streams
Authors: Sudipto Guha, D. Gunopulos, Nick Koudas
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In a variety of modern mining applications, data are commonly viewed as infinite time ordered data streams rather as finite data sets stored on disk. This view challenges fundamental assumptions commonly made in the context of several data mining algorithms.In this paper, we study the problem of identifying correlations between multiple data streams. In particular, we propose algorithms capable of capturing correlations between multiple continuous data streams in a highly efficient and accurate manner. Our algorithms and techniques are applicable in the case of both synchronous and asynchronous data streaming environments. We capture correlations between multiple streams using the well known technique of Singular Value Decomposition (SVD). Correlations between data items, and the SVD technique in particular, have been repeatedly utilized in an off-line (non stream) data mining problems, for example forecasting, approximate query answering, and data reduction.We propose a methodology based on a combination of dimensionality reduction and sampling to make the SVD technique suitable for a data stream context. Our techniques are approximate, trading accuracy with performance, and we analytically quantify this tradeoff. We present a through experimental evaluation, using both real and synthetic data sets, from a prototype implementation of our technique, investigating the impact of various parameters in the accuracy of the overall computation. Our results indicate, that correlations between multiple data streams can be identified very efficiently and accurately. The algorithms proposed herein, are presented as generic tools, with a multitude of applications on data stream mining problems.
DOVE: drawing over video environment
Authors: Jiazhi Ou, Xilin Chen, Susan R. Fussell, Jie Yang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We demonstrate a multimedia system that integrates pen-based gesture and live video to support collaboration on physical tasks. The system combines network IP cameras, desktop PCs, and tablet PCs (or PDAs) to allow a remote helper to draw on a video feed of a workspace as he/she provides task instructions. A gesture recognition component enables the system both to normalize freehand drawings to facilitate communication with remote partners and to use pen-based input as a camera control device. The system also embeds some tools, such as controlled video delay, gesture delay, and remote camera pan-tilt-zoom control. The system provides a software environment for studying multimodal/multimedia communication for remote collaborative physical tasks.
Online novelty detection on temporal sequences
Authors: Junshui Ma, Simon Perkins
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In this paper, we present a new framework for online novelty detection on temporal sequences. This framework include a mechanism for associating each detection result with a confidence value. Based on this framework, we develop a concrete online detection algorithm, by modeling the temporal sequence using an online support vector regression algorithm. Experiments on both synthetic and real world data are performed to demonstrate the promising performance of our proposed detection algorithm.