ppxscal/embedding_network huggingface dataset:
JBEAM: Coding Lines and Curves via Digital Beamlets
Authors: Xiaoming Huo, Jihong Chen, David L. Donoho
Venue: Proceedings of the Conference on Data Compression (2004)

Beamlets are combined with zero-tree coding algorithm to create a newcoding method, particularly suitable for lines and curves. Beamlets are a multiscale collection of line segments at a range of scales, location, having a varietyof lengths and orientations. The new coding scheme-named JBEAM-is moreefficient-in terms of bit rates-in coding binary curvy images in simulations.
"-Quaternion Splines for the Smooth Interpolation of Orientations
Authors: Gregory M. Nielson
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--We present a new method for smoothly interpolating orientation matrices. It is based upon quaternions and a particular construction of ¿-spline curves. The new method has tension parameters and variable knot (time) spacing which both prove to be effective in designing and controlling key frame animations.
Invariance in motion analysis of videos
Authors: Cen Rao, Mubarak Shah, Tanveer Syeda-Mahmood
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we propose an approach that retrieves motion of objects from the videos based on the dynamic time warping of view invariant characteristics. The motion is represented as a sequence of dynamic instants and intervals, which are automatically computed using the spatiotemporal curvature of the trajectory of moving object in the videos. Dynamic Time Warping (DTW) method matches trajectories using a view invariant similarity measure. Our system is able to incrementally learn different actions without any initialization mode, therefore it can work in an unsupervised manner. The retrieval of relevant videos can be easily performed by computing a simple distance metric. This paper makes two fundamental contribution to view invariant video retrieval: (1) Dynamic Instant detection in trajectories of moving objects acquired from video. (2) View-invariant Dynamic Time Warping to measure similarity between two trajectories of actions performed by different persons and from different viewpoints. Although the learning algorithm is relatively simple in our approach, we can achieve high recognition rate because of the view-invariant representation and the similarity measure using DTW.
Medical data analysis using self-organizing data mining technologies
Authors: Frank Lemke, Johann-Adolf Mueller
Venue: Systems Analysis Modelling Simulation (2003)

Three self-organizing data mining technologies that employ complementary descriptive languages - parametric regression models (GMDH neural networks), fuzzy rules (self-organizing fuzzy rule induction), and similarity models (analog complexing based clustering and classification) - are applied to generate diagnosis models of different levels of heart disease. The classification results show an accuracy of over 95% in average. Due to the strong knowledge extraction capabilities of the used technologies a nucleus of 4 most relevant variables is identified. The obtained results both classification accuracy and identified nucleus are also important for diagnosis cost reduction considerations.
Almost Odd Random Sum-Free Sets
Authors: Neil J. Calkin, P. J. Cameron
Venue: Combinatorics, Probability and Computing (1998)

We show that if S1 is a strongly complete sum-free set of positive integers, and if S0 is a finite sum-free set, then, with positive probability, a random sum-free set U contains S0 and is contained in S0&cup;S1. As a corollary we show that, with positive probability, 2 is the only even element of a random sum-free set.
A Hierarchical Strategy for Testing Web-Based Applications and Ensuring Their Reliability
Authors: Jeff Tian, Li Ma, Zhao Li, A. Günes Koru
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

After examining the specific problems of testing andquality assurance for web-based applications, we proposea strategy by integrating existing testing techniques and reliabilityanalyses in a hierarchical framework. This strategycombines various usage models for statistical testingto perform high level testing and to guide selective testingof critical and frequently used subparts or components usingtraditional coverage-based structural testing. Reliabilityanalysis and risk identification form an integral part ofthis strategy to help assure and improve the overall reliabilityfor web-based applications. Some preliminary resultsare included to demonstrate the general viability and effectivenessof our approach.
Are there degrees of belief?
Authors: Henry E. Kyburg,  Jr.
Venue: Journal of Applied Logic (2003)

John Maynard Keynes claimed that not all probabilities were comparable. Frank Ramsey argued that they were, and that Keynes's views to the contrary rested on a confusion of degree of entailment and degree of belief. We will argue that Keynes and Ramsey largely talked past each other, and yet that there are issues of great significance underlying their dispute. In particular, the simple principle of maximizing expected utility may be seen in a new light as one step of a rich and complex process.
Augmenting the World with Interactive Virtual Studio
Authors: Li Li, Hock Soon Seah, Widya Andyardja Weliamto
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

In this paper, a system named IVS (Interactive VirtualStudio), which integrates low-level (feature extraction andordering), mid-level (camera parameters estimation andevaluation), high-level (object recognition and reconstruction),and graphics techniques, is presented. The purposeof IVS is to integrate computer generated animation withreal image sequence seamlessly. With minimum human intervention,IVS is an off-line postprocessing system that operateson a real world sequence in which a known object istracked. The camera pose in each frame is recovered fromwhich the camera trajectory is reconstructed. Firstly, objectfeatures are extracted from the environment and correspondencebetween the extracted shape and a shape froma database is solved by an SVD (Singular Value Decomposition)based technique. Secondly, SFSM (Structure fromSimulated Motion) is used for object recognition and theinformation is used for reconstruction of the 3D object containedin the image. An evaluation mechanism is introducedto provide feedback and reduce the registration error. In thelast stage of the processing, virtual graphics objects are importedto interact with the real image sequence. While theconcept of developing such a system is not new, the variousnovel techniques we incorporated into IVS make it different.
Digital emulator and observer of multicell converter
Authors: R. Ruelland, G. Gateau, T. Meynard, J. C. Hapiot
Venue: Mathematics and Computers in Simulation (2003)

This article presents the design of a digital real-time emulator dedicated to the simulation of four-level multicell converter. The design has been made using a new tool: the co-simulation. Co-simulation results are presented in this paper and an experimental setup has been realised on a FPGA1 in order to validate this new tool. In the final part, we present the test of an observation loop using this emulator.
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Authors: Mizuhito Ogawa
Venue: Information and Computation (2003)

This paper demonstrates the generation of a linear-time query-answering algorithm based on the constructive proof of Higman's lemma by Murthy and Russell [Proceedings of the 5th IEEE Symposium on Logic in Computer Science, 1990, p. 257-267]. The target problem is linear-time evaluation of a fixed disjunctive monadic query on an indefinite database over linearly ordered domains, first posed by van der Meyden [Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992, p. 331-345]. Van der Meyden showed the existence of a linear-time algorithm, but an explicit construction has, until now, not been reported.
Application of atomic force microscopy to detect edge of mask contaminations that may hinder titanium silicide formation
Authors: C. Bresolin, M. Pesaturo, P. Paruzzi, V. Soncini, D. Erbetta, M. Bigi
Venue: Microelectronic Engineering (2003)

An atomic force microscope (AFM) was used to study anomalies in the titanium disilicide formation of narrow (0.26 µm) poly lines at the edge of n+ and p+ implant masks; a special test structure was designed both for morphological and electrical evaluations. On poly lines along the borders of the n+ mask, before titanium deposition, the AFM was able to detect some material build-up exactly on the locations where the silicide is severely reduced in thickness or interrupted, as inferred by electrical data and SEM analysis on finished samples. A carbon (or nitrogen) atom knock-on during the arsenic implant was invoked to explain the observed local hindering of the silicide formation.
Hierarchical cognitive maps
Authors: Horatiu Voicu
Venue:  (2003)

This set of studies was designed to investigate two research topics related to spatial navigation in humans. The first topic examines the factors that determine the strategy used by humans (18&ndash;20 years old) to perform detours in open virtual environments. A detour in an open environment is performed when a participant encounters and circumvents a large obstacle on a path that has been experienced before. This paradigm was simulated using a computational model of navigation and the predictions of the model were validated experimentally. The results show that humans are more likely to reach the known path if they had previous experience with the path, and they are more likely to move directly to the goal otherwise. The computational model explains these results in terms of the trodden path built between the start and goal locations. A trodden path is defined as a sequence of adjacent places that have been visited repeatedly. The second topic addressed in this dissertation investigates the circumstances under which humans build hierarchical representations of space, a subject investigated by Hirtle and Jonides (1985). In their study, participants recalled lists of landmarks from the Ann Arbor Campus at the University of Michigan and estimated distances between pairs of landmarks. The recall lists were analyzed with an algorithm that provides information about the structure of the recall data. The results showed that participants divided the environment into clusters of landmarks. Furthermore, participants estimated distances between landmarks in the same cluster as smaller than similar distances between landmarks in different clusters According to Hirtle and Jonides, these findings are suggestive but not conclusive evidence for the existence of it hierarchical representation of space. We simulated the Hirtle and Jonides study with a computational model that uses a nonhierarchical representation of space and obtained similar findings. The model explains the results by using a nearest neighbor strategy for producing the recall data and by using trodden paths for estimating distances between places. Further evidence for the existence of the hierarchical cognitive map is provided by a computational model that uses a hierarchical representation of space. The model shows results that match the experimental findings reported by Hirtle and Jonides. In addition, the model predicts that the reaction time for distance estimation varies logarithmically with distance. The prediction was validated experimentally for the case in which the environment contains structural information.
Local spectra of perfect binary codes
Authors: A. Yu. Vasil'eva
Venue: Discrete Applied Mathematics (2004)

For an arbitrary perfect binary (n, 3)-code, the notion of the local spectrum, a local analog of weight spectnun, is introduced. The connection between local spectra of a code on a pair of orthogonal faces of dimension k and (n - k) is investigated, and some properties of the spectra considered are detected.
Demo: playingfFantasyA with senToy
Authors: Ana Paiva, Rui Prada, Ricardo Chaves, Marco Vala, Adrian Bullock, Gerd Andersson, Kristina Höök
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Game development is an emerging area of development for new types of interaction between computers and humans. New forms of communication are now being explored there, influenced not only by face to face communication but also by recent developments in multi-modal communication and tangible interfaces. This demo will feature a computer game, FantasyA, where users can play the game by interacting with a tangible interface, SenToy (see Figure 1). The main idea is to involve objects and artifacts from real life into ways to interact with systems, and in particular with games. So, SenToy is an interface for users to project some of their emotional gestures through moving the doll in certain ways. This device would establish a link between the users (holding the physical device) and a controlled avatar (embodied by that physical device) of the computer game, FantasyA.
Neural networks and their economic applications
Authors: Janusz Morajda
Venue: Artificial intelligence and security in computing systems (2003)

The paper outlines basic types of neural networks and presents their selected applications in marketing, finance and other areas of business and economy.
Second messenger: increasing the visibility of minority viewpoints with a face-to-face collaboration tool
Authors: Joan Morris DiMicco, Walter Bender
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

This paper introduces the application Second Messenger, a tool for supporting face-to-face meetings and discussions. Second Messenger uses a speech-recognition engine as an input method and outputs filtered keywords from the group's conversation onto an interactive display. The goal of this interface is to improve the quality of a group discussion by increasing the visibility of diverse viewpoints.
Mining maximal frequent intervals
Authors: Jun-Lin Lin
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Many real world data are associated with intervals of time or distance. Mining frequent intervals from such data allows the users to group transactions with similar behavior together. Previous work only focuses on the problem of mining frequent intervals in a discrete domain. This paper first proposes the notion of maximal frequent intervals, which are superior to frequent intervals in many perspectives, and then provides a method for mining maximal frequent intervals in either a discrete domain or a continuous domain. Experimental results indicate that our method outperforms previous method for mining frequent intervals, and improves the runtime by two orders of magnitude for databases with a large number of distinct endpoints.
Using weakly structured documents at the user-interface level to fill in a classical database
Authors: Frederique Laforest, André Flory
Venue: Advanced topics in database research vol. 1 (2003)

Electronic documents have become a universal way of communication due to Web expansion. But using structured information stored in databases is still essential for data coherence management, querying facilities, etc. We thus face a classical problem-known as "impedance mismatch" in the database world; two antagonist approaches have to collaborate. Using documents at the end-user interface level provides simplicity and flexibility. But it is possible to take documents as data sources only if helped by a human being; automatic document analysis systems have a significant error rate. Databases are an alternative as semantics and format of information are strict; queries via SQL provide 100% correct responses. The aim of this work is to provide a system that associates document capture freedom with database storage structure.The system we propose does not intend to be universal. It can be used in specific cases where people usually work with technical documents dedicated to a particular domain. Our examples concern medicine and more explicitly medical records. Computerization has very often been rejected by physicians because it necessitates too much standardization and form-based user interfaces are not easily adapted to their daily practice. In this domain, we think that this study provides a viable alternative approach. This system offers freedom to doctors; they would fill in documents with the information they want to store, in a convenient order and in a freer way. We have developed a system that allows a database to fill in quasi-automatically from documents paragraphs.The database used is an already existing database that can be queried in a classical way for statistical studies or epidemiological purposes. In this system, the document fund and the database containing extractions from dccuments coexist. Queries are sent to the database, answers include data from the database and references to source documents.
Deploying Diffserv at the Network Edge for Tight SLAs, Part 1
Authors: John Evans, Clarence Filsfils
Venue: IEEE Internet Computing (2004)

In the first of a two-part series, the authors review industry best practices for designing, validating, deploying, and operating IP-based services at the network edge with tight service-level agreements (SLAs). The authors describe the important SLA metrics for IP service performance and discuss why Diffserv is the preferred technology to achieve these SLAs.
The Digital Divide, the UN, and the Computing Profession
Authors: Neville Holmes
Venue: Computer (2003)

The world needs the computing profession, but do the politicians want us?
Modeling Latency in Deterministic Wormhole-Routed Hypercubes under Hot-Spot Traffic
Authors: S. Loucif, M. Ould-khaoua
Venue: The Journal of Supercomputing (2004)

Analytical models of deterministic routing in common wormhole-routed networks, such as the hypercube, have been widely reported in the literature. However, all these models have been discussed for the uniform traffic pattern. The performance of deterministic routing under other important non-uniform communication patterns, such as hot-spots, has often been analyzed through simulation. The main advantage of the analytical approach over simulation is that the analytical models can be used to obtain performance results for large systems that are infeasible by simulation due to the excessive computation demands on conventional computers. This paper presents the first analytical model of deterministic routing in the hypercube in the presence of hot-spot traffic. Simulation results confirm that the proposed model predicts message latency with a reasonable degree of accuracy under different traffic conditions.
Group prioritization in the AHP by fuzzy preference programming method
Authors: L. Mikhailov
Venue: Computers and Operations Research (2004)

In this paper we propose a new group fuzzy preference programming (GFPP) method for deriving group priorities from crisp pairwise comparison judgements, provided by multiple decision makers. The assessment of the group priorities is formulated as a fuzzy linear programming problem, maximizing the group's overall satisfaction with the group solution. The GFPP method combines the group synthesis and prioritization stages into a coherent integrated framework, which does not need additional aggregation procedures. The method can easily deal with missing judgements and provides a meaningful indicator for measuring the level of group satisfaction and group consistency.
Octree-based Animated Geometry Compression
Authors: Jinghua Zhang, Charles B. Owen
Venue: Proceedings of the Conference on Data Compression (2004)

Geometry compression is the compression of the 3D geometric data that provides acomputer graphics system with the scene description necessary to render images.Geometric data is quite large and, therefore, needs effective compression methods todecrease the transmission and storage bit requirements. A large amount of research hasfocused on static geometry compression, but only limited research has addressedanimated geometry compression, the compression of temporal sequences of geometrydata. In this paper, we propose an octree-based motion representation method that can beapplied to compress animated geometric data. In our approach, 3D animated sequencescan be represented with a compression factor of over 100, with slight losses in animationquality. We focus on compressing vertex positions for all the frames. In our approach weonly need to use two consecutive frames to generate a small set of motion vectors thatrepresent the motion from the previous frame to the current frame. The motion vectorsare used to predict the vertex positions for each frame except the first frame. The processgenerates a hierarchical octree motion representation for each frame. Quantization and anadaptive arithmetic coder are used to achieve further data reduction. The simple andefficient decompression of this approach makes it suitable for real time applications.
A DSA model for data access in self-organizing systems
Authors: Dhavy Gantsou
Venue: Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies (2003)

Data availability is an important issue for self-organizing systems, which include both Peer-to-Peer (P2P) systems and mobile ad hoc networks (MANETs). In P2P systems, the problem of data availability is solved by replicating data across the network. However, this approach wastes resources, and so is not appropriate for MANETs where resource frugality is essential. Unlike P2P systems, MANETs routing protocols require real-time features to cope with a highly dynamic environment, and efficient synchronization mechanisms to guarantee consistent updates of routing information. Unfortunately, due to the semantics of the languages that are most used in network programming, such mechanisms are extremely hard or even impossible to implement in efficient way. To build an application capable of meeting almost all of these requirements, while providing a framework capable of evolving over time, we propose an approach that is based on DSA.
Energy conservative algorithm for numerical solution of ODES initial value problems
Authors: E. Miletics
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The numerical treatment of the ODE initial value problems is an intensively researched field. Recently the qualitative algorithms, such as monotonicity and positivity preserving algorithms are in the focus of investigation. For the dynamical systems the energy conservative algorithms are very important. In the case of Hamiltonian system the symptectic algorithms are very effective. This kind of algorithm is not adaptive, but doubtless they are powerful. The high-efficiency computers and the computer algebraic software systems allow us to create efficient adaptive energy conservative numerical algorithm for solving ODE initial value problems. In this article an adaptive numerical-analytical algorithm is suggested which very effectively can be applied for Hamiltonian systems, but the idea of construction can be adaptable for other initial value problems too, where there are some quantity preserved in time. The idea and the efficiency of the proposed algorithm will be presented by simple examples, such as the Lotka-Volterra and linear oscillator problems.