ppxscal/embedding_network huggingface dataset:
Integrating Web Caching and Web Prefetching in Client-Side Proxies
Authors: Wei-Guang Teng Cheng-Yue Chang Ming-Syan Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (2005)

Web caching and Web prefetching are two important techniques used to reduce the noticeable response time perceived by users. Note that by integrating Web caching and Web prefetching, these two techniques can complement each other since the Web caching technique exploits the temporal locality, whereas Web prefetching technique utilizes the spatial locality of Web objects. However, without circumspect design, the integration of these two techniques might cause significant performance degradation to each other. In view of this, we propose in this paper an innovative cache replacement algorithm, which not only considers the caching effect in the Web environment, but also evaluates the prefetching rules provided by various prefetching schemes. Specifically, we formulate a normalized profit function to evaluate the profit from caching an object (i.e., either a nonimplied object or an implied object according to some prefetching rule). Based on the normalized profit function devised, we devise an innovative Web cache replacement algorithm, referred to as Algorithm IWCP (standing for the Integration of Web Caching and Prefetching). Using an event-driven simulation, we evaluate the performance of Algorithm IWCP under several circumstances. The experimental results show that Algorithm IWCP consistently outperforms the companion schemes in various performance metrics.
EPYFQ: a novel scheduling algorithm for performance virtualization in shared storage environment
Authors: Yong Feng, Yan-yuan Zhang, Rui-yong Jia
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This paper introduces EPYFQ, a novel scheduling algorithm, which is the core technology to provide performance virtualization in shared storage environment. EPYFQ schedules requests from virtual disks according to their shares, and can satisfy the following three requirements demanded by performance virtualization, performance isolation, fairness and throughput. We implement EPYFQ into DM, a kernel module of Linux, which provides logic volume management service, and evaluate it from the above three aspects. Our results show that EPYFQ has good ability of performance isolation and fairness. Besides, we can adjust the tradeoff between tight resource control and throughput of storage system through the parameter &epsilon;.
Portal management
Authors: Chavdar Marchev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper describes the structure and the opportunities afforded by the new programming framework of Microsoft - Visual Studio .NET. A concrete application has been considered - an abstract model of an Internet portal using XML and RDF data bases. Some advantages of that framework have been described. They are relevant to the stage of the physical creation of the portal.
Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus system
Authors: Anu G. Bourgeois, Yi Pan, Sushil K. Prasad
Venue: Journal of Parallel and Distributed Computing (2005)

Recently, researchers have proposed many models using reconfigurable optically pipelined buses. Most algorithms developed for these models assume that a healthy system is available. The only previous work in this area considers faulty processors or hardware for an N-processor linear array with a reconfigurable pipelined bus system (LARPBS), resulting in fault tolerant algorithms that run in O(logN) time. We extend and improve upon previous results by considering new fault scenarios and slight modifications to the LARPBS model. By modifying the switches on the receiving segment of an LARPBS, a reasonable, low-cost extension to the model, we are able to achieve fault tolerant algorithms that execute in O(1) time rather than O(logN) time. The fault tolerant algorithms that we consider are key basic fundamental algorithms, such as compaction, binary prefix sums, and sorting, that all execute in constant time on a healthy LARPBS. As the algorithms improved are building blocks for more complex algorithms, the results presented in this paper will extend to those more complex algorithms as well.
Unsupervised Fuzzy-Membership Estimation of Terms in Semantic and Syntactic Lexical Classes
Authors: David Portnoy, Peter Bock
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

The objective of this research is to discover fuzzy semantic and syntactic relationships among English words at various levels of abstraction without using any other sources of semantic or syntactical reference information (e.g. dictionaries, lexicons, grammar rules, etc...) An agglomerative clustering algorithm is applied to the co-occurrence space formed by subsets of target words and training words the output of which is a set of semantic or syntactic classes. The fuzzy-relationships (membership coefficients) between test words and the semantic and syntactic classes are estimated by the non-negative least-squares solution to the system of linear equations defined. Experiments using raw text in 218 unrelated novels have yielded promising results. It is expected that larger and/or more narrowly focused training sets will yield even better and more diverse results.
Dihedral Angle based Dimensionality Reduction for Protein Structural Comparison
Authors: Naveen Kandiraju, Sumeet Dua, Steven A. Conrad
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Structural comparison of proteins is considered as one of the highly focused research areas in the field of bioinformatics. Structural similarity estimation techniques using singular geometric parameters derived from spatial coordinates of protein structural atoms have been reported previously, but it is also ascertained that a single geometric parameter based structural estimation can result in misconstrued classification and functional interpretation. In this paper we propose a novel geometric parameters based comparison protocol that uses previously unexplored pair of dihedral angles NC_a NC_a and NCNC for similarity search. An orthonormal transformation is employed on the two-dimensional distribution for feature extraction and selective feature-space is represented in an indexing schema later used for similarity calibration. The results demonstrate the success of this dimensionality reduction based similarity measure in performing a rapid and length-independent similarity analysis of the protein structures.
Dual-Primal FETI Algorithms for Edge Element Approximations: Two-Dimensional H And P Finite Elements on Shape-Regular Meshes
Authors: Andrea Toselli, Xavier Vasseur
Venue: SIAM Journal on Numerical Analysis (2004)

A family of dual-primal finite element tearing and interconnecting (FETI) methods for edge element approximations in two dimensions is proposed and analyzed. The primal constraints here are averages over subdomain edges. It is shown that the condition number of the corresponding method is independent of the number of substructures and grows only polylogarithmically with the number of unknowns associated with individual substructures. The estimate is also independent of the jumps of both of the coefficients of the original problem. Numerical results validating our theoretical bounds are given.
Building a bilingual WordNet-like lexicon: the new approach and algorithms
Authors: Yang Liu, Shiwen Yu, Jiangsheng Yu
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

A bilingual concept MRD is of significance for IE, MT, WSD and the like. However, it is reasonably difficult to build such a lexicon for there exist two ontologies, also, the evolution of such a lexicon is quite challenging. In this paper, we would like to put forth the new approach to building a bilingual WordNet-like lexicon and to dwell on some of the pivotal algorithms.A characteristic of this new approach is to emphasize the inheritance and transformation of the existent monolingual lexicon. On the one hand, we have extracted all the common knowledge in WordNet as the semantic basis for further use. On the other hand, we have developed a visualized developing tool for the lexicographers to interactively operate on to express the bilingual semantics. The bilingual lexicon has thus gradually come into being in this natural process.ICL now has benefited a lot by employing this new approach to build CCD (Chinese Concept Dictionary), a bilingual WordNet-like lexicon, in Peking University.
Efficient solution of multi-term fractional differential equations using P(EC)mE methods
Authors: K. Diethelm
Venue: Computing (2003)

We investigate strategies for the numerical solution of the initial value problem y(αv)(x) = f(x, y(x), y(α1)(x),..., y(αv-1)(x)) with initial conditions y(k)(0) = y0(k) (k = 0, 1,..., ⌈αv⌉ - 1), where 0 < α1 < α2 < ... < αv. Here y(xj) denotes the derivative of order αj > 0 (not necessarily αj ∈ N) in the sense of Caputo. The methods are based on numerical integration techniques applied to an equivalent nonlinear and weakly singular Volterra integral equation. The classical approach leads to an algorithm with very high arithmetic complexity. Therefore we derive an alternative that leads to lower complexity without sacrificing too much precision.
A Methodology for Evaluating Agent Toolkits
Authors: Elhadi Shakshuki
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Multi-agent systems (MASs) play an important role in information technology. They are used in many applications. To develop these systems requires the developer to deal with several issues and to implement many of the system components, such as protocols and agents' functionalities. Due to their significant role, agent toolkits are becoming more of a necessity to help build, re-use, and deploy agents. Although there are several agent-building toolkits that can help developers to effectively develop MAS and allow them to focus more on the application to specific domains, it is difficult for developers to select the appropriate toolkit. This paper presents a methodology to evaluate MAS toolkits based on the criteria of their availability, environment, development, characteristic properties and performance.
A Cross-Validatory Statistical Approach to Scale Selection for Image Denoising by Nonlinear Diffusion
Authors: George Papandreou, Petros Maragos
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Scale-spaces induced by diffusion processes play an important role in many computer vision tasks. Automatically selecting the most appropriate scale for a particular problem is a central issue for the practical applicability of such scale-space techniques. This paper concentrates on automatic scale selection when nonlinear diffusion scale-spaces are utilized for image denoising. The problem is studied in a statistical model selection framework and cross-validation techniques are utilized to address it in a principled way. The proposed novel algorithms do not require knowledge of the noise variance and have acceptable computational cost. Extensive experiments on natural images show that the proposed methodology leads to robust algorithms, which out-perform existing techniques for a wide range of noise types and noise levels.
Systematic construction of q-analogs of t - (v, k, λ)-designs
Authors: Michael Braun, Adalbert Kerber, Reinhard Laue
Venue: Designs, Codes and Cryptography (2005)

In the present paper we consider a q-analog of t - (v, k, λ)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247-253 (1996)] they are called t - (v, k, λ q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package.In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t - (v, k, λ)-designs on sets, obtaining this way new results on the existence of t - (v, k, λ q)-designs on spaces for further quintuples (t, v, k, λ q) of parameters. We present several 2 - (6, 3, λ 2)-designs, 2 - (7.3, λ 2)-designs and, as far as we know, the very first 3-designs over GF(q).
Predictive Reduction of Power and Latency (PuRPLe)
Authors: Matthew Craven, Ahmed Amer
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Increasing efforts have been aimed towards the management of power as a critical system resource, and the disk can consume approximately a third of the power required for a typical laptop computer. Mechanisms to manage disk power have included spin-down policies and APIs to modify access workloads to be more powerfriendly. In this work we present a measurement study of disk power consumption, focusing on the potential impact of successfully optimizing disk layout or predicting future disk accesses with predictive read-ahead. We demonstrate how such strategies can allow the reduction of disk power consumption at least as well as traditional disk spin-down schemes, while avoiding the serious performance degradation that can occur from excessive spin-downs. Experimental results showed that a successful predictive disk management policy could reduce disk power consumption by over 80%, while maintaining the responsiveness of a continuously running disk. In contrast, an aggressive spin-down policy that does not attempt to optimize layout or predictively read-ahead data, would achieve the same results at the expense of increasing average delays by 2 to 4 times. Another contribution of this work involves the accuracy of the measurements, which were conducted at a level precise enough to distinguish the power consumption of drive electronics, spindle-motors, and disk arm movement.
Peer Certification: Techniques and Tools for Reducing System Admin Support Burdens While Improving Customer Service
Authors: Stacy Purcell, Sally Hambridge, David Armstrong, Tod Oace, Matt Baker, Jeff Sedayao
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

System administrators are under pressure to do more work and provide better customer service with fewer staff members. At the same time, other challenges emerge: constant interrupts, poor morale, career development needs. At Intel Online Services, we use peer certification to reduce system and network administration burdens while simultaneously improving both customer service and staff morale. Intel Online Services (IOS) has teams of system administrators specializing in various areas such as Virtual Private Networks (VPNs), mail, DNS, and firewalls. Before peer certification these specialists did all of an area's work, from completing routine changes and handling problem escalations, to doing engineering work. Peer certification was created as a way to add qualified personnel. Specialists certified their peers by having them pass oral content tests and by supervising them doing changes. Tools were created to simplify administration tasks and make them doable by nonspecialists, and varied in complexity and flexibility depending on the expertise needed to do the task. After implementing peer certification, the number of staff certified to make basic changes increased greatly, along with the number of changes made by front line staff, while the number of escalations decreased. Morale improved as interrupts were reduced and staff gained new areas to learn while customer issues and requests were resolved more quickly.
A GTRBAC Based System for Dynamic Workflow Composition and Management
Authors: Basit Shafiq, Arjmand Samuel, Halima Ghafoor
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

In this paper, we propose an architecture for adaptive real-time workflow-based collaborative system. Such a system is needed to support real-time communication and sharing of information among predefined or ad hoc team of users collaborating with each other for the execution of their respective tasks in the workflow. A key requirement for real-time workflow system is to provide the right data to the right person at the right time. In addition, the workflow needs to be reconfigured if a subtask of a workflow cannot be executed within the due time. We use the generalized temporal role-based access control (GTRBAC) model to capture the real-time dependencies of such workflow applications. In addition, support for triggers in GTRBAC allows dynamic adaptation of workflow based on the occurrence of certain events. Such adaptations may include rescheduling of workflow tasks, reassignment of users to scheduled tasks based on their availability and skill level, and abortion of incomplete tasks.
Particle Filtering for Geometric Active Contours with Application to Tracking Moving and Deforming Objects
Authors: Yogesh Rathi, Namrata Vaswani, Allen Tannenbaum, Anthony Yezzi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a higher dimensional function. This representation is able to deal with singularities and changes in topology of the contour. It has been used very successfully in static images for segmentation and registration problems where the contour (represented as an implicit curve) is evolved until it minimizes an image based energy functional. But tracking involves estimating the global motion of the object and its local deformations as a function of time. Some attempts have been made to use geometric active contours for tracking, but most of these minimize the energy at each frame and do not utilize the temporal coherency of the motion or the deformation. On the other hand, tracking algorithms using Kalman filters or Particle filters have been proposed for finite dimensional representations of shape. But these are dependent on the chosen parametrization and cannot handle changes in curve topology. In the present work, we formulate a particle filtering algorithm in the geometric active contour framework that can be used for tracking moving and deforming objects.
A Least-Squares Volterra Predistorter for Compensation of Non-Linear Effects with Memory in OFDM Transmitters
Authors: Jian Li, Jacek Ilow
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

This paper proposes a general solution to compensate for the nonlinearity of a high power amplifier (HPA) with memory effects in orthogonal frequency division multiplexing (OFDM) communication systems at the transmitter side. Mean square error (MSE) minimization is used to derive the predistorter, which is modelled as a simplified finite order Volterra system. A general feedback loop structure is used in order to reduce the computational complexity. The input and output of the nonlinear system with memory effects are accessed, and a least-squares solution is used to obtain the Volterra kernel, which represents the predistorter. Once the Volterra kernel is obtained, when signals pass through the cascaded system of the predistorter and the HPA, overall linear system characteristics are achieved. The advantage of the proposed method is that it does not assume any specific model for the HPA. The performance of the proposed scheme is verified through computer simulations. Specifically, the improvements in the reduction of out-of-band spectral regrowth and enhanced performance in terms of the bit error rate (BER) are documented for the travelling wave tube (TWT) HPA model.
Sensitivity Analysis Using It&ocirc;-Malliavin Calculus and Martingales, and Application to Stochastic Optimal Control
Authors: Emmanuel Gobet, Remi Munos
Venue: SIAM Journal on Control and Optimization (2005)

We consider a multidimensional diffusion process $(X^\alpha_t)_{0\leq t\leq T}$ whose dynamics depends on a parameter $\alpha$. Our first purpose is to write as an expectation the sensitivity $\nabla_\alpha J(\alpha)$ for the expected cost $J(\alpha)=\mathbb{E}(f(X^\alpha_T))$, in order to evaluate it using Monte Carlo simulations. This issue arises, for example, from stochastic control problems (where the controller is parameterized, which reduces the control problem to a parametric optimization one) or from model misspecifications in finance. Previous evaluations of $\nabla_\alpha J(\alpha)$ using simulations were limited to smooth cost functions $f$ or to diffusion coefficients not depending on $\alpha$ (see Yang and Kushner, SIAM J. Control Optim., 29 (1991), pp. 1216--1249). In this paper, we cover the general case, deriving three new approaches to evaluate $\nabla_\alpha J(\alpha)$, which we call the Malliavin calculus approach, the adjoint approach, and the martingale approach. To accomplish this, we leverage Itô calculus, Malliavin calculus, and martingale arguments. In the second part of this work, we provide discretization procedures to simulate the relevant random variables; then we analyze their respective errors. This analysis proves that the discretization error is essentially linear with respect to the time step. This result, which was already known in some specific situations, appears to be true in this much wider context. Finally, we provide numerical experiments in random mechanics and finance and compare the different methods in terms of variance, complexity, computational time, and time discretization error.
Review of "Artificial Intelligence: An MIT Perspective, Volume 1: Expert Problem Solving, Natural Language Understanding, Intelligent Computer Coaches, Representation and Learning by Patrick Henry Winston and Richard Henry Brown"; The MIT Press, Cambridge, Massachusetts, 1979, ISBN 0-262-73058-8.
Authors: Varol Akman
Venue: Issue 84 (April 1983) (1983)

Artificial Intelligence: An MIT Perspective consists of two volumes. Volume 1 covers the areas cited in the title of this review. Volume 2 (which will be the subject matter of an upcoming review) has sections on Understanding Vision, Manipulation and Productivity Technology, Computer Design, and Symbol Manipulation.
Hughes Trainable Text Skimmer: MUC-3 test results and analysis
Authors: Charles P. Dolan, Thomas V. Cuda, Seth R. Goldman, Alan M. Nakamura
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Figure 1 gives the official results for the Hughes Trainable Text Skimmer used for MUC3 (TTS-MUC3). TTS is a largely statistical system, using a K-Nearest Neighbor classifier with the output of a shallow parser as features. (See the System Summary section of this volume for a detailed description of TTS-MUC3). The performance, on a slot by slot basis is, therefore, what one might expect: the pure set fills such as "Incident Type" and "Category" have much better performance than the string fills such as "Human Target." In addition, we can see that "Incident Date" and "Incident Location," for which special code was written, have performance above that of the string fills.