ppxscal/embedding_network huggingface dataset:
Developing Scalable Series 40 Applications: A Guide for Java Developers (Nokia Mobile Developer)
Authors: Michael Juntao Yuan, Kevin Sharp
Venue:  (2004)

"I have had the good fortune to be involved with mobile Java from the very beginning, and I know what it takes to be successful in this marketplace. This book will help you be successful with mobile Java application design and development. If you take the information inside and sprinkle it with some imaginative application ideas, you will have a winning combination."- Jon Bostrom, Senior Director, CTO Java Technology Platforms, NokiaThe First Official End-To-End Solutions Guide for Every Nokia Series 40 DeveloperNokia's Series 40 Developer Platform gives Java developers access to the world's highest-volume, fastest-growing, and most exciting mobile markets. Nokia sells close to 100 million units within their Developer Platform families every year, and the Series 40 Developer Platform is the highest-volume platform in the family. Success on this platform is crucial for the commercial success of any mobile application. Knowledge of the Series 40 Developer Platform can be applied to the Java environment on all Nokia Developer Platform devices, including Series 60 devices.Fully reviewed by Nokia's subject matter experts, this book covers the entire development process-from design and coding through testing and deployment. The authors walk you through eleven complete example applications, presenting downloadable client and server source code that you can use to jump-start virtually any project. Along the way, the authors illuminate the technical underpinnings of Series 40, review crucial architectural issues, introduce key mobile design patterns, discuss scalability and device optimization strategies, and offer dozens of best practices and tips-many of which have never before been published.Coverage includes Identifying your best opportunities and killer applications for mobile development Building effective MIDP 2.0 user interfaces for devices built on the Series 40 Developer Platform Building animated mobile games Handling persistent and networking data Proven techniques for scaling and optimizing applications across devices© Copyright Pearson Education. All rights reserved.
Summary thumbnails: readable overviews for small screen web browsers
Authors: Heidi Lam, Patrick Baudisch
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In order to display web pages designed for desktop-sized monitors, some small-screen web browsers provide single-column or thumbnail views. Both have limitations. Single-column views affect page layouts and require users to scroll significantly more. Thumbnail views tend to reduce contained text beyond readability, so differentiating visually similar areas requires users to zoom. In this paper, we present Summary Thumbnails-thumbnail views enhanced with readable text fragments. Summary Thumbnails help users identify viewed material and distinguish between visually similar areas. In our user study, participants located content in web pages about 41% faster and with 71% lower error rates when using the Summary Thumbnail interface than when using the Single-Column interface, and zoomed 59% less than when using the Thumbnail interface. Nine of the eleven participants preferred Summary Thumbnails over both the Thumbnail and Single-Column interfaces.
Efficient Direct User Level Sockets for an Intel® Xeon" Processor Based TCP On-Load Engine
Authors: Vikram A. Saletore, Paul M. Stillwell Jr, John A. Wiegert, Phil Cayton, Jeff Gray, Greg J. Regnier
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Intel Labs has continued development of the Embedded Transport Acceleration (ETA) software prototype that uses one of the Intel® Xeon¿ processors in a multi-processor server as a packet processing engine (PPE) that is closely tied to the server's core CPU and memory complex. We have further developed the prototype to provide support for user-level, asynchronous interface for sockets. The Direct User Socket Interface (DUSI) allows user-level applications to interface directly to the PPE using familiar socket commands and semantics. The prototype runs in an asymmetric multiprocessing mode, in that the PPE does not run as a general computing resource for the host operating system. We describe the prototype software architecture, the DUSI application interface, and detail our measurement and analysis of some micro-benchmarks. In particular, we measure throughput for transactions and end-to-end latency as the key metrics for the analysis.
Support and optimization of Java RMI over a Bluetooth environment: Research Articles
Authors: Pu-Chen Wei, Chung-Hsin Chen, Cheng-Wei Chen, Jenq-Kuen Lee
Venue: Concurrency and Computation: Practice Experience (2005)

Distributed object-oriented platforms are increasingly important over wireless environments for providing frameworks for collaborative computations and for managing a large pool of distributed resources. Due to limited bandwidths and heterogeneous architectures of wireless devices, studies are needed into supporting object-oriented frameworks over heterogeneous wireless environments and optimizing system performance. In our research work, we are working towards efficiently supporting object-oriented environments over heterogeneous wireless environments. In this paper, we report the issues and our research results related to the efficient support of Java RMI over a Bluetooth environment. In our work, we first implement support for Java RMI over Bluetooth protocol stacks, by incorporating a set of protocol stack layers for Bluetooth developed by us (which we call JavaBT) and by supporting the L2CAP layer with sockets that support the RMI socket. In addition, we model the cost for the access patterns of Java RMI communications. This cost model is used to guide the formation and optimizations of the scatternets of a Java RMI Bluetooth environment. In our approach, we employ the well-known BTCP algorithm to observe initial configurations for the number of piconets. Using the communication-access cost as a criterion, we then employ a spectral-bisection method to cluster the nodes in a piconet and then use a bipartite matching scheme to form the scatternet. Experimental results with the prototypes of Java RMI support over a Bluetooth environment show that our scatternet-formation algorithm incorporating an access-cost model can further optimize the performances of such as system. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Manifold splines
Authors: Xianfeng Gu, Ying He, Hong Qin
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in real-world applications are of fundamental importance in solid and shape modeling, geometric design, graphics, etc. This paper presents a general theoretical and computational framework, in which spline surfaces defined over planar domains can be systematically extended to manifold domains with arbitrary topology with or without boundaries. We study the affine structure of domain manifolds in depth and prove that the existence of manifold splines is equivalent to the existence of a manifold's affine atlas. Based on our theoretical breakthrough, we also develop a set of practical algorithms to generalize triangular B-spline surfaces from planar domains to manifold domains. We choose triangular B-splines mainly because of its generality and many of its attractive properties. As a result, our new spline surface defined over any manifold is a piecewise polynomial surface with high parametric continuity without the need for any patching and/or trimming operations. Through our experiments, we hope to demonstrate that our novel manifold splines are both powerful and efficient in modeling arbitrarily complicated geometry and representing continuously-varying physical quantities defined over shapes of arbitrary topology.
Wavelet packet modulation for wireless communications: Research Articles
Authors: Antony Jamin, Petri Mähönen
Venue: Wireless Communications Mobile Computing (2005)

As proven by the success of OFDM, multicarrier modulation has been recognized as an efficient solution for wireless communications. Waveform bases other than sine functions could similarly be used for multicarrier systems in order to provide an alternative to OFDM.In this paper, we study the performance of wavelet packet transform modulation (WPM) for transmission over wireless channels. This scheme is shown to be overall quite similar to OFDM but with some interesting additional features and improved characteristics. A detailed analysis of the system's implementation complexity as well as an evaluation of the influence of implementation-related impairments are also reported. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An agent-based approach for coordinating product design workflows
Authors: Therani Madhusudan
Venue: Computers in Industry (2005)

New product development processes in manufacturing organizations are distributed and knowledge-intensive. Such product development processes interleave complex manual and software-enabled design decision-making activities. In current approaches to product development, design activities are accomplished by teams of engineers in an ad hoc, resource-intensive manner. Though well-developed tools exist for enabling individual engineering activities, support for autonomous coordination of distributed design tasks is minimal. In this paper, we present an Agent-based Process Coordination (APC) framework for distributed design process management. The proposed approach embeds autonomous agents in a workflow-based distributed systems infrastructure. The framework utilizes a centralized decision-making and task sharing approach to support design activities. A design process plan is executed by a centralized coordination agent with the help of service agents. We evaluate the applicability of the APC framework to support design in an industrial context with a case study. The study illustrates the utility of deploying agent-based workflow technologies to: (a) enable incremental and large-scale process and product knowledge acquisition and management, (b) facilitate design process knowledge reuse in different contexts, and (c) support distributed dynamic process management.
An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols
Authors: Iliano Cervesato, Catherine Meadows, Dusko Pavlovic
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Authentication and secrecy properties are proved by very different methods: the former by local reasoning, leading to matching knowledge of all principals about the order of their actions, the latter by global reasoning towards the impossibility of knowledge of some data. Hence, proofs conceptually decompose in two parts, each encapsulating the other as an assumption. From this observation, we develop a simple logic of authentication that encapsulates secrecy requirements as assumptions. We apply it within the derivational framework to derive a large class of key distribution protocols based on the authentication properties of their components.
Relative placement representation
Authors: H. K. E. Liesenberg, D. J. Kinniment
Venue: ACM SIGDA Newsletter (1984)

This paper suggests two ways of representing a relative placement of rectangular cells. The first one by a graph, whereas the second representation is expressed in terms of a linear notation. Some operations are described to convert the former representation into the latter one.
A study on the tie-set graph theory and network flow optimization problems: Research Articles
Authors: Toshio Koide, Haruki Kubo, Hitoshi Watanabe
Venue: International Journal of Circuit Theory and Applications (2004)

Aiming at establishing a firm basic theory to ring-based information network management systems, our paper proposes a tie-set graph theory. We define a binary vector representing a tie-set in a biconnected undirected graph G=(V,E) as a tie-set vector. The set of tie-set vectors forms a vector space over the proposed law of composition, then a basis of the vector space, &mu; linear independent tie-set vectors, is defined as a tie-set basis. The essential key concept in our theory is a tie-set graph, which has a one-to-one correspondence to a tie-set basis and represents a relation between two tie-set vectors of the basis. Some important properties of tie-set graphs and their application to survivable mesh networks in modern high-speed backbone networks are also presented. Furthermore, as a general approach to network flow optimization problems, tie-set flow vector space is proposed based on the tie-set graph theory. A distributed algorithm for the network flow optimization problems and its application are also presented in this paper. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Human computer interfaces for autism: assessing the influence of task assignment and output modalities
Authors: Ouriel Grynszpan, Jean-Claude Martin, Jacqueline Nadel
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Several experimental studies have shown the usefulness of computers for autism, but software design remains poorly documented. Our multidisciplinary research focuses on educational HCI for autism. We compared two domains of learning: social dialogue understanding and spatial planning, our hypothesis being that people with autism will be less skilful in the first than in the second domain. Two sets of exercises were designed for each domain: one for training purposes and the other for performance assessment before and after training. We also tested the influence of the following output modalities: text, images, speech synthesis, visual and auditory feedback. Each exercise produced log files informing on duration, number of trials and successes. So far, eight teenagers with autism have completed a 13 week training program with one session a week. First analysis of log files suggests a significant progression in dialogic understanding but not in spatial planning; nor was significant influence of output modalities found.
prefuse: a toolkit for interactive information visualization
Authors: Jeffrey Heer, Stuart K. Card, James A. Landay
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Although information visualization (infovis) technologies have proven indispensable tools for making sense of complex data, wide-spread deployment has yet to take hold, as successful infovis applications are often difficult to author and require domain-specific customization. To address these issues, we have created prefuse, a software framework for creating dynamic visualizations of both structured and unstructured data. prefuse provides theoretically-motivated abstractions for the design of a wide range of visualization applications, enabling programmers to string together desired components quickly to create and customize working visualizations. To evaluate prefuse we have built both existing and novel visualizations testing the toolkit's flexibility and performance, and have run usability studies and usage surveys finding that programmers find the toolkit usable and effective.
Developing use cases and scenarios in the requirements process
Authors: Neil Maiden, Suzanne Robertson
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Scenarios are often used for discovering requirements using established techniques, but how such scenarios are initially developed is not so well understood. This experience paper reports the application of one scenario-based approach - RESCUE - to discover requirements for DMAN, an air traffic management system for the UK's National Air Traffic Services. A retrospective analysis of the DMAN use cases, scenarios and requirements artifacts revealed the importance of diverse information sources in the specification of use cases that enabled systematic requirements discovery. Results were used to explore 3 research questions that arose in previous studies. The paper reports lessons from this experience and offers guidelines that practitioners can apply in their requirements processes and academics can use to inform their research.
An Efficient Data Location Protocol for Self.organizing Storage Clusters
Authors: Hong Tang, Tao Yang
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Component additions and failures are common for large-scale storage clusters in production environments. To improve availability and manageability, we investigate and compare data location schemes for a large self-organizing storage cluster that can quickly adapt to the additions or departures of storage nodes. We further present an efficient location scheme that differentiates between small and large file blocks for reduced management overhead compared to uniform strategies. In our protocol, small blocks, which are typically in large quantities, are placed through consistent hashing. Large blocks, much fewer in practice, are placed through a usage-based policy, and their locations are tracked by Bloom filters. The proposed scheme results in improved storage utilization even with non-uniform cluster nodes. To achieve high scalability and fault resilience, this protocol is fully distributed, relies only on soft states, and supports data replication. We demonstrate the effectiveness and efficiency of this protocol through trace-driven simulation.
Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths
Authors: Jufeng Peng, Srinivas Akella
Venue: International Journal of Robotics Research (2005)

This paper focuses on the collision-free coordination of multiple robots with kinodynamic constraints along specified paths. We present an approach to generate continuous velocity profiles for multiple robots; these velocity profiles satisfy the dynamics constraints, avoid collisions, and minimize the completion time. The approach, which combines techniques from optimal control and mathematical programming, consists of identifying collision segments along each robot's path, and then optimizing the robots' velocities along the collision and collision-free segments. First, for each path segment for each robot, the minimum and maximum possible traversal times that satisfy the dynamics constraints are computed by solving the corresponding two-point boundary value problems. The collision avoidance constraints for pairs of robots can then be combined to formulate a mixed integer nonlinear programming (MINLP) problem. Since this nonconvex MINLP model is difficult to solve, we describe two related mixed integer linear programming (MILP) formulations, which provide schedules that give lower and upper bounds on the optimum; the upper bound schedule is designed to provide continuous velocity trajectories that are feasible. The approach is illustrated with coordination of multiple robots, modeled as double integrators subject to velocity and acceleration constraints. An application to coordination of nonholonomic car-like robots is described, along with implementation results for 12 robots.
Performance Analysis for Multi-Service Networks with Congestion-Based Pricing for QoS Traffic
Authors: Woan Sun Chang, Robert Simon
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

There has been recent interest in employing unified pricing schemes for supporting both QoS and best-effort traffic within multi-service networks. This paper presents an analytical approach for the design and analysis of this class of network pricing control. In particular, we propose an approximation method to estimate overall user value arising from all traffic types, given the routes for QoS traffic. Our approach considers admission control as both a resource allocation issue for QoS traffic, and a pricing control decision for best-effort and QoS traffic. We show how to convert the price-based admission control decision to a resource-based blocking problem. We also present the numerical results of performance analysis for multi-service networks using our proposed approximationmethod. Our approach can be used to predict the performance and parameter settings for a wide range of combined QoS and best-effort pricing schemes.
Embeddings of k-connected graphs of pathwidth k
Authors: Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
Venue: Discrete Applied Mathematics (2005)

We present O(n3) embedding algorithms (subgraph isomorphism and its generalizations) for classes of graphs of bounded pathwidth, where n is the number of vertices in the graph. These include the first polynomial-time algorithm for minor containment and the first O(nc) algorithm (c a constant independent of k) for topological embedding of graphs from subclasses of partial k-trees, as well as an O(n2) algorithm for subgraph isomorphism. Of independent interest are structural properties of k-connected graphs of bounded pathwidth on which our algorithms are based. We also describe special cases which reduce to various generalizations of string matching, permitting more efficient solutions. Finally, we describe nk+O(1) algorithms for solving these problems on arbitrary graphs of pathwidth at most k.
A web-based spatial data access system using semantic R-trees
Authors: Shu-Ching Chen, Xinran Wang, Naphtali Rishe, Mark Allen Weiss
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

With the increasing use of geographical data in real-world applications, Geographic Information Systems (GISs) have recently emerged as a fruitful area for research. In order to provide information to a multitude of users, the World Wide Web (WWW) techniques have been integrated into GISs. A high-performance web-based GIS, called TerraFly, has been developed in order to provide web-based GIS accesses to the general public. The design of TerraFly considers two major aspects: (1) the system architecture including client, database server, proxy server and information server; and (2) the semantic R-tree data structure and semantic queries. The system architecture utilizes the existing resources to achieve maximum performance by using the "internally Distributed Multithreading (IDMT)" technique. The spatial access method, semantic R-trees, is used to search for an object, based on both spatial and semantic information. System performance results are presented and analyzed. Reducing network traffic to achieve faster response to users is also discussed.
Influence of colearner agent gehavior on learner performance and attitudes
Authors: Wendy Ju, Seth Nickell, Katherine Eng, Clifford Nass
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This study examines the effect of colearner agent performance and social behavior on learner performance and subjective satisfaction in an interactive learning environment. In this 2 (high- or low-performing colearner) by 2 (socially supportive or competitive colearner) experiment (N=44), participants learned Morse Code alongside an agent colearner. Participants with high-scoring colearner agents performed significantly better than participants with low-scoring colearners. Participants liked and felt liked by socially supportive agents more than they did socially competitive agent participants. Implications for developing educational software are discussed.