ppxscal/embedding_network huggingface dataset:
Language acquisition through a human-robot interface by combining speech, visual, and behavioral information
Authors: Naoto Iwahashi
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

This paper describes new language-processing methods suitable for human-robot interfaces. These methods enable a robot to learn linguistic knowledge from scratch in unsupervised ways. The learning is done through statistical optimization in the process of human-robot communication, combining speech, visual, and behavioral information in a probabilistic framework. The linguistic knowledge learned includes speech units like phonemes, lexicon, and grammar, and is represented by a graphical model that includes hidden Markov models. In experiments, a robot was eventually able to understand utterances according to given situations, and act appropriately.
Thermal Management of High Performance Microprocessors
Authors: Arman Vassighi, Oleg Semenov, Manoj Sachdev, Ali Keshavarzi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

In deep sub-micron technologies, increased standby current in high performance processors will result in increased junction temperature. Evaluated temperature will have positive feedback on the standby current. If the temperature is not controlled, it may lead to the thermal runaway. In this paper we investigate the thermal management of high performance chips in the burn-in environment.
Unsupervised learning of the morphology of a natural language
Authors: John Goldsmith
Venue: Computational Linguistics (2001)

This study reports the results of using minimum description length (MDL) analysis to model unsupervised learning of the morphological segmentation of European languages, using corpora ranging in size from 5,000 words to 500,000 words. We develop a set of heuristics that rapidly develop a probabilistic morphological grammar, and use MDL as our primary tool to determine whether the modifications proposed by the heuristics will be adopted or not. The resulting grammar matches well the analysis that would be developed by a human morphologist.In the final section, we discuss the relationship of this style of MDL grammatical analysis to the notion of evaluation metric in early generative grammar.
Energy Profiler for Hardware/Software Co-Design
Authors: Raghukiran Sreeramaneni, Sarma B. K. Vrudhula
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The increasing popularity of low power computing drivesthe need for increasing battery life-time by power-optimizingapplication programs. This requires a tool capableof providing a system-level energy model. We present amethodology for simulating and profiling energy consumedby software applications running on computing systems.The uniqueness of our framework lies in its ability to captureat a fine granularity, power behavior of the softwareexecuting on the system as well as of each of the hardwarecomponents in the system and its applicability to a wide varietyof computing systems. We demonstrate our work on areal world platform, the Itsy, a handheld computer developedby Compaq's Western Research Labs.
A performance study of four index structures for set-valued attributes of low cardinality
Authors: Sven Helmer, Guido Moerkotte
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structures (sequential signature files, signature trees, extendible signature hashing, and inverted files) for a fast retrieval of sets with low cardinality. We compared the index structures by implementing them and subjecting them to extensive experiments, investigating the influence of query set size, database size, domain size, and data distribution (synthetic and real). The results of the experiments clearly indicate that inverted files exhibit the best overall behavior of all tested index structures.
Towards a Sound Modular Model Checking of Collaboration-Based Software Designs
Authors: Nguyen Truong Thang, Takuya Katayama
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Collaboration-based designs [2, 8, 11] are an effectivesoftware development approach due to its achievement inseparation of concerns [5, 12]. These designs also demanda new model checking technique allowing to provesystem correctness by verifying each collaboration individuallywith a minimum assumption about other collaborations.To verify a collaboration of multiple actors, a typicaltechnique consists of constructing a standard cross-productof actor statecharts as global state space and then checkingproperties with respect to that global space.This paper initially points out some drawbacks of a previousapproach [2] in verifying collaboration. Then, inaddition to intra-object behaviors in statecharts as of [2],we first improve the technique by imposing additional constraintsto model checking process via protocol invariantswhich are essentially inter-object behaviors. Due to theseadditional constraints, state space is reduced and more importantly,our model reflects more accurately about systembehavior by eliminating those unreachable states. Second,a more general form, i.e. multiple exit and re-entry states,of the interface between two collaborations is used insteadof a fixed interface with single exit and re-entry states.Some pre-processing work on reentry states and solutionsto specifics of properties to be verified are also discussedregarding to the soundness of the verification algorithm.
Tagging English text with a probabilistic model
Authors: Bernard Merialdo
Venue: Computational Linguistics (1994)

In this paper we present some experiments on the use of a probabilistic model to tag English text, i.e. to assign to each word the correct tag (part of speech) in the context of the sentence. The main novelty of these experiments is the use of untagged text in the training of the model. We have used a simple triclass Markov model and are looking for the best way to estimate the parameters of this model, depending on the kind and amount of training data provided. Two approaches in particular are compared and combined:using text that has been tagged by hand and computing relative frequency counts,using text without tags and training the model as a hidden Markov process, according to a Maximum Likelihood principle.Experminents show that the best training is obtained by using as much tagged text as possible. They also show that Maximum Likelihood training, the procedure that is routinely used to estimate hidden Markov models parameters from training data, will not necessarily improve the tagging accuracy. In fact, it will generally degrade this accuracy, except when only a limited amount of hand-tagged text is available.
Three Legs, No Wobble
Authors: Andy Hunt, Dave Thomas
Venue: IEEE Software (2004)

This month, the column looks at how to ruin a software project in just three easy steps. These approaches will kill a project every time. Fortunately, three simple practices can save a project from these and other common mishaps: version control, unit testing, and automation. The authors discuss what's important about each of these areas and list commonly used, freely available open source tools that can help.
On the existence of totally anti-symmetric quasigroups of order 4k+2
Authors: Michael Damm
Venue: Computing (2003)

Totally anti-symmetric quasigroups are employed in check digit systems. We give counterexamples to a conjecture of Ecker and Poch and show that there are totally anti-symmetric quasigroups for all orders n ≡ 0, 1, 3 mod 4, n = 4(5k + 2) + 2, and n = 4(7k + 3) + 2. We prove that finite totally anti-symmetric quasigroups possess a transversal, and we give a useful condition for quasigroups not to have a transversal.
Quantifiers in XQuery
Authors: Norman May, Sven Helmer, Guido Moerkotte
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

We present algebraic equivalences that allow to unnest nested algebraic expressions containing quantifiers for order-preserving algebraic operators. We illustrate how these equivalences can be applied successfully to unnest nested queries formulated in XQuery. Measurements illustrate the performance gains possible by unnesting.
A new perspective on single and multi-variate differential equations
Authors: N. Gurappa, Prasanta K. Panigrahi, T. Shreecharan
Venue: Journal of Computational and Applied Mathematics (2003)

We elaborate upon a new method of solving linear differential equations, of arbitrary order, which is applicable to a wide class of single and multi-variate equations. Our procedure separates the operator part of the equation under study in to a part containing a function of the Euler operator and constants, and another one retaining the rest. The solution of the equation is then obtained from the monomials (or the monomial symmetric functions, for the multi-variate case), which are the eigenfunctions of the Euler operator. Novel exponential forms of the solutions of the differential equations enable one to analyze the underlying symmetries of the equations and explore the algebraic structures of the solution spaces in a straightforward manner. The procedure allows one to derive various properties of the orthogonal polynomials and functions in a unified manner. After showing how the generating functions and Rodriguez formulae emerge naturally in this method, we briefly outline the generalization of the present approach to the multi-variate case.
Video input driven animation (vida)
Authors: Eugene Fiume
Venue:  (2003)

There are many challenges associated with the integration of synthetic and real imagery. One particularly difficult problem is the automatic extraction of salient parameters of natural phenomena in real video footage for subsequent application to synthetic objects. Can we ensure that the hair and clothing of a synthetic actor placed in a meadow of swaying grass will move consistently with the wind that moved that grass? The video footage can be seen as a controller for the motion of synthetic features, a concept we call video input driven animation (VIDA). We propose a schema that analyzes an input video sequence, extracts parameters from the motion of objects in the video; and uses this information to drive the motion of synthetic objects. To validate the principles of VIDA; we approximate the inverse problem to harmonic oscillation, which we use to extract parameters of wind and of regular water waves. We observe the effect of wind on a tree in a video; estimate wind speed parameters from its motion; and then use this to make synthetic objects move. We also extract water elevation parameters from the observed motion of boats and apply the resulting water waves to synthetic boats.
Optimum tolerance design for complex assemblies using hierarchical interval constraint networks
Authors: Christopher C. Yang, V. N. Achutha Naikan
Venue: Computers and Industrial Engineering (2003)

In this paper, we propose two efficient algorithms for optimal allocation of tolerance among the components of complex assembly with large number of constraints and entities. Basic concepts of hierarchical interval constraint networks have been used for deriving the objective functions and constraint functions of the problem. The optimization problem is then solved by two different algorithms and the results are compared. The first algorithm is based on Lagrange multipliers and the second one is developed based on an iterative relative sensitivity analysis procedure. The relative sensitivity analysis algorithm can practically handle any number of constraints and entities with required level of accuracy, whereas the Lagrange multiplier algorithm is more suitable for simple problems. The proposed algorithms accept any type of cost-tolerance relationship for modeling. The algorithms are illustrated using two examples. The first example is the tolerance design of a tank, which is solved by both algorithms, and the results are compared. A second example of a movable double bearing assembly has been discussed to show that the relative sensitivity analysis algorithm can handle complex tolerance design problems, which is difficult or inaccurate to solve by Lagrange multiplier algorithm.
A model of the chemical vapor deposition of Si1-x-yGexCy films from silane, germane and methyl silane
Authors: M. W. Stoker, T. Merchant, A. Morton, J. Hildreth
Venue: Microelectronic Engineering (2003)

A model has been developed for the chemical vapor deposition of epitaxial Si1-x-yGexCy films from SiH4, GeH4 and SiH3CH3. The model is based on a simplified chemical mechanism including adsorption and decomposition of SiH4, GeH4 and H2 on vacant Si or Ge sites and subsequent H2 desorption. The model focuses on effects at relatively high pressures (i.e., 1-200 Torr) where suppression of deposition by adsorbed hydrogen becomes important, resulting in an inverse dependence of the deposition rate on pressure and giving rise to a strong dependence of Ge concentration on the deposition temperature. The model assumes that this temperature dependence is due to the influence of adsorbed hydrogen on segregation of Ge to the surface and the relative concentration of vacant Si and Ge sites. The model also includes a simple treatment of carbon incorporation from SiH3CH3. The model predictions of deposition rate, Ge content and both total and substitutional carbon content compare favorably with experimental data over a wide range of conditions.
Evolving intelligent game-playing agents
Authors: Nelis Franken, Andries P. Engelbrecht
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Traditional game playing programs have relied on advanced search algorithms and hand-tuned evaluation functions to play 'intelligently'. A historical overview of these techniques is provided, followed by a revealing look at recent developments in co-evolutionary strategies to facilitate game learning. The use of particle swarms in conjunction with neural networks to learn how to play tic-tac-toe is experimentally compared to current game learning research. The use of a new particle swarm neighbourhood structure and innovative board state representation show promising results that warrant further investigation to its application in more complex games like checkers.
Computational spectrotemporal auditory model with applications to acoustical information processing
Authors: Tai-Shih Chi
Venue:  (2003)

A computational spectrotemporal auditory model based on neurophysiological findings in early auditory and cortical stages is described. The model provides a unified multiresolution representation of the spectral and temporal features of sound likely critical in the perception of timbre. Several types of complex stimuli are used to demonstrate the spectrotemporal information preserved by the model. Shown by these examples, this two stage model reflects the apparent progressive loss of temporal dynamics along the auditory pathway from the rapid phase-locking (several kHz in auditory nerve), to moderate rates of synchrony (several hundred Hz in midbrain), to much lower rates of modulations in the cortex (around 30 Hz). To complete this model, several projection-based reconstruction algorithms are implemented to resynthesize the sound from the representations with reduced dynamics. One particular application of this model is to assess speech intelligibility. The spectro-temporal Modulation Transfer Functions (MTF) of this model is investigated and shown to be consistent with the salient trends in the human MTFs (derived from human detection thresholds) which exhibit a lowpass function with respect to both spectral and temporal dimensions, with 50% bandwidths of about 16 Hz and 2 cycles/octave. Therefore, the model is used to demonstrate the potential relevance of these MTFs to the assessment of speech intelligibility in noise and reverberant conditions. Another useful feature is the phase singularity emerged in the scale space generated by this multiscale auditory model. The singularity is shown to have certain robust properties and carry the crucial information about the spectral profile. Such claim is justified by perceptually tolerable resynthesized sounds from the nonconvex singularity set. In addition, the singularity set is demonstrated to encode the pitch and formants at different scales. These properties make the singularity set very suitable for traditional speech tasks such as vowel recognition or speaker (music instrument) identification. Other potential applications and future modification of this model are also discussed at the end.
Optimized prefactored compact schemes
Authors: Graham Ashcroft, Xin Zhang
Venue: Journal of Computational Physics (2003)

The numerical simulation of aeroacoustic phenomena requires high-order accurate numerical schemes with low dispersion and dissipation errors. In this paper we describe a strategy for developing high-order accurate prefactored compact schemes, requiring very small stencil support. These schemes require fewer boundary stencils and offer simpler boundary condition implementation than existing compact schemes. The prefactorization strategy splits the central implicit schemes into forward and backward biased operators. Using Fourier analysis, we show it is possible to select the coefficients of the biased operators such that their dispersion characteristics match those of the original central compact scheme and their numerical wavenumbers have equal and opposite imaginary components. This ensures that when the forward and backward stencils are added, the original central compact scheme is recovered. To extend the resolution characteristic of the schemes, an optimization strategy is employed in which formal order of accuracy is sacrificed in preference to enhanced resolution characteristics across the range of wavenumbers realizable on a given mesh. The resulting optimized schemes yield improved dispersion characteristics compared to the standard sixth- and eighth-order compact schemes making them more suitable for high-resolution numerical simulations in gas dynamics and computational aeroacoustics. The efficiency, accuracy and convergence characteristics of the new optimized prefactored compact schemes are demonstrated by their application to several test problems.
Almost k-wise independence versus k-wise independence
Authors: Noga Alon, Oded Goldreich, Yishay Mansour
Venue: Information Processing Letters (2003)

We say that a distribution over {0,1}n is (ε,k)-wise independent if its restriction to every k coordinates results in a distribution that is ε-close to the uniform distribution. A natural question regarding (ε, k)-wise independent distributions is how close they are to some k-wise independent distribution. We show that there exist (ε, k)-wise independent distributions whose statistical distance is at least nO(k) ċ ε from any k-wise independent distribution. In addition, we show that for any (ε,k)-wise independent distribution there exists some k-wise independent distribution, whose statistical distance is nO(k) ċ ε.
Interactive constraint-aided conceptual design
Authors: Barry O'Sullivan
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Engineering conceptual design can be defined as that phase of the product development process during which the designer takes a specification for a product to be designed and generates many broad solutions to it. This paper presents a constraint-based approach to supporting interactive conceptual design. The approach is based on an expressive and general technique for modeling: the design knowledge that a designer can exploit during a design project; the life-cycle environment that the final product faces; the design specification that defines the set of requirements the product must satisfy; and the structure of the various schemes that are developed by the designer. A computational reasoning environment based on constraint filtering is proposed as the basis of an interactive design support tool. Using such a tool, human designers can be assisted in interactively developing and evaluating a set of schemes that satisfy the various constraints imposed on the design.
Support vector machines for classification of histopathological images of brain tumour astrocytomas
Authors: D. Glotsos, P. Spyridonos, P. Petalas, G. Nikiforidis, D. Cavouras, P. Ravazoula, P. Dadioti, I. Lekka
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A computer-based image analysis system was developed for the automatic classification of brain tumours according to their degree of malignancy using Support Vector Machines (SVMs). Morphological and textural nuclear features were quantified to encode tumour malignancy. 46 cases were used to construct the SVM classifier. Best vector was obtained performing an exhaustive search procedure in feature space. SVM classifier gave 84.8% accuracy using the leave-one-out method. To validate the systems' generalization to unseen data, 41 cases collected from a different hospital were utilized. For the validation unseen data set classification performance was 82.9%. The generalization ability of the proposed classification methodology was verified enforcing the belief that automatic characterization of brain tumours might be feasible in every day clinical routine.
A Multipole Method for Schwarz--Christoffel Mapping of Polygons with Thousands of Sides
Authors: Lehel Banjai, L. N. Trefethen
Venue: SIAM Journal on Scientific Computing (2003)

A method is presented for the computation of Schwarz--Christoffel maps to polygons with tens of thousands of vertices. Previously published algorithms have CPU time estimates of the order O(N3) for the computation of a conformal map of a polygon with N vertices. This has been reduced to O(N log N) by the use of the fast multipole method and Davis's method for solving the parameter problem. The method is illustrated by a number of examples, the largest of which has $N \approx 2 \times 10^5$.
High speed and multimedia communication
Authors: Lothar Mackert
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

The presentation gives an overview of the activities at the IBM European Networking Center (ENC) in high speed and multimedia communications. ENC is involved in major efforts towards defining and prototyping communication systems for Europe 's evolving high speed networks, such as RACE (R&D in Advanced Communication in Europe) and BERKOM (BERliner KOMmunikationssystem).One of the main application drivers for fiber-based networks will be multimedia, which will be important for many industry sectors and the home market as well. Within BERKOM and RACE, the IBM European Networking Center investigates communication support for isochronous information and its integration with data. To achieve this goal, protocols, communication software implementation techniques, and operating system integration have to be revisited. The talk will give an overview of HeiTS, the Heidelberg Transport System, which implements high-speed multimedia communication on an RS/6000, AIX based environment.