ppxscal/embedding_network huggingface dataset:
Role-related library use by local union officials: Book Reviews
Authors: Margaret A. Chaplan, Edward J. Hertenstein
Venue: Journal of the American Society for Information Science and Technology (2005)

A questionnaire was distributed to local union officials in Illinois in order to determine the officials' use of various types of libraries, their satisfaction with their experience in using the libraries, the problems they encountered in library use, and their opinion of various ways in which libraries might be made more useful to them. They were also asked whether they had had training in how to find information. Respondents to the survey used more than one type of library, and their union role had an impact on which type they were likely to use. They used different types of libraries to find different types of information. In general they were satisfied with their library experience, but they found library collections inadequate for their needs. Respondents who had had training in how to find information appeared to use libraries more but differed little in the frequency or types of problems encountered from those who had no training. When asked their opinion on various suggestions for improving library service to local union officials, they preferred measures that gave greater emphasis to increasing labor materials in library collections. The findings of this study, combined with those of our earlier study (Chaplan & Hertenstein, 2002), suggest that an information seeking model developed by Wilkinson (2001) may be useful in explaining union officials' information seeking behavior. &copy; 2005 Wiley Periodicals, Inc.
Advanced technology for streamlining the creation of ePortfolio resources and dynamically-indexing digital library assets: a case study from the digital chemistry project
Authors: Alex Cuthbert, Mark Kubinec, David O. Tanis, Fan Ieong, Lois Wei, David Schlossberg
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The goal of the Digital Chemistry Project at UC Berkeley is to create a model for how technology can be used to (a) introduce interactivity into large lecture classes, (b) offer customized, web-based learning materials to students outside of the classroom, and (c) provide immediate feedback on students' understanding of targeted instructional concepts. Two products, PRISM and LOTIS, and their interrelated design processes are described in this paper. PRISM (Presentation and Interaction with Streaming media) automates the creation of online learning materials by integrating streaming digital video, wireless concept testing, an annotation system, and face-to-face peer interaction. LOTIS (the Learning Object Tagging and Information System) catalogues and packages instructional resources using a combination of intelligent agents and customized metadata templates. The result is a model for dynamic content creation that lays the foundation for design improvements based on students' access to and interaction with instructional materials.
Morphology on Label Images: Flat-Type Operators and Connections
Authors: Christian Ronse, Vincent Agnus
Venue: Journal of Mathematical Imaging and Vision (2005)

We consider morphological operations on images whose pixel values are considered as labels without ordering between them, except for a least element ¿ (meaning no label) and a greatest element ¿(Meaning conflicting labels). Flat dilations and erosions can be defined as in usual grey-level morphology. Since the lattice of label images is not distributive, non-flat operators can be obtained by combination of flat ones. Given any connectivity on sets, there is a connection on label images for which the connected components of an image correspond precisely to its flat zones with their labels attached. Some specific applications of label morphology are given.In the sequel of this paper [20], we will examine geodesic dilations and reconstructions on label images, and show how this variant of mathematical morphology can be applied to the segmentation of moving objects in video sequences [2, 3].
Creating an Integrated Health Care System in Greece: A Primary Care Perspective
Authors: K. Souliotis, C. Lionis
Venue: Journal of Medical Systems (2005)

Over the past few years Greece has undergone several endeavors, aimed at modernizing and improving the national health care services. A Health Care Reform Act seeking quality improvement and coordination of outpatient and hospital services at the Regional level, through the enhancement of primary care, has been recently approved. This paper reports a proposal for integrated health system in the primary care system in Greece with a major focus on equity, quality, and outcomes. The equity and quality framework of this proposal will possess the main components focusing on the provision of essential services, and clinical and organizational standards.
A progress report on speech understanding at SRI
Authors: Don Walker
Venue: Issue 36 (October 1972) (1972)

SRI is one of a number of organizations engaged in a major program of research on the analysis of continuous speech by computer (cf. Newell et al., 1971). The goal is the development of a speech understanding system capable of engaging a human operator in a natural conversation about a specific problem domain. The SRI project involves the actions of a simulated robot manipulating blocks in a simulated three-dimensional environment. A person speaking to the computer will be able to ask questions about this environment, to give commands that will modify it, and to add information to augment its structure. The procedures being developed to provide these capabilities integrate pragmatic, semantic, syntactic, lexical, phonological, phonetic, and acoustic analyses.
On 3-monotone approximation by piecewise polynomials
Authors: D. Leviatan, A. V. Prymak
Venue: Journal of Approximation Theory (2005)

We consider 3-monotone approximation by piecewise polynomials with prescribed knots. A general theorem is proved, which reduces the problem of 3-monotone uniform approximation of a 3-monotone function, to convex local L1 approximation of the derivative of the function. As the corollary we obtain Jackson-type estimates on the degree of 3-monotone approximation by piecewise polynomials with prescribed knots. Such estimates are well known for monotone and convex approximation, and to the contrary, they in general are not valid for higher orders of monotonicity. Also we show that any convex piecewise polynomial can be modified to be, in addition, interpolatory, while still preserving the degree of the uniform approximation. Alternatively, we show that we may smooth the approximating piecewise polynomials to be twice continuously differentiable, while still being 3-monotone and still keeping the same degree of approximation.
Knowledge nebula crystallizer for time-based information
Authors: Shigeki Amitani, Ernest Edmonds
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In this paper, we are going to describe a system for managing and authoring time-based information artefact, as an implementation of Knowledge Nebula Crystallizer [9]. The design rationale of the system and its implementation are described.
Bootstrapping Semantic Annotation for Content-Rich HTML Documents
Authors: Saikat Mukherjee, I. V. Ramakrishnan, Amarjeet Singh
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Enormous amount of semantic data is still being encoded in HTML documents. Identifying and annotating the semantic concepts implicit in such documents makes them directly amenable for Semantic Web processing. In this paper we describe a highly automated technique for annotating HTML documents, especially template-based content-rich documents, containing many different semantic concepts per document. Starting with a (small) seed of hand-labeled instances of semantic concepts in a set of HTML documents we bootstrap an annotation process that automatically identifies unlabeled concept instances present in other documents. The bootstrapping technique exploits the observation that semantically related items in content-rich documents exhibit consistency in presentation style and spatial locality to learn a statistical model for accurately identifying different semantic concepts in HTML documents drawn from a variety ofWeb sources. We also present experimental results on the effectiveness of the technique.
Improving Energy-Efficiency by Bypassing Trivial Computations
Authors: Ehsan Atoofian, Amirali Baniasadi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 11 - Volume 12 (2005)

We study the energy efficiency benefits of bypassing trivial computations in high-performance processors. Trivial computations are those computations whose output can be determined without performing the computation. We show that bypassing trivial instructions reduces energy consumption while improving performance. Our study shows that by bypassing trivial instructions and for the subset of SPEC'2K benchmarks studied here, on average, it is possible to improve energy and energy-delay by up to 4.5% and 11.8% over a conventional processor.
Enhancing Focused Crawling with Genetic Algorithms
Authors: Milad Shokouhi, Pirooz Chubak, Zaynab Raeesy
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Web crawlers are one of the most crucial components in search engines and their optimization would have a great effect on improving the searching efficiency. In this paper, we introduce an intelligent crawler called Gcrawler that uses a genetic algorithm for improving its crawling performance. Gcrawler estimates the best path for crawling on one hand and expands its initial keywords by using a genetic algorithm during the crawling on the other hand. This is the first crawler that acts intelligently without any relevance feedback or training. All the processes are online and there is no need for direct interaction with the users.
Elsewhere
Authors: David Clark
Venue: IEEE Internet Computing (2004)

Review of Internet stories in Computer Society and trade press. 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
Plug-and-play application platform: towards mobile peer-to-peer
Authors: Erkki Harjula, Mika Ylianttila, Jussi Ala-Kurikka, Jukka Riekki, Jaakko Sauvola
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

While peer-to-peer (P2P) has emerged as a new hot communication concept among the Internet users, mobile usage of P2P applications is still taking its first steps. This article first elaborates the evolutionary process that P2P architectures are going through. Challenges and requirements for mobile P2P are then identified, followed by a definition of a novel Plug-and-Play Application Platform (PnPAP). This platform enables dynamic selections between diverse P2P and session management protocols while preserving the best available network connectivity through Holistic Connectivity (HCon) management. On-the-fly reconfiguration and run-time parameter optimization can be done with a lightweight interpretable state machine. The concept enables flexible and seamless communications for mobile devices in P2P networks.
Computing the first Betti number and the connected components of semi-algebraic sets
Authors: Saugata Basu, Richard Pollack, Marie-Françoise Roy
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi-algebraic descriptions of the semi-algebraically connected components of any given real algebraic or semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincaré characteristic, were known before. No singly exponential algorithm was known for computing any of the individual Betti numbers other than the zero-th one.
Ranking systems: the PageRank axioms
Authors: Alon Altman, Moshe Tennenholtz
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and the exact rationale of page ranking algorithms we suggest the axiomatic approach taken in the formal theory of social choice. In this paper we deal with PageRank, the most famous page ranking algorithm. We present a set of simple (graph-theoretic, ordinal) axioms that are satisfied by PageRank, and moreover any page ranking algorithm that does satisfy them must coincide with PageRank. This is the first representation theorem of that kind, bridging the gap between page ranking algorithms and the mathematical theory of social choice.
Multi-objective optimization of structures topology by genetic algorithms
Authors: J. F. Aguilar Madeira, H. Rodrigues, Heitor Pina
Venue: Advances in Engineering Software (2005)

This work develops a computational model for topology optimization of linear elastic structures for situations where more than one objective function is required, each one of them with a different optimal solution.The method is thus developed for multi-objective optimization problems and is based on Genetic Algorithms. Its purpose is to evolve an evenly distributed group of solutions (population) to obtain the optimum Pareto set for the given problem.To reduce computational effort, optimal solutions of each of the single-objective problems are introduced in the initial population.Two numerical examples are presented and discussed to assess the method.
Current driven dimensionality reduction at block level in the design of an efficient classifier for spatial multi spectral images
Authors: Lalitha Rangarajan, P. Nagabhushan
Venue: Pattern Recognition Letters (2004)

In case of spatial multi spectral images, such as remotely sensed earth cover, there could be many classes in one entire frame covering a large spatial stretch, because of which meaningful dimensionality reduction cannot perhaps be realizable without trading off with the quality of classification. However most often one would encounter in such images, presence of only a few classes in a small neighborhood, which would enable to devise a very effective dimensionality reduction around that small neighborhood identified as a block. Based on this theme a new method for dimensionality reduction is proposed in this paper.The method proposed divides the image into uniform non-overlapping windows/blocks. The few features that are essential in discriminating classes in a window are identified. Clustering is performed independently on each of the blocks with the reduced set of features. These clusters in the blocks are later merged to obtain an overall classification of the entire image. The efficacy of the method is corroborated experimentally.
Using MPI with C&num; and the Common Language Infrastructure: Research Articles
Authors: Jeremiah Willcock, Andrew Lumsdaine, Arch Robison
Venue: Concurrency and Computation: Practice Experience (2005)

We describe two different libraries for using the Message Passing Interface (MPI) with the C&num; programming language and the Common Language Infrastructure (CLI). The first library provides C&num; bindings that closely match the original MPI library specification. The second library presents a fully object-oriented interface to MPI and exploits modern language features of C&num;. The interfaces described here use the P&sol;Invoke feature of the CLI to dispatch to a native implementation of MPI, such as LAM&sol;MPI or MPICH. Performance results using the Shared Source CLI demonstrate only a small performance overhead. Copyright &copy; 2005 John Wiley & Sons, Ltd.
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
Authors: Adam Silberstein, Hao He, Ke Yi, Jun Yang
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment join and twig matching. While labeling for static XML documents is well understood, less is known about how to maintain accurate labeling for dynamic XML documents, when elements and subtrees are inserted and deleted. Most existing approaches do not work well for arbitrary update patterns; they either produce unacceptably long labels or incur enormous relabeling costs. We present two novel I/O-efficient data structures, W-BOX and B-BOX, thatefficiently maintain labeling for large, dynamic XML documents. We show analytically and experimentally that both, despite consuming minimal amounts of storage, gracefully handle arbitrary update patterns without sacrificing lookupefficiency. The two structures together provide a nice tradeoff between update and lookup costs: W-BOX has logarithmic amortized update cost and constant worst-case lookup cost, while B-BOX has constant amortized update cost and logarithmic worst-case lookup cost. We further propose techniques to eliminate the lookup cost for read-heavy workloads.
Software performance testing using covering arrays: efficient screening designs with categorical factors
Authors: Dean S. Hoskins, Charles J. Colbourn, Douglas C. Montgomery
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Classical Design of Experiment (DOE) techniques have been in use for many years to aid in the performance testing of systems. In particular fractional factorial designs have been used in cases with many numerical factors to reduce the number of experimental runs necessary. For experiments involving categorical factors, this is not the case; experimenters regularly resort to exhaustive (full factorial) experiments. Recently, D-optimal designs have been used to reduce numbers of tests for experiments involving categorical factors because of their flexibility, but not necessarily because they can closely approximate full factorial results. In commonly used statistical packages, the only generic alternative for reduced experiments involving categorical factors is afforded by optimal designs. The extent to which D-optimal designs succeed in estimating exhaustive results has not been evaluated, and it is natural to determine this. An alternative design based on covering arrays may offer a better approximation of full factorial data. Covering arrays are used in software testing for accurate coverage of interactions, while D-optimal and factorial designs measure the amount of interaction. Initial work involved exhaustive generation of designs in order to compare covering arrays and D-optimal designs in approximating full factorial designs. In that setting, covering arrays provided better approximations of full factorial analysis, while ensuring coverage of all small interactions. Here we examine commercially viable covering array and D-optimal design generators to compare designs. Commercial covering array generators, while not as good as exhaustively generated designs, remain competitive with D-optimal design generators.
Detecting Pedestrians Using Patterns of Motion and Appearance
Authors: Paul Viola, Michael J. Jones, Daniel Snow
Venue: International Journal of Computer Vision (2005)

This paper describes a pedestrian detection system that integrates image intensity information with motion information. We use a detection style algorithm that scans a detector over two consecutive frames of a video sequence. The detector is trained (using AdaBoost) to take advantage of both motion and appearance information to detect a walking person. Past approaches have built detectors based on motion information or detectors based on appearance information, but ours is the first to combine both sources of information in a single detector. The implementation described runs at about 4 frames/second, detects pedestrians at very small scales (as small as 20 × 15 pixels), and has a very low false positive rate.Our approach builds on the detection work of Viola and Jones. Novel contributions of this paper include: (i) development of a representation of image motion which is extremely efficient, and (ii) implementation of a state of the art pedestrian detection system which operates on low resolution images under difficult conditions (such as rain and snow).
Patching the Enterprise
Authors: George Brandman
Venue: Queue (2005)

Organizations of all sizes are spending considerable efforts on getting patch management right--their businesses depend on it. Software patch management has grown to be a business-critical issue - from both a risk and a financial management perspective. According to a recent Aberdeen Group study, corporations spent more than $2 billion in 2002 on patch management for operating systems. Gartner research further notes the cost of operating a well-managed PC was approximately $2,000 less annually than that of an unmanaged PC. You might think that with critical mass and more sophisticated tools, the management cost per endpoint in large organizations would be lower, though in reality this may not be the case. The objective of this article is to provide some rationale - drawn from enterprise experience - to put these observations into context and present some approaches that could be useful to combat that trend.
A robust system for accurate real-time summaries of internet traffic
Authors: Ken Keys, David Moore, Cristian Estan
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Good performance under extreme workloads and isolation between the resource consumption of concurrent jobs are perennial design goals of computer systems ranging from multitasking servers to network routers. In this paper we present a specialized system that computes multiple summaries of IP traffic in real time and achieves robustness and isolation between tasks in a novel way: by automatically adapting the parameters of the summarization algorithms. In traditional systems, anomalous network behavior such as denial of service attacks or worms can overwhelm the memory or CPU, making the system produce meaningless results exactly when measurement is needed most. In contrast, our measurement system reacts by gracefully degrading the accuracy of the affected summaries.The types of summaries we compute are widely used by network administrators monitoring the workloads of their networks: the ports sending the most traffic, the IP addresses sending or receiving the most traffic or opening the most connections, etc. We evaluate and compare many existing algorithmic solutions for computing these summaries, as well as two new solutions we propose here: "flow sample and hold" and "Bloom filter tuple set counting". Compared to previous solutions, these new solutions offer better memory versus accuracy tradeoffs and have more predictable resource consumption. Finally, we evaluate the actual implementation of a complete system that combines the best of these algorithms.