ppxscal/embedding_network huggingface dataset:
Real recursive functions and their hierarchy
Authors: Jerzy Mycka, José Félix Costa
Venue: Journal of Complexity (2004)

In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, pp. 1-14). However, one of the operators introduced in the seminal paper by Moore (1996), the minimalization operator, has not been considered: (a) although differential recursion (the analog counterpart of classical recurrence) is, in some extent, directly implementable in the General Purpose Analog Computer of Claude Shannon, analog minimalization is far from physical realizability, and (b) analog minimalization was borrowed from classical recursion theory and does not fit well the analytic realm of analog computation. In this paper, we show that a most natural operator captured from analysis--the operator of taking a limit--can be used properly to enhance the theory of recursion over the reals, providing good solutions to puzzling problems raised by the original model.
An analysis of internet content delivery systems
Authors: Stefan Saroiu, Krishna P. Gummadi, Richard J. Dunn, Steven D. Gribble, Henry M. Levy
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

In the span of only a few years, the Internet has experienced an astronomical increase in the use of specialized content delivery systems, such as content delivery networks and peer-to-peer file sharing systems. Therefore, an understanding of content delivery on the Internet now requires a detailed understanding of how these systems are used in practice.This paper examines content delivery from the point of view of four content delivery systems: HTTP web traffic, the Akamai content delivery network, and Kazaa and Gnutella peer-to-peer file sharing traffic. We collected a trace of all incoming and outgoing network traffic at the University of Washington, a large university with over 60,000 students, faculty, and staff. From this trace, we isolated and characterized traffic belonging to each of these four delivery classes. Our results (1) quantify the rapidly increasing importance of new content delivery systems, particularly peer-to-peer networks, (2) characterize the behavior of these systems from the perspectives of clients, objects, and servers, and (3) derive implications for caching in these systems.
Server-friendly delta compression for efficient web access
Authors: Anubhav Savant, Torsten Suel
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

A number of researchers have studied delta compression techniques for improving the efficiency of web page accesses over slow communication links. Most of these schemes exploit the fact that updated web pages often change only very slightly, thus resulting in very small sizes for the transmitted deltas. However, these schemes are only applicable to a minority of page accesses, and require web or proxy servers to retain potentially many different outdated versions of pages for use as reference files in the encoding. Another approach, studied by Chan and Woo [4], encodes a page with respect to similar files located on the same web server that are already in the client's browser cache.Based on the latter approach, we study different delta compression policies for web access. Our emphasis is on web and proxy server-friendly policies that do not require the maintenance of multiple older versions of a page, but only use reference files accessed by the client within the last few minutes. We compare several policies for identifying appropriate reference files and evaluate their performance on a set of traces. We show that there are very simple policies that achieve significant benefits over gzip compression on most web accesses, and that can be efficiently implemented at web or proxy servers. We also study the potential of file synchronization techniques such as rsync [28] for web access.
Dynamic Resource Allocation in an HPC Environment
Authors: Duane A. Gilmour, James P. Hanna, Gary Blank
Venue: Proceedings of the 2004 Users Group Conference (2004)

Analysts within the military strategic planning process need to be able to anticipate and respond in real-time to a dynamically changing battlespace with counter actions. Thecapability is required to accept current information into a simulation and rapidly peer into the future at any given moment to derive hypotheses about future alternatives. It is virtually impossible to identify or predict the specific details of what might transpire. Our research interest is to develop techniques to assess potential courses of action (COAs) against the adversarial environment. Utilizing HPC technology, multiple force structure simulations can be dynamically executed in parallel to concurrently evaluate the hypothesis of assessing a given COA against a range of adversarial eCOAs. The uncertainty of the adversary decision process requires simulation capabilities that spawn multiple simulations from critical decision points to evaluate alternative eCOAs. The focus of this paper is on the development of a simulation framework that provides the foundation for faster than real-time parallel COA simulations.Within this framework is a requirement to be able to dynamically allocate and reallocate resources in an HPC environment. The authors will describe techniques to clone and create variant simulations in real-time and the dynamic system requirements and use of HPC nodes.
Fundamental limitations of power control and radio resource management in wireless networks: Research Articles
Authors: Fredrik Gunnarsson
Venue: Wireless Communications Mobile Computing (2004)

The ultimate resource in wireless networks is transmission power. The system stability and the resource sharing algorithms all rely on well functioning power control. To realistically address resource management algorithms, it is important to consider fundamental limitations of the radio resource and of power control. Exact and approximate capacity expressions are derived and related to Quality of Service (QoS) requirements of services. Power control is subject to limited update rate, limited feedback bandwidth, time delays, measurement errors, feedback errors and filtering effects which all affect the resulting performance. Simulations further illustrate the hampering effects and motivates models of power control inaccuracies. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Solution of vector Stefan problems with cross-diffusion
Authors: F. J. Vermolen, C. Vuik
Venue: Journal of Computational and Applied Mathematics (2005)

A general model for the dissolution of particles in multi-component alloys is proposed and analyzed. The model is based on diffusion equations with cross-terms for the several species, combined with a Stefan condition as the equation of motion of the interface between the particle and diffusive phase. Several numerical schemes for the solution of the Stefan problem are proposed and compared. It turns out that diagonalization is useful for numerical purposes. However, for the case of position-dependent diffusion coefficients one has to use a different scheme. Here, we analyze stability and workload of several time integration methods.
Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems
Authors: E. G. Birgin, R. A. Castillo, J. M. Martínez
Venue: Computational Optimization and Applications (2005)

Augmented Lagrangian algorithms are very popular tools for solving nonlinear programming problems. At each outer iteration of these methods a simpler optimization problem is solved, for which efficient algorithms can be used, especially when the problems are large. The most famous Augmented Lagrangian algorithm for minimization with inequality constraints is known as Powell-Hestenes-Rockafellar (PHR) method. The main drawback of PHR is that the objective function of the subproblems is not twice continuously differentiable. This is the main motivation for the introduction of many alternative Augmented Lagrangian methods. Most of them have interesting interpretations as proximal point methods for solving the dual problem, when the original nonlinear programming problem is convex. In this paper a numerical comparison between many of these methods is performed using all the suitable problems of the CUTE collection.
Webified video: media conversion from TV program to web content and their integrated viewing method
Authors: Hisashi Miyamori, Katsumi Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

A method is proposed for viewing broadcast content that converts TV programs into Web content and integrates the results with related information retrieved using local and/or Internet content.
A sensitivity analysis of low-power repeater insertion
Authors: Yuantao Peng, Xun Liu
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, we perform the first quantitative study on the sensitivities of repeater power to available repeater width and candidate location, two key parameters of the dynamic programming (DP) based repeater insertion algorithms. Based on our analysis, we propose a simple yet effective scheme to select repeater widths and locations for DP-based algorithms, achieving an excellent trade-off between the solution quality and runtime. Experimental results have shown that, when combined with our sensitivity-guided scheme, the DP algorithm can attain more than 6 times speedup with negligible power degradation.
Optimal control of the moment of spontaneous tumor regression
Authors: T. Z. Biktimirov, A. A. Butov, Yu. G. Savinov
Venue: Automation and Remote Control (2005)

This paper is concerned with the description of the spontaneous regression of a cancer tumor in mice. A model is suggested in which it is assumed that the strategy of resolution of a tumor is chosen by an organism in an optimal way. A goal function is introduced that has the sense of the work to be done by an organism so as to annihilate the cancer tumor. In the course of the solution of the originated minimization problem, it becomes possible to define the class of systems that involves the object under consideration with the preliminary accumulation of injuries in cancer cells. It is assumed that without such a preliminary accumulation of injuries, the immune action does not lead to the extinction of cancer cells.
Image-space based collision detection in cloth simulation on walking humans
Authors: Vladimir Dochev, Tzvetomir Vassilev, Bernhard Spanlang
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper describes a technique for cloth-body collision detection applicable to simulation of apparel on walking humans. It is based on image-space interference tests but employs a new approach with layers of depth maps to resolve the problem arising from overlapping body parts. The modern workstations' graphics hardware is used to generate the depth maps of the body as well as to interpolate the normal vectors and velocities of each body vertex. The latter information is necessary for proper collision response. Images showing the result of applying this technique are given at the end of the paper.
Incremental maintenance for materialized XPath/XSLT views
Authors: Makoto Onizuka, Fong Yee Chan, Ryusuke Michigami, Takashi Honishi
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

This paper proposes an incremental maintenance algorithm that efficiently updates the materialized XPath/XSLT views defined using XPath expressions in XP([],*,//,vars). The algorithm consists of two processes. 1) The dynamic execution flow of an XSLT program is stored as an XT (XML Transformation) tree during the full transformation. 2) In response to a source XML data update, the impacted portions of the XT-tree are identified and maintained by partially re-evaluating the XSLT program. This paper discusses the XPath/XSLT features of incremental view maintenance for subtree insertion/deletion and applies them to the maintenance algorithm. Experiments show that the incremental maintenance algorithm outperforms full XML transformation algorithms by factors of up to 500.
Lower bounds for linear degeneracy testing
Authors: Nir Ailon, Bernard Chazelle
Venue: Journal of the ACM (JACM) (2005)

In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, do any r of them add up to 0? His lower bound of &Omega;(n&lceil;r/2&rceil;), for any fixed r, is optimal if the polynomials at the nodes are linear and at most r-variate. We generalize his bound to s-variate polynomials for s > r. Erickson's bound decays quickly as r grows and never reaches above pseudo-polynomial: we provide an exponential improvement. Our arguments are based on three ideas: (i) a geometrization of Erickson's proof technique; (ii) the use of error-correcting codes; and (iii) a tensor product construction for permutation matrices.
J2EE support for wireless services
Authors: Sherali Zeadally, Junhua Pan
Venue: Journal of Systems and Software (2005)

We explore by design and implementation the applicability of J2EE (Java 2 Platform, Enterprise Edition) architecture in supporting wireless services as well as web-based services. This has been demonstrated by implementing a wireless prescription system, which provides wireless services to physicians, and web-based services to pharmacies and administrators. The goal of the wireless prescription system is to improve the efficiency of the healthcare system by reducing the overall time and cost used to create documents and retrieve information. We also present a performance evaluation of the implemented wireless prescription system using latency as the performance metric. In particular, we investigated the overheads associated with different components of the underlying J2EE architecture, which includes the Session Bean, Entity Bean, and the database. We found that the latency overheads introduced by these components account for 3.8-4.3%, 3.9-4.4%, and 91.8% of the total delay experienced inside the J2EE architecture respectively.
Retrieving multimedia web objects based on PageRank algorithm
Authors: Christopher C. Yang, K. Y. Chan
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Hyperlink analysis has been widely investigated to support the retrieval of Web documents in Internet search engines. It has been proven that the hyperlink analysis significantly improves the relevance of the search results and these techniques have been adopted in many commercial search engines, e.g. Google. However, hyperlink analysis is mostly utilized in the ranking mechanism of Web pages only but not including other multimedia objects, such as images and video. In this project, we propose a modified Multimedia PageRank algorithm to support the searching of multimedia objects in the Web.
A Tool Framework for Generation of Application Optimized Communication Protocols
Authors: Ralf Burda, Jorn Seger
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Communication networks and their services have been developing from user centric systems to a conglomerate of heterogeneous entities. Nowadays the end user device is only one participant. All communicating entities define services of arbitrary complexity by arranging the set of available functionalities according to the requested solution. Recently sensor networks have gathered a lot of attention to provide to "the network" some needed environmental information to enable value added location based services. This evolution has also introduced embedded systems to participate and supplement existing networks. In favour of these systems (which are lightweigth usually), this paper proposes an algorithmic and tooling approach to define and implement communication protocols which are tailored to the specific needs of a given application. This approach, compared to general purpose protocols, reduces the communication overhead significantly. Side effects as energy saving may become crucial if long sustainablity of an autonomous service is a major goal. Meanwhile, the database defining the application protocol is kept at a high abstraction level such as an XML document in case of the given examples.
TRIBA: a cable television retrieval & awareness system
Authors: Michael Tseng, Jon Kolko
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper discusses the design of a physical and digital system intended to allow for easy manipulation and interaction with the tremendous amount of options present in advanced multimedia devices, such as digital cable television. As user demand for access to large quantities of data increases, and cable companies offer more choices to their audiences, traditional content selection techniques become less useful and much more difficult to understand. TRIBA is the result of a ten week research and design exploration investigating how users can easily manipulate and comprehend tremendously large data sets. The findings of this research indicate a need for utilizing interactive agents to bridge the gap between the user and their goal. As technology is created and consumer electronics becomes more integrated into our lives, devices speak a language that users are expected to learn. TRIBA is a product embracing the philosophical idea that users should not have to learn a new language to interact with a futuristic and useful product, but instead products and devices must learn to speak the same language as the user.
A Modular Concept of the Robotic Vehicle for Demining Operations
Authors: Štefan Havlík
Venue: Autonomous Robots (2005)

Paper analyses some most important characteristics that should be taken into consideration in building the robotic demining vehicle. Based on previous experiences from the development of demining technology the modular concept of the multipurpose vehicle and some its main functional parts are discussed. Such robotic vehicle can be used as general porter of various detection systems, tools for cleaning terrain as well as neutralization equipment. Further development towards partially autonomous system and some principal tasks of positioning in dangerous terrain are analyzed. The real construction of the vehicle equipped by the flailing mechanisms for mechanical activation of explosions is briefly presented.
Content Delivery Networks: Status and Trends
Authors: Athena Vakali, George Pallis
Venue: IEEE Internet Computing (2003)

CDNs improve network performance and offer fast and reliable applications and services by distributing content to cache servers located close to users.
The statistical significance of the MUC-5 results
Authors: Nancy Chinchor
Venue: Proceedings of the 5th conference on Message understanding (1993)

The statistical significance of the results of the MUC-5 evaluation is determined using a computer-intensive method of hypothesis testing known as approximate randomization. The exact method is described in detail in [1] and [2] and has been used as the accepted statistical test for the MUC results since MUC-3. The purpose of the statistical testing is to determine whether the scores of the systems are different by chance or due to a significant difference in the character of the systems.
A quality-driven systematic approach for architecting distributed software applications
Authors: Tariq Al-Naeem, Ian Gorton, Muhammed Ali Babar, Fethi Rabhi, Boualem Benatallah
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Architecting distributed software applications is a complex design activity. It involves making decisions about a number of inter-dependent design choices that relate to a range of design concerns. Each decision requires selecting among a number of alternatives; each of which impacts differently on various quality attributes. Additionally, there are usually a number of stakeholders participating in the decision-making process with different, often conflicting, quality goals, and project constraints, such as cost and schedule. To facilitate the architectural design process, we propose a quantitative quality-driven approach that attempts to find the best possible fit between conflicting stakeholders' quality goals, competing architectural concerns, and project constraints. The approach uses optimization techniques to recommend the optimal candidate architecture. Applicability of the proposed approach is assessed using a real system.
An Agent-Based Middleware for Communication Service on Ad Hoc Network
Authors: Gen Kitagata, Yu Matsushima, Daisuke Hasegawa, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we propose an agent-based mobile Ad-hoc service construction system named AMACS, which is an agent based middleware and improves usability of user communication on Ad-hoc networks. AMACS exchanges user information among computers and makes users possible to use various communication services by only selecting target userýs name and service name. In this paper, we describe agent-oriented service composition method of AMACS, and show detailed design and implementation. Finally, through experiments using prototype system, we show effectiveness of AMACS.
Using speech and language technology to coach reading
Authors: Patti Price, Luc Julia
Venue: Proceedings of the first international conference on Human language technology research (2001)

BravoBrava! is expanding the repertoire of commercial user interfaces by incorporating multimodal techniques combining traditional point and click interfaces with speech recognition, speech synthesis, and gesture recognition. One of these applications is software to help children read. While the child reads aloud, the computer keeps the child on track and offers feedback when the child has difficulty. The feedback can be as subtle as changing the text color for a well articulated phrase or as friendly as a cartoon character that talks. The computer is infinitely patient and can keep detailed records of the child's progress. The reading software is being commercialized by BravoBrava!'s spinoff company, SUP Inc.
Novell Linux Desktop 9 Administrator's Handbook
Authors: Emmett Dulaney
Venue:  (2005)

What better way to learn something than from the inside? Novell Linux Desktop 9 Administrator's Handbook brings you inside the system and inside the only Novell authorized administrator's handbook for the new Novell Linux Desktop (NLD). Learn how NLD interacts with other Novell components and how to integrate security throughout the operating system. You'll also cover: Working with graphical interfaces, devices and file systems How to boot, initialize, shutdown and run levels Linux administrationWith the help of Novell Linux Desktop 9 Administrator's Handbook, you will master the administration of Novell Linux Desktop 9 systems.