ppxscal/embedding_network huggingface dataset:
Segmentation of Pulmonary Nodule Images Using Total Variation Minimization
Authors: Thomas F. Coleman, Yuying Li, Adrian Mariano
Venue:  (1998)

Total variation minimization has edge preserving and enhancing properties which make it suitable for image segmentation. We present Image Simplification, a new formulation and algo rithm for image segmentation. We illustrate the edge enhancing properties of total variation minimization in a discrete setting by giving exact solutions to the problem for piecewise constant functions in the presence of noise. In this case, edges can be exactly recovered if the noise is sufficiently small. After optimization, segmentation is completed using edge detection. We find that our image segmentation approach yields good results when applied to the segmentation of pulmonary nodules.
Visualization of Routes in Design Process Planning
Authors: Andres Melo
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Design process planning is essential for business success. However, it is complex for all but the simplest products. There is therefore a need for effective support for the design process planner to help them visualize and assess alternative design process strategies.This paper describes a new approach to design process planning, known as signposting, which has the potential to assist in the characterization, and hence planning, of a particular design process, by identifying a number of possible design routes.The success of signposting is critically dependent upon the planner's ability to visualize the emergent process characteristics. A number of route visualization techniques are therefore presented and discussed. The preferred approach is then developed further in an attempt to maximize its visualization potential. 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
HRM - A Hierarchical Simulator for Full-Chip Power Network Reliability Analysis
Authors: Han Young Koh
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents a novel hierarchical simulation method for analyzing the power network reliability. Instead of performing full-chip simulation at the transistor level, this method first simulates each top-level block in the design individually to derive macro-models of the blocks. For standard-cell blocks in the design, gate-level simulation is used to derive the switching profiles of all cells in the blocks. For full-custom blocks embedded in the design, transistor-level power network simulation is used. Based on the block-level simulation results, the simulated blocks are modeled as a set of current sources along with simplified but equivalent power network RCs. Top-level simulation is then performed based on the network consisting of the top-level power net RCs and the macro-models of the blocks. To macro-model the standard-cell blocks for power network analysis, this paper proposes a modeling technique to derive the power-network model which can accurately characterize the impact of the cell switching activity on the current and voltage of the entire power network. Experimental results on two industrial structured-custom-designs are presented. The results indicate that the proposed method, compared with an industrial power network simulator, significantly reduces the CPU runtime and memory requirement for power network simulation, with maintaining small discrepancies.
An Accurate Analysis of Reliability Parameters in Meshes with Fault-Tolerant Adaptive Routing
Authors: R. Alcover, V. Chirivella, J. Duato
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

The traditional approach to study fault-tolerance in multicomputer interconnection networks consists of determining the worst possible combination of faulty components that causes a network failure, and then assuming that this will occur. But the worst possible combination does not always occur, and the routing algorithm allows the network to work in the presence of a greater number of failures. The network reliability parameters computed according to the traditional approach will be underestimated. In this paper we use a new methodology to compute accurately the reliability and availability functions. The reliability parameters have been computed for a network with mesh topology, taking into account size, routing algorithm, failure and repair rates of the network channels and coverage.
Analysis of random polling system with an infinite number of coupled servers and correlated input process
Authors: Thomas Yew Sing Lee
Venue: Computers and Operations Research (2003)

We introduce a simple approach for modeling and analyzing a random polling system with infinite servers. We assume that the infinite number of servers is coupled together and they visit the queues as one processing unit. It is assumed that the customer arrival processes at all queues are correlated. Two classes of service disciplines, exhaustive and gated, are considered. We will derive several performance measures of the system. These performance measures include the mean cycle time and the expected delay observed by a customer. For the special case of M/D/∞ vacation queue, we also provide a new proof of a known result. The numerical results indicate that when the expected number of busy servers is high gated service produces mean waiting times less than those given by exhaustive service discipline. This result differs significantly from the known result for single server polling system and it is due to the assumption of coupled servers.
A model for virtual tree bandwidth allocation in ATM networks
Authors: A. S. Sethi
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The technique of virtual paths is used in ATM networks to perform bandwidth allocation for virtual circuits and to simplify setting up of virtual circuits in response to connection requests. The author describe a new technique called virtual trees that can be used for bandwidth allocation in ATM networks. A virtual tree corresponds to pre-allocated bandwidth along a set of links in the network that form a tree rooted at a source node and leading to various destinations. The use of virtual trees provides more flexibility to a source node in setting up a virtual circuit and results in smaller rejection probabilities for connection requests. virtual trees retain all the advantages of virtual paths but have a better performance potential. The authors present an optimization model for bandwidth allocation for virtual tree configurations and present the results of a simulation study comparing the performance of virtual trees with that of virtual paths.
Interaction Diagrams
Authors: Joachim Parrow
Venue:  (1993)

Interaction diagrams are graphic representations of concurrent processes with evolving access capabilities; in particular they illustrate the points of access and relations between them. The basic step of computation is the migration of an access point between processes. This paper explains interaction diagrams through a sequence of examples. Diagrams can be regarded as graphic counterparts of terms in the pi-calculus and illuminate some interesting points on its construction.
A Wearable Computer for Quality Assurance Inspectors in a Food Processing Plant
Authors: Lawrence J. Najjar, J. Christopher Thompson, Jennifer J. Ockerman
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

Our team developed a wearable computer and a special application for quality assurance inspectors in a food processing plant. The computer includes a hard drive, head-mounted display, microphone, earphone, and batteries. The software includes applications for quality assurance data collection, voice recognition, wireless network, auditory feedback, and Windows 95. The application allows inspectors to select a form, complete the form, and send the data to the plant manager's computer. The system allows mobile workers to use their voices, rather than their hands, to enter data from anywhere in the plant.
The Effectiveness and Efficiency of Agglomerative Hierarchic Clustering in Document Retrieval
Authors: Ellen M. Voorhees
Venue:  (1985)

NOT SUPPLIED
The Yin/Yang Web: A Unified Model for XML Syntax and RDF Semantics
Authors: Peter F. Patel-Schneider, Jerome Simeon
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

XML is the W3C standard document format for writing and exchanging information on the Web. RDF is the W3C standard model for describing the semantics and reasoning about information on the Web. Unfortunately, RDF and XML—although very close to each other—are based on two different paradigms. We argue that, in order to lead the Semantic Web to its full potential, the syntax and the semantics of information need to work together. To this end, we develop a model theory for the XML XQuery 1.0 and XPath 2.0 Data Model, which provides a unified model for both XML and RDF. This unified model can serve as the basis for Web applications that deal with both data and semantics. We illustrate the use of this model on a concrete information integration scenario. Our approach enables each side of the fence to benefit from the other, notably, we show how the RDF world can take advantage of XML Schema description and XML query languages, and how the XML world can take advantage of the reasoning capabilities available for RDF. Our approach can also serve as a foundation for the next layer of the Semantic Web, the ontology layer, and we present a layering of an ontology language on top of our approach.
A scalability analysis of classifiers in text categorization
Authors: Yiming Yang, Jian Zhang, Bryan Kisiel
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Real-world applications of text categorization often require a system to deal with tens of thousands of categories defined over a large taxonomy. This paper addresses the problem with respect to a set of popular algorithms in text categorization, including Support Vector Machines, k-nearest neighbor, ridge regression, linear least square fit and logistic regression. By providing a formal analysis of the computational complexity of each classification method, followed by an investigation on the usage of different classifiers in a hierarchical setting of categorization, we show how the scalability of a method depends on the topology of the hierarchy and the category distributions. In addition, we are able to obtain tight bounds for the complexities by using the power law to approximate category distributions over a hierarchy. Experiments with kNN and SVM classifiers on the OHSUMED corpus are reported on, as concrete examples.
Database support for conflict detection in a computer-supported cooperative work environment
Authors: D. R. Schwartz
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Computer supported cooperative work (CSCW) requires the simultaneous consideration of a huge diversity of issues regarding a given object under design. Successful support for CSCW requires a conceptually integrated environment that can address this diversity of issues and assist with the detection and resolution of conflicts among design constraints and decisions. The Automated Constraint Refinement and Assessment Tool (AutoCRAT) is a generic tool for the top down refinement and bottom up validation of design constraints. AutoCRAT supports the diversity of issues that arise in a CSCW environment because constraints can address any aspect of the product under design and because constraints can be expressed in any language, including natural language. The focus of the paper is on the structuring facility of AutoCRAT that supports a user defined organizational structure for constraints. This structure allows constraints to be flagged, annotated, browsed and queried.
Improving efficiency: conducting walkthroughs remotely
Authors: Gaby Wenneker, Michael Hatscher
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Find out about a walkthrough technique that saves time and money by facilitating the remote evaluation of early prototypes. Provides rich insights into mismatches between users' expectatins and needs, and interaction design.
The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits
Authors: Thomas Thierauf
Venue:  (1998)

We investigate the computational complexity of the isomorphism problem for read-once branching programs (1-BPI): upon input of two read-once branching programs B_0 and B_1, decide whether there exists a permutation of the variables of B_1 such that it becomes equivalent to B_0. Our main result is that 1-BPI cannot be NP-hard unless the polynomial hierarchy collapses. The result is extended to the isomorphism problem for arithmetic circuits over large enough fields. We use the known arithmetization of read-once branching programs and arithmetic circuits into multivariate polynomials over the rationals. Hence, another way of stating our result is: the isomorphism problem for multivariate polynomials over large enough fields is not NP-hard unless the polynomial hierarchy collapses. We derive this result by providing a two-round interactive proof for the nonisomorphism problem for multivariate polynomials. The protocol is based on the Schwartz-Zippel theorem for probabilistically checking polynomial identities. Finally, we show that there is a perfect zero-knowledge interactive proof for the isomorphism problem for multivariate polynomials.
Dynamic Scheduling for Soft Real-Time Distributed Object Systems
Authors: V. Kalogeraki, P. M. Melliar-Smith, L. E. Moser
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Distributed real-time applications require flexible and dynamic scheduling mechanisms to provide timeliness guarantees to application objects. In this paper we present a new scheduling algorithm that exploits the task laxities and the object importance to make effective scheduling decisions.The algorithm uses current timing and resource measurements to determine the feasibility of the tasks and to distribute the objects to the processors. A task's timing parameter (laxity value) is carried, from one processor to another, with the object invocations, yielding a system-wide scheduling strategy that requires only local computations. The algorithm aims to ensure that a low importance object does not delay the execution of a high importance task.
Finding Cuts in the TSP (A preliminary report)
Authors: D. Applegate, R. Bixby, V. Chvatal, B. Cook
Venue:  (1995)

TSPLIB is Gerhard Reinelt''s library of some hundred instances of the traveling salesman problem. Some of these instances arise from drilling holes in printed circuit boards; others arise from X-ray crystallography; yet others have been constructed artificially. None of them (with a single exception) is contrived to be hard and none of them is contrived to be easy; their sizes range from 17 to 85,900 cities; some of them have been solved and others have not. We have solved twenty previously unsolved problems from the TSPLIB. One of them is the problem with 225 cities that was contrived to be hard; the sizes of the remaining nineteen range from 1,000 to 7,397 cities. Like all the successful computer programs for solving the TSP, our computer program follows the scheme designed by George Dantzig, Ray Fulkerson, and Selmer Johnson in the early nineteen-fifties. The purpose of this preliminary report is to describe *some* of our innovations in implementing the Dantzig-Fulkerson-Johnson scheme; we are planning to write up a more comprehensive account of our work soon.
Retrieval and novelty detection at the sentence level
Authors: James Allan, Courtney Wade, Alvaro Bolivar
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Previous research in novelty detection has focused on the task of finding novel material, given a set or stream of documents on a certain topic. This study investigates the more difficult two-part task defined by the TREC 2002 novelty track: given a topic and a group of documents relevant to that topic, 1) find the relevant sentences from the documents, and 2) find the novel sentences from the collection of relevant sentences. Our research shows that the former step appears to be the more difficult part of this task, and that the performance of novelty measures is very sensitive to the presence of non-relevant sentences.
Perfect Sequences for Belief Networks Representation
Authors: Radim Jiroušek, Jirina Vejnarová
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In contrast to most other approaches used to represent multidimensional probability distributions, which are based on graphical Markov modelling (i.e. dependence structure of distributions is represented by graphs), the described method is rather procedural. Here, we describe a process by which a multidimensional distribution can be composed from a "generating sequence" - a sequence of low-dimensional distributions. The main advantage of this approach is that the same apparatus based on operators of composition can be applied for description of both probabilistic and possibilistic models.
A thin near hexagon with 50 points
Authors: Rieuwert Blok, Bart De Bruyn, Ulrich Meierfankenfeld
Venue: Journal of Combinatorial Theory Series A (2003)

We show the existence and uniqueness of a thin near hexagon which has 50 points and an affine plane of order 3 as a local space.
Experience with Techniques for Refining Data Race Detection
Authors: Robert H. B. Netzer, Barton P. Miller
Venue:  (1992)

Dynamic data race detection is a critical part of debugging shared-memory parallel programs. The races that can be detected must be refined to filter out false alarms and pinpoint only those that are direct manifestations of bugs. Most race-detection methods can report false alarms because of imprecise run-time information and because some races are caused by others. To overcome this problem, race refinement uses whatever run-time information is available to speculate on which of the detected races should be reported. In this paper we report on experimental tests of two refinement techniques previously developed by us. Our goal was to determine whether good refinement is possible, and how much run-time information is required. We analyzed two sets of programs, one set written by others (which they had tested and believed to be race-free but which in fact had subtle races) and another set written by us (in which we introduced more complex races). We performed race detection and refinement on executions of these programs, and recorded both the global event ordering and an approximate ordering recorded without a global clock. We found that in all the programs written by others, accurate refinement was possible even without the global ordering. In the other programs, accurate refinement was also possible but required the global ordering. These results suggest that our techniques refine races accurately and lead a programmer directly to race-causing bugs. They also suggest that race-detection methods should record only enough information necessary for good refinement (either global or approximate event orderings), and this information depends on the severity of the races being debugged.
IP for 3G: Networking Technologies for Mobile Communications
Authors: Dave Wisely, Louise Burness, Philip Eardley
Venue:  (2002)

:Third Generation (3G) mobile offers access to broadband multimedia services -- and in the future most of these, even voice and video, will be IP-based. However 3G networks are not based on IP technologies, rather they are an evolution from existing 2G networks. Much work needs to be done to IP QoS and mobility protocols and architectures for them to be able to provide the functionality 3G requires.
Small Pieces Loosely Joined: A Unified Theory of the Web
Authors: David Weinberger
Venue:  (2003)

:The Web doesn't exist in space, yet we talk about going to sites, entering them, and leaving. Diaries move online and suddenly they're more about creating selves than writing about them. Web sites don't have fences, yet a site for auction hunters was found to have trespassed on eBay, a metaphorical offense for which it paid a very real price. Companies invest heavily in professional, polished Web sites, but the Web rewards sites that revel in imperfection. Bits are the "atoms" of the Web, but they have no weight, no size and no real existence. These anomalies are just a few that show how uncomfortable the fit between the Web and the real world is -- and how deeply weird the ordinary life of the Web is. In this one-of-a-kind book of social commentary, David Weinberger takes us beyond the hype, revealing what is truly revolutionary about this new medium. Just as Marshall McLuhan forever altered our view of broadcast media, Weinberger shows that the Web is transforming not only social institutions but also bedrock concepts of our world such as space, time, self, knowledge -- even reality itself. The Web would be important enough if it hooked up our species on a global scale. But, Weinberger argues, it is doing much more than that. Unlike previous technologies such as the phone or fax, the Web is a permanent public space that gathers value every time someone posts a Web page, responds on a discussion board, or replies to a mail list. More and more of our lives together are being lived in this new, second world that intersects the real world in ways we have only begun to understand. Weinberger introduces us to the denizens of this second world, people like Zannah, whose online diary turns self-revelation into play; Tim Bray, whose map of the Web reveals what's at the heart of the new Web space; and Danny Yee and Claudiu Popa, part of the new breed of Web experts we trust despite their lack of obvious qualifications. Through these stories of life on the Web, an insightful take on some familiar -- and some unfamiliar -- Web sites, and a pervasive sense of humor, Weinberger is the first to put the Web into the social and intellectual context we need to begin assessing its true impact on our lives. The irony, according to Weinberger, is that this seemingly weird new technology is more in tune with our authentic selves than is the modern world. Because the Web foils our conventional assumptions about concepts like space and time and self, we are led back to a more authentic view of what it means to be a person sharing a world with others -- whether it's the world of the Web or the real world of atoms. Our experience on the Web enables us to recapture the truth of our experience of the real world. Funny, provocative, and ultimately hopeful, Small Pieces Loosely Joined makes us look at the Web as never before.
Parallelization via Context Preservatio
Authors: Wei-Ngan Chin, Akihiko Takano, Zhenjiang Hu
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Program schemes, such as scan or homomorphism, can capture a wide range of data parallel programs. While versatile, these schemes are of limited practical use on their own. A key problem is that the more natural sequential specifications may not have associative combine operators required by these schemes. As a result, they often fail to be immediately identified. To resolve this problem, we propose a method to systematically derive parallel programs from sequential definitions. This method is special in that it can automatically invent auxiliary functions needed by associative combine operators. Apart from a formalisation, we also provide new theorems, based on the notion of context preservation, to guarantee parallelization for a precise class of sequential programs.