ppxscal/embedding_network huggingface dataset:
Computing Clusters of Correlation Connected objects
Authors: Christian Böhm, Karin Kailing, Peer Kröger, Arthur Zimek
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the features or some association of cause and effect between them. This association can be arbitrarily complex, i.e. one or more features might be dependent from a combination of several other features. Well-known methods like the principal components analysis (PCA) can perfectly find correlations which are global, linear, not hidden in a set of noise vectors, and uniform, i.e. the same type of correlation is exhibited in all feature vectors. In many applications such as medical diagnosis, molecular biology, time sequences, or electronic commerce, however, correlations are not global since the dependency between features can be different in different subgroups of the set. In this paper, we propose a method called 4C (Computing Correlation Connected Clusters) to identify local subgroups of the data objects sharing a uniform but arbitrarily complex correlation. Our algorithm is based on a combination of PCA and density-based clustering (DBSCAN). Our method has a determinate result and is robust against noise. A broad comparative evaluation demonstrates the superior performance of 4C over competing methods such as DBSCAN, CLIQUE and ORCLUS.
Time-frequency analysis of visual evoked potentials for interhemispheric transfer time and proportion in callosal fibers of different diameters
Authors: Ilkay Ulusoy, Ugur Halici, Erhan Nal&#x00e7;ac&#x0131;, Ilker Ana&#x00e7;, Kemal Leblebicio, Canan Başar-Ero
Venue: Biological Cybernetics (2004)

This study is an extension of the experimental research of Nal&#x00e7;ac&#x0131; et al., who presented 16 subjects with a reversal of checkerboard pattern as stimuli in the right visual field or left visual field and recorded EEG at O1, O2, P3, and P4. They applied the chosen bandpass filters (4&#x2013;8, 8&#x2013;15, 15&#x2013;20, 20&#x2013;32 Hz) to the VEPs of subjects and obtained four different components for each VEP. The first aim of this study is to improve the previous report using some methods in time-frequency domain to estimate interhemispheric delays and amplitudes in a time window. Using the improved estimates of interhemispheric delays, the second aim is to estimate the proportion of callosal fibers of different diameters that are activated by visual stimuli by comparing amplitudes of VEPs in different frequency bands. If the relation between frequency components of VEP and delays for callosal fibers of different dimension were reliable, it would give us an opportunity to deal with amplitude of bandpass-filtered VEPs in order to see approximately the proportion of these fibers activated by a certain stimulus. By using frequency-dependent shifts in time and maximizing the cross correlation of direct VEP (DVEP&#x2013;VEP obtained from contralateral hemisphere)&#x2013;indirect VEP (IVEP&#x2013;VEP obtained from ipsilateral hemisphere) pairs in the time-frequency domain, we examined the delay not only at P100 and N160 peaks but along a meaningful time interval as well. Furthermore, by shifting back the IVEP according to the delay estimated at each time window, both the amplitudes and energies of the synchronized DVEP&#x2013;IVEP pairs were compared at the chosen frequency bands. The percentages of IVEPs at each band was then examined further in conjunction with the distribution of axon diameters in the posterior pole of the CC, questioning the relation between the distributions of the axon diameters and activations at each band. We established an energy definition to express the activation in the fibers. When the energy percentages of IVEPs in theta and alpha were totaled, they were found to be between 76.2% and 81.6%, which is close to the value 74&#x2013;77% for fibers of 0.4&#x2013;1 &#x03bc;m in diameter obtained from anatomical study of human CC. The sum of energy percentages in the beta1 and beta2 bands was between 20.1% and 24.2%, which probably reflects the proportion of activation of callosal fibers 1&#x2013;3 &#x03bc;m in diameter.
Physicomimetics for Mobile Robot Formations
Authors: William M. Spears, Rodney Heil, Diana F. Spears, Dimitri Zarzhitsky
Venue: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (2004)

In prior work we established how physicomimetics can be used to self-organize hexagonal and square lattice formations of mobile robots. In this paper we extend the framework to moving formations, by providing additional theoretical analysis and showing how this theory facilitates the implementation of seven robots in a hexagonal formation moving towards a goal.
Construction of Nonlinear Dynamic MEMS Component Models Using Cosserat Theory
Authors: C. Wang, D. Liu, R. Rosing, B. De Masi, A. Richardson
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper presents a new modelling method for MEMS components based on the Cosserat theory. By constructing Cosserat rod elements, generating symbolic code and developing numeric code in VHDL-AMS for selected demonstrators, we are able to effectively simulate and predict the essential linear and nonlinear behaviour in estimating system performance and guiding the reliability verification process. The simplicity of the Cosserat approach follows from the possibility to formulate interconnected slender components in terms of a network of quasi-rigid bodies (Cosserat elements). This modularization fits well into the behavioural modelling where a relatively low degree of freedom is needed to capture salient features of the system. Furthermore, the manner in which Cosserat elements and their interactions are formulated makes this method ideally suited for nonlinear dynamic simulations in the presence of large deflections.
Workflow View Driven Cross-Organizational Interoperability in a Web Service Environment
Authors: Dickson K. W. Chiu, S. C. Cheung, Sven Till, Kamalakar Karlapalem, Qing Li, Eleanna Kafeza
Venue: Information Technology and Management (2004)

Workflow technology has recently been employed not only within businesses but also as a framework for implementing e-services over the Internet. Such e-services typically require collaborative enactment of workflows across multiple organizations. In this paper, we propose the use of workflow views as a fundamental support mechanism for the interoperability of multiple workflows across business organizations. We present a meta-model of workflow views and their semantics using a cross-organization workflow example based on a supply-chain e-service. We also formulate an interoperation model of workflow views and its consistency criteria. Finally, this paper presents an implementation of the model based on XML and contemporary Web services technologies, with adaptation to our E-ADOME workflow engine.
Proposal of Tradition Handicraft Searching Method Using DCML
Authors: Akihiro Miyakawa, Tomoyuki Ishida, Kaoru Sugita, Yoshitaka Shibata
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In recent years, various types of Web contents which consist of audio, video, graphics and text data are provided on WWW using high-speed networks. Since the volume of those data enormously increase, it is quite difficult to search and retrieve the desired data among them. More efficient and effective search and retrieval method are required to recover from this problem. In particular, the traditional industrial products such as Japanese crafts have various kinds of attributes and cannot be simply classified to take advantage of the conventional relational database system and retrieval system as opposed to the modern industrial products. In order to overcome those difficulties, we propose tradition industrial arts description language DCML with the use of half structure data model (Digital Crafting Mark up Language). Using DCML, database system for traditional industrial products can be easily defined and implemented to retrieve the desired objects by reflecting the user's feeling.
Whole-Part based Composition Approach: A Case Study
Authors: Nicolas Belloir, Fabien Romeo, Jean-Michel Bruel
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Component Based Software Engineering is a good response to actual systems needs: flexibility and adaptability. In this context, design techniques based on software composition and verification techniques proving that the design properties are well implemented, are current and actively studied problematics. In this paper we present a composition design technique based on a formally defined theory: the whole-part relationship. We show, with an in-house verification framework, how to verify an implementation of composition properties. We illustrate our approach with a case study.
E-Marketplace Using Artificial Immune System as Matchmaker
Authors: Tung-Wan Cheng, Wan-Ling Wang, An-Pin Chen
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Architecture Immune Dealing System (AIDS) is a system that uses the artificial immune algorithm that is implemented in the e-marketplace. It has similar architecture as the artificial immune system with agents acting to search for an appropriate match of buyer and seller. The AIDS represents the next generation of services in the e-marketplace, aiming to achieve an efficient and fair e-marketplace with less cost..
Online Control for Self-Management in Computing Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Dependable computer systems hosting critical commerce,transportation, and military applications, amongothers, must satisfy stringent quality-of-service (QoS)requirements. However, as these systems become increasinglycomplex, maintaining the desired QoS bymanually tuning the numerous performance-related parameterswill be very difficult. This paper developsa generic online control framework to designself-managing computer systems. The proposed approachexplores a limited region of the systemstate-space at each time step and decides the best controlaction accordingly. We present two case studiesto demonstrate the practicality of the proposed controlframework.
The CAT for efficient 2D and 3D interaction as an alternative to mouse adaptations
Authors: Martin Hachet, Pascal Guitton, Patrick Reuter
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

We present the first usable prototype of the CAT (Control Action Table). The CAT is a 6 degree of freedom freestanding device, mixing isotonic and isometric sensing modes. It allows a group of users to interact with virtual environments by means of 3D and 2D interaction techniques. The innovating design of the CAT unifies the principle advantages of existing input devices while rejecting their main limitations. We present the resulting characteristics and compare the CAT to existing input devices. A 3D docking task experiment and a demo application have shown that the CAT can be used more efficiently than an 3D isometric desktop device and that the users preferred the CAT. The CAT is contributing to the development of real VR applications.
An XML- and Log-Based Infrastructure For Evaluating And Teaching Spatio-Temporal Indexing Schemes
Authors: Ludger Becker, Tobias Gerke, Klaus Hinrichs, Tina Strauf nee Hausmann, Jan Vahrenhold
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

We present an XML- and log-based infrastructure for spatio-temporal indexing schemes. Our approach is based upon a clear separation between the indexing schemes, algorithms for their visualization, data sets, and the schemes' and data sets' metadata. We show the implications of our approach and discuss how design patterns can be used to facilitate incorporating indexing schemes and data sets.
Analysis of Second-Order Markov Reward Models
Authors: G. Horvath, S. Racz, M. Telek
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper considers the analysis of second-orderMarkov reward models. In these systems the reward accumulationduring state sojourns is not deterministic, but followsa Brownian motion with a state dependent driftand variance parameter. We give the differential equationsthat describe the density function and the momentsof the accumulated reward, and show the similarities comparedto the first-order (ordinary) case. A randomizationbased numerical method is also presented which is numericallystable, has an error bound to control the precision,and allows the efficient analysis of large models. The computationalcost of the proposed procedure is practically thesame as the one of the analysis of first-order reward models,while the modeling power of second-order models is clearly larger.
The inherent queuing delay of parallel packet switches
Authors: Hagit Attiya, David Hay
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

The parallel packet switch (PPS) is extensively used as the core of contemporary commercial switches. This paper investigates the inherent queuing delay and delay jitter introduced by the PPS's demultiplexing algorithm, relative to an optimal work-conserving switch.We show that the inherent queuing delay and delay jitter of a symmetric and fault-tolerant N x N PPS, where every demultiplexing algorithm dispatches cells to all the middle-stage switches is Ω(N), if there are no buffers in the PPS input-ports. If the demultiplexing algorithms dispatch cells only to part of the middle-stage switches, the queuing delay and delay jitter are Ω(N/S), where S is the PPS speedup. These lower bounds hold unless the demultiplexing algorithm has full and immediate knowledge of the switch status. When the PPS has buffers in its input-ports, an Ω(N/S) lower bound holds if the demultiplexing algorithm uses only local information, or the input buffers are small relative to the time an input-port needs to learn the switch global information.
Cross-architecture performance predictions for scientific applications using parameterized models
Authors: Gabriel Marin, John Mellor-Crummey
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

This paper describes a toolkit for semi-automatically measuring and modeling static and dynamic characteristics of applications in an architecture-neutral fashion. For predictable applications, models of dynamic characteristics have a convex and differentiable profile. Our toolkit operates on application binaries and succeeds in modeling key application characteristics that determine program performance. We use these characterizations to explore the interactions between an application and a target architecture. We apply our toolkit to SPARC binaries to develop architecture-neutral models of computation and memory access patterns of the ASCI Sweep3D and the NAS SP, BT and LU benchmarks. From our models, we predict the L1, L2 and TLB cache miss counts as well as the overall execution time of these applications on an Origin 2000 system. We evaluate our predictions by comparing them against measurements collected using hardware performance counters.
Refinable functions and positive operators
Authors: Laura Gori, Francesca Pitolli
Venue: Applied Numerical Mathematics (2004)

The aim of this paper is to study the shape preserving properties of some positive operators constructed by means of B-bases on a finite interval. These bases are obtained by the integer translates of totally positive compactly supported refinable functions. We shall prove that the constructed B-bases generate, on the interval, multiresolution analyses which reproduce polynomials up to a certain degree.
Principles for software environments
Authors: Kenneth Magel
Venue: ACM SIGSOFT Software Engineering Notes (1984)

A large number of software development support environments have been developed during the last few years. Many more are being developed now. This paper presents some principles which should be followed in the development and evolution of such an environment. Stress is placed on the idea that an environment evolves and that the ultimate success or failure of the environment depends on its evolution more than on its initial appearance.
Parallel Flux Sweep Algorithm for Neutron Transport on Unstructured Grid
Authors: Mo Zeyao, Fu Lianxiang
Venue: The Journal of Supercomputing (2004)

Discontinuous finite element discrete ordinates (DFE-Sn) method is widely used to solve the time-dependent neutron transport equation for nuclear science and engineering applications. Most efficiently, the kernel is to iteratively sweep the neutron flux across the computational grid. However, for unstructured grid this will bring forward several challenges while implemented on distributed memory parallel computers where the grid are decomposed across processors. This paper presents a parallel flux sweep algorithm to improve the parallel scalability of this basic sweep algorithm on unstructured grid under 2-D cylindrical Lagrange coordinates system from two sides. One is to prioritize the sweep order of elements within each subdomain, another is to better decompose the unstructured grid across processors. With optimal combination of domain decomposition method and priority queuing algorithm, this parallel algorithm has successfully been incorporated into DFE-Sn method and has been implemented with MPI to solve the neutron and photon coupled transport equation for complex physics. Performance results for two different applications on hundreds of processors of two parallel computers are given in this paper. In particular, the parallel solver has respectively achieved speedup larger than 72 using 92 processors and 78 using 256 processors on these two machines.
On the 80th problem of F.Smarandache(I)
Authors: He Xiaolin, Guo Jinbao
Venue: Smarandache Notions Journal (2004)

Using analytic methold, this paper studies the first power mean of a(n) and its generation, and gives a mean value formula, where a(n) is the sequence in problem 80 of "only problems not solutions" which was presented by professor F. Smarandache.
Motion to support rapid interactive queries on node--link diagrams
Authors: Colin Ware, Robert Bobrow
Venue: ACM Transactions on Applied Perception (TAP) (2004)

Many different problems can be represented as graphs displayed in the form of node--link diagrams. However, when a graph is large it becomes visually uninterpretable because of the tangle of links. We describe a set of techniques that use motion in an interactive interface to provide effective access to larger graphs. Touching a node with the mouse cursor causes that node and the subgraph of closely connected nodes to oscillate. We argue from perceptual principles that this should be a more effective way of interactively highlighting a subgraph than more conventional static methods. The MEGraph system was developed to gain experience with different forms of motion highlighting. Based on positive feedback, three experiments were carried out to evaluate the effectiveness of motion highlighting for specific tasks. All three showed motion to be more effective than static highlighting, both in increasing the speed of response for a variety of visual queries, and in reducing errors. We argue that motion highlighting can be a valuable technique in applications that require users to understand large graphs.
Fingerprint Matching Based on Directional Image Constructed Using Expanded Haar Wavelet Transform
Authors: M. Mokji, S. A. R. Abu-Bakar
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In this paper, a directional image for a fingerprint obtained from an expanded second stage Haar wavelet transform is presented. This directional image will represent the orientation pattern that later on will be used for fingerprint matching so that the real owner can be identified. To construct the directional image, we first perform a second stage Haar wavelet transform on a fingerprint. Due to the limitation of the Haar wavelet, we use the expanded version of it instead so that a better directional image can be obtained. Next, we quantize the directional image into a few grey-level values that represent a range of angle orientations. We then smooth the image using an averaging filter. Based on this image we then perform the matching process based on the minimum square error (MSE) criteria.
LASH-TOR: A Generic Transition-Oriented Routing Algorithm
Authors: Tor Skeie, Olav Lysne, J. Flich, P. Lopez, A. Robles, J. Duato
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Cluster networks are seen as the future access networksfor multimedia streaming, E-commerce, network storage,etc. For these applications, performance and high availabilityare particularly crucial. Regular topologies are preferredwhen performance is the primary concern. However,due to spatial constraints or fault-related issues, the networkstructure may become irregular, which makes moredifficult to find deadlock-free minimal paths.Over the recent years, several solutions have been proposed.One of them is the LASH routing, which enables minimalrouting by assigning paths to different virtual layers.In this paper, we propose an extension of LASH in orderto reduce the number of required virtual layers by allowingtransitions between virtual layers.Evaluation results show that the new routing scheme(LASH-TOR) is able to obtain full minimal routing with areduced number of virtual channels. For torus and meshnetworks, with only two virtual channels, LASH throughputis increased by an average factor of improvement of3.30 for large networks. For regular networks with some unconnected(faulty) links, equal performance improvementsare achieved. Even for highly irregular networks of size upto 128 switches the new routing scheme only needs three virtualchannels for guaranteeing minimal routing. Besides,LASH-TOR performs well compared to Dimension OrderRouting for mesh and torus networks.
Scrubbing Away Transients and Jiggling Around the Permanent: Long Survival of FPGA Systems Through Evolutionary Self-Repair
Authors: Miguel Garvie, Adrian Thompson
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

The Jiggling architecture extending TMR+Scrubbing isshown to mitigate FPGA transient and permanent faults usinglow overhead. Mission operation is never interrupted.The repair circuitry is sufficiently small that a pair could mutuallyrepair each other. A minimal evolutionary algorithm isused during permanent fault self-repair. Reliability analysisof the studied case shows the system has a 0.99 probabilityof surviving 17 times the mean time to local permanent faultarrival. Such a system would be 0.99 probable to survive 100years with one fault every 6 years.
Separation Principles for Input-Output and Integral-Input-to-State Stability
Authors: D. Angeli, B. Ingalls, E. D. Sontag, Y. Wang
Venue: SIAM Journal on Control and Optimization (2004)

We present new characterizations of input-output-to-state stability. This is a notion of detectability formulated in the ISS (input-to-state stability) framework. Equivalent properties are presented in terms of asymptotic estimates of the state trajectories based on the magnitudes of the external input and output signals. These results provide a set of separation principles for input-output-to-state stability---characterizations of the property as conjunctions of weaker stability notions. When applied to the notion of integral ISS, these characterizations yield analogous results.