ppxscal/embedding_network huggingface dataset:
Techniques for Fast and Easy Mobile Text-Entry with Three-Keys
Authors: Frode Eika Sandnes, Haavard W. Thorkildssen, Alexander Arvei, Johannes O. Buverud
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

SMS (Short Messaging Service) has become extremely popular in Europe. It allows users to send and receive short asynchronous messages at low cost. Text-messaging requires text-entry facilities, usually awkward and small 12-key phone keyboards labelled with the alphabet in the classic phone-layout. As devices are becoming smaller, for example wristwatches with Internet connectivity, there is less space for keys. Researchers have experimented with three-key text input devices and come up with designs allowing text to be entered with nearly as few as 4 keystrokes per characters on average. However, experiments have shown that these interfaces are hard to learn and thus slow to use in practice. In this paper we study four three-key mobile text-entry strategies with different characteristics, namelymulti-ring, three-based binary and multi-tap. Three of the methods require from 1 to 7 keystrokes per character, and the third method always retrieves the required character with a constant of only three keystrokes per character for English text. Experiments are used to demonstrate that the techniques are easy to learn and pleasant to use. The techniques are cheap and simple to implement and therefore hold great potential for future text-enabled consumer electronics.
An Area-Efficient Router for the Data-Intensive Architecture (DIVA) System
Authors: Sumit Mediratta, Jeff Sondeen, Jeffrey Draper
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

A key component of the Data-Intensive Architecture(DIVA) is the Processing-In-Memory (PIM) RoutingComponent (PiRC) that is responsible for efficientcommunication between PIM chips. This paperpresents the design of a low area, delay and powerrouter for DIVA. A 58.5% saving in area and 86%reduction in load on the clock as compared to anearlier PIM router design makes the presented designideal for use in the second version of DIVA, with lowarea being a critical design requirement for DIVA.This paper also gives a comparison of the presenteddesign with an earlier PIM router design in terms ofdelay and power to justify the new design choice.
Discriminative model fusion for semantic concept detection and annotation in video
Authors: G. Iyengar, H. J. Nock
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper we describe a general information fusion algorithm that can be used to incorporate multimodal cues in building user-defined semantic concept models. We compare this technique with a Bayesian Network-based approach on a semantic concept detection task. Results indicate that this technique yields superior performance. We demonstrate this approach further by building classifiers of arbitrary concepts in a score space defined by a pre-deployed set of multimodal concepts. Results show annotation for user-defined concepts both in and outside the pre-deployed set is competitive with our best video-only models on the TREC Video 2002 corpus.
A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains
Authors: Miroslav Tanushev, Richard Arratia
Venue: Combinatorics, Probability and Computing (1997)

The cyclic tour property has previously been an equality for the expected time to complete a tour, compared with that for the reverse tour, for reversible Markov chains. We give a simple bijection to show that the equality can be extended to the distributions involved. The bijection is based on rotation of circular words.
Real wrongs in virtual communities
Authors: Thomas M. Powers
Venue: Ethics and Information Technology (2004)

Beginning with the well-known cyber-rape in LambdaMOO, I argue that it is possible to have real moral wrongs in virtual communities. I then generalize the account to show how it applies to interactions in gaming and discussion communities. My account is supported by a view of moral realism that acknowledges entities like intentions and causal properties of actions. Austin's speech act theory is used to show that real people can act in virtual communities in ways that both establish practices and moral expectations, and warrant strong identifications between themselves and their online identities. Rawls' conception of a social practice is used to analyze the nature of the wrong and the stage-setting aspect of engaging in a practice.
Bridging Legacy Systems to Model Driven Architecture
Authors: Bing Qiao, Hongji Yang, William C. Chu, Baowen Xu
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

System evolution can be achieved effectively fromarchitectural point of view, and one of the most excitingoutcomes of those efforts on software architecture isOMG' Model Driven Architecture (MDA) which aims at aunified framework for system evolution targetingmiddleware-based modern distributed system. Theadvance of technologies in software design andimplementation, however, cannot completely avoid theneed for deep understanding of legacy systems forevolution. We are still stuck with incomplete highabstraction views when evolving the legacy systems.This paper presents an approach to bridging legacysystems to MDA, which has three contributions: a suitablearchitecture description language for architecturerecovery, the relevant abstraction rules and theintegration of reverse engineering with MDA.
Vision and Inertial Sensor Cooperation Using Gravity as a Vertical Reference
Authors: Jorge Lobo, Jorge Dias
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--This paper explores the combination of inertial sensor data with vision. Visual and inertial sensing are two sensory modalities that can be explored to give robust solutions on image segmentation and recovery of 3D structure from images, increasing the capabilities of autonomous robots and enlarging the application potential of vision systems. In biological systems, the information provided by the vestibular system is fused at a very early processing stage with vision, playing a key role on the execution of visual movements such as gaze holding and tracking, and the visual cues aid the spatial orientation and body equilibrium. In this paper, we set a framework for using inertial sensor data in vision systems, and describe some results obtained. The unit sphere projection camera model is used, providing a simple model for inertial data integration. Using the vertical reference provided by the inertial sensors, the image horizon line can be determined. Using just one vanishing point and the vertical, we can recover the camera's focal distance and provide an external bearing for the system's navigation frame of reference. Knowing the geometry of a stereo rig and its pose from the inertial sensors, the collineation of level planes can be recovered, providing enough restrictions to segment and reconstruct vertical features and leveled planar patches.
A Rule Based Approach to the Service Composition Life-Cycle
Authors: Jian Yang, Mike P. Papazoglou, Bart Orriëns, Willem-Jan van Heuvel
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Web services are becoming the prominent paradigm for distributed computing and electronic business. This has raised the opportunity for service providers and application developers to develop value-added services by combining existing web services. However the current web service composition solutions, even for the applications developed on the basis of the standard Business Process Execution Language for Web Services (BPEL for short) , are rather restricted and inflexible as they lack proper support for generating dynamic compositions and for managing the service composition life cycle. The ReServCom project proposed here aims to remedy this situation by introducing a rule based approach for web service composition which combines best practices from rule base systems and software engineering to support parameterization, dynamic binding, and flexible service compositions.
Cooperative Crawling
Authors: Marina Buzzi
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Web crawler design presents many different challenges: architecture, strategies, performance and more. One of the most important research topics concerns improving the selection of"interesting" web pages (for the user), according to importance metrics. Another relevant point is content freshness, i.e. maintaining freshness and consistency of temporary stored copies. For this, the crawler periodically repeats its activity going over stored contents (re-crawling process). In this paper, we propose a scheme to permit a crawler to acquire information about the global state of a website before the crawling process takes place. This scheme requires web server cooperation in order to collect and publish information on its content, useful for enabling a crawler to tune its visit strategy. If this information is unavailable or not updated the crawler still acts in the usual manner. In this sense the proposed scheme is not invasive and is independent from any crawling strategy and architecture.
Combinators for program generation
Authors: Peter Thiemann
Venue: Journal of Functional Programming (1999)

We present a general method to transform a compositional specification of a specializer for a functional programming language into a set of combinators that can be used to perform the same specialization more efficiently. The main transformation steps are the transition to higher-order abstract syntax and untagging. All transformation steps are proved correct. The resulting combinators can be implemented in any functional language, typed or untyped, pure or impure. They may also be considered as forming a domain-specific language for meta-programming. We demonstrate the generality of the method by applying it to several specializers of increasing strength. We demonstrate its efficiency by comparing it with a traditional specialization system based on self-application.
Tough constraint-based frequent closed itemsets mining
Authors: Lei Jia, Renqing Pei, Dingyu Pei
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Mining frequent itemsets has been one of the hot topics in data mining. Candidate generation-and-test approaches such as Apriori have been proved to be effective. However, in practical applications, we will face a lot of intractable frequent itemsets under the preset minimum support. In order to solve the problem, we have two methods: constraint-based mining and frequent closed itemsets mining. To the best of our knowledge, it has not been studied how to combine one of the complex constraint, tough constraint, with the frequent closed itemsets mining. In this paper, we show the benefits of combining the two technologies through the TC-based FCM Algorithm. We also discuss the following two problems: 1) which one should be put in advance, select process or filter process? 2) how to make full use of the information from the upper level.
Analysis and Design of an Agent Searching Algorithm for e-Marketplaces
Authors: Chi Sing Leung, John Pui-Fai Sum, Hong Shen, Jie Wu, G. Young
Venue: Cluster Computing (2004)

Recently, agent techniques in electronic marketplaces (e-marketplaces) bring B-to-B trading into a new era. However, not much analysis on the behavior of agents has been reported. In this paper, based on the ant algorithm in network routing, we introduce a jumping (searching) model for agents in an e-marketplace network. However, we should be aware that if there are too many agents in the e-marketplace network, they will use up all communication bandwidth and computing resource. It is inevitable to investigate the behavior of agents, such as agent population. Based on the existing results in the ant algorithm in network routing, we present the behavior of agents in an e-marketplace network. Hence, we can control the agent population by setting the appropriate agent generation rate.
Milch, 2000
Authors: Carsten Nicolai
Venue: Organised Sound (2001)

Milch is taken from Nicolai's first solo exhibition in the UK (shown in 2001) and is a special commission for Milch's industrial space. The minimal installation is a repetition of the same groups of objects four times over. There is a CD and amplifier connected to four 9&Prime; speaker cones by thick coils of black cable. A shallow 2 &times; 1 m tray containing water is placed on top of the speaker cones and sonic frequencies constantly stretch and bend the water's molecules. The surface shifts from absolute flatness through spirographic swirls to geometric grids, effects which are recorded in a series of photographs hung around the gallery.
Using Elementary Linear Algebra to Solve Data Alignment for Arrays with Linear or Quadratic References
Authors: Weng-Long Chang, Jih-Woei Huang, Chih-Ping Chu
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--Data alignment that facilitates data locality so that the data access communication costs can be minimized, helps distributed memory parallel machines improve their throughput. Most data alignment methods are devised mainly to align the arrays referenced using linear subscripts or quadratic subscripts with few (one or two) loop index variables. In this paper, we propose two communication-free alignment techniques to align the arrays referenced using linear subscripts or quadratic subscripts with multiple loop index variables. The experimental results from our techniques on Vector Loop and TRFD of the Perfect Benchmarks reveal that our techniques can improve the execution times of the subroutines in these benchmarks.
Three-dimensional shape representation via shock flows
Authors: Benjamin B. Kimia
Venue:  (2003)

We address the problem of representing 3D shapes when partial and unorganized data is obtained as an input, such as clouds of point samples on the surface of a face, statue, solid, etc., of regular or arbitrary complexity (free-form), as is commonly produced by photogrammetry, laser scanners, computerized tomography, and so on. Our starting point is the medial axis ( MA ) representation which has been explored mainly for 2D problems since the 1960's in pattern recognition and image analysis. The MA makes explicit certain symmetries of an object, corresponding to the shocks of waves initiated at the input samples, but is itself difficult to directly use for recognition tasks and applications. Based on previous work on the 2D problem, we propose a new representation in 3D which is derived from the MA , producing a graph we call the shock scaffold. The nodes of this graph are defined to be certain singularities of the shock flows along the MA . This graph can represent exactly the MA &mdash;and the original inputs&mdash;or approximate it, leading to a hierarchical description of shapes. We develop accurate and efficient algorithms to compute for 3D unorganized clouds of points the shock scaffold, and thus the MA , as well as its close cousin the Voronoi diagram. One computational method relies on clustering and visibility constraints, while the other simulates wavefront propagation on a 3D grid. We then propose a method of splitting the shock scaffold in two subgraphs, one of which is related to the ( a priori unknown) surface of the object under scrutiny. This allows us to simplify the shock scaffold making more explicit coarse scale object symmetries, while at the same time providing an original method for the surface interpolation of complex datasets. In the last part of this thesis, we address extensions of the shock scaffold by studying the case where the inputs are given as collections of unorganized polygons.
Virtual fetal pig dissection as an agent of knowledge acquisition and attitudinal change in female high school biology students
Authors: Richard Speaker
Venue:  (2002)

One way to determine if all students can learn through the use of computers is to introduce a lesson taught completely via computers and compare the results with those gained when the same lesson is taught in a traditional manner. This study attempted to determine if a virtual fetal pig dissection can be used as a viable alternative for an actual dissection for females enrolled in high school biology classes by comparing the knowledge acquisition and attitudinal change between the experimental (virtual dissection) and control (actual dissection) groups. Two hundred and twenty-four students enrolled in biology classes in a suburban all-girl parochial high school participated in this study. Female students in an all-girl high school were chosen because research shows differences in science competency and computer usage between the genders that may mask the performance of females on computer-based tasks in a science laboratory exercise. Students who completed the virtual dissection scored significantly higher on practical test and objective tests that were used to measure knowledge acquisition. Attitudinal change was measured by examining the students' attitudes toward dissections, computer usage in the classroom, and toward biology both before and after the dissections using pre and post surveys. Significant results in positive gain scores were found in the virtual dissection group's attitude toward dissections, and their negative gain score toward virtual dissections. Attitudinal changes toward computers and biology were not significant. A purposefully selected sample of the students were interviewed, in addition to gathering a sample of the students' daily dissection journals, as data highlighting their thoughts and feelings about their dissection experience. Further research is suggested to determine if a virtual laboratory experience can be a substitute for actual dissections, or may serve as an enhancement to an actual dissection.
Answer Filtering via Text Categorization in Question Answering Systems
Authors: Alessandro Moschitti
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Modern Information Technologies and Web-based services are faced with the problem of selecting, filtering and managing growing amounts of textual information to which access is usually critical. On one hand, Text Categorization models allow users to browse more easily the set of texts of their own interests, by navigating in category hierarchies. On the other hand, Question/Answering is a method of retrieving information from vast document collections. Inspite of their shared goal, these two information retrieval techniques have been ever applied separately.In this paper we present a Question/Answering system that takes advantage from category information by exploiting several models of question and answer categorization. Knowing the question category has the potential of enhancing a more efficient answer extraction mechanism as the matching of the question category with the answer category allows to (1) re-rank the answers; and (2) eliminate incorrect answers. Experimental results show the effects of question and answer categorization on the overall Question Answeringperformance.
Systems framework for regional-scale integrated modelling and assessment
Authors: R. Greiner
Venue: Mathematics and Computers in Simulation (2004)

Computer-based methods of integrated modelling and assessment provide an important means for reviewing policy choices in natural resource management (NRM). Research in support of NRM needs to address a wide range of issues involved, from point-scale biophysical, to business-scale human, to regional-scale planning issues. Research covering the full scope of such issues is by default multi-disciplinary and integrative and therefore analytically, methodologically and operationally challenging. The recently initiated Ord-Bonaparte Program is an example of a research and development program attempting to achieve both levels of integration in an applied NRM context. One key requirement for the success of the program lies in developing a systems framework that: (i) enables the integration of the various disciplinary research activities; and (ii) facilitates the implementation of research outputs by making integrated science relevant to decision-makers and translating new knowledge into outcomes for sustainable regional development. This paper proposes an approaches for such a systems framework.
Visualisation of large networks in 3-D space: issues in implementation and experimental evaluation
Authors: Yan Xiao, Paul Milgram
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

Three dimensional visualisation has become a widespread scheme for helping users to access and manage large information network. In this report, various techniques for displaying depth information are reviewed, with an emphasis on stereoscopic displays. Input devices used to interact with a 3-D space are also examined. Issues in 3-D network visualisation are elicited from three viewpoints: psychological, task-related and implementational. Consideration of these issues leads to the design of a preliminary experimental programme for evaluating various network visualisation techniques.
A network architecture for providing per-flow delay guarantees with scalable core
Authors: Prasanna Chaporkar, Joy Kuri
Venue: Journal of High Speed Networks (2003)

Many real-time applications demand delay guarantees from the network. A network architecture designed to support these applications should be robust and scalable. The IntServ architecture provides per-flow QoS at the cost of robustness and scalability. The DiffServ architecture is robust and scalable but can provide QoS at a class level and not at a flow level.In this paper, our aim is to design architectures that are scalable and robust like DiffServ and at the same time able to provide per-flow QoS like IntServ. We propose a non work-conserving and a work-conserving architecture to achieve this goal. The guaranteeable delay regions of these architectures are the same as those of GPS based policies with rate proportional resource allocation. We also propose a scheme to provide meaningful throughput and responsiveness to best effort traffic even in the presence of heavy QoS load.
Scalable and Efficient PKI for Inter-Organizational Communication
Authors: Arne Ansper, Ahto Buldas, Margus Freudenthal, Jan Willemson
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

We propose an efficient and flexible system for asecure and authentic data exchange in a multi-institutionalenvironment, where the institutionsmaintain different databases and provide secure andlimited access services to employees of other institutions.The main motivation for building such asystem was to organize efficient cooperative use ofstate registers, in order to increase the efficiencyand quality of public services in Estonia. In orderto meet high security requirements, several contemporarymeasures are integrated (using digital signatures,distributing certificate information by meansof DNS protocol and linking log files with crypto-graphicchecksums). We give rationale for the designdecisions made in the implementation process andconclude with the current state of public use of theresulting infrastructure.