ppxscal/embedding_network huggingface dataset:
On Absorbing Cycles in Min--Max Digraphs
Authors: Harald Günzel, Hubertus Th. Jongen
Venue: Journal of Global Optimization (2005)

We consider smooth finite dimensional optimization problems with a compact, connected feasible set M and objective function f. The basic problem, on which we focus, is: how to get from one local minimum to all the other ones. To this aim we introduce a bipartite digraph ¿ as follows. Its nodes are formed by the set of local minima and maxima of f|M, respectively. Given a smooth Riemannian (i.e. variable) metric, there is an arc from a local minimum x to a local maximum y if the ascent (semi-)flow induced by the projected gradients of f connects points from a neighborhood of x with points from a neighborhood of y. The existence of an arc from y to x is defined with the aid of the descent (semi-)flow. Strong connectedness of ¿ ensures that, starting from one local minimum, we may reach any other one using ascent and descent trajectories in an alternating way. In case that no inequality constraints are present or active, it is well known that for a generic Riemannian metric the resulting min-max digraph ¿ is indeed strongly connected. However, if inequality constraints are active, then there might appear obstructions. In fact, we show that ¿ may contain absorbing two-cycles. If one enters such a cycle, one cannot leave it anymore via ascent and descent trajectories. Moreover, the cycles being constructed are stable with respect to small perturbations (in the C1-topology) of the Riemannian metric.
Automatically learning document taxonomies for hierarchical classification
Authors: Kunal Punera, Suju Rajan, Joydeep Ghosh
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

While several hierarchical classification methods have been applied to web content, such techniques invariably rely on a pre-defined taxonomy of documents. We propose a new technique that extracts a suitable hierarchical structure automatically from a corpus of labeled documents. We show that our technique groups similar classes closer together in the tree and discovers relationships among documents that are not encoded in the class labels. The learned taxonomy is then used along with binary SVMs for multi-class classification. We demonstrate the efficacy of our approach by testing it on the 20-Newsgroup dataset.
Digital identity matters
Authors: Arthur Allison, James Currall, Michael Moss, Susan Stuart
Venue: Journal of the American Society for Information Science and Technology (2005)

Digital objects or entities present us with particular problems of an acute nature. The most acute of these are the issues surrounding what constitutes identity within the digital world and between digital entities. These are problems that are important in many contexts but, when dealing with digital texts, documents, and certification, an understanding of them becomes vital legally, philosophically, and historically. Legally, the central issues are those of authorship, authenticity, and ownership; philosophically, we must be concerned with the sorts of logical relations that hold between objects and in determining the ontological nature of the object; and historically, our concern centers around our interest in chronology and the recording of progress, adaptation, change, and provenance. Our purpose is to emphasize why questions of digital identity matter and how we might address and respond to some of them. We will begin by examining the lines along which we draw a distinction between the digital and the physical context and how, by importing notions of transitivity and symmetry from the domain of mathematical logic, we might attempt to provide at least interim resolutions of these questions.
A Broadband Double-Conversion RF Tuner
Authors: Kari Stadius, Arto Malinen, Petri Järviö, Petteri Paatsila, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (2005)

A prototype design of upconverter and downconverter units for a double-conversion cable-modem RF tuner are presented. The upconverter upconverts a channel from 47--862 MHz input band to around 1575 MHz intermediate frequency. The image-reject downconverter shifts the channel to 36.125 MHz (EU) or to 43.75 MHz (US). The upconverter includes a variable-gain low-noise amplifier, a double-balanced mixer, a three-stage VCO bank for LO generation and a divide-by-two circuit for driving an external PLL. The downconverter includes a LNA, image-reject mixers in Hartley configuration, a 3-stage polyphase filter, an IF-amplifier and a SAW driver. For the second LO generation the circuit includes a 6-GHz on-chip VCO, a divide-by-four circuit for quadrature LO and a divide-by-16 for feeding an external PLL. Signal reversal switching in the LO buffer can be used for the selection of LSB/USB injection. All building blocks are presented in this paper and experimental results are given from the upconverter, downconverter, and RF tuner demonstrator including SAW filters with center frequencies at 1575 and 44 MHz. The circuits are fabricated in a 0.9-¿ m SiGe bipolar process.
Building Compilers by Combining Algebras
Authors: Garrin Kimmell, Ed Komp, Perry Alexander
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Embedded systems present a wide variety of challenges for developers of language tools. Verification of correctness, flexibility for adding new language features, and retargeting new architectures all present significant problems when developing a compiler for embedded systems. In this paper we present a domain-specific language based on modular monadic semantics which addresses many of these challenges.
An implicit matrix inversion process
Authors: D. J. Evans
Venue: ACM SIGNUM Newsletter (1980)

An implicit iterative method for improving the accuracy of the inverse matrix is presented and shown to possess superior convergence properties over the well known quadratically convergent Hotelling method. Numerical examples are included to illustrate the new method. It is proposed that the new techniques may be useful in statistical analyses where matrix inverses are required.
MMM2: mobile media metadata for media sharing
Authors: Marc Davis, Nancy Van House, Jeffrey Towle, Simon King, Shane Ahern, Carrie Burgener, Dan Perkel, Megan Finn, Vijay Viswanathan, Matthew Rothenberg
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Cameraphones are rapidly becoming a global platform for everyday digital imaging especially for networked sharing of media from mobile devices. However, their constrained user interfaces and the current network and application infrastructure encumber the basic tasks of transferring, finding, and sharing captured media. We have deployed a prototype context-aware cameraphone application for mobile media sharing (MMM2) that aims to overcome these difficulties. MMM2 leverages the point of capture and of sharing to gather metadata, and uses metadata to support sharing. Based on the early results of the first 6 weeks of a six-month trial involving 60 users, indications are that with MMM2 users are actively capturing and sharing photos. The ability to automatically upload photos from a cameraphone to a web-based photo management application and to automatically suggest sharing recipients at the time of capture based on Bluetooth-sensed co-presence and sharing frequency promise to reduce the current difficulty of mobile media sharing.
Design Validation of Behavioral VHDL Descriptions for Arbitrary Fault Models
Authors: Fei Xin, Maciej Ciesielski, Ian G. Harris
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

In this paper we present a flexible automatic test generation framework to detect a variety of design faults in systems with behavioral VHDL descriptions. Predefined fault models may range from the commonly used state coverage and transition coverage models to any other fault models which can be described as a set of non-linear constraints on the systemýs behavior. The test generation problem is formulated as a constraint logic programming problem (CLP) and an industrial CLP engine is used to solve it.
Design for design: support for creative practice in computer-supported collaborative work (CSCW) in design
Authors: Phebe Mann
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper describes a novel methodology for observing and analysing collaborative design by using the concepts of cognitive dimensions related to concept-based misfit analysis. The study aims at gaining an insight into support for creative practice of graphical communication in collaborative design processes of designers while sketching within a shared white board and audio conferencing environment. Empirical data on design processes have been obtained from observation of groups of student designers solving an interior space-planning problem of a lounge-diner in a shared virtual environment. The results of the study provide recommendations for the design and development of interactive systems to support such collaborative design activities.
Convergence technologies for sensor systems in the Next Generation networks (NGN)
Authors: Conor Gildea, Declan Barber
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

This paper describes an approach to the internetworking of sensory nodes in a converged network environment. This preliminary investigation of sensory network creation is driven by a joint applied research project which seeks to establish the feasibility of the real-time remote monitoring of animal welfare while in transit between Ireland, Europe and the Middle East. This paper examines the use of Java to create sensor services in converging architectures which leverage the Internetworking protocols and describes our implementation of such a system.
THE DANGERS OF TAKING THINGS TOO SERIOUSLY
Authors: H. K. Hedge
Venue: ACM SIGSMALL/PC Notes (1988)

An irresistable challenge for someone like myself who likes to dabble in physics. 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
Automatic pattern acquisition for Japanese information extraction
Authors: Kiyoshi Sudo, Satoshi Sekine, Ralph Grishman
Venue: Proceedings of the first international conference on Human language technology research (2001)

One of the central issues for information extraction is the cost of customization from one scenario to another. Research on the automated acquisition of patterns is important for portability and scalability. In this paper, we introduce Tree-Based Pattern representation where a pattern is denoted as a path in the dependency tree of a sentence. We outline the procedure to acquire Tree-Based Patterns in Japanese from un-annotated text. The system extracts the relevant sentences from the training data based on TF/IDF scoring and the common paths in the parse tree of relevant sentences are taken as extracted patterns.
Combination of Polar Edge Detection and Active Contour Model for Automated Tongue Segmentation
Authors: Wangmeng Zuo, Kuanquan Wang, David Zhang, Hongzhi Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Tongue diagnosis is an important diagnosis method in Traditional Chinese Medicine (TCM) and recently the development of automated tongue image analysis technology has been carried out. Automated tongue segmentation is difficult due to the complexity of pathological tongue, variance of tongue shape and interference of the lips. In this paper we present a novel method for automated tongue segmentation by combining polar edge detector and active contour model. First a novel polar edge detector is proposed to effectively extract the edge of the tongue body. We then introduce a method to filter out the edge that is useless for tongue segmentation. A local adaptive edge bi-thresholding technique is also proposed. Finally an initialization and active contour model are proposed to segment the tongue body from the image. Experimental results demonstrate that the novel tongue segmentation can segment the tongue accurately. A quantitative evaluation on 50 images indicates that the mean DCP (the distance to the closest point) of the proposed method is 5.86 pixels, and the average true positive (TP) percent is 97.2%.
View Matching with Blob Features
Authors: Per-Erik Forssen, Anders Moe
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper introduces a new region based feature for object recognition and image matching. In contrast to many other region based features, this one makes use of colour in the feature extraction stage. We perform experiments on the repeatability rate of the features across scale and inclination angle changes, and show that avoiding to merge regions connected by only a few pixels improves the repeatability. Finally we introduce two voting schemes that allow us to find correspondences automatically, and compare them with respect to the number of valid correspondences they give, and their inlier ratios.
Efficient, Unified, and Scalable Performance Monitoring for Multiprocessor Operating Systems
Authors: Robert W. Wisniewski, Bryan Rosenburg
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Programming, understanding, and tuning the performance of large multiprocessor systems is challenging. Experts have difficulty achieving good utilization for applications on large machines. The task of implementing a scalable system such as an operating system or database on large machines is even more challenging. And the importance of achieving good performance on multiprocessor machines is increasing as the number of cores per chip increases and as the size of multiprocessors increases. Crucial to achieving good performance is being able to understand the behavior of the system. We have developed an efficient, unified, and scalable tracing infrastructure that allows for correctness debugging, performance debugging, and performance monitoring of an operating system. The infrastructure allows variable-length events to be logged without locking and provides random access to the event stream. The infrastructure allows cheap and parallel logging of events by applications, libraries, servers, and the kernel. The infrastructure was designed for K42, a new open-source research kernel designed to scale near perfectly on large cache-coherent 64-bit multiprocessor systems. The techniques are generally applicable, and many of them have been integrated into the Linux Trace Toolkit. In this paper, we describe the implementation of the infrastructure, how we used the facility, e.g., analyzing lock contention, to understand and achieve K42's scalable performance, and the lessons we learned. The infrastructure has been invaluable to achieving great scalability.
A knowledge editor for designing pattern-driven intelligent systems
Authors: Charles Fizer
Venue: Journal of Computing Sciences in Colleges (2005)

A current problem is that standard software development environments are tailored to a different programming paradigm from those best suited for intelligent systems. Standard tools support linear and serial flow of control through modular sets of recursive procedures. In contrast, the most robust intelligent systems must avoid the notion of a "procedure", because they must be able to react appropriately to any interruptions or unexpected changes in the state of the environment or flow of control. In order to support large-scale development of pattern-driven intelligent systems, we are building a graphical user interface that aids in the design of the rich pattern sets that make up the knowledge base of an intelligent system.
A Ubiquitous Personalized Multimedia Service Model Based on FSM
Authors: Zhiwen Yu, Xingshe Zhou, Daqing Zhang, Artur Lugmayr, Zhiyong Yu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The ubiquitous computing environment and users' demand for multimedia personalization precipitate a need for ubiquitous personalized multimedia services (UPMSs). Delivering UPMSs is very complex because of diverse device capabilities, dynamic network characteristics, etc. This paper proposes a lifecycle management model based on FSM (Finite State Machines) for ubiquitous personalized multimedia services (UPMSs). By using this model, the management of UPMSs is very clear and easy, and the services are delivered more efficiently, effectively, and robustly.
A fault-tolerant message passing algorithm and its hardware implementation
Authors: G. Ch. Sirakoulis, V. Raptis, I. Karafyllidis, Ph. Tsalides, A. Thanailakis
Venue: Advances in Engineering Software (2005)

A message passing algorithm for processor arrays that can tolerate any number of faulty blocks, which form any shape, is presented. Each message is delivered to its destination, provided that the destination processor is not surrounded by faults. In this case the message is returned to its source processor. Only local knowledge of faults is demanded. The hardware implementation of this algorithm leads to a message passing coprocessor which is allocated at each processor of the array. No need for high silicon overhead is required for the implementation of the message passing coprocessor. This coprocessor executes only the fault tolerant message passing algorithm presented here. The usage of the proposed coprocessor improves the general processing efficiency, as well as, the performance reliability under faulty conditions.
What Is Context For? Syntax in a Non-Abstract World
Authors: Tom Sgouros
Venue: Journal of Logic, Language and Information (2005)

An explanation for the uncertain progress of formalist linguistics is sought in an examination of the concept of syntax. The idea of analyzing language formally was made possible by developments in 20th century logic. It has been pointed out by many that the analogy between natural language and a formal system may be imperfect, but the objection made here is that the very concept of syntax, when applied to any non-abstract system of communication, is flawed as it is commonly used. Syntax is properly defined with respect to an individual transformation rule that might be applied to some message. Collections of syntax rules, however, are inevitably due to categories imposed by an observer, and do not correspond to functional features found in non-abstract systems. As such, these categories should not be relied upon as aids to understanding any natural system.
The parameter-less genetic algorithm in practice
Authors: Fernando G. Lobo, David E. Goldberg
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

The parameter-less genetic algorithm was introduced a couple of years ago as a way to simplify genetic algorithm operation by incorporating knowledge of parameter selection and population sizing theory in the genetic algorithm itself. This paper shows how that technique can be used in practice by applying it to a network expansion problem. The existence of the parameter-less genetic algorithm stresses the fact that some problems need more processing power than others. Such observation leads to the development of a problem difficulty measure which is also introduced in this paper. The measure can be useful for comparing the difficulty of real-world problems.
XAR-miner: efficient association rules mining for XML data
Authors: Sheng Zhang, Ji Zhang, Han Liu, Wei Wang
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transform to either an Indexed Content Tree (IX-tree) or Multi-relational databases (Multi-DB), depending on the size of XML document and memory constraint of the system, for efficient data selection and AR mining. Task-relevant concepts are generalized to produce generalized meta-patterns, based on which the large ARs that meet the support and confidence levels are generated.
Multi-platform, script-based user interface
Authors: Plamen Paskalev Vladimir Nikolov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The problem of developing several user interface modules for an application is overviewed. The main problems and advantages of using the different technologies in this aspect are discussed. The paper describes an implementation of an extended user interface, based on scripts, its internal structure and organisation. The goals and the approach are discussed. An approach for intelligent, CLIPS-based control of the user interactions is suggested. An implementation of such a software system is presented.
Survey of requirements and solutions for ubiquitous software
Authors: Eila Niemelä, Juhani Latvakoski
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Ubiquitous computing embeds computer technology in our everyday environment, providing a human with information services and applications through any device over different kinds of networks. Ubiquitous computing can be seen as a prerequisite for pervasive computing that emphasizes mobile data access and the mechanisms needed for supporting a community of nomadic users. Ubiquitous software is the software required in ubiquitous computing environments. This paper surveys the challenges and state-of-the-art software technologies applicable to ubiquitous computing environments. Ubiquitous wireless world systems trigger a set of requirements, e.g. interoperability, adaptability and mobility, for ubiquitous system and software technologies. The main challenges of ubiquitous software are a uniform and adaptive middleware technology, iteroperability of services and networks, and the enabling technologies required in their development. Futhermore guaranteeing secure transactions between service providers, content providers and users is essential in worldwide pervasive computing environments. Although standards, reference architectures and generic software technologies provide the basis for future ubiquitous software development, new kinds of micro architectures and software technologies, and development methods are needed.
Measuring Mesh Qualities and Application to Variational Mesh Adaptation
Authors: Weizhang Huang
Venue: SIAM Journal on Scientific Computing (2005)

The mesh assessment problem is investigated in this paper by taking into account the shape and size of elements and the solution behavior. Three elementwise mesh quality measures characterizing the shape, alignment, and adaptation features of elements are introduced according to the estimates of interpolation error developed on a general mesh. An adaptive mesh is assessed by an overall quality measure defined as a weighted Lebesgue norm of a product of the three elementwise quality measures. It is shown that the overall quality of a mesh is good if the overall mesh quality measure is small or significantly smaller than the so-called roughness measure of the solution, defined as the ratio of two Lebesgue norms of a derivative of the solution. The definition of the overall mesh quality measure comes in such a way that the measure appears in the underlying error bound as the only factor depending substantially on the mesh. As an immediate result, the task of mesh adaptation becomes to control the overall mesh quality. This idea is applied to variational mesh adaptation to develop two functionals, one new and the other related to an existing functional recently developed using the regularity and equidistribution arguments. Numerical experiments are given to demonstrate the ability of the functionals to generate adaptive meshes of good quality.