ppxscal/embedding_network huggingface dataset:
The adwords problem: online keyword matching with budgeted bidders under random permutations
Authors: Nikhil R. Devenur, Thomas P. Hayes
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize the revenue generated by these keyword sales, bearing in mind that, as some bidders may eventually exceed their budget, not all keywords should be sold to the highest bidder. We assume that the sequence of keywords (or equivalently, of bids) is revealed on-line. Our concern will be the competitive ratio for this problem versus the off-line optimum. We extend the current literature on this problem by considering the setting where the keywords arrive in a random order. In this setting we are able to achieve a competitive ratio of 1-ε under some mild, but necessary, assumptions. In contrast, it is already known that when the keywords arrive in an adversarial order, the best competitive ratio is bounded away from 1. Our algorithm is motivated by PAC learning, and proceeds in two parts: a training phase, and an exploitation phase.
Synthetic-X control charts optimized for in-control and out-of-control regions
Authors: Francisco Aparisi, Marco A. de Luna
Venue: Computers and Operations Research (2009)

There are real industrial cases where small shifts in the quality of a productive process do not need to be detected, but, at the same time, it is necessary to maintain the performance of the control chart to detect large shifts which are considered important. In this paper the optimization, zero- and steady-state cases, of the synthetic-X@? control chart is studied (standard, side-sensitive, group runs and side-sensitive group runs versions) with the aim of not detecting shifts in a region of admissible shifts (in-control region) and, at the same time, being able to detect shifts considered important (out-of-control region). Genetic algorithms have been employed to solve this optimization problem and user-friendly software has been developed with the objective of helping users to select the best synthetic-X@? chart for the process. On the other hand, a comparison is made with the optimized EWMA chart for this in-control and out-of-control optimization problem.
The myriad virtues of Wavelet Trees
Authors: Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
Venue: Information and Computation (2009)

Wavelet Trees have been introduced by Grossi et al. in SODA 2003 and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compression algorithms. Although several papers have investigated the properties and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a throughout theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. Also, we propose a novel framework, called Pruned Wavelet Trees, that aims for the best combination of Wavelet Trees of properly-designed shapes and compressors either binary (like, Run-Length encoders) or non-binary (like, Huffman and Arithmetic encoders).
Interlacing of zeros of linear combinations of classical orthogonal polynomials from different sequences
Authors: Kathy Driver, Kerstin Jordaan, Norbert Mbuyi
Venue: Applied Numerical Mathematics (2009)

We prove that the zeros of polynomials of consecutive degree in the sequences {r"n}"n"="1^~ and {s"n}"n"="1^~ are interlacing for n@?N, n>=1 wherer"n=p"n+a"nq"n,s"n=p"n+b"nq"n"-"1,a"n,b"n
Stochasticity, spikes and decoding: sufficiency and utility of order statistics
Authors: Barry J. Richmond
Venue: Biological Cybernetics (2009)

For over 75&#x00a0;years it has been clear that the number of spikes in a neural response is an important part of the neuronal code. Starting as early as the 1950&#x2019;s with MacKay and McCullough, there has been speculation over whether each spike and its exact time of occurrence carry information. Although it is obvious that the firing rate carries information it has been less clear as to whether there is information in exactly timed patterns, when they arise from the dynamics of the neurons and networks, as opposed to when they represent some strong external drive that entrains them. One strong null hypothesis that can be applied is that spike trains arise from stochastic sampling of an underlying deterministic temporally modulated rate function, that is, there is a time-varying rate function. In this view, order statistics seem to provide a sufficient theoretical construct to both generate simulated spike trains that are indistinguishable from those observed experimentally, and to evaluate (decode) the data recovered from experiments. It remains to learn whether there are physiologically important signals that are not described by such a null hypothesis.
On the Performance and Scalability of Web Services for Monitoring MPLS-based Networks
Authors: Aimilios Chourmouziadis, Marinos Charalambides, George Pavlou
Venue: Journal of Network and Systems Management (2009)

Web Services is an XML-based technology that has attracted significant attention for building distributed Internet services. Considerable research efforts have been trying to extend it to become a unifying management technology; initial evaluation efforts have demonstrated promising application potential in the domain of network and service management. This paper analyzes the monitoring requirements of a management system used in architectures for providing quality of service, and shows how Web Services can be used effectively to fulfill these requirements. In order to achieve this, a WS-based framework was designed and a query tool was developed to support distributed, optimized retrieval of management information exposed as Web Services. The query tool supports selective and bulk retrieval from MPLS-capable routers. Management information retrieval is demonstrated through three monitoring scenarios, and the measured performance in terms of latency and bandwidth is compared against a conventional approach based on SNMP.
Building Agents that Plan and Argue in a Social Context
Authors: Dionysis Kalofonos, Nishan Karunatillake, Nicholas R. Jennings, Timothy J. Norman, Chris Reed, Simon Wells
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

In order for one agent to meet its goals, it will often need to influence another to act on its behalf, particularly in a society in which agents have heterogenous sets of abilities. To effect such influence, it is necessary to consider both the social context and the dialogical context in which influence is exerted, typically through utterance. Both of these facets, the social and the dialogical, are affected by, and in turn affect, the plan that the influencing agent maintains, and the plans that the influenced agents may be constructing. The i-Xchange project seeks to bring together three closely related areas of research: in distributed planning, in agent-based social reasoning, and in inter-agent argumentation, in order to solve some of the problems of exerting influence using socially-aware argument.
Priority-based routing resource assignment considering crosstalk
Authors: Yi-Ci Cai, Bin Liu, Yan Xiong, Qiang Zhou, Xian-Long Hong
Venue: Journal of Computer Science and Technology (2006)

Crosstalk has become one of the most critical concerns in very deep sub-micron era. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. Noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. An efficient priority-based heuristic algorithm is developed, which works slice by slice. Crosstalk avoidance, and many other aspects that are critical in routing practice including congestion, vias, layer preference, etc., are taken into account. A track reservation strategy is adopted in the algorithm framework to compensate the undesired effects caused by sequential routing. Experimental results on a series of ISPD98 and industrial benchmarks show that the proposed approach is able to reduce capacitive crosstalk by about 70% on average without compromising completion ratio compared with a previously reported graph based algorithm, demonstrating the advantages of the approach.
Archiving the videogame industry: collecting primary materials of new media artifacts
Authors: Megan A. Winget
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This paper describes the initial deposits in The Videogame Archive at the Center for American History at the University of Texas at Austin.
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
Authors: A. Sedeño-Noda, C. González-Martín
Venue: Computational Optimization and Applications (2009)

We introduce a new network simplex pivot rule for the shortest path simplex algorithm. This new pivot rule chooses a subset of non-basic arcs to simultaneously enter into the basis. We call this operation a multiple pivot. We show that a shortest path simplex algorithm with this pivot rule performs O(n) multiple pivots and runs in O(nm) time. Our pivot rule is based on the new concept of a pseudo permanently labeled node, and it can be adapted to design a new label-correcting algorithm that runs in O(nm). Moreover, this concept lets us introduce new rules to identify negative cycles. Finally, we compare the network simplex algorithm with multiple pivots with other previously proposed efficient network simplex algorithm in a computational experiment.
Fixed-Point Quantifiers in Higher Order Logics
Authors: Klaus-Dieter Schewe, José María Turull Torres
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

We add inflationary and non-inflationary fixed-points to higher-order logics. We show that, for every order, it is sufficient to increase the order of the given logic by one to capture inflationary fixed-points and by two to capture non-inflationary fixed-points. In the two cases, restricting to the existential fragment of the corresponding logic turns out to be enough. This also holds for non-deterministic fixed-points.
Simulation for queueing systems under fuzziness
Authors: Hsien-Chung Wu
Venue: International Journal of Systems Science (2009)

The fuzzy arrival rate and fuzzy service rate in a queueing system are proposed in this article. The nonhomogeneous Poisson process with fuzzy intensity function will be taken as the arrival process for this queueing system. The computational procedures for performing simulation in the α-level sense and for obtaining the α-level closed intervals of the system performance measure are also proposed to tackle this kind of model. The numerical results are obtained by using the commercial software MATLAB.
MCTS Self-Paced Training Kit (Exam 70-432): Microsoft SQL Server 2008 Implementation and Maintenance, 1st edition
Authors: Mike Hotek
Venue: Pro-Certification (2009)

Long Description Announcing an all-new SELF-PACED TRAINING KIT designed to help maximize your performance on 70-432, the required exam for the new Microsoft Certified Technology Specialist (MCTS) certification for SQL Server 2008 Implementation and Maintenance. This 2-in-1 kit includes the official Microsoft study guide, plus practice tests on CD to help you assess your skills. It comes packed with the tools and features exam candidates want most including in-depth, self-paced training based on final exam content; rigorous, objective-by-objective review; exam tips from expert, exam-certified authors; and customizable testing options. It also provides real-world scenarios, case study examples, and troubleshooting labs for the skills and expertise you can apply to the job. Focusing on implementing and maintaining a SQL Server 2008 database, this official study guide covers installing and configuring SQL Server 2008; managing SQL Server Agent jobs, alerts, and operators; implementing security features; backing up and restoring databases; monitoring and troubleshooting SQL Server; optimizing performance using the Resource Governor and Database Engine Tuning Advisor; and implementing high availability. Work at your own pace through the lessons and lab exercises. Then assess yourself using 300+ practice and review questions on the CD, featuring multiple, customizable testing options to meet your specific needs. Choose timed or untimed testing mode, generate random tests, or focus on discrete objectives. You get detailed explanations for right and wrong answers including pointers back to the book for further study. You also get an evaluation version of SQL Server 2008 software and an exam discount voucher making this kit an exceptional value and a great career investment.
Innovations in Hybrid Intelligent Systems (Advances in Soft Computing), 1st edition
Authors: Emilio Corchado, Emilio Corchado, Juan M. Corchado, Ajith Abraham
Venue:  (2007)

Hybrid Artificial Intelligence Systems (HAIS) combines symbolic and sub-symbolic techniques to construct more robust and reliable problem solving models. This volume focused on "Hybrid Artificial Intelligence Systems" contains a collection of papers that were presented at the 2nd International Workshop on Hybrid Artificial Intelligence Systems, held in 12 - 13 November, 2007, Salamanca, Spain. This carefully edited book provides a comprehensive overview of the recent advances in the hybrid intelligent systems and covers a wide range of application areas, including data analysis and data mining, intelligent control, pattern recognition, robotics, optimization, etc. The book is aimed at researchers, practitioners and postgraduate students who are engaged in developing and applying advanced intelligent systems principles to solving real-world problems.
The ImaginePA Project: The First Large-Scale, Public Sector ERP Implementation
Authors: William Wagner, Yvonne Lederer Antonucci
Venue: Information Systems Management (2009)

While large-scale ERP deployments have been prevalent in the private-sector, there have been few attempts to deploy them in the public sector. This paper describes the first large-scale, public-sector ERP implementation, which integrates systems for over 50 different agencies in the state of Pennsylvania government. Over 20 individuals were interviewed during three years to identify and describe issues, success factors, implementation strategies, and lessons learned as compared to private-sector ERP implementations.
Contextualising tags in collaborative tagging systems
Authors: Ching-man Au Yeung, Nicholas Gibbins, Nigel Shadbolt
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Collaborative tagging systems are now popular tools for organising and sharing information on the Web. While collaborative tagging offers many advantages over the use of controlled vocabularies, they also suffer from problems such as the existence of polysemous tags. We investigate how the different contexts in which individual tags are used can be revealed automatically without consulting any external resources. We consider several different network representations of tags and documents, and apply a graph clustering algorithm on these networks to obtain groups of tags or documents corresponding to the different meanings of an ambiguous tag. Our experiments show that networks which explicitly take the social context into account are more likely to give a better picture of the semantics of a tag.
IT Success!: Towards a New Model for Information Technology
Authors: Michael Gentle
Venue:  (2007)

Fifty years after the birth of corporate computing, IT today is still characterized by 50-70% project failure rates. Which is pretty scary when you come to think of it: either a goblin has cast a spell on a whole profession or that profession is doing something fundamentally wrong. IT Success! challenges the widespread assumption that an IT department is like a building contractor whose project managers, architects and engineers (all construction industry terms) are supposed to deliver systems on schedule, within budget and to spec. Michael Gentle explains why this is not possible, and turns conventional wisdom on its head by showing that: you cannot define an IT project in terms of contractual budgets and schedules anything can change during the life of a project what is eventually delivered can never be what is actually needed He proposes a new model for IT in which the traditional client/vendor relationship, with its contractual commitments, is replaced by a shared risk/reward partnership geared towards workable results over time. Using real-world examples and a case study, the author walks you through the end-to-end processes of an IT department, covering subjects like demand management, investment planning, agile development and managing production applications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Diversity and Software Development
Authors: Hakan Erdogmus
Venue: IEEE Software (2009)

Scott E. Page's diversity framework provides useful insights regarding software engineering research, practice, and education. This editorial discusses the concepts and implications of diversity in this context.
Electro-hydrostatic servo-actuators for aircraft
Authors: Liviu Dinca, Jenica-Ileana Corcau, Mihai Aureliu Lungu, Alexandru Nicolae Tudosie
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

Some great aeronautic catastrophes were produced by the hydraulic liquid lost and from this by the impossibility of aerodynamic surfaces command. For this reason it appears necessary to replace the centralized hydraulic system with some small local hydraulic systems. This paper presents some problems concerning these actuators, a mathematical model for a such actuator and some numerical simulations.
Impact of Non-schedulability on Embedded System Performance
Authors: Jiafu Wan, Di Li, Hehua Yan, Ping Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The uncertainty factors of real-time tasks during runtime affect the control performance owing to system resources and processor utilization restriction. The impact of non-schedulability on embedded system performance is deeply researched in this paper. First, the time characteristics such as sampling jitter, input-output jitter and non-schedulability are discussed. Then the schedulability analyses of the rate monotonic (RM) algorithm and the earliest deadline first (EDF) algorithm are introduced. Finally, using RM algorithm, an example, DC servo motor controller, is use to illuminate the impact of non-schedulable jobs on system performance. The experiment results indicate that it is extremely important to reduce, even eliminate the non-schedulable jobs for improving embedded system performance.
Cheap or Flexible Sensor Coverage
Authors: Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson, Ou Liu
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The first class of problems involve assigning radii to already-positioned sensors (being cheap). The second class of problems are motivated by the fact that the sensors may, because of practical difficulties, be positioned with only approximate accuracy (being flexible). This changes the character of some coverage problems that solve for optimal disk positions or disk sizes, ordinarily assuming the disks can be placed precisely in their chosen positions, and motivates new problems. Given a set of disk sensor locations, we show for most settings how to assign either (near-)optimal radius values or allowable amounts of placement error. Our primary results are 1) in the 1-d setting we give a faster dynamic programming algorithm for the (linear) sensor radius problem; and 2) we find a max-min fair set of radii for the 2-d continuous problems in polynomial time. We also give results for other settings, including fast approximation algorithms for the 1-d continuous case.
Learning when to stop thinking and do something!
Authors: Barnabás Póczos, Yasin Abbasi-Yadkori, Csaba Szepesvári, Russell Greiner, Nathan Sturtevant
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we consider the challenge of learning when we should terminate such algorithms on each of a sequence of iid tasks, to optimize the expected average reward per unit time. We provide a system for addressing this challenge, which combines the global optimizer Cross-Entropy method with local gradient ascent. This paper theoretically investigates how far the estimated gradient is from the true gradient, then empirically demonstrates that this system is effective by applying it to a toy problem, as well as on a real-world face detection task.
Direct model checking matrix algorithm
Authors: Zhi-Hong Tao, Hans Kleine Büning, Li-Fu Wang
Venue: Journal of Computer Science and Technology (2006)

During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties.