ppxscal/embedding_network huggingface dataset:
Persistence barcodes for shapes
Authors: Gunnar Carlsson, Afra Zomorodian, Anne Collins, Leonidas Guibas
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

In this paper, we initiate a study of shape description and classification via the application of persistent homology to two tangential constructions on geometric objects. Our techniques combine the differentiating power of geometry with the classifying power of topology. The homology of our first construction, the tangent complex, can distinguish between topologically identical shapes with different "sharp" features, such as corners. To capture "soft" curvature-dependent features, we define a second complex, the filtered tangent complex, obtained by parametrizing a family of increasing subcomplexes of the tangent complex. Applying persistent homology, we obtain a shape descriptor, called a barcode, that is a finite union of intervals. We define a metric over the space of such intervals, arriving at a continuous invariant that reflects the geometric properties of shapes. We illustrate the power of our methods through a number of detailed studies of parametrized families of mathematical shapes.
The Effects of Participation in Online Communities on Individuals in Saudi Arabi
Authors: Yeslam Al-Saggaf, John Weckert
Venue: ACM SIGCAS Computers and Society (2004)

There is a major transformation taking place in Saudi Arabia. The Saudis are poised on the edge of a significant new social landscape. Called the Internet, this new frontier includes not only the crea tion of new forms of private communication, like electronic mail and chat, but also web-based forums, which for the first time enabled public discussions between males and females in this gender-segre gated society. This paper has been written as a result of an ethnographic study conducted in Saudi Arabia during the period 2001- 2002. The purpose of the study was to understand how online communitie s in Saudi Arabia are affecting people. The results of the study indicate that while participants to a large extent used online communities in accordance with their cultural values, norms and traditio ns, the communication medium and the features associated with it, such as the anonymity and lack of social cues, have affected them considerably. For example, many participants became more flexible in their thinking, more mindful about the diverse nature of people within their society, less inhibited about the opposite gender, and more self-confident. Contrary to their cultural values, participant s neglected their family commitments, became less shy and some developed relationships that are based on interest alone. These findings will be highlighted in this paper.
Data structures in Java for matrix computations: Research Articles
Authors: Geir Gundersen, Trond Steihaug
Venue: Concurrency and Computation: Practice Experience (2004)

In this paper we show how to utilize Java's native arrays for matrix computations. The disadvantages of Java arrays used as a 2D array for dense matrix computation are discussed and ways to improve the performance are examined. We show how to create efficient dynamic data structures for sparse matrix computations using Java's native arrays. This data structure is unique for Java and shown to be more dynamic and efficient than the traditional storage schemes for large sparse matrices. Numerical testing indicates that this new data structure, called Java Sparse Array, is competitive with the traditional Compressed Row Storage scheme on matrix computation routines. Java gives increased flexibility without losing efficiency. Compared with other object-oriented data structures Java Sparse Array is shown to have the same flexibility. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An A Posteriori Error Estimate for the Local Discontinuous Galerkin Method
Authors: Paul Castillo
Venue: Journal of Scientific Computing (2005)

In this work an a posteriori global error estimate for the Local Discontinuous Galerkin (LDG) applied to a linear second order elliptic problem is analyzed. Using a mixed formulation, an upper bound of the error in the primal variable is derived from explicit computations. Finally, a local adaptive scheme based on explicit error estimators is studied numerically using one dimensional problems.
Robust parsing with weighted constraints
Authors: Kilian Foth, Wolfgang Menzel, Ingo Schröder
Venue: Natural Language Engineering (2005)

Based on constraint optimization techniques, an architecture for robust parsing of natural language utterances has been developed. The resulting system is able to combine possibly contradicting evidence from a variety of information sources, using a plausibility-based arbitration procedure to derive fairly rich structural representations, comprising aspects of syntax, semantics and other description levels of language. The results of a series of experiments are reported which demonstrate the high potential for robust behaviour with respect to ungrammaticality, incomplete utterances, and temporal pressure.
Transaction Level Modeling: Flows and Use Models
Authors: Adam Donlin
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Transaction-level models (TLMs) address the problems of designing increasingly complex systems by raising the level of design abstraction above RTL. However, TLM terminology is presently a subject of contentious debate and a coherent set of TLM use-models have not been proposed. In this paper we propose a variety of TLM use-models that reveal paths through the TLM abstraction levels for various types of system. We begin by stating the abstraction levels that comprise ýtransaction-levelý and identify roles and responsibilities that apply within the use-models. We then take each use-model and discuss the type of system it applies to, the TLM abstraction levels it supports, and the design activites applied at those levels. We also consider the distribution of modeling effort between the various design rôles and apply that to descriptions of various use-model design flows.
Distributed low-cost backbone formation for wireless ad hoc networks
Authors: Yu Wang, WeiZhao Wang, Xiang-Yang Li
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Backbone has been used extensively in various aspects (e.g., routing, route maintenance, broadcast, scheduling) for wireless networks. Previous methods are mostly designed to minimize the backbone size. However, in many applications, it is desirable to construct a backbone with small cost when each wireless node has a cost of being in the backbone. In this paper, we first show that previous methods specifically designed to minimize the backbone size may produce a backbone with a large cost. We then propose an efficient distributed method to construct a weighted sparse backbone with low cost. We prove that the total cost of the constructed backbone is within a small constant factor of the optimum for homogeneous networks when either the nodes' costs are smooth or the network maximum node degree is bounded. We also show that with a small modification the constructed backbone is efficient for unicast: the total cost (or hop) of the least cost (or hop) path connecting any two nodes using backbone is no more than 3 (or 4) times of the least cost (or hop) path in the original communication graph. As a side product, we give an efficient overlay based multicast structure whose total cost is no more than 10 times of the minimum when the network is modeled by UDG. Our theoretical results are corroborated by our simulation studies.
Operator splitting and commutativity analysis in the Danish Eulerian model
Authors: I. Dimov, I. Faragó, Á. Havasi, Z. Zlatev
Venue: Mathematics and Computers in Simulation (2004)

In this paper the splitting error arising in the Danish Eulerian Model is investigated. Sufficient conditions under which the local splitting error vanishes are formulated for the continuous case. The numerical solution of the model problem introduces several other error sources, which makes the task of determining the effect of the splitting error more complicated. Therefore, we need numerical examples which will allow us to separate the splitting errors from the other errors in order to evaluate both the magnitude of these errors and the relationships between splitting errors and other errors for different values of the discretization parameters. Several such examples have been constructed and analysed. The appropriate conclusions were drawned. The experiences obtained from these experiments can be a starting step towards a total error analysis of the numerical solution of split systems of partial differential equations.
Dynamic Reconfiguration of Mechatronic Real-Time Systems Based on Configuration State Machines
Authors: Steffen Toscher, Roland Kasper, Thomas Reinemann
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Data flow and FSMs are used to specify real-time sys-tems in the field of mechatronics. Their implementation in FPGAs is discussed against the background of dy-namic reconfiguration which can be used to reduce the amount of logic resources. Bit serial algorithms come into operation for data flow implementation. Particular attention has been paid for synchronizationin dynamic reconfigurable systems. Typically a control system uses different functions depending on its operating state; dynamic reconfiguration is used to switch between them. Reconfiguration is triggered in a distributed way by the active states of all FSMs and executed in a central way by a general control module. Synchronization and mes-sage passing is guaranteed by a distributed communication system.
Classification of Multivariate Time Series and Structured Data Using Constructive Induction
Authors: Mohammed Waleed Kadous, Claude Sammut
Venue: Machine Learning (2005)

We present a method of constructive induction aimed at learning tasks involving multivariate time series data. Using metafeatures, the scope of attribute-value learning is expanded to domains with instances that have some kind of recurring substructure, such as strokes in handwriting recognition, or local maxima in time series data. The types of substructures are defined by the user, but are extracted automatically and are used to construct attributes.Metafeatures are applied to two real domains: sign language recognition and ECG classification. Using metafeatures we are able to generate classifiers that are either comprehensible or accurate, producing results that are comparable to hand-crafted preprocessing and comparable to human experts.
On the impulse circuit model for the single-electron tunnelling junction: Research Articles
Authors: Jaap Hoekstra
Venue: International Journal of Circuit Theory and Applications (2004)

In this paper, the impulse circuit model for the single-electron tunnelling (SET) junction is discussed. Starting from well-known results of the so-called orthodox theory of single electronics, an equivalent circuit for the single-electron tunnelling junction is &lsquo;derived&rsquo; by examining the behaviour of simple circuits including a SET junction. In the impulse circuit model, the electron tunnelling event is basically implemented by an impulsive current source with value e&delta;(t-t0), which absorbs exactly the energy delivered by the sources that is not stored in the circuit. The equivalent circuit consisting of a charged capacitor in parallel with the impulsive current source does not contain a tunnel resistance, and the critical voltage is expressed in only local parameters. The impulse model is suitable for implementation in a circuit simulator; results of a SPICE simulation of the single-electron pump are shown. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Sixth generation computing: a conspectus of the Japanese proposals
Authors: Brian R Gaines
Venue: Issue 95 (January 1986) (1986)

This paper gives a precis of the sixth-generation computing systems research proposal, Promotion of Research and Development on electronics and Information Systems That May Complement or Substitute for Human Intelligence. The proposal was requested by the Japanese Ministry of Science and Technology in January 1983, prepared by the Subcommittee on Artificial Intelligence of The Council for Aerospace, Electronics and Other Advanced Technologies, and submitted in March 1985. It proposes an interdisciplinary research program on the nature of human intelligence involving physiology, psychology, linguistics, logic and computer science.
Minimum Vehicle Fleet Size Under Time-Window Constraints at a Container Terminal
Authors: Iris F. A. Vis, René (M.) B. M. de Koster, Martin W. P. Savelsbergh
Venue: Transportation Science (2005)

Products can be transported in containers from one port to another. At a container terminal these containers are transshipped from one mode of transportation to another. Cranes remove containers from a ship and put them at a certain time (i.e., release time) into a buffer area with limited capacity. A vehicle lifts a container from the buffer area before the buffer area is full (i.e., in due time) and transports the container from the buffer area to the storage area. At the storage area the container is placed in another buffer area. The advantage of using these buffer areas is the resultant decoupling of the unloading and transportation processes. We study the case in which each container has a time window [release time, due time] in which the transportation should start.The objective is to minimize the vehicle fleet size such that the transportation of each container starts within its time window. No literature has been found studying this relevant problem. We have developed an integer linear programming model to solve the problem of determining vehicle requirements under time-window constraints. We use simulation to validate the estimates of the vehicle fleet size by the analytical model. We test the ability of the model under various conditions. From these numerical experiments we conclude that the results of the analytical model are close to the results of the simulation model. Furthermore, we conclude that the analytical model performs well in the context of a container terminal.
Boosting Saliency in Color Image Features
Authors: J. van de Weijer, Th. Gevers
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The aim of salient point detection is to find distinctive events in images. Salient features are generally determined from the local differential structure of images. They focus on the shape saliency of the local neighborhood. The majority of these detectors is luminance based which has the disadvantage that the distinctiveness of the local color information is completely ignored. To fully exploit the possibilities of color image salient point detection, color distinctiveness should be taken into account next to shape distinctiveness. In this paper color distinctiveness is explicitly incorporated into the design of saliency detection. The algorithm, called color saliency boosting, is based on an analysis of the statistics of color image derivatives. Isosalient color derivatives can be closely approximated by ellipsoidal surfaces in color derivative space. Based on this remarkable statistical finding, isosalient derivatives are transformed by color boosting to have equal impact on the saliency. Color saliency boosting is designed as a generic method easily adaptable to existing feature detectors. Results show that substantial improvements in information content are acquired by targeting color salient features. Further, the generality of the method is illustrated by applying color boosting to multiple existing saliency methods.
Choosing document structure weights
Authors: Andrew Trotman
Venue: Information Processing and Management: an International Journal (2005)

Existing ranking schemes assume all term occurrences in a given document are of equal influence. Intuitively, terms occurring in some places should have a greater influence than those elsewhere. An occurrence in an abstract may be more important than an occurrence in the body text. Although this observation is not new, there remains the issue of finding good weights for each structure.Vector space, probability, and Okapi BM25 ranking are extended to include structure weighting. Weights are then selected for the TREC WSJ collection using a genetic algorithm. The learned weights are then tested on an evaluation set of queries. Structure weighted vector space inner product and structure weighted probabilistic retrieval show an about 5% improvement in mean average precision over their unstructured counterparts. Structure weighted BM25 shows nearly no improvement. Analysis suggests BM25 cannot be improved using structure weighting.
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
Authors: Eugenia O'Reilly Regueiro
Venue: European Journal of Combinatorics (2005)

In this paper we prove that there cannot be a biplane admitting a primitive, flag-transitive automorphism group of almost simple type, with alternating or sporadic socle.
Reconfigurable universal SAD-multiplier array
Authors: Humberto Calderon, Stamatis Vassiliadis
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In this paper, we investigate the collapsing of some multi-operand addition related operations into a single array. More specifically we consider multiplication and Sum of Absolute Differences (SAD) and propose an array capable of performing the aforementioned operations for unsigned, signed magnitude, and two's complement notations. The array, called a universal array, is divided into common and controlled logic blocks intended to be reconfigured dynamically. The proposed unit was constructed around three main operational fields, which are feed with the necessary data products or SAD addition terms in order to compute the desired operation. It is estimated that a 66.6% of the (3:2)counter array is shared by the operations providing an opportunity to reduce reconfiguration times. The synthesis result for a FPGA device, of the new structure, was compared against other multiplier organizations. The obtained results indicate that the proposed unit is capable of processing in 23.9 ns a 16 bit multiplication, and that an 8 input SAD can be computed in 29.8 ns using current FPGA technology. Even though the proposed structure incorporates more operations, the extra delay required over conventional structures is very small in the order of 1% compared to Baugh&Wooley multiplier
3D-VOQ Switch Design and Evaluation
Authors: Ding-Jyh Tsaur, Xian-Yang Lu, Chin-Chi Wu, Woei Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Input Buffered Switches with Virtual Output Queues(VOQ) design to avoid Head-Of-Line problems, is a primary design of switches that can be scalable to very high speeds. However, this design requires a complex and iterative scheduling approach and does not meet quality of service(QoS) requirements during operation. In this paper, a three-dimensional Virtual Output Queue(3D-VOQ) switch is proposed and a scheduling algorithm under new architecture that improves the competitive transfer of service. Analysis and simulation are employed to verify the performance of 3D-VOQ, and supports high/low QoS requirements, and then improves switch performance.
Higher order B-spline collocation at the Greville abscissae
Authors: Richard W. Johnson
Venue: Applied Numerical Mathematics (2005)

Collocation methods are investigated because of their simplicity and inherent efficiency for application to a model problem with similarities to the equations of fluid dynamics. The model problem is a steady, one-dimensional convection-diffusion equation with constant coefficients. The objective of the present research is to compare the efficiency and accuracy of several collocation schemes as applied to the model problem for values of 15 and 50 for the associated Peclet number. The application of standard nodal and orthogonal collocation is compared to the use of the Greville abscissae for the collocation points, in conjunction with cubic and quartic B-splines. The continuity of the B-spline curve solution is varied from C1 continuity for traditional orthogonal collocation of cubic and quartic splines to C2-C3 continuity for cubic and quartic splines employing nodal, orthogonal and Greville point collocation. The application of nodal, one-point orthogonal, and Greville collocation for smoothest quartic B-splines is found to be as accurate as for traditional two-point orthogonal collocation using cubics, while having comparable or better efficiency based on operation count. Greville collocation is more convenient than nodal or 1-point orthogonal collocation because exactly the correct number of collocation points is available.
Machine learning research
Authors: Jaime G. Carbonell
Venue: Issue 77 (July 1981) (1981)

META is a Natural Language learning project whose specific objective is to acquire new word definitions and new concepts from contextual information in interactive dialogues. It is an instance of a learning-from-examples method, with a difference: learning proceeds in a reactive, knowledge-rich environment. Our initial research indicates that the interactive nature of the environment ought to be a crucial component of any general learning system. In brief, our investigations have led us to formulate the following hypotheses, which we intend to test and pursue further in the immediate future:1. Learning requires progressive refinement -- It is unreasonable to expect that a computer system (or a human) learn a concept or a skill without error, in its full embellished form, in one brief learning session. It must undergo a sequence of progressive test-and-update stages. In other words, a concept can be learned by first inducing a rough approximation of its final form and successively correcting this approximation with more accurate, more detailed information.2. Interaction with a reactive environment -- Interaction is the engine that drives learning processes. A learner must be able to direct queries to its teacher or perform experiments on its environment. It must be able test out new concepts and skills as it learns them.3. Reasoning by Analogy -- The more a system can learn by relating new concepts to old, by modifying existing concepts, or using chunks of existing concepts as building blocks, the more robust and general its learning mechanisms will be.
Vista: interactive coffee-corner display
Authors: Marcin Wichary, Lucy Gunawan, Nele Van den Ende, Qarin Hjortzberg-Nordlund, Aga Matysiak, Ruud Janssen, Xu Sun
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In the contemporary information-saturated world, there is a need for an easier, faster, and more social way to keep office workers updated and better aware of surrounding activities. Today's information management systems tend to consume time rather than simplify information sharing.The Vista system tries to solve this problem. It is designed to be used in places of social interaction, where it displays information about professional activities happening in the department. In this paper, the origins of the project, the user-centered design process, and iterative evaluation of the concept are described. The paper concludes with observations regarding the social acceptance of Vista and reflections on future research aspects.Vista is the result of a design project conducted in cooperation between the User-System Interaction postgraduate program at Eindhoven University of Technology, and the Research Group of Océ Technologies in the Netherlands.