ppxscal/embedding_network huggingface dataset:
Guest Editors' Introduction: Sketch-Based Interaction
Authors: Takeo Igarashi, Bob Zeleznik
Venue: IEEE Computer Graphics and Applications (2007)

Two key research areas must advance before sketch-based interfaces can transition from a collection of individually provocative research prototypes into a computing platform of choice. First, fundamental techniques for segmenting, recognizing, and parsing collections of ink strokes must be generalized and made more robust with better user models. Second, developers must go beyond redesign and actually reinvent their applications to leverage pen input's intrinsic capacity for rapid, direct, modeless 2D expression. Solving either of these problems independently is no guarantee of success. Guest editors Takeo Igarashi of the University of Tokyo and Bob Zeleznik of Brown University introduce this special issue, which reflects on these two research themes.
Digitized Bio-physical Therapy of Skin
Authors: V. Resl, M. Leba, A. Lojek, M. Ciz, P. Hyrsl, L. Palko, I. Rampl
Venue: Proceedings of the First International Conference on the Digital Society (2007)

The article gives a brief survey of present-day knowledge obtained in the research into the influence of planar pulsed magnetic and luminous fields on live tissue with simultaneous application of existing and practically tested bio-physical methods used in the treatment of human skin, with emphasis on digitizing all the medical processes. This approach provides the posibility of using remote control in the treatment via computer nets (e.g. the Internet), and it represents an advance in some selected treatments. The method being developed is advantageous particularly in dermatology, cosmetics and cosmetic surgery.
Teaching microcontrollers
Authors: C. E. Nunnally
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This presentation provides a brief look at the process used to teach microcontrollers to junior/seniors in EE and CpE. Each pair of students is issued a development hardware kit and related software. All software development is perfected on the student's required personal computer. The style presented permits teaching of several microcontrollers i.e. Motorola 68HC11, Intel 8051 and Microchip PIC family. Example laboratories are suggested. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Unsupervised adaptive separation of impulse signals applied to EEG analysis
Authors: A. Rouxel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The theoretical properties of a novel self adaptive source separation algorithm are studied. It is a normalized version of a modified relative gradient. It is shown that its stability domain in terms of the normalized kurtosises of sources is complementary of the unmodified gradient algorithm. So it can separate a source with a very high kurtosis from other sources having positive kurtosis. The algorithm is then used to analyze EEG signals because they often have positive kurtosises especially for patients suffering from epilepsy. The good behavior of this novel algorithm is illustrated via simulated data and then demonstrated with real signals in an EEG analysis to separate an epileptic source from other brain signals.
Object-based image segmentation using DWT/RDWT multiresolution Markov random field
Authors: Lei Zheng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper introduces a segmentation algorithm for object-based image coding techniques. This scheme is based on discrete wavelet transform (DWT)/redundant discrete wavelet transform (RDWT) and multiresolution Markov random field (MMRF). The DWT based MMRF works well for noise-free images. It merges details in the original image with their respective visual objects and divides the image into different segments according to their textures. The RDWT based MMRF is a generalization of the DWT based MMRF. When the noise level is high, the RDWT based MMRF reduces the influence of noise in the segmentation procedure and generates much better results at some computing costs. The proposed algorithm has been successfully integrated with our DWT based region of interest (ROI) compression coder, the generalized self-similarity trees (GST) codec, for networking applications.
Spatio-temporal polarization signaling for multipath spread-spectrum channels
Authors: E. N. Onggosanusi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A spread-spectrum spatio-temporal signaling scheme based on electric field polarization is proposed. The information symbol is transmitted via two perpendicular transverse electric field components, each with a unique signature sequence. At the receiver, all three electric field components are measured. It is demonstrated that polarization signaling provides another degree of freedom for increasing spatial diversity to improve the performance of the wireless link.
Simple Method of Increasing the Coverage of Nonself Region for Negative Selection Algorithms
Authors: Andrzej Chmielewski, Slawomir T. Wierzchon
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

One of the intriguing applications of immune-inspired negative selection algorithm is anomaly detection in the datasets. Such a detection is based on the self/nonself discrimination and its characteristic feature is the ability of detecting nonself samples (anomalies) by using only information about the self, or regular, samples. Thus the problem space (Universe) is splitted into two disjoint subspaces: One of them contains self samples and the second is covered by the samples which activate the detectors generated by the negative selection algorithms. Hence, the efficiency of negative selection algorithms is proportional to the degree of coverage (by the detectors) of nonself subspace. In this paper, we present a simple method of increasing the coverage for real-valued negative selection algorithm.
Fuzzy recursive symbol-by-symbol detector for single user CDMA receivers
Authors: J. Bas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The Bayesian or maximum a posteriori (MAP) symbol-by-symbol detector allows minimum BER single user detection in CDMA systems with less memory requirements than the multiuser maximum likelihood sequence estimator. This work proposes a further complexity reduction by developing a fuzzy recursive implementation of the Bayesian detector. Simulation studies demonstrate the almost optimal performance of the developed fuzzy detector. The resulting system offers a performance v.s. complexity trade-off very appealing for detection in a 3/sup rd/ generation mobile handset.
Compact Hilbert Indices for Multi-Dimensional Data
Authors: Chris H. Hamilton, Andrew Rau-Chaplin
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Space-filling curves, particularly Hilbert curves, have proven to be a powerful paradigm for maintaining spatial groupings of multi-dimensional data in a variety of application areas including database systems,data structures and distributed information systems. One significant limitation in the standard definition of Hilbert curves is the requirement that the grid size (i.e. the cardinality) in each dimension be the same. In the real world, not all dimensions are of equal size and the work-around of padding all dimensions to the size of the largest dimension wastes memory and disk space, while increasing the time spent manipulating and communicating these "inflated" values. In this paper we define a new compact Hilbert index which, maintains all the advantages of the standard Hilbert curve and permits dimension cardinalities of varying sizes. This index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This is particularly important in distributed applications (Parallel, P2P and Grid), in which not only is memory space saved but communication volume reduced.
Service-Oriented Architecture and Web 2.0
Authors: Jared T. Howerton
Venue: IT Professional (2007)

For CIOs, managing cybersecurity means anticipating threats and a whole lot more.
Integrated Stochastic Supply-Chain Design Models
Authors: Zuo-Jun (Max) Shen
Venue: Computing in Science and Engineering (2007)

A supply chain is a network of facilities and activities that procure, produce, and distribute goods to customers. Many uncertainties within a supply chain can substantially affect its performance. The author discusses how to model these uncertainties in integrated supply-chain design models and studies their impacts on optimal supply-chain decisions.
4G Self-Configurable System Based on Nueral Networks
Authors: M. C. Juan Antonio Arizaga Silva
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

This work present the study on two types of neuronal networks for a fourth generation (4G) selfconfigurable wireless communications system. Simulations were made in MATLAB to study the behavior of two types of neuronal networks, Back Propagation Network (BPN) and Radial Basis Function (RBF) trained to discriminate signals taken from three systems of wireless communication of second (2G) and third generation (3G). When the results are observed it seems that designed network BPN, generates a smaller error of recognition in addition of which it contains a smaller number of neurons than network RBF, this reduces the system time response in addition of which it allows a saving in the memory use.
How Developers Develop Features
Authors: Orla Greevy, Tudor Girba, Stephane Ducasse
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software systems are typically developed by teams of developers, with responsibilities for different parts of the code. Knowledge of how the developers collaborate, and how their responsibilities are distributed over the software artifacts is a valuable source of information when reverse engineering a system. Determining which developers are responsible for which software artifacts (e.g., packages or classes) is just one perspective. In this paper we complement the static perspective with the dynamic perspective of a system in terms of its features. We want to extract information about which developers are responsible for which features. To achieve these two perspectives, we correlate developer responsibilities both with a structural view of the system and with a feature view. We identify which developers are responsible for which features, and whether the responsibilities correspond with structural source code artifacts or with features. We apply our technique to two software projects developed by two teams of students as part of their course work, and to one large open source project.
Asymptotic optimality of competitive associative nets and its application to incremental learning of nonlinear functions
Authors: Shuichi Kurogi
Venue: Systems and Computers in Japan (2007)

The competitive associative net CAN2 is a neural net that provides piecewise-linear approximation through incremental learning of a nonlinear function by the associative net function. The effectiveness of this net has already been shown by applications to function approximation, control, precipitation estimation, and other problems. The learning algorithm essentially includes competitive learning based on the gradient method and suffers from the local solution problem. The purpose of this paper is to circumvent this problem. First, the asymptotic optimality condition, that is, the optimality condition for minimizing the mean-square error of the approximation function, is derived for the case in which the net is composed of a very large number of units. This condition can be used to decide whether the weight assignment each time is close to the optimal solution, and also to suggest weight assignments closer to the optimal solution. The condition is incorporated into a learning algorithm based on the gradient method, resulting in the following learning algorithm: when it is decided that the weight assignment obtained by the gradient method is not close to the optimal solution, the weights of some units are reinitialized so that the weight assignment is closer to the optimal solution. Finally, numerical experiments are performed in which the proposed learning algorithm is applied to several benchmark functions. The effectiveness of the proposed algorithm is verified. The results are compared to the results of experiments by BPN (Back-Propagation Net), RBFN (Radial Basis Function Net), and SVR (Support Vector Regression), and it is shown that CAN2 based on the proposed algorithm has excellent function approximation performance. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 85&ndash;96, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10538
A quantitative investigation of the effect of hypermedia navigational aid style on user performance and the intervening influence of cognitive style
Authors: Barbara Levine
Venue:  (2006)

Websites typically present the same navigational aid to all users, often with aesthetics or programming convenience dictating the design of that navigational aid. This study possessed two main purposes for improving the selection and design of website navigational aids. The first purpose of this study was to examine the effect of hypermedia navigational aid style on user performance. A directional hypothesis predicted that a graphical site map navigational aid leads to better user performance during website information search tasks than does a traditional textual menu of hyperlinks. The second purpose of this study was to determine whether cognitive style served as an intervening variable on user performance with each navigational aid style. Non-directional hypotheses predicted that cognitive style influenced the effect on user performance of each navigational aid style. A further non-directional hypothesis predicted that one navigational aid style is more effective than the other is, for each cognitive style. Participants performed information search tasks using one of the two navigational aids, and then completed a cognitive styles assessment. Participants' performance on the information search tasks were measured according to correctness of results, elapsed time, number of mouse clicks, and participant usability ratings of the websites. Statistical analyses of these user performance metrics showed that one navigational aid style had a slight advantage over the other in the general case, and that cognitive style moderately influenced the effectiveness of the navigational aids.
The Number of k -Faces of a Simple d -Polytope
Authors: A. Bj&#x00f6;rner, S. Linusson
Venue: Discrete Computational Geometry (1999)

Consider the question: Given integers 0 \le k<d<n , does there exist a simple d -polytope with n faces of dimension k ? We show that there exist numbers G(d,k) and N(d,k) such that for n> N(d,k) the answer is yes if and only if {G(d,k)} divides n . Furthermore, a formula for G(d,k) is given, showing that, e.g., G(d,k)=1 if $k \ge \left\lfloor (d+1)/{2}\right\rfloor$ or if both d and k are even, and also in some other cases (meaning that all numbers beyond N(d,k) occur as the number of k -faces of some simple d -polytope). This question has previously been studied only for the case of vertices (k=0 ), where Lee [Le] proved the existence of N(d,0) (with G(d,0)=1 or 2 depending on whether d is even or odd), and Prabhu [P1] showed that $N(d,0) \le cd\sqrt {d}$. We show here that asymptotically the true value of Prabhu's constant is $c=\sqrt2 $ if d is even, and c=1 if d is odd.
BiTAM: bilingual topic AdMixture models for word alignment
Authors: Bing Zhao, Eric P. Xing
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We propose a novel bilingual topical admixture (BiTAM) formalism for word alignment in statistical machine translation. Under this formalism, the parallel sentence-pairs within a document-pair are assumed to constitute a mixture of hidden topics; each word-pair follows a topic-specific bilingual translation model. Three BiTAM models are proposed to capture topic sharing at different levels of linguistic granularity (i.e., at the sentence or word levels). These models enable word-alignment process to leverage topical contents of document-pairs. Efficient variational approximation algorithms are designed for inference and parameter estimation. With the inferred latent topics, BiTAM models facilitate coherent pairing of bilingual linguistic entities that share common topical aspects. Our preliminary experiments show that the proposed models improve word alignment accuracy, and lead to better translation quality.
SphereViz - Data Exploration in a Virtual Reality Environment
Authors: Marco Soldati, Mario Doulis, Andre Csillaghy
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We present SphereViz, a novel 3D user interface for the visual exploration of multi-dimensional data sets in virtual reality environments. SphereViz builds on known visualization and search concepts like RadViz and RelevanceSphere. It combines them with 3D-interaction techniques like World in Miniature for projection in virtual environments. A prototype implementation of SphereViz allows to study, on one hand, the visualization methods of images in 3D space, and on the other hand, intuitive search methods and adequate interaction techniques.
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation
Authors: Jean-Luc Beuchat, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

In this paper, we propose a modified çT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.
Reconstruction of 3D human body pose from stereo image sequences based on top-down learning
Authors: Hee-Deok Yang, Seong-Whan Lee
Venue: Pattern Recognition (2007)

This paper presents a novel method for reconstructing a 3D human body pose from stereo image sequences based on a top-down learning method. However, it is inefficient to build a statistical model using all training data. Therefore, the training data is hierarchically divided into several clusters to reduce the complexity of the learning problem. In the learning stage, the human body model database is hierarchically constructed by classifying the training data into several sub-clusters with silhouette images. The data of each cluster in the bottom level is represented by a linear combination of examples. In the reconstruction stage, the proposed method hierarchically searches a cluster for the best matching silhouette image using a silhouette history image (SHI). Then, the 3D human body pose is reconstructed from a depth image using a linear combination of examples method. By using depth information to reconstruct 3D human body pose, the similar poses in silhouette images are estimated as different 3D human body poses. The experimental results demonstrate that the proposed method is efficient and effective for reconstructing 3D human body poses.
A simple boiling module
Authors: Theodore Kim, Mark Carlson
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Recent efforts to visually capture the phenomena of boiling have proposed monolithic approaches that extend the basic techniques underlying existing fluid solvers. In this work, we show that if we instead treat boiling as a separate computational module to be loosely coupled to an existing solver, a very easy to implement, highly efficient algorithm can be designed that produces excellent visual results, even on coarse (643) grids. The algorithm is also highly SIMD-amenable, allowing the boiling computation to be farmed out to a GPU or Playstation 3 Cell processor. Our algorithm takes less than 100 lines of commented, readable C + +, and can be integrated into an existing particle level set fluid solver with virtually no modifications. A serial implementation consumes between 3-5% of the overall running time, and a preliminary SIMD implementation shows that a 643 simulation runs at 130 FPS, making the computational cost of the module totally negligible.
Stereo echo cancellation algorithm using imaginary input-output relationships
Authors: S. Shimauchi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A stereo teleconferencing system provides greater presence in teleconferencing compared with a monaural system. It helps listeners distinguish who is talking at the other end by means of spatial information. The most important problem in stereo echo cancellation is that the adaptive filter often misconverges or, if not, its convergence speed is very slow because of the crosscorrelation between stereo signals. A new stereo echo cancellation algorithm using imaginary input-output relationships is proposed. This algorithm is based on the idea of approximating the input-output relationships for the reversed stereo signals. Unlike conventional methods, which use the input-output relationships in only one situation, our algorithm uses the simultaneous equations for the input-output relationships under two different conditions. Consequently, convergence to the unique steady-state solution is faster than with the conventional algorithm. Computer simulations using data recorded in a conference room demonstrate the effectiveness of this algorithm.
Broadcast Authentication Protocol with Time Synchronization and Quadratic Residues Chain
Authors: Bogdan Groza
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Assuring information authenticity is an important issue in the field of information security. A new broadcast authentication protocol is proposed. The protocol is based on time synchronization and uses chains constructed with the squaring function. The proposed solution is efficient for transmissions over long periods of time since the chains have an unbounded length. The protocol assures information authenticity at the reduced cost of almost one modular multiplication for each broadcasted packet. Time synchronization issues are discussed and the security of the protocol is equivalent to factoring since the squaring function is used. A failure mode analysis of the protocol is done; this is also an aspect of novelty and applies to other protocols based on time synchronization as well.
On sampling theory and basic Sturm-Liouville systems
Authors: M. H. Annaby, J. Bustoz M. E. H. Ismail
Venue: Journal of Computational and Applied Mathematics (2007)

We investigate the sampling theory associated with basic Sturm-Liouville eigenvalue problems. We derive two sampling theorems for integral transforms whose kernels are basic functions and the integral is of Jackson's type. The kernel in the first theorem is a solution of a basic difference equation and in the second one it is expressed in terms of basic Green's function of the basic Sturm-Liouville systems. Examples involving basic sine and cosine transforms are given.