ppxscal/embedding_network huggingface dataset:
Scene-adaptive switching of segmentation methods for object-based video encoding
Authors: Toshihiko Misu, Hajime Sonehara, Wentao Zheng, Masahide Naemura, Yasuaki Kanatsugu, Yoshinori Izumi, Yutaka Tanaka
Venue: Systems and Computers in Japan (2004)

In order to create efficient object-based video encoding, the authors have proposed a scene-adaptive region segmentation method that can work with a variety of different types of scenes. In their method, encoding efficiency is improved by adaptively selecting for each frame the optimal method from among several different region segmentation methods determined using Bayesian decision-making based on the video features of a scene. In this paper, the authors describe the Bayesian decision and training methods, and then formalize the image features and the different region segmentation methods. Finally, the authors demonstrate the validity of the proposed approach through experiments. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 31&ndash;44, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10593
Book Reviews
Authors: Bob O'Malley
Venue: SIAM Review (2005)

This issue's Book Reviews section begins the new year on a positive note. Reviewers generally liked the broad variety of books under consideration, in contrast to the recent situation when certain books haven't fared so well. Some authors have, indeed, asked to write rebuttals, but we prefer to urge readers to see for themselves whether our well-picked reviewers made the right call. Overall, they do an admirable job and we appreciate their opinions. This issue's featured review by Ron Guenther and Enrique Thomann is about two new and different books on partial differential equations, a subject at the heart of applied mathematics. Other titles range from Everything and More} to When Least Is Best, in addition to the usual more technical selections! Among the boxes of books showing up in my office are now shipments combining publications of Springer, Birkhauser, and Kluwer. Authors and readers are urged to consider whether the ongoing consolidation of technical publishing is advantageous. The alternatives provided by the Web don't seem to be adequately marketed to either book reviewers or potential users.
A generalization of an inequality of Brouwer-Wilbrink
Authors: Akira Hiraki, Jack Koolen
Venue: Journal of Combinatorial Theory Series A (2005)

Brouwer and Wilbrink showed that t + 1 ≤ (s2 + 1)cd-1 holds for a regular near 2d-gon of order (s, t) with s ≥ 2 and where the diameter d is even.In this note we generalize their inequality to all diameter.
Studying the queue length in a single-server queuing system with unreliable server
Authors: I. S. Mikadze, V. V. Khocholava
Venue: Automation and Remote Control (2005)

The unreliable queuing system was studied in both the nonstationary and stationary modes. It was assumed that a Poisson flow of customers arrives to the system; the times of customer servicing and restoration of the server (servicing system) are random variables with arbitrary distributions; the flow of stable failures makes up the restoration process; the interfailure intervals are distributed hyperexponentially; and the waiting and sojourn times as well as the queue length are not limited.
Elimination of Java array bounds checks in the presence of indirection: Research Articles
Authors: Mikel Luján, John R. Gurd, T. L. Freeman, José Miguel
Venue: Concurrency and Computation: Practice Experience (2005)

The Java language specification states that every access to an array needs to be within the bounds of that array, i.e. between 0 and array length - 1. Different techniques for different programming languages have been proposed to eliminate explicit bounds checks. Some of these techniques are implemented in off-the-shelf Java Virtual Machines (JVMs). The underlying principle of these techniques is that bounds checks can be removed when a JVM&sol;compiler has enough information to guarantee that a sequence of accesses (e.g. inside a for-loop) is safe (within the bounds). Most of the techniques for the elimination of array bounds checks have been developed for programming languages that do not support multi-threading and&sol;or enable dynamic class loading. These two characteristics make most of these techniques unsuitable for Java. Techniques developed specifically for Java have not addressed the elimination of array bounds checks in the presence of indirection; that is, when the index is stored in another array (indirection array). With the objective of optimizing applications with array indirection, this paper proposes and evaluates three implementation strategies, each implemented as a Java class. The classes provide the functionality of Java arrays of type <mono>int</mono> so that objects of the classes can be used instead of indirection arrays. Each strategy enables JVMs, when examining only one of these classes at a time, to obtain enough information to remove array bounds checks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The Sentient Web
Authors: Michael N. Huhns
Venue: IEEE Internet Computing (2003)

The Web has a huge memory capacity and onlinemcomputational ability, and resources are not a limiting factor ý but how likely is it? What is the future possibility for some form of sentience, and what is the current sentient capability of the Web and Web technology?
The compositional approach to sequential consistency and lazy caching
Authors: Wil Janssen, Mannes Poel, Job Zwiers
Venue: Distributed Computing (1999)

The lazy caching protocol proposed by Afek, Brown and Merritt [ABM93], is explained and formally proven correct by means of compositional methods. The protocol is decomposed into four simple protocols, which are of interest on their own. A top level proof is given that is to a large extent independent of the particular model used for the more detailed proofs and allows for a number of generalizations of the original lazy caching protocol. Detailed proofs of safety and liveness properties are given using CSP and trace logic.
Confronting the design and acceptance of electronic intermediaries: a case study in the maritime sector
Authors: Erwin Fielt, Wil Janssen, Edward Faber, René Wagenaar
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Electronic business offers opportunities and threats for the firms in business networks, triggering established and new intermediaries to introduce their own electronic business initiatives. Despite their potential, successful designs of electronic intermediaries leading to acceptance by buyers and sellers are intricate and not well understood. The design of an electronic intermediary involves careful balancing of the interests of actors within a vertical business network.In this paper we analyze the design of an electronic intermediary in the maritime sector, and how this design relates to the voluntary acceptance of the intermediary by buyers and sellers. We discuss design choices and expected interests for all actors from the perspective of the intermediary. Acceptance approaches the electronic intermediary from the perspectives of buyers and sellers.The case study shows design choices for a limited role with restricted transparency and little novelty. These choices come mostly with positive expectations of the intermediary for buyers, sellers, and itself. Acceptance results confirm these expectations. Buyers and sellers are moderately positive and satisfied. However, there is the danger that the design has too little added value to convince users, especially buyers.
Physical design tools for hierarchy
Authors: Paul Villarrubia
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

There are a number of factors that motivate the use of hierarchical physical design approaches for ASIC and mircroprocessor designs. While microprocessor designs have traditionally been done using hierarchy, the trend in ASIC designs is more recent. The growing use of hierarchy presents new challenges to the design automation community. Tools and algorithms that are designed to work well on flat chips certainly can be applied to individual partitions of a hierarchical design. This works well for some tasks, but there are a host of new problems introduced by hierarchy boundaries that are not addressed by such an approach. This talk will focus on some of the new and interesting physical design automation tasks, with an emphasis on the placement and timing closure aspects of the hierarchy problem.
Camera Calibration and Light Source Estimation from Images with Shadows
Authors: Xiaochun Cao, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we describe how camera parameters and light source orientation can be recovered from two perspective views of a scene given only two vertical lines and their cast shadows. Compared to the traditional calibration methods that involve images of some precisely machined calibration pattern, our method uses new calibration objects: the vertical objects and their parallel shadow lines, which are common in natural environments. In addition to the benefit of increasing accessibility of the calibration objects, the proposed method is also especially useful in cases where only limited information is available. To demonstrate the accuracy and the applications of the proposed algorithm, we present results on both synthetic and real images.
QueryLines: approximate query for visual browsing
Authors: Kathy Ryall, Neal Lesh, Tom Lanning, Darren Leigh, Hiroaki Miyashita, Shigeru Makino
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by defining QueryLines: soft constraints and preferences for selecting and sorting a subset of the data. By using both preferences and soft constraints for query composition, we allow greater flexibility and expressiveness than previous visual query systems. When the user over-constrains a query, for example, a system using approximate techniques can display "near misses" to enable users to quickly and continuously refine queries.
Holistic Quota Management: The Natural Path to a Better, More Efficient Quota System
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Disk quota systems exist to protect a limited resource and ensure that users can share it. However, existing quota management systems concentrate on controlling user privileges, rather than protecting resources. This paper suggests a new management model based upon a holistic view of resources and their controls. By acting upon a resource globally rather than upon individual users, the new approach exposes trends, allows for better resource planning, and allows for easy understanding of the impact of changes on a user's ability to accomplish work. A new tool 'Qualm' is the first component of a new system for dynamic resource management that allows for decisions based not upon fixed limits for resource usage, but upon limits that change with usage patterns and demand.
The nag library "machine"
Authors: Brian Ford, Janet Bentley
Venue: ACM SIGNUM Newsletter (1977)

Since its inception the Numerical Algorithms Group (NAG) Project has pursued four aims:(i) To create a balanced, general purpose numerical algorithms library to meet the mathematical and statistical requirements of computer users.(ii) To support the Library with documentation giving advice on problem identification and algorithm selection, and on the use of each routine.(iii) To provide a test program library for certification of the Library.(iv) To implement the Library as widely as user demand required.
GDOC: a tool for computer aided design of data base applications
Authors: Fabrizio Massimo Ferrara, Carlo Batini
Venue: ACM SIGDA Newsletter (1984)

Release 2.0 of GDOC, a tool for computer aided design of data base applications, is described.GDOC allows interactive specification of the conceptual schema of the application, expressed in an enriched Entity-Relationship Model, produces the relevant documentation by means of traditional printouts, as well as allowing a graphical definition of the conceptual schema. Moreover GDOC automatically generates the operating programs for accessing the concepts in the schema.Experiences of use of GDOC are discussed and further research directions are outlined.
SmartFrog Meets LCFG: Autonomous Reconfiguration with Central Policy Control
Authors: Paul Anderson, Patrick Goldsack, Jim Paterson
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Typical large infrastructures are currently configured from the information in a central configuration repository. As infrastructures get larger and more complex, some degree of autonomous reconfiguration is essential, so that certain configuration changes can be made without the overhead of feeding the changes back via the central repository. However, it must be possible to dictate a central policy for these autonomous changes, and to use different mechanisms for different aspects of the configuration.This paper describes a framework which can be used to configure different aspects of a system using different methods, including explicit configuration, service location, and various other autonomous techniques. The proven LCFG tool is used for explicit configuration and to provide a wide range of configuration components. The dynamic elements are provided by the SmartFrog framework.
Listen-Communicate-Show (LCS): spoken language command of agent-based remote information access
Authors: Jody J. Daniels, Benjamin Bell
Venue: Proceedings of the first international conference on Human language technology research (2001)

Listen-Communicate-Show (LCS) is a new paradigm for human interaction with data sources. We integrate a spoken language understanding system with intelligent mobile agents that mediate between users and information sources. We have built and will demonstrate an application of this approach called LCS-Marine. Using LCS-Marine, tactical personnel can converse with their logistics system to place a supply or information request. The request is passed to a mobile, intelligent agent for execution at the appropriate database. Requestors can also instruct the system to notify them when the status of a request changes or when a request is complete. We have demonstrated this capability in several field exercises with the Marines and are currently developing applications of this technology in new domains.
On the performance of circuit-switched networks in the presence of correlated traffic: Research Articles
Authors: Geyong Min, Mohamed Ould-Khaoua
Venue: Concurrency and Computation: Practice Experience (2004)

Many studies have revealed that the traffic generated by multimedia applications exhibits a high degree of burstiness and possesses strong correlation in the number of message arrivals between adjacent time intervals, which can significantly affect network performance. This paper proposes a new analytical performance model for circuit-switched k-ary n-cubes with correlated traffic pattern. Compared to the models presented in the previous studies, this model is more realistic due to its ability to capture the effects of using virtual channels at a source node by taking into account the splitting of correlated traffic. Moreover, a closed-form expression for computing the probability of virtual channel occupancy is given. The validity of the present model is demonstrated by comparing analytical results against those obtained through simulation experiments of the actual system. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A file system abstraction for sense and respond systems
Authors: Sameer Tilak, Bhanu Pisupati, Kenneth Chiu, Geoffrey Brown, Nael Abu-Ghazaleh
Venue: Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services (2005)

The heterogeneity and resource constraints of sense-and-respond systems significantly challenge system and application development. In this paper, we present a flexible, intuitive file system abstraction for organizing and managing sense-and-respond systems based on the Plan 9 design principles. A key feature is the support of multiple views of the system via filesystem namespaces. Constructed logical views present an application-specific representation of the network, thus enabling high-level programming. Concurrently, structural views of the network enable resource-efficient planning and execution of tasks. We present and motivate the design using several examples, outline research challenges and our plan to address them, and describe the current implementation state.
Efficient algorithms for optimistic crash recovery
Authors: S. Venkatesan, Tony T-Y. Juang
Venue: Distributed Computing (1994)

Recovery from transient processor failures can be achieved by using optimistic message logging and checkpointing. The faulty processors roll back, and some/all of the non-faulty processors also may have to roll back. This paper formulates the rollback problem as a closure problem. A centralized closure algorithm is presented together with two efficient distributed implementations. Several related problems are also considered and distributed algorithms are presented for solving them.
Diameter vulnerability of iterated line digraphs in terms of the girth
Authors: C. Balbuena, X. Marcote, D. Ferrero
Venue: Networks (2005)

Iterated line digraphs arise naturally in designing fault tolerant systems. Diameter vulnerability measures the increase in diameter of a digraph when some of its vertices or arcs fail. Thus, the study of diameter vulnerability is a suitable approach to the fault tolerance of a network. In this article we present some upper bounds for diameter vulnerability of iterated line digraphs LkG. Our bounds depend basically on the girth of the digraph G and on the number of iterations k. These bounds generalize some previous results on diameter vulnerability of line digraphs. Also, we apply our results to several important families of line digraphs such as Kautz digraphs and deBruijn generalized cycles, which contain deBruijn digraphs, the Reddy-Pradhan-Kuhl digraphs, and the butterflies. Our bounds allow us to obtain improvements in known results on diameter vulnerability for all these families. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 49-54 2005
Efficient computation of query point visibility in polygons with holes
Authors: Alireza Zarei, Mohammad Ghodsi
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase. Our algorithm is based on solutions in [13] and [2] proposed for simple polygons. In our solution, the preprocessing is done in time O(n3 log(n)) to construct a data structure of size O(n3). It is then possible to report the visibility polygon of any query point q in time O((1+h′) log n+|V(q)|), in which n and h are the number of the vertices and holes of the polygon respectively, |V(q)| is the size of the visibility polygon of q, and h′ is an output and preprocessing sensitive parameter of at most min(h,|V(q)|). This is claimed to be the best query-time result on this problem so far.
Applications of the retracing method for distance-regular graphs
Authors: Akira Hiraki
Venue: European Journal of Combinatorics (2005)

In the previous paper (J. Combin. Theory Ser. B 79 (2000) 211) we introduced the retracing method for distance-regular graphs and gave some applications. In this paper, we give other applications of this method. In particular, we prove the following result: Theorem. Let Γ be a distance-regular graph of diameter d with r = |{i|(ci, ai, bi) = (c1, a1, b1)}| ≥ 2 and cr+1 ≥ 2. Let m, s and t be positive integers with s ≤ m, m + t ≤ d and (s, t) ≠ (1, 1). Suppose bm-s+1 = ... = bm = 1 + bm+1, cm+1 = ... = cm+t = 1 + cm and am-s+2 = ... = am+t-1 = 0. Then the following hold. (1) If bm+1 ≥ 2, then t ≤ r - 2[s/3]. (2) If cm ≥ 2, then s ≤ r - 2[t/3].
Parallel Multilevel Tetrahedral Grid Refinement
Authors: Sven Gross, Arnold Reusken
Venue: SIAM Journal on Scientific Computing (2005)

In this paper we analyze a parallel version of a multilevel red/green local refinement algorithm for tetrahedral meshes. The refinement method is similar to the approaches used in the UG-package [UG, http://cox.iwr.uni-heidelberg.de/~ug] and by Bey [Computing, 55 (1995), pp. 355--378; Finite-Volumen- und Mehrgitterverfahren für Elliptische Randwertprobleme, Ph. D. thesis, Universität Tübingen, Tübingen, Germany, 1997]. We introduce a new data distribution format that is very suitable for the parallel multilevel refinement algorithm. This format is called an admissible hierarchical decomposition. We will prove that the application of the parallel refinement algorithm to an input admissible hierarchical decomposition yields an admissible hierarchical decomposition. The analysis shows that the data partitioning between the processors is such that we have a favorable data locality (e.g., parent and children are on the same processor) and at the same time only a small number of copies.