ppxscal/embedding_network huggingface dataset:
Algorithms for a network design problem with crossing supermodular demands
Venue: Networks (2004)

We present approximation algorithms for a class of directed network design problems. The network design problem is to find a minimum cost subgraph such that for each vertex set S there are at least f&lpar;S&rpar; arcs leaving the set S. In the last 10 years general techniques have been developed for designing approximation algorithms for undirected network design problems. Recently, Kamal Jain gave a 2-approximation algorithm for the case when the function f is weakly supermodular. There has been very little progress made on directed network design problems. The main techniques used for the undirected problems do not have simple extensions to the directed case. Andr&aacute;s Frank has shown that in a special case when the function f is intersecting supermodular the problem can be solved optimally. In this article, we use this result to get a 2-approximation algorithm for a more general case when f is crossing supermodular. We also extend Jain's techniques to directed problems. We prove that if the function f is crossing supermodular, then any basic solution of the LP relaxation of our problem contains at least one variable with value greater or equal to &frac14;. This result implies a 4-approximation algorithm for the class of directed network design problems. &copy; 2004 Wiley Periodicals, Inc.
Build the Best Data Center Facility for Your Business
Authors: Douglas Alger
Venue:  (2005)

A comprehensive guide to designing and operating reliable server environments Keep your data center cool, clean, scalable, and secure Learn the five principles of effective data center design Avoid the natural and man-made hazards that can jeopardize a data center site Learn how to lay out key infrastructure objects within the data center for greatest efficiency, from buffer zones to server rows Apply proven installation methods by studying sample illustrations of both overhead and under-floor systems Extract the best practices and design strategies for both in-room and standby electrical infrastructure Avoid accidental downtime, improve productivity, and ensure user safety Safeguard and streamline your network infrastructure with a well-organized physical hierarchy Understand the special challenges of retrofitting overburdened server environments Implement solutions from a wide array of sample illustrations and examples of essential data center signage Safeguard servers with operations standards for people working in or visiting the data center Download templates used by Cisco to design its data centers, customizable to square footage and geography Avoid excess construction costs by designing a data center that meets your needs today and for many years to comeï¾ All data centers are unique, but they all share the same mission: to protect your company's valuable information. Build the Best Data Center Facility for Your Business answers your individual questions in one flexible step-by-step reference guide.Benefit from the author's concise and practical approach to data center design and management. The author distills this complex topic by sharing his first-hand and worldwide experience and expertise. Regardless of your experience level, you can fill your knowledge gaps on how to safeguard your company's valuable equipment and intellectual property.This easy-to-navigate book is divided into two parts: Part I covers data center design and physical infrastructure details, and Part II covers data center management and operations. You can also access supplementary online materials for installation instructions, which include customizable data center design templates, written cabling specifications, and sample drawings.If you need a starting point for designing your first data center, regardless of size; if you need to prepare yourself with comprehensive strategies to retrofit or improve an existing one; or if you need proven methods to manage a data center for maximum productivity-this book is your readily accessible, comprehensive resource for answers and insights.ï¾ Invest in the best future for your business by learning how to build and manage robust and productive data centers now.This book is part of the Networking Technology Series from Cisco Pressï¾ which offers networking professionals valuable information for constructing efficient networks, understanding new technologies, and building successful careers.
Extracting grammar from programs: evolutionary approach
Authors: Matej Črepinšek, Marjan Mernik, Faizan Javed, Barrett R. Bryant, Alan Sprague
Venue: ACM SIGPLAN Notices (2005)

The paper discusses context-free grammar (CFG) inference using genetic-programming with application to inducing grammars from programs written in simple domain-specific languages. Grammar-specific heuristic operators and non-random construction of the initial population are proposed to achieve this task. Suitability of the approach is shown by small examples where the underlying CFG's are successfully inferred.
Entry vocabulary: a technology to enhance digital search
Authors: Fredric Gey, Michael Buckland, Aitao Chen, Ray Larson
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes a search technology which enables improved search across diverse genres of digital objects -- documents, patents, cross-language retrieval, numeric data and images. The technology leverages human indexing of objects in specialized domains to provide increased accessibility to non-expert searchers. Our approach is the reverse-engineer text categorization to supply mappings from ordinary language vocabulary to specialist vocabulary by constructing maximum likelihood mappings between words and phrases and classification schemes. This forms the training data or 'entry vocabulary'; subsequently user queries are matched against the entry vocabulary to expand the search universe. The technology has been applied to search of patent databases, numeric economic statistics, and foreign language document collections.
No task left behind?: examining the nature of fragmented work
Authors: Gloria Mark, Victor M. Gonzalez, Justin Harris
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present data from detailed observation of 24 information workers that shows that they experience work fragmentation as common practice. We consider that work fragmentation has two components: length of time spent in an activity, and frequency of interruptions. We examined work fragmentation along three dimensions: effect of collocation, type of interruption, and resumption of work. We found work to be highly fragmented: people average little time in working spheres before switching and 57% of their working spheres are interrupted. Collocated people work longer before switching but have more interruptions. Most internal interruptions are due to personal work whereas most external interruptions are due to central work. Though most interrupted work is resumed on the same day, more than two intervening activities occur before it is. We discuss implications for technology design: how our results can be used to support people to maintain continuity within a larger framework of their working spheres.
The Design and Implementation of a Cartesian Router
Authors: Mohammad Farajmandi, Larry Hughes
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

The increasing popularity of the Internet and networking has resulted in a significant growth in Internet traffic, coupled with an increase in the number of Internet routers. The increase in routers has resulted in the development of more complex routing algorithms, larger routing tables (requiring more memory), ultimately increasing the time required to search the lookup table. The Cartesian network is an attempt to overcome these problems. Instead of improving the search algorithm, it entirely removes the need for a table lookup. The Cartesian unicast routing algorithm is a novel routing methodology in which a packetýs route is determined by the position of the router relative to that of the destination. This paper describes the hardware design, development, and implementation of the Cartesian routers. A parallel architecture is proposed for the Cartesian routers. Field Programmable Gate Arrays (FPGA) devices are selected as a target platform for hardware implementation.
A Scheme for Authentication and Authorization in a Grid Application
Authors: HePing Hu, HanBing Yao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

One of the problems of designing a grid application is that, as the number of machines on the grid increases, it becomes very difficult to manage security and access control lists in a distributed and highly dynamic environment. In this article, we'll look at how to authentication and authorization in a grid application where machines can disconnect from the network at any time, and presents a scheme that allows users to register once and yet still provides the grid node the information they need to authenticate and authorize.
A framework for conducting political event analysis using group support systems
Authors: Robert W. Blanning, Bruce A. Reinig
Venue: Decision Support Systems (2005)

Corporations seeking to expand their operations internationally often encounter certain political events that they do not encounter domestically. Political events are those events that may occur because of the actions or decisions made by certain political actors having influence in a region. Such events include corruption, currency fluctuations, and civil unrest. However, obtaining information and insight about such events from local knowledgeable persons is often difficult due to authoritarian governments and/or cultural environments that discourage open criticism. We present a framework for using group support systems (GSS) under such conditions. The framework consists of methods that can be employed depending on the number of events (unidimensional or multidimensional) and time periods (static or dynamic) of interest. Each method is illustrated with local Hong Kong business executives addressing the future of Hong Kong as a desirable place to conduct multinational operations.
The virtual learning space: an interactive 3D environment
Authors: Anja Le Blanc, Jonathan Bunt, Jim Petch, Yien Kwok
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

This paper describes the Virtual Learning Space (VLS) project, a multi-user, distance learning environment. It describes the historical background which led to the proposal for this project, as well as the educational requirements and the design cycle undertaken. Technical details about the implementation are discussed, including a description of the technologies involved and their interaction with each other, a description of the application, and examples of procedures to create interactivity within the system.Early initial education test studies have been undertaken and ongoing large scale tests are currently being carried out. From this possible future enhancements are presented at the end of the paper.
A Fuzzy Find Matching Tool for Image Text Analysis
Authors: Simon Berkovich, Mohammad Inayatullah
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

In this paper, we present a study based on the effect of using a fuzzy find matching technique with the objective of increasing the precision of textual information retrieval for image analysis while allowing for mismatches. This technique is very helpful for searching those areas of interest where chances of misspelling are more likely, for example retrieving text information from an image. The technique we propose can be used as an embedded component or a post-processing tool for image analysis resulting in faster retrieval of corresponding information from images with given keywords. In the case of no hits, our technique outcome will suggest few close matches that can be further searched in keywords to get a closer match with improved speed of searching.
The fujaba real-time tool suite: model-driven development of safety-critical, real-time systems
Authors: Sven Burmester, Holger Giese, Martin Hirsch, Daniela Schilling, Matthias Tichy
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Evaluating implicit measures to improve web search
Authors: Steve Fox, Kuldeep Karnawat, Mark Mydland, Susan Dumais, Thomas White
Venue: ACM Transactions on Information Systems (TOIS) (2005)

Of growing interest in the area of improving the search experience is the collection of implicit user behavior measures (implicit measures) as indications of user interest and user satisfaction. Rather than having to submit explicit user feedback, which can be costly in time and resources and alter the pattern of use within the search experience, some research has explored the collection of implicit measures as an efficient and useful alternative to collecting explicit measure of interest from users.This research article describes a recent study with two main objectives. The first was to test whether there is an association between explicit ratings of user satisfaction and implicit measures of user interest. The second was to understand what implicit measures were most strongly associated with user satisfaction. The domain of interest was Web search. We developed an instrumented browser to collect a variety of measures of user activity and also to ask for explicit judgments of the relevance of individual pages visited and entire search sessions. The data was collected in a workplace setting to improve the generalizability of the results.Results were analyzed using traditional methods (e.g., Bayesian modeling and decision trees) as well as a new usage behavior pattern analysis (&ldquo;gene analysis&rdquo;). We found that there was an association between implicit measures of user activity and the user's explicit satisfaction ratings. The best models for individual pages combined clickthrough, time spent on the search result page, and how a user exited a result or ended a search session (exit type/end action). Behavioral patterns (through the gene analysis) can also be used to predict user satisfaction for search sessions.
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
Authors: Emerson C. Colin, Roberto C. Quinino
Venue: Computers and Operations Research (2005)

This paper addresses the problem of optimally inserting idle time into a single-machine schedule when the sequence is fixed and the cost of each job is a convex function of its completion time. We propose a pseudo-polynomial time algorithm to find a solution within some tolerance of optimality in the solution space, i.e., each completion time will belong to a small time interval z within which the optimal solution lies. Letting H be the planning horizon and |J| the number of jobs, the proposed algorithm is superior to the current best algorithm in terms of time-complexity when |J| < H/z.
Acceleration of Transition Test Generation for Acyclic Sequential Circuits Utilizing Constrained Combinational Stuck-At Test Generation
Authors: Tsuyoshi Iwagaki, Satoshi Ohtake, Hideo Fujiwara
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

This paper presents a transition test generation method for acyclic sequential circuits. In this method, to generate test sequences for transition faults in a given acyclic sequential circuit, constrained combinational stuck-at test generation is performed on its double time-expansion model that is composed of two copies of a time-expansion model of the given circuit. This method is complete, i.e., this method can generate test sequences for all the testable transition faults and can identify all the untestable transition faults in a given acyclic sequential circuit. Experimental results show that our method can achieve higher faultefficiency with drastically shorter test generation time than that achieved by a conventional method.
A Generalized BDS Statistic
Authors: M. Matilla-García, R. Queralt, P. Sanz, F. J. Vázquez
Venue: Computational Economics (2004)

The BDS statistic, rooted on the correlation integral, has been proven to be useful for different problems. But although the correlation integral is defined for any choice of delay time, the BDS statistic assumes delay time is one. As different studies have shown, an adequate choice of delay time is important in order to determine the dynamical properties of a system from an observed time series, specially when the data sets are small and there is some noise. This paper introduces a new statistic that generalizes BDS by allowing the choice of any delay time.
Modified Alternating$$\vec{k}$$--generators
Authors: Rafał Białota, Grzegorz Kawa
Venue: Designs, Codes and Cryptography (2005)

This paper deals with a class $$\mathcal{MAG}_{\vec{k}}$$ of pseudorandom bit generators -- modified alternating $$\vec{k}$$ --generators. This class is constructed similarly to the class $$\mathcal{ASG}_{\vec{k}}$$ of alternating step generators. Three subclasses of $$\mathcal{MAG}_{\vec{k}}$$ are distinguished, namely linear, mixed and nonlinear generators. The main attention is devoted to the subclass $$\mathcal{MAG}_{\vec{k}}^{max}$$ of linear and mixed generators generating periodic sequences with maximal period lengths. A necessary and sufficient condition for all sequences generated by the linear generators of $$\mathcal{MAG}_{\vec{k}}$$ to be with maximal period lengths is formulated. Such sequences have good statistical properties, such as distribution of zeroes and ones, and large linear complexity. Two methods of cryptanalysis of the proposed generators are given. Finally, three new classes of modified alternating $$\vec{k}$$ --generators, designed especially to be more secure, are presented.
Can Genetic Algorithms Explain Experimental Anomalies?
Authors: Marco Casari
Venue: Computational Economics (2004)

In experimental data, it is common to find persistent oscillations in the aggregate outcomes and high levels of heterogeneity in individual behavior. Furthermore, it is not unusual to find significant deviations from aggregate Nash equilibrium predictions. In this paper, we employ an evolutionary model with boundedly rational agents to explain these findings. We use data from common property resource experiments (Casari and Plott, 2003). Instead of positing individual-specific utility functions, we model decision makers as selfish and identical. Agent interaction is simulated using an individual learning genetic algorithm (GA), where agents have constraints in their working memory, a limited ability to maximize, and experiment with new strategies. We show that the model replicates most of the patterns that can be found in common property resource experiments.
Knight-Ridder information's value adding name finder: a variation on the theme of FASTUS
Venue: Proceedings of the 6th conference on Message understanding (1995)

Knight-Ridder Information, Inc., participated in MUC-6 with VANF (Value Adding Name Finder), the system used by Knight-Ridder Information in production for adding a Company Names descriptor field to online newspaper and newswire databases. Knight-Ridder Information participated in the NE task only. The system used for MUC-6 is exactly the same as is used in production. The only difference is the input and output formats. VANF used a cascaded non-deterministic state machines approach and is based on FASTUS.
An In-Depth, Analytical Study of Sampling Techniques for Self-Similar Internet Traffic
Authors: Guanghui He, Jennifer C. Hou
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Techniques for sampling Internet traffic are very important to understand the traffic characteristics of the Internet [14, 8]. In spite of all the research efforts on packet sampling, none has taken into account of self-similarity of Internet traffic in devising sampling strategies. In this paper, we perform an in-depth, analytical study of three sampling techniques for self-similar Internet traffic, namely static systematic sampling, stratified random sampling and simple random sampling. We show that while all three sampling techniques can accurately capture the Hurst parameter (second order statistics) of Internet traffic, they fail to capture the mean (first order statistics) faithfully. We also show that static systematic sampling renders the smallest variation of sampling results in different instances of sampling (i.e., it gives sampling results of high fidelity). Based on an important observation, we then devise a new variation of static systematic sampling, called biased systematic sampling (BSS), that gives much more accurate estimates of the mean, while keeping the sampling overhead low. Both the analysis on the three sampling techniques and the evaluation of BSS are performed on synthetic and real Internet traffic traces. Our performance study shows that BSS gives a performance improvement of 40% and 20% (in terms of efficiency) as compared to static systematic and simple random sampling.
Nonparametric Subspace Analysis for Face Recognition
Authors: Zhifeng Li, Wei Liu, Dahua Lin, Xiaoou Tang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Linear discriminant analysis (LDA) is a popular face recognition technique. However, an inherent problem with this technique stems from the parametric nature of the scatter matrix, in which the sample distribution in each class is assumed to be normal distribution. So it tends to suffer in the case of non-normal distribution. In this paper a nonparametric scatter matrix is defined to replace the traditional parametric scatter matrix in order to overcome this problem. Two kinds of nonparametric subspace analysis (NSA): PNSA and NNSA are proposed for face recognition. The former is based on the principal space of intra-personal scatter matrix, while the latter is based on the null space. In addition, based on the complementary nature of PNSA and NNSA, we further develop a dual NSA-basedclassifier framework using Gabor images to further improve the recognition performance. Experiments achieve near perfect recognition accuracy (99.7%) on the XM2VTS database.
CRL/NMSU and Brandeis: description of the MucBruce system as used for MUC-4
Authors: Jim Cowie, Louise Guthrie, Yorick Wilks, James Pustejovsky, Scott Waterman
Venue: Proceedings of the 4th conference on Message understanding (1992)

Through their involvement in the Tipster project the Computing Research Laboratory at New Mexico State University and the Computer Science Department at Brandeis University are developing a method for identifying articles of interest and extracting and storing specific kinds of information from large volumes of Japanese and English texts. We intend that the method be general and extensible. The techniques involved are not explicitly tied to these two languages nor to a particular subject area. Development for Tipster has been going on since September, 1992.