ppxscal/embedding_network huggingface dataset:
Topology driven 3D mesh hierarchical segmentation
Authors: Julien Tierny, Jean-Philippe Vandeborre, Mohamed Daoudi
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper, we propose to address the semanticoriented 3D mesh hierarchical segmentation problem, using enhanced topological skeletons [18]. This high level information drives both the feature boundary computation as well as the feature hierarchy definition. Proposed hierarchical scheme is based on the key idea that the topology of a feature is a more important decomposition criterion than its geometry. First, the enhanced topological skeleton of the input triangulated surface is constructed. Then it is used to delimit the core of the object and to identify junction areas. This second step results in a fine segmentation of the object. Finally, a fine to coarse strategy enables a semanticoriented hierarchical composition of features, subdividing human limbs into arms and hands for example. Method performance is evaluated according to seven criteria enumerated in latest segmentation surveys [3]. Thanks to the high level description it uses as an input, presented approach results, with low computation times, in robust and meaningful compatible hierarchical decompositions.
Fault Tolerant Approaches to Nanoelectronic Programmable Logic Arrays
Authors: Wenjing Rao, Alex Orailoglu, Ramesh Karri
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Programmable logic arrays (PLA), which can implement arbitrary logic functions in a two-level logic form, are promising as platforms for nanoelectronic logic due to their highly regular structure compatible with the nano crossbar architectures. Reliability is an important challenge as far as nanoelectronic devices are concerned. Consequently, it is necessary to focus on the fault tolerance aspects of nanoelectronic PLAs to ensure their viability as a foundation for nanoelectronic systems. In this paper, we investigate two types of fault tolerance techniques for nanoelectronic device based PLAs, focusing at the online faults occurring at the cross-points of nano devices. We develop a scheme to precisely locate the faults online, as this is a crucial step for efficient online reconfiguration based fault tolerance schemes. We also propose a tautology based fault masking scheme. We demonstrate that these two types of fault tolerance schemes developed for nano PLAs significantly improve at low hardware cost the reliability of the high fault occurrence nanoelectronic environment.
A Clinical Virtual Reality Rehabilitation System for Phobia Treatment
Authors: Barnabas Takacs, Lajos Simon
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper describes a unified approach to applying virtual reality for clinical rehabilitation and its uses to administer cognitive, mental and physicals exercises. Our goal is to create a flexible and reconfigurable VR solution that can be readily installed in hospitals and serve all needs of a rehabunit with ease. We have successfully used this system for treating cognitive deficits and phobias and present details that underline the usability and importance of our solution.
Interdisciplinary team learning in a semiconductor processing course
Authors: E. L. Allen
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

We describe a course in which the traditional "cookbook" approach to laboratory assignments is abandoned in favor of an attempt to experiment "without recipes". In fact, we do use a "recipe" to fabricate electronic devices (PMOS transistors), but simultaneously, experiments in processing science are designed, implemented, and reported on by students. By creating a "start-up company" atmosphere, one where the "employees" (students) are responsible for their own "profits" (learning), a more cooperative environment has been created, where students learn more and strengthen many of the skills needed for industry in addition to gaining the knowledge content of semiconductor processing.
UBMSS (Understanding Based Managing Support Systems) as an Example of the Application of Cognitive Analysis in Data Analysis
Authors: Lidia Ogiela
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This paper discusses a general method of applying UBMSS (Understanding Based Managing Support Systems) in data analysis. The method proposed is based on the analysis of economic data, especially data that is essential for a company's strategic decisions. The general method of applying UBMSS as sub-systems of a more general class of cognitive categorization systems is presented as a theoretical example of economic data analysis and interpretation.
Shape analysis with inductive recursion synthesis
Authors: Bolei Guo, Neil Vachharajani, David I. August
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Separation logic with recursively defined predicates allows for concise yet precise description of the shapes of data structures. However, most uses of separation logic for program analysis rely on pre-defined recursive predicates, limiting the class of programs analyzable to those that manipulate only a priori data structures. This paper describes a general algorithm based on inductive program synthesis that automatically infers recursive shape invariants, yielding a shape analysis based on separation logic that can be applied to any program. A key strength of separation logic is that it facilitates, via explicit expression of structural separation, local reasoning about heap where the effects of altering one part of a data structure are analyzed in isolation from the rest. The interaction between local reasoning and the global invariants given by recursive predicates is a difficult area, especially in the presence of complex internal sharing in the data structures. Existing approaches, using logic rules specifically designed for the list predicate to unfold and fold linked-lists, again require a priori knowledge about the shapes of the data structures and do not easily generalize to more complex data structures. We introduce a notion of "truncation points" in a recursive predicate, which gives rise to generic algorithms for unfolding and folding arbitrary data structures.
Lower Bounds for Achieving Synchronous Consensus with Orderly Crash Failure
Authors: Rong Zhang, Yong Meng Teo, Qijuan Chen, Xianbing Wang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The time lower bounds for both uniform consensus and early stopping consensus have already been proved in synchronous distributed systems with crash failures, but both have not been proved with orderly crash failures and remain as open problems. This paper uses a bivalency argument proof to solve the two open problems. The first open problem is how to prove the lower bound, min (t + 1, f + 2) rounds, for early-stopping synchronous consensus with orderly crash failures, where t \le n - 1 and 0 \leqslant f \leqslant t - 1. The second problem is to prove that the lower bound for early deciding uniform consensus with orderly crash failures is (f + 2)-rounds where 0 \leqslant f \leqslant t - 2, and (f + 1)-rounds when f = t and t -1.
A fast M-D Chandrasekhar algorithm for second order Volterra adaptive filtering
Authors: M. Sayadi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents a fast method for nonlinear filtering based on multichannel Chandrasekhar equations. By assuming that the adaptive second order Volterra filter may be transformed in a multichannel input linear filter, we present a new form of the second order Volterra filtering based a the fast multichannel Chandrasekhar algorithm. This method has a computational complexity of 3.N/sup 3/ multiplications per time instant, where N represents the memory span in number of samples of the nonlinear system model. This compares with 7.N/sup 3/ multiplications required for application of the fast Kalman filter with the same approach. A direct implementation of the RLS algorithm has a computational complexity of N/sup 6/. The adaptive filter is successfully used in a second order Volterra system identification in a stationary environment.
A System Dynamics Approach to Study Virtual Communities
Authors: Yan Mao, Julita Vassileva, Winfried Grassmann
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In recent years, extensive studies of many interesting aspects of virtual community dynamics promoted a better understanding of this area. One of the most challenging problems facing builders of virtual communities is the design of incentive mechanisms that can ensure user participation. However, running virtual community experiments in the real world is expensive, and requires a great deal of motivation from users. In this paper we advocate a system dynamics approach to simulate the overall behaviors of participants in the communities, which can provide insights into the user motivation process, incentive mechanism evaluation and community development. A simulation model for a virtual community called Comtella is presented, and the results are very promising.
A Large-Grain Parallel Programming Environment for Non-Programmers
Authors: Ted Lewis
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Banger is a parallel programming environment used by non-professional programmers to write explicitly parallel large-grain parallel programs. The goals of Banger are: 1. extreme ease of use, 2. immediate feedback, and 3. machine-independence. Banger is based on three principles: 1. separation of parallel programming-in-the-large from sequential programming-in-the-small, 2. separation of programming environment from target machine dependency, and 3. instant feedback to user wherever possible.
An integrated solution to distributed data requirements
Authors: P. W. Flur, J. B. Lockhart, S. Yalamanchili
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Recent developments within the World Wide Web (WWW) and attendant user interfaces (e.g. Mosaic, Netscape) have produced well defined protocols for describing, communicating, and viewing hypertext information. This ability to uniformly handle different types of information has created tremendous opportunities for re-engineering the means by which disparate information is managed and communicated among individuals and organizations. In the School of Electrical and Computer Engineering (ECE) at the Georgia Institute of Technology, this technology is being used as the building block for integrating administrative, instructional, and research services. The paper describes some of our experiences as well lessons that we have learned while migrating our services to this technology.
A five-year study of file-system metadata
Authors: Nitin Agrawal, William J. Bolosky, John R. Douceur, Jacob R. Lorch
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

For five years, we collected annual snapshots of filesystem metadata from over 60,000 Windows PC file systems in a large corporation. In this paper, we use these snapshots to study temporal changes in file size, file age, file-type frequency, directory size, namespace structure, file-system population, storage capacity and consumption, and degree of file modification. We present a generative model that explains the namespace structure and the distribution of directory sizes. We find significant temporal trends relating to the popularity of certain file types, the origin of file content, the way the namespace is used, and the degree of variation among file systems, as well as more pedestrian changes in sizes and capacities. We give examples of consequent lessons for designers of file systems and related software.
Innovations in a global distance education program
Authors: K. Randall
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The success of distance learning programs is highly dependent on the organizational environment in which they are implemented. This paper discusses how one large organization implemented and evolved a global distance learning program. The primary focus of this paper is the extraction of the perceived benefits and lessons learned during the development and use of this distance learning program. The lessons learned are generalizable and can be transferred to other organizations with appropriate attention to organizational context and environment.
Performance Evaluation of DS-CDMA Based OFDM Multiuser System for Ultra Wideband (UWB) Communication
Authors: Himanshu B. Soni, U. B. Desai, S. N. Merchant
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

Here we have considered multiuser communication scenario with Ultra wideband (UWB) communication. We propose two schemes for downlink communication, which are DS-CDMA based OFDM systems. For both the schemes, performance is compared with TH-PPM UWB proposed in [1-3]. Performance of both the schemes is evaluated with additive white Gaussian noise (AWGN) channel. We have considered effect of higher spreading factor for AWGN channel. Also, we investigate performance of both the schemes under fading channel with different numbers of multipath components.
Comparison of Khepera robot navigation by evolutionary neural networks and pain-based algorithm
Authors: Liu Xin, P. Vadakkepat, Xiao Peng
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A comparison of mobile robot navigation using evolutionary neural networks and the pain based algorithm is discussed in this paper. The controllers are designed based on evolutionary neural networks and the pain-based algorithms. The performance of the controllers are verified with the Khepera robot.
Latin American Perspectives on Grid Computing, from Bahia Blanca, Argentina
Authors: Javier Echaiz, Jorge Ardenghi
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

A computational grid is a distributed infrastructure that appears to the end user as one large computing resource across organization boundaries. Grid technologies enable large-scale sharing of resources within formal or informal consortia of individuals and/or institutions, usually called virtual organizations. In these settings, the discovery, characterization, and monitoring of resources, services, and computations can be challenging due to the considerable diversity, large numbers, dynamic behavior, and geographical distribution of the entities in which a user might be interested. This work explores the grid computing current state and perspectives in Latin America. In particular, we describe potential grid application areas and the experiences of our group in this promising field of research. Also, considering that grid trends are showing the importance of grid services we also identify some limitations and future research directions on this domain.
Integrating Motion, Illumination, and Structure in Video Sequences with Applications in Illumination-Invariant Tracking
Authors: Yilei Xu, Amit K. Roy-Chowdhury
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

In this paper, we present a theory for combining the effects of motion, illumination, 3D structure, albedo, and camera parameters in a sequence of images obtained by a perspective camera. We show that the set of all Lambertian reflectance functions of a moving object, at any position, illuminated by arbitrarily distant light sources, lies "close” to a bilinear subspace consisting of nine illumination variables and six motion variables. This result implies that, given an arbitrary video sequence, it is possible to recover the 3D structure, motion, and illumination conditions simultaneously using the bilinear subspace formulation. The derivation builds upon existing work on linear subspace representations of reflectance by generalizing it to moving objects. Lighting can change slowly or suddenly, locally or globally, and can originate from a combination of point and extended sources. We experimentally compare the results of our theory with ground truth data and also provide results on real data by using video sequences of a 3D face and the entire human body with various combinations of motion and illumination directions. We also show results of our theory in estimating 3D motion and illumination model parameters from a video sequence.
Numerical Function Generators Using LUT Cascades
Authors: Tsutomu Sasao, Shinobu Nagayama, Jon T. Butler
Venue: IEEE Transactions on Computers (2007)

This paper proposes an architecture and a synthesis method for high-speed computation of fixed-point numerical functions such as trigonometric, logarithmic, sigmoidal, square root, and combinations of these functions. Our architecture is based on the lookup table (LUT) cascade, which results in a significant reduction in circuit complexity compared to traditional approaches. This is suitable for automatic synthesis and we show a synthesis method that converts a Matlab-like specification into an LUT cascade design. Experimental results show the efficiency of our approach as implemented on a field-programmable gate array (FPGA).
Enhancing SWORD to Detect Zero-Day-Worm-Infected Hosts
Authors: Shad Stafford, Jun Li, Toby Ehrenkranz
Venue: Simulation (2007)

Once a host is infected by an Internet worm, prompt action must be taken before that host does more harm to its local network and the rest of the Internet. It is therefore critical to quickly detect that a worm has infected a host. In this paper, we enhance our SWORD system to allow for the detection of infected hosts and evaluate its performance. This enhanced version of SWORD inherits the advantages of the original SWORD: it does not rely on inspecting traffic payloads to search for worm byte patterns or setting up a honeypot to lure worm traffic. Furthermore, while acting as a host-level detection system, it runs at a network's gateway and stays transparent to individual hosts. We show that our enhanced SWORD system is able to quickly and accurately detect if a host is infected by a zero-day worm. Furthermore, the detection is shown to be effective against worms of different types and speeds, including polymorphic worms
Two-view feature generation model for semi-supervised learning
Authors: Rie Kubota Ando, Tong Zhang
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We consider a setting for discriminative semi-supervised learning where unlabeled data are used with a generative model to learn effective feature representations for discriminative training. Within this framework, we revisit the two-view feature generation model of co-training and prove that the optimum predictor can be expressed as a linear combination of a few features constructed from unlabeled data. From this analysis, we derive methods that employ two views but are very different from co-training. Experiments show that our approach is more robust than co-training and EM, under various data generation conditions.
Error concealment for MPEG-4 video communication in an error prone environment
Authors: S. Shirani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We propose an error concealment method for shape information in the MPEG-4 coded video sequences. A maximum a posteriori estimator, which employs an adaptive Markov random field, is used to restore the missing shape information. The proposed concealment method successfully reconstructs the missing shape data, with good computation-performance tradeoffs.
Dependency-Based Construction of Semantic Space Models
Authors: Sebastian Padó, Mirella Lapata
Venue: Computational Linguistics (2007)

Traditionally, vector-based semantic space models use word co-occurrence counts from large corpora to represent lexical meaning. In this article we present a novel framework for constructing semantic spaces that takes syntactic relations into account. We introduce a formalization for this class of models, which allows linguistic knowledge to guide the construction process. We evaluate our framework on a range of tasks relevant for cognitive science and natural language processing: semantic priming, synonymy detection, and word sense disambiguation. In all cases, our framework obtains results that are comparable or superior to the state of the art.
The solution of the two-dimensional sine-Gordon equation using the method of lines
Authors: A. G. Bratsos
Venue: Journal of Computational and Applied Mathematics (2007)

The method of lines is used to transform the initial/boundary-value problem associated with the two-dimensional sine-Gordon equation in two space variables into a second-order initial-value problem. The finite-difference methods are developed by replacing the matrix-exponential term in a recurrence relation with rational approximants. The resulting finite-difference methods are analyzed for local truncation error, stability and convergence. To avoid solving the nonlinear system a predictor-corrector scheme using the explicit method as predictor and the implicit as corrector is applied. Numerical solutions for cases involving the most known from the bibliography line and ring solitons are given.
Supervised classification using MCMC methods
Authors: M. Davy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper addresses the problem of supervised classification using general Bayesian learning. General Bayesian learning consists of estimating the unknown class-conditional densities from a set of labelled samples. However, the estimation requires to evaluate intractable multidimensional integrals. This paper studies an implementation of general Bayesian learning based on Markov chain Monte Carlo (MCMC) methods.
An MMSE-based beamforming algorithm for smart antenna applied to an MC-CDMA system with co-channel interference
Authors: Zhang Mingde, Jewoo Kim, Giwan Yoon
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper proposes an adaptive beamforming algorithm, called MC-MMSE, for adaptive antennas applied to an MC-CDMA system. A new method for updating the weight vector based on the MSE criterion is derived. Computer simulations show that the MC-MMSE algorithm is capable of rejecting co-channel interference that affects the MC-CDMA system. Thus, the BER performance of the MC-CDMA system is much higher than that of the MC-CDMA system without using adaptive antenna and that of the DS-CDMA system with adaptive antenna in multipath Rayleigh fading channel.