ppxscal/embedding_network huggingface dataset:
Documents at Hand: Learning from Paper to Improve Digital Technologies
Authors: Olha Bondarenko, Ruud Janssen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper the results of a two-year ethnographic study of the personal document management of 28 information workers is described. Both the paper and digital domain were taken into account during the study. The results reaffirmed that document management is strongly related to task management. Digital tools do not adequately support two important user needs related to task management, namely that documents should be embedded within meaningful (task-related) context information, and that they should be easily accessible for regrouping as the task goes on. In contrast, paper supports these needs very well. Following a discussion of personal document management using paper, email, and digital file folder structures, six implications are outlined for the design of digital document management systems that combine the advantages of both domains.
Implementation, analysis, and evaluation of TCP-J: A new version of TCP for wireless networks
Authors: Shunsuke Saito, Fumio Teraoka
Venue: Systems and Computers in Japan (2005)

We implemented TCP-J, a new version of TCP for wireless networks on the NetBSD Release 1.6.1 kernel, and evaluated it in our test network, in which dummynet is used to emulate segment losses and delays. The results showed that TCP-J improves performance about 50 to 220&percnt; under segment loss rate varying from 1 &times; 10-2 to 4 &times; 10-2 in comparison with conventional TCP (Reno, NewReno, and SACK). In addition, it was shown that TCP-J has high fairness when competing against NewReno and SACK with no segment loss, and when there is free bandwidth on the wireless link due to the performance degradation of conventional TCP, TCP-J improves throughput efficiently using that bandwidth. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 23&ndash;30, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20277
Proactive Fault Handling for System Availability Enhancement
Authors: Felix Salfner, Miroslaw Malek
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

Proactive fault handling combines prevention and repair actions with failure prediction techniques. We extend the standard availability formula by five key measures: (1) precision and (2) recall assess failure prediction while failure handling is gauged by (3) prevention probability, (4) repair time improvement, and (5) risk of introducing additional failures. We give a short survey of actions that are suited to be combined with failure prediction and provide a procedure to estimate the five key measures. Altogether, this allows to quantify the impact of proactive fault handling on system availability and may provide valuable input for system design.
A 3-D FPGA wire resource prediction model validated using a 3-D placement and routing tool
Authors: Young-Su Kwon, Payam Lajevardi, Anantha P. Chandrakasan, Frank Honoré, Donald E. Troxel
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

The interconnection architecture of FPGAs such as switches dominates performance of FPGAs. Three-dimensional integration of FPGAs overcomes interconnect limitations by allowing instances to be located and signals to be routed in 3-D space. Wire resource prediction is important for fast and accurate interconnection planning in 3-D FPGA. In this paper, we extend the existing analytic model shown in [13] with a new parameter for our 3-D FPGA which has cluster-based logic blocks. The proposed wire resource prediction model is applied to our 3-D FPGA using a Xilinx Virtex2 slice [18] and our 3-D routing architecture. We validate the effectiveness of the extended model by comparing the required number of channel wires predicted by the extended analytic equation with that of the placed and routed results using 3-D placement and routing algorithm designed for our 3-D FPGA for a number of benchmark circuits. The extended 3-D wire resource prediction model predicts the required channel capacity with an average of 11.1% error for 17 large circuits from LGSynth93 and ISPD2001 Verilog benchmarks.
HPC.NET - are CLI-based Virtual Machines Suitable for High Performance Computing?
Authors: Werner Vogels
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

The Common Language Infrastructure is a new, standardized virtual machine that is likely to become popular on several platforms. In this paper we review whether this technology has any future in the high-performance computing community, for example by targeting the same application space as the Java-Grande Forum. We review the technology by benchmarking three implementations of the CLI and compare those with the results on Java virtual machines.
A unified bandwidth reservation and admission control mechanism for QoS provisioning in cellular networks: Research Articles
Authors: Sunho Lim, Guohong Cao, Chita R. Das
Venue: Wireless Communications Mobile Computing (2004)

We propose a unified framework consisting of a differential bandwidth reservation (DBR) algorithm and a Quality of Service (QoS)-aware admission control scheme to provide QoS guarantees to on-going connections in cellular networks. The differential bandwidth reservation policy uses a sector of cells in making the bandwidth reservation for accepting a new call. Based on the distance of the target cells in the sectors, two different bandwidth reservation policies are applied to optimize the connection dropping rate (CDR), while maintaining a competitive connection blocking rate (CBR). In addition, two possible mobile terminal (MT) movements are analyzed using the DBR mechanism. In the first case, no knowledge of an MT's moving path is assumed to be known, while in the second case, prior knowledge of a user profile is used in bandwidth reservation, and it is called user profile-based DBR (UPDBR) algorithm. Using the DBR scheme, we propose an admission control algorithm that uses varying number of cells in a sector to meet admission decisions. Extensive simulation is performed to evaluate our methodology. Comparison of the proposed scheme with two prior schemes shows that our approach is not only capable of providing better QoS guarantees, but is also flexible in terms of using varying number of cells in satisfying the high-level QoS requirements. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Utilising context ontology in mobile device application personalisation
Authors: Panu Korpipää, Jonna Häkkilä, Juha Kela, Sami Ronkainen, Ilkka Känsälä
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Context Studio, an application personalisation tool for semi-automated context-based adaptation, has been proposed to provide a flexible means of implementing context-aware features. In this paper, Context Studio is further developed for the end users of small-screen mobile devices. Navigating and information presentation are designed for small screens, especially for the Series 60 mobile phone user interface. Context ontology, with an enhanced vocabulary model, is utilized to offer scalable representation and easy navigation of context and action information in the UI. The ontology vocabulary hierarchy is transformed into a folder-file model representation in the graphical user interface. UI elements can be directly updated, according to the extensions and modifications to ontology vocabularies, automatically in an online system. A rule model is utilized to allow systematic management and presentation of context-action rules in the user interface. The chosen ontology-based UI model is evaluated with a usability study.
Approximately-strategyproof and tractable multiunit auctions
Authors: Anshul Kothari, David C. Parkes, Subhash Suri
Venue: Decision Support Systems (2005)

We present an approximately-efficient and approximately-strategyproof auction mechanism for a single-good multiunit allocation problem. The bidding language allows marginal-decreasing piecewise-constant curves and quantity-based side constraints. We develop a fully polynomial-time approximation scheme for the multiunit allocation problem, which computes a (1+ε) approximation in worst-case time T=O(n3/ε), given n bids each with a constant number of pieces. We integrate this approximation scheme within a Vickrey-Clarke-Groves (VCG) mechanism and compute payments for an asymptotic cost of O(T log n). The maximal possible gain from manipulation to a bidder in the combined scheme is bounded by εV/(1+ε), where V is the total surplus in the efficient outcome.
Digital Family Portrait Field Trial: Support for Aging in Place
Authors: Jim Rowan, Elizabeth D. Mynatt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

As the use of mobile data services has spread across the globe, the effect of cultural differences on user requirements has become important issue. To date, however, little research has been conducted on the role cultural factors play in the design of mobile data services. This paper proposes a set of critical design attributes for mobile data services that takes cross-cultural differences into account. To determine these attributes, we devised a qualitative method and conducted in-depth long interviews in Korea, Japan, and Finland. We found 52 attributes considered important by mobile data service users, and 11 critical attributes that showed a clear correlation with characteristics of the user's culture. The paper concludes with a discussion of limitations and of implications for developers of mobile data services.
A Fuzzy-Set-Based Reconstructed Phase Space Method for Idenitification of Temporal Patterns in Complex Time Series
Authors: Xin Feng
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

The new time series data mining framework proposed in this paper applies Reconstructured Phase Space (RPS) to identify temporal patterns that are characteristic and predictive of significant events in a complex time series. The new framework utilizes the fuzzy set and the Gaussian-shaped membership function to define temporal patterns in the time-delay embedding phase space. The resulting objective function represents not only the overall value of the event function, but also the weight of the vector in the temporal pattern cluster to which it contributes. Also, the new objective function is continuously differentiable so the gradient descent optimization such as quasi-Newton's method can be applied to search the optimal temporal patterns with much faster speed of convergence. The computational stability is significantly improved over the genetic algorithm originally used in our early framework. A new simple but effective two-step optimization strategy is proposed which further improves the search performance. Another significant contribution is the use of mutual information and false neighbors methods to estimate the time delay and the phase space dimension. We also implemented two experimental applications to demonstrate the effectiveness of the new framework with comparisons to the original framework and to the neural network prediction approach.
On Equitable Coloring of d-Degenerate Graphs
Authors: A. V. Kostochka, K. Nakprasit, S. V. Pemmaraju
Venue: SIAM Journal on Discrete Mathematics (2005)

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. A d-degenerate graph is a graph G in which every subgraph has a vertex with degree at most d. A star Sm with m rays is an example of a 1-degenerate graph with maximum degree m that needs at least 1+m/2 colors for an equitable coloring. Our main result is that every n-vertex d-degenerate graph G with maximum degree at most n/15 can be equitably k-colored for each $k \ge 16d$. The proof of this bound is constructive. We extend the algorithm implied in the proof to an O(d)-factor approximation algorithm for equitable coloring of an arbitrary d-degenerate graph. Among the implications of this result is an O(1)-factor approximation algorithm for equitable coloring of planar graphs with fewest colors. A variation of equitable coloring (equitable partitions) is also discussed.
Analogic CNN algorithm for estimating position and size of moving objects: Research Articles
Authors: Giovanni Costantini, Daniele Casali, Renzo Perfetti
Venue: International Journal of Circuit Theory and Applications (2004)

An analogic CNN algorithm is proposed for detection of multiple moving objects in high resolution, grey-scale images taken from a fixed camera. The algorithm, based on simple 3 &times; 3 templates, can be implemented using CNN hardware, providing the real-time operation required in surveillance and traffic control applications. Efficient separation of moving objects from the background is obtained through automatic threshold selection. The performance of the proposed method is shown using real-life indoor and outdoor video sequences. Copyright &copy; 2004 John Wiley & Sons, Ltd.
3D Reconstruction of Environments for Planetary Exploration
Authors: Sebastien Gemme, Joseph Nsasi Bakambu, Ioannis Rekleitis
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper we present our approach to 3D surface reconstruction from large sparse range data sets. In space robotics constructing an accurate model of the environment is very important for a variety of reasons. In particular, the constructed model can be used for: safe tele-operation, path planning, planetary exploration and mapping of points of interest. Our approach is based on acquiring range scans from different view-points with overlapping regions, merge them together into a single data set, and fit a triangular mesh on the merged data points. We demonstrate the effectiveness of our approach in a path planning scenario and also by creating the accessibility map for a portion of the Mars Yard located in the Canadian Space Agency.
American Sign Language natural language generation and machine translation
Authors: Matt Huenerfauth
Venue: Issue 81 (January 2005) (2005)

Although deaf students in the U.S. and Canada are taught written English, their inability to hear spoken English results in most deaf U.S. high school graduates (18 year olds) reading at a fourth-grade (10 year old) level (Holt, 1991). Unfortunately, many deaf accessibility aids, like television closed captioning or teletype telephones, assume the user has strong English literacy skills. Many deaf people with English reading difficulty are fluent in American Sign Language (ASL); so, an English-to-ASL automated machine translation (MT) system could make information and services accessible when English text captioning is too complex or an interpreter is unavailable.
The business case for B2B e-contracting
Authors: Samuil Angelov, Paul Grefen
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Business-to-business e-contracting has gained attention in recent years as a way to improve traditional paper contracting. However, a complete framework specifying the aspects of improvement of traditional paper contracting and the new opportunities introduced by e-contracting still does not exist. Past and current projects in e-contracting have relied on common sense and ad hoc reasoning to motivate the introduction of e-contracting to business. This paper fills the existing gap, describing the business foundation for the employment of e-contracting. A complete and structured description of the improvements and the new business opportunities introduced by e-contracting are presented. This research work allows companies to clearly identify the benefits that can be achieved in their business context by the introduction of e-contracting. We use two business scenarios to illustrate the new contracting opportunities for business parties.
High performance asynchronous on-chip bus with multiple issue and out-of-order/in-order completion
Authors: E.-G. Jung, J.-G. Lee, S.-H. Kwak, K.-S. Jhang, J.-A. Lee, D.-S. Har
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, we propose a high performance asynchronous on-chip bus with multiple issue and in-order/out-of-order completion for a Globally Asynchronous Locally Synchronous (GALS) design. The proposed bus implementation can be characterized with distributed and modularized control units based on a layered architecture to support multiple issue and in-order/out-of-order completion. Simulation results reveal that throughputs of asynchronous on-chip buses with multiple issue and in-order/out-of-order completion increases by 31.3% / 34.3%, while power consumption overhead is only 6.76% / 3.98% respectively, compared to a simple asynchronous on-chip bus with only a single issue feature.
Coordinating Multiple Agents via Reinforcement Learning
Authors: Gang Chen, Zhonghua Yang, Hao He, Kiah Mok Goh
Venue: Autonomous Agents and Multi-Agent Systems (2005)

In this paper, we attempt to use reinforcement learning techniques to solve agent coordination problems in task-oriented environments. The Fuzzy Subjective Task Structure model (FSTS) is presented to model the general agent coordination. We show that an agent coordination problem modeled in FSTS is a Decision-Theoretic Planning (DTP) problem, to which reinforcement learning can be applied. Two learning algorithms, ``coarse-grained'' and ``fine-grained'', are proposed to address agents coordination behavior at two different levels. The ``coarse-grained'' algorithm operates at one level and tackle hard system constraints, and the ``fine-grained'' at another level and for soft constraints. We argue that it is important to explicitly model and explore coordination-specific (particularly system constraints) information, which underpins the two algorithms and attributes to the effectiveness of the algorithms. The algorithms are formally proved to converge and experimentally shown to be effective.
Toward a great and enduring profession
Authors: Michael Wing
Venue: ACM SIGSOFT Software Engineering Notes (2005)

SE is emerging from years of turmoil. Practitioners are beginning to stand up for themselves and their profession. I have seen them do so in Technology Review and heard them on NPR. Practitioners are fighting for their jobs, against outsourcers, like the SEI.
Kode Vicious Gets Dirty
Authors: George Neville-Neil
Venue: Queue (2005)

Dear Kode Vicious, I am a new Webmaster of a (rather new) Web site in my company's intranet. Recently I noticed that although I have implemented some user authentication (a start *.asp page linked to an SQL server, having usernames and passwords), some of the users found out that it is also possible to enter a rather longer URL to a specific page within that Web site (instead of entering the homepage), and they go directly to that page without being authenticated (and without their login being recorded in the SQL database). It makes me wonder what solution you could advise me to implement to ensure that any and all Web accesses are checked and recorded by the Web server.
A secure P2P architecture for location management
Authors: Kaouthar Sethom, Khaled Masmoudi, Hossam Afifi
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Networking and computing have become so tied and have naturally integrated our daily life and are evolving to a ubiquitous and transparent interaction between users and information. Distributed and collaborative architectures particularly P2P solutions, proved to be the most efficient way to meet the requirements of pervasive computing. However, many security and mobility issues have to be considered. In this paper, we propose a secure architecture for location management in mobile environments. It inherits from the P2P paradigm features, such as scalability, flexibility and fault-tolerance; thus adapting to dynamic changes of information context.
A method of knowledge modeling and its application to gene function analysis
Authors: Tsutomu Matsunaga
Venue: Systems and Computers in Japan (2004)

This paper proposes a knowledge model for large-scale knowledge structurization of documents. When an elementary concept such as input for information retrieval is handled as an object, generally a structure composed of the relations in the set of objects is observed. The proposed model generates objects by statistical machine learning of the occurrence patterns of words in the word set and quantifies the relations among the objects by matching to the occurrence patterns. The idea is to approach knowledge structurization in order to achieve systematic understanding by relating pieces of existing knowledge by quantifying the relations among objects as elementary concepts. In this paper, the proposed model is applied to problems in the life science field, where there is a strong requirement for new knowledge with a comprehensive overview, and its application to gene function analysis is discussed. Experimental results on the extraction of disease-related genes as relations between genes and a disease, and on the estimation of gene functions combined with knowledge about organs, are presented and the effectiveness of the approach is demonstrated. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 21&ndash;30, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10670
Software Engineering and Database Web Management in Daleelcom Design
Authors: Radwan Tahboub, Dan Lazarescu, V. Lazarescu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper describes the software engineering techniques used in the development of a Web-based dynamic advertisement directory portal for different companies, called Daleelcom portal. Companies or firms that have membership in this portal can manage and administer their information database using web-based forms that are designed using ASP .NET technology. The information about firms can be published through registering to Daleelcom portal, which requires pre-paid card validation. Different levels of services with different cost charging schemas are available. The visitor of Daleelcom portal can traverse and search for firms by name, city, category or commercial class. Several web-based utility programs have been developed to provide the system with additional features such as general administration utilities and firms' administration abilities. The main steps experienced during the development process are discussed.
Partition-Optimization with Schur Convex Sum Objective Functions
Authors: Frank K. Hwang, Uriel G. Rothblum
Venue: SIAM Journal on Discrete Mathematics (2005)

We study optimization problems over partitions of the finite set N = {1,...,n}, where each element i in the partitioned set N is associated with a real number $\theta^i$ and the objective associated with a partition $\pi=(\pi_1, \ldots,\pi_p)$ has the form $F(\pi)=f(\theta_{\pi})$, where $ \theta_{\pi} = (\sum _{i\in{\pi_1}}\theta^i,\ldots, \sum _{i\in\pi_{p}}\theta^i)$. When F is to be either maximized or minimized, we obtain conditions that allow for simple constructions of partitions that are uniformly optimal for all Schur convex functions f.
Hierarchies for semantic classes
Authors: Lance Fortnow, Rahul Santhanam, Luca Trevisan
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We show that for any constant a, ZPP/b(n) strictly contains ZPTIME(na)/b(n) for some b(n) = O(log n log log n). Our techniques are very general and give the same hierarchy for all common semantic time classes including RTIME, NTIME ∩ coNTIME, UTIME, MATIME, AMTIME and BQTIME.We show a stronger hierarchy for RTIME: For every constant c, RP/1 is not contained in RTIME(nc)/(log n)1/2c. To prove this result we first prove a similar statement for NP by building on Zák's proof of the nondeterministic time hierarchy.