ppxscal/embedding_network huggingface dataset:
Web-Based Energy-Efficient Cache Invalidation in Wireless Mobile Environment
Authors: Y.-K. Chang, M.-H. Hong, Y.-W. Ting
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

More and more users use mobile devices to retrieve dynamic web pages in the wireless networks. Caching dynamic pages becomes very important due to the power constraint of mobile devices. In this paper, we first introduce a framework to cache and manage the dynamic web pages on the server side such that these dynamic pages can also be cached in the mobile devices. Then we propose a stateful IR-based approach which only records two numbers, the number of web pages updated and the number of web pages updated and also queried after they are updated on the server in an IR interval. Recording these two numbers dramatically reduces the IR size. The experiments show that our proposed approach combined with the Timestamp and UIR algorithms consumes the power around 40-47% less than the original Timestamp and UIR. Also, our method performs better than the Perfect Server that has the full knowledge of the contents stored in all the mobile clientýs caches in terms of power consumption.
Equilibrium in safe strategies
Authors: M. B. Iskakov
Venue: Automation and Remote Control (2005)

The interaction of many participants dividing among themselves a resource located on a certain set is investigated. For the problem stated, the Mash equilibrium does not exist in most of the cases, but at the same time there is an intuitively perceived stable rational behavior of participants, which relies on the reflexive accounting of mutual threats. For the description of such a behavior, the definition is set up of an equilibrium in safe strategies (ESS's), which coincides with the strict Nash equilibrium where it is available and exists for those situations in the stated problem where it is unavailable. Using the introduced definition, the initial problem is examined. The introduced equilibrium is also illustrated by examples of bimatrix games, a competitive system of stimulation, and a game in which the ESS's does not exist.
A non-contact device for tracking gaze in a human computer interface
Authors: B. Noureddin, P. D. Lawrence, C. F. Man
Venue: Computer Vision and Image Understanding (2005)

This paper presents a novel design for a non-contact eye detection and gaze tracking device. It uses two cameras to maintain real-time tracking of a person's eye in the presence of head motion. Image analysis techniques are used to obtain accurate locations of the pupil and corneal reflections. All the computations are performed in software and the device only requires simple, compact optics and electronics attached to the user's computer. Three methods of estimating the user's point of gaze on a computer monitor are evaluated. The camera motion system is capable of tracking the user's eye in real-time (9 fps) in the presence of natural head movements as fast as 100°/s horizontally and 77°/s vertically. Experiments using synthetic images have shown its ability to track the location of the eye in an image to within 0.758 pixels horizontally and 0.492 pixels vertically. The system has also been tested with users with different eye colors and shapes, different ambient lighting conditions and the use of eyeglasses. A gaze accuracy of 2.9° was observed.
Company investments in home-PCs: realising business value through human resource development?
Authors: Tom Roar Eikebrokk, Bjørn Furuholt
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

In Europe, companies are increasing their investments in home-PCs to employees for use at home. These investments are stimulated by tax regulations mainly driven by the assumption that these investments increase IT competence and competitiveness. However, there are few empirical studies that have analysed these assumptions. This paper contributes with empirical data to the relationship between the management of home-PC arrangements and business value. The relationship between home-PC investments, financial-, training- and support strategies, and business value is explored with interview data from 8 Norwegian companies, consultants and technology providers followed by an empirical survey in 69 companies. The main results suggest that home-PCs stimulate knowledge creation, but also that tax regulation can be counterproductive. The paper concludes with suggestions for further research. The results have implications for business and government leaders globally, as they make policy decisions regarding the implementation of programs that stimulate the adoption of home-PCs that are intended to stimulate IT competence.
On Change Diagnosis in Evolving Data Streams
Authors: Charu C. Aggarwal
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

In recent years, the progress in hardware technology has made it possible for organizations to store and record large streams of transactional data. This results in databases which grow without limit at a rapid rate. This data can often show important changes in trends over time. In such cases, it is useful to understand, visualize, and diagnose the evolution of these trends. In this paper, we introduce the concept of velocity density estimation, a technique used to understand, visualize, and determine trends in the evolution of fast data streams. We show how to use velocity density estimation in order to create both temporal velocity profiles and spatial velocity profiles at periodic instants in time. These profiles are then used in order to predict three kinds of data evolution: dissolution, coagulation, and shift. Methods are proposed to visualize the changing data trends in a single online scan of the data stream and a computational requirement which is linear in the number of data points. The visualization techniques can also be used to provide online animations which show the changes in the data characteristics while they occur. In addition, batch processing techniques are proposed in order to quantify the level of change across different combinations of dimensions. This quantification is then used in order to determine dimensional combinations with significant evolution. The techniques discussed in this paper can be easily extended to spatiotemporal data, changes in data snapshots at fixed instances in time, or any other data which has a temporal component during its evolution.
3-D Container Packing Heuristics
Authors: A. Lim, B. Rodrigues, Y. Yang
Venue: Applied Intelligence (2005)

In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a first step, a basic heuristic is devised. From results using this heuristic, problems are categorized as homogeneous and heterogeneous. Two augmenting heuristics are then formulated to deal with these categories. They are complementary in their capabilities in dealing with a range of practical problems, and in terms of their computational consumption. Results using our algorithmsexceed the benchmark by 4.5% on average.
An Improved Preemption Policy for Higher User Satisfaction
Authors: Iftekhar Ahmad, Joarder Kamruzzaman, Srinivas Aswathanarayaniah
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Preemption is an efficient technique to provide available and reliable services to high priority connections in a QoS-enabled network. Preemption technique is governed by a preemption policy which makes the decision about which connections to preempt when resource scarcity is experienced. Previously proposed policies considered preemption rate, priority of connection and preempted bandwidth as the deciding criteria for preempting connections. In this paper, another new criterion, namely, user satisfaction is introduced in formulating the objective function that defines the preemption policy as an optimization problem. Simulation results show that the proposed policy incorporating user satisfaction outperforms the existing preemption policy in terms of customer satisfaction with a significant margin and performs comparably in terms of preemption rate and priority of preempted calls. The improved user satisfaction indicates higher prospects of revenue return and make the proposed policy highly attractive to the network providers.
Modeling users' mobility among WiFi access points
Authors: Minkyong Kim, David Kotz
Venue: Papers presented at the 2005 workshop on Wireless traffic measurements and modeling (2005)

Modeling movements of users is important for simulating wireless networks, but current models often do not reflect real movements. Using real mobility traces, we can build a mobility model that reflects reality. In building a mobility model, it is important to note that while the number of handheld wireless devices is constantly increasing, laptops are still the majority in most cases. As a laptop is often disconnected from the network while a user is moving, it is not feasible to extract the exact path of the user from network messages. Thus, instead of modeling individual user's movements, we model movements in terms of the influx and outflux of users between access points (APs). We first counted the hourly visits to APs in the syslog messages recorded at APs. We found that the number of hourly visits has a periodic repetition of 24 hours. Based on this observation, we aggregated multiple days into a single day by adding the number of visits of the same hour in different days. We then clustered APs based on the different peak hour of visits. We found that this approach of clustering is effective; we ended up with four distinct clusters and a cluster of stable APs. We then computed the average arrival rate and the distribution of the daily arrivals for each cluster. Using a standard method (such as thinning) for generating non-homogeneous Poisson processes, synthetic traces can be generated from our model.
Recognizing object surface properties using impedance perception
Authors: Ryo Kikuuwe, Tsuneo Yoshikawa
Venue: Robotica (2005)

By using the impedance perception algorithm, which we previously proposed, the stiffness matrix that constrains the motion-force relation of a robot's end-effector is calculated in real-time. In this paper, we describe methods of extracting information concerning certain local properties of object surfaces from the stiffness matrix when the end-effector is slid on the surfaces. We develop two algorithms to deal with two classes of surfaces: flat and convex cylindrical surfaces. Since the proposed methods are designed separately from control strategies, they can be used for both autonomous and remote controlled robots. The results of preliminary experiments are presented.
A stochastic approach to hotel revenue optimization
Authors: Kin-Keung Lai, Wan-Lung Ng
Venue: Computers and Operations Research (2005)

Owning to similar business nature, it should be possible to directly migrate successful airline revenue management techniques to the hotel domain. However, one of the salient differences between airlines and hotels is rarely highlighted--the network structure of length of stay or the displacement effect. The hotel patrons go from a first stay-over night to a last stay-over night in consecutive night stays. The arrival demands for multi-night stays and the lengths of stay are stochastic in nature.In this paper, we propose a network optimization model for hotel revenue management under an uncertain environment. The network optimization is in a stochastic programming formulation so as to capture the randomness of the unknown demand (unknown number of arrivals and length of stays). A novel approach of robust optimization techniques for stochastic programming is applied to solve the problem. We also discuss the strategies for hotel management to take into account of risk trade-off; different pricing policies; cancellations and no-show; early check-outs; extended stay and over-booking are discussed. We showed that our proposed model can be modified to adopt these strategic considerations.
Curved document imaging with eye scanner
Authors: Toshiyuki Amano, Tsutomu Abe, Osamu Nishikawa, Tetsuo Iyoda, Yukio Sato
Venue: Systems and Computers in Japan (2004)

In conventional document imaging by a copying machine, the item to be copied must be held flat at a specified position. In addition, distortion or blurring can be produced when an object with three-dimensional undulations is imaged. Consequently, we developed a next-generation document imaging device (Eye Scanner) which can image characters or photographs on a curved sheet from an arbitrary viewpoint, without contact and without distortion, by utilizing shape information. This paper gives an outline of the Eye Scanner device and proposes a method of eliminating texture distortion of a curved object imaged from an arbitrary viewpoint. A divided imaging and connection method by using a pan-tilt stage is presented. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 20&ndash;29, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10558
Interactive posters: HUMAN-COMPUTER INTERACTION DESIGN MUST BE EMBEDDED IN SYSTEM DESIGN: LESSONS FROM NASA INTELLIGENT SYSTEMS
Authors: Jane Malin
Venue: ACM SIGCHI Bulletin (1991)

A multi-year, interdisciplinary effort is currently in progress to assist the design of effective human-computer interaction (HCI) for systems with real-time process monitoring and control capabilities shared between human and computer agents. Based on observations and experiences from this research, a persistent problem in the design of such systems is inadequate consideration of HCI requirements.
Partially ordered regular languages for graph queries
Authors: Sergio Flesca, Sergio Greco
Venue: Journal of Computer and System Sciences (2005)

In this paper we present an extension of regular languages to support graph queries. The proposed extension is based on the introduction of a partial order on the strings of the languages. We extend regular expressions and regular grammars by introducing partial orders on strings and production rules, respectively. The relations between regular expressions and regular grammars are analyzed. We show how partially ordered languages can be used to define path queries to search graph databases and present results on their computational complexity. Finally, we present an application of partially ordered languages for searching the Web.
USE OF THE EYEGAZE SYSTEM IN A USABILITY LABORATORY
Authors: Denise C. R. Benel, Donald Ottens,  Jr., Richard Horst
Venue: ACM SIGCHI Bulletin (1991)

There are many situations in assessing product or system usability where it is desirable to know where a person is looking. In addition, measures such as scan patterns, pupil size, and direction of gaze are useful for inferring usability, helping designers select the best of several displays.
The volume and evolution of web page templates
Authors: David Gibson, Kunal Punera, Andrew Tomkins
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We study the nature, evolution, and prevalence of these templates on the web. As part of this work, we develop new randomized algorithms for template extraction that perform approximately twenty times faster than existing approaches with similar quality. Our results show that 40--50% of the content on the web is template content. Over the last eight years, the fraction of template content has doubled, and the growth shows no sign of abating. Text, links, and total HTML bytes within templates are all growing as a fraction of total content at a rate of between 6 and 8% per year. We discuss the deleterious implications of this growth for information retrieval and ranking, classification, and link analysis.
Computing on the edge: a platform for replicating internet applications
Authors: Michael Rabinovich, Zhen Xiao, Amit Aggarwal
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

Content delivery networks (CDNs) improve the scalability of accessing static and, recently, streaming content. However, proxy caching can improve access to these types of content as well. A unique value of CDNs is therefore in improving performance of accesses to dynamic content and other computer applications. We describe an architecture, algorithms, and a preliminary performance study of a CDN for applications (ACDN). Our system includes novel algorithms for automatic redeployment of applications on networked servers as required by changing demand and for distributing client requests among application replicas based on their load and proximity. The system also incorporates a mechanism for keeping application replicas consistent in the presence of developer updates to the content. A prototype of the system has been implemented.
Jackson's pseudo-preemptive schedule and cumulative scheduling problems
Authors: Jacques Carlier, Eric Pinson
Venue: Discrete Applied Mathematics (2004)

The aim of this paper is to show the usefulness of the Jackson's pseudo-preemptive schedule (JPPS) for solving cumulative scheduling problems. JPPS was introduced for the m-processor scheduling problem Pm/ri, qi/Cmax. In the latter problem, a set I of n operations has to be scheduled without preemption on m identical processors in order to minimize the makespan. Each operation i has a release date (or head) ri, a processing time pi, and a tail qi. In the cumulative scheduling problem (CuSP), an operation i requires a constant amount ei of processors throughout its processing. A CuSP is obtained, for instance, from the resource constrained project scheduling problem (RCPSP) by choosing a resource and relaxing the constraints induced by the other resources. We state new properties on JPPS and we show that it can be used for studying the CuSP and for performing adjustments of heads and tails using a strategy very close to the one designed by Carlier and Pinson for the 1/ri, qi/Cmax sequencing problem. It confirms the interest of JPPS for solving RCPSP.
Mean-square stability of second-order Runge-Kutta methods for stochastic differential equations
Authors: A. Tocino
Venue: Journal of Computational and Applied Mathematics (2005)

In a previous paper, we proposed the stochastic generalization of classical second-order two-stage explicit Runge-Kutta (RK) methods. The obtained stochastic schemes have second order in the weak sense. In this paper, the numerical stability of these RK schemes is studied. The study focuses on stability with respect to the second moment (MS-stability). Figures of the stability domains of the numerical schemes are shown. Numerical examples that confirm the theoretical results are also presented.
Modeling and Analyzing Cultural Influences on Project Team Performance
Authors: Tamaki Horii, Yan Jin, Raymond E. Levitt
Venue: Computational Mathematical Organization Theory (2005)

Research on international joint ventures (IJV) finds managers experience difficulties in working with cross-cultural teams. Our research aims to understand how cultural differences between Japanese and American firms in IJV projects effect team performance through computational experimentation. We characterize culture and cultural differences using two dimensions: practices and values.Practices refer to each culture's typical organization style, such as centralization of authority, formalization of communication, and depth of organizational hierarchy. Values refer to workers' preferences in making task execution and coordination decisions. These preferences drive specific micro-level behavior patterns for individual workers. Previous research has documented distinctive organization styles and micro-level behavior patterns for different nations. We use a computational experimental design that sets task complexityat four levels and team experience independently at three levels, yielding twelve organizational contexts. We then simulate the four possible combinations of USvs.Japanese organization style and individual behavior in each context to predict work volume, cost, schedule andprocess quality outcomes. Simulation results predict that: (1) both Japanese and American teams show better performance across all contexts when each works with its familiar organization style; (2) the Japanese organization style performs better under high task complexity, with low team experience; and (3) process quality risk is not significantly affected by organization styles. In addition, culturally driven behavior patterns have less impact on project outcomes than organization styles. Our simulation results are qualitatively consistent with both organizational and cultural contingency theory, and with limited observations of US-Japanese IJV project teams.
Adding parallelism to visual data flow programs
Authors: Philip Cox Simon Gauvin
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared memory APIs, such as OpenMP, have made shared-memory parallelism more widely accessible for users of traditional procedural languages: however, the mechanisms provided are difficult to use and error-prone. This paper examines the use of visual notations for data flow programming to enable the creation of shared memory parallel programs. We present a model, arising from research on the ReactoGraph visual programming language, that allows code in a general class of visual data flow languages to be parallelized using visual annotations, and discuss the advantages this has over current textual methods.
Improving the efficiency of portable software for linear algebra
Authors: R. J. Hanson, F. T. Krogh, C. L. Lawson
Venue: ACM SIGNUM Newsletter (1973)

In algorithms for linear algebraic computations there are a fairly small number of basic operations which are generally responsible for a significant percentage of the total execution time. We mention particularly the dot product operation, &omega; := xTy, the elementary vector operation, y :=&alpha;x+y, and the euclidean vector norm, &eta; = (xTx)1/2.
ERP-system: a commercial goods planning module
Authors: Tzanko Golemanov, Emilia Golemanova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper discuses the problems concerning the commercial goods planning at trade objects (stores) of the companies with a branch structure and a huge nomenclature base. A principle of optimality for amount on hand is defined. Some approaches to resemble it are proposed. The occurrences "temporary locality" and "space locality" are discussed and the algorithm for correction of inferior limits lists is presented. The report considers the main functions of Registry_S module during its implementation at the company dealing with electronic components and systems import and trade.
Predictive Methods for Location Services in Mobile Ad Hoc Networks
Authors: Xinwei Luo, Tracy Camp, William Navidi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

In recent years, many location service protocols have been developed for ad hoc networks, including the Grid Location Service (GLS), the Simple Location Service (SLS) and the Legend Exchange and Augmentation Protocol (LEAP). In all of the existing location services, when an MN's location is needed, the previously saved information in the location table is used. In this paper, a new location service, the Prediction Location Service (PLS), is proposed. In PLS, an MN uses the previous state of an MN to predict that MN's future state. Our evaluation shows that PLS has (in general) lower overhead and lower location error than GLS, SLS, and LEAP.