ppxscal/embedding_network huggingface dataset:
Querying websites using compact skeletons
Authors: Anand Rajaraman, Jeffrey D. Ullman
Venue: Journal of Computer and System Sciences (2003)

Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML documents. Much research has been devoted to this problem, resulting in several research prototypes and commercial implementations. Such systems rely on wrappers that provide relational or other structured interfaces to websites. Traditionally, wrappers have been constructed by hand on a per-website basis, constraining the scalability of the system. We introduce a website structure inference mechanism called compact skeletons that is a step in the direction of automated wrapper generation. Compact skeletons provide a transformation from websites or other hierarchical data, such as XML documents, to relational tables. We study several classes of compact skeletons and provide polynomial-time algorithms and heuristics for automated construction of compact skeletons from websites. Experimental results show that our heuristics work well in practice. We also argue that compact skeletons are a natural extension of commercially deployed techniques for wrapper construction.
DYNAMIC: A New Role for Training Problems in EBL
Authors: M. A Perez, Oren Etzioni
Venue:  (1992)

Most Explanation-Based Learning (EBL) systems construct explanations by directly translating a trace of their problem solver''s search, on training problems, into proofs. This approach makes proof derivation tractable, but can focus EBL on incidental aspects of its training problems, yielding overly-specific control knowledge. Previous work has described the other extreme: STATIC, a system that generates more general control knowledge by statically analyzing problem-space definitions. However, since STATIC does not utilize training problems, it has a number of potential disadvantages compared with EBL. This paper advocates an intermediate approach in which training problems pinpoint learning opportunities but do not determine EBL''s explanations. Based on this design principle, we developed DYNAMIC, a module that learns control rules for the PRODIGY problem solver. In DYNAMIC, choosing what to explain and how to explain it are independent. DYNAMIC utilizes the analysis algorithms introduced by STATIC, but relies on training problems to achieve the distribution-sensitivity of EBL. On a highly skewed problem distribution, DYNAMIC was almost four times as effective as STATIC in speeding up PRODIGY. When tested in PRODIGY/EBL ''s benchmark problem spaces, DYNAMIC ran considerably faster than PRODIGY/EBL and produced control rules that were close to three times as effective. In addition, DYNAMIC required only a fraction of the training problems used by PRODIGY/EBL.
Optimal point-to-point broadcast algorithms via lopsided trees
Authors: M. Golin, A. Schuster
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We consider the broadcasting operation in point-to-point packet-switched parallel and distributed networks of processors. We develop a general technique for the design of optimal broadcast algorithms on a wide range of such systems. Our technique makes it easier to design such algorithms and, furthermore, provides tools that can be used to derive precise analyses of their running times. As direct applications of this method we give an exact analysis of a known algorithm for the POSTAL model, and design and analyze an optimal broadcast algorithm for the MULTI PORT MULTI-MEDIA model. We then show how our method can be applied to networks with different underlying topologies, by designing and giving an exact analysis of an optimal broadcast algorithm for the OPTICAL RING.
On characterizing an ATM source via the sustainable cell rate traffic descriptor
Authors: F. Guillemin, C. Rosenberg, J. Mignault
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The sustainable cell rate (SCR) was introduced by the ATM Forum as a means of characterizing the statistical activity of ATM VBR connections. The SCR traffic descriptor (SCR-TD), composed of the sustainable cell rate 1/T/sub SCR/ and the intrinsic burst tolerance /spl tau//sub IBT/, is defined with respect to an algorithmic characterization, the generic cell rate algorithm (GCRA). This method makes source parameter enforcement straightforward. Unfortunately, the current specification of the SCR-TD is incomplete, leaving the source with an infinite number of (T/sub SCR/, /spl tau//sub IBT/) couples to choose from, This ambiguity could bear a negative impact on network efficiency. The authors investigate the issues involved in selecting suitable SCR-TD values for a given source, both from a user's perspective and from a networking point of view.
Integrating multimedia characteristics in web-based document languages
Authors: J. R. Ossenbruggen, Lynda Hardman, L. W. Rutledge
Venue:  (2000)

A single multimedia document model needs to include a wide range of different types of information. In particular, information about space and time is essential for determining the spatial and temporal placement of elements within a presentation. Each information type included in a document model requires its own structuring mechanisms. The language used to express the document model has to be able to encapsulate the plurality of required structures. While this is a process that can be carried out relatively easily during the initial design of a language, it is more difficult in the case that a particular document language already exists and extra multimedia characteristics are required. For example, one could consider adding temporal information to an existing "static" document language. We investigate the underlying problems of superimposing a new document feature on an existing language and discuss possible strategies for integrating the required extra information in a modified document description language.
Exploring term dependences in probabilistic information retrieval model
Authors: Bong-Hyun Cho, Changki Lee, Gary Geunbae Lee
Venue: Information Processing and Management: an International Journal (2003)

Most previous information retrieval (IR) models assume that terms of queries and documents are statistically independent from each another. However, this kind of conditional independence assumption is obviously and openly understood to be wrong, so we present a new method of incorporating term dependence in probabilistic retrieval model by adapting Bahadur-Lazarsfeld expansion (BLE) to compensate the weakness of the assumption. In this paper, we describe a theoretic process to apply BLE to the general probabilistic models and the state-of-the-art 2-Poisson model. Through the experiments on two standard document collections, HANTEC2.0 in Korean and WT10g in English, we demonstrate that incorporation of term dependences using the BLE significantly contribute to the improvement of performance in at least two different language IR systems.
Finite element approximation of spectral problems with Neumann boundary conditions on curved domains
Authors: Erwin Hernández, Rodolfo Rodríguez
Venue: Mathematics of Computation (2003)

This paper deals with the finite element approximation of the spectral problem for the Laplace equation with Neumann boundary conditions on a curved nonconvex domain Ω. Convergence and optimal order error estimates are proved for standard piecewise linear continuous elements on a discrete polygonal domain Ωh ⊄ Ω in tile framework of the abstract spectral approximation theory.
Deadline Handling in Real-Time Distributed Objects
Authors: K. H. (Kane) Kim, Juqiang Liu, Moon-Hae Kim
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Deadline handling is a fundamental part of real-time computing but has been practiced in ad hoc forms for decades. A general framework for systematic deadline handling in real-time distributed computer systems is proposed in this paper. The notions of hard deadlines and hard-real-time program components are discussed along with the advantages of a hard-real-time component based construction approach.To present approaches for implementation of systematic deadline handling in concrete forms, we use the time-triggered message triggered object (TMO) network structuring as the basic design framework in which deadline handling approaches are incorporated. The TM0 structuring scheme is a general-style component structuring scheme and supports design of all types of components including hard-real-time objects and non-real-time objects within one general structure. An augmentation of the TM0 structure with statistical performance indicators is also proposed.
UML for Java Programmers
Authors: Martin, Pete McBreen
Venue:  (2003)

UML for Java ProgrammersRobert C. MartinAll the UML Java developers need to knowYou don't use UML in a vacuum: you use it to build software with a specific programming language. If that language is Java, you need UML for Java Programmers. In this book, one of the world's leading object design experts becomes your personal coach on UML 1&2 techniques and best practices for the Java environment.Robert C. Martin illuminates every UML 1&2 feature and concept directly relevant to writing better Java software--and ignores features irrelevant to Java developers. He explains what problems UML can and can't solve, how Java and UML map to each other, and exactly how and when to apply those mappings. Pragmatic coverage of UML as a working tool for Java developers Shows Java code alongside corresponding UML diagrams Covers every UML diagram relevant to Java programmers, including class, object, sequence, collaboration, and state diagrams Introduces dX, a lightweight, powerfully productive RUP & XP-derived process for successful software modeling Includes a detailed, start-to-finish case study: remote service client, server, sockets, and tests
Proving Inductive Theorems using Witnessed Test Sets
Authors: Z. Shao, Y Sun, G. Song, H. Yu
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

Based on a new approach to deciding ground reducibility we proposed by introducing witnesses, we design an algorithm for proving inductive theorems using witnessed test sets for left-linear rewrite systems. Experimental results show that: compared with the standard test set approach presented by Kapur, Narendran and Zhang, our method generates test sets of smaller size and is more efficient to prove inductive theorems.
Constructive algorithms of vascular network modeling for training of minimally invasive catheterization procedure
Authors: Yiyu Cai, Xiuzi Ye, Cheekong Chui, James H. Anderson
Venue: Advances in Engineering Software (2003)

In this paper, three-dimensional modeling of vascular networks is described. We propose a constructive approach to generating vascular segments and bifurcations using sweeping and blending operations. This allows smooth connection of individual branching segments at the vascular bifurcations. A tangential continuity or visual smooth (e.g. GC1) representation of the vascular network is derived to formulate constructive algorithms for vascular modeling. The vascular modeling technique developed is applied in our medical simulation system for the training and pretreatment planning of minimally invasive vascular surgery using catheterization procedure.
On the complexity of finding balanced oneway cuts
Authors: Uriel Feige, Orly Yahalom
Venue: Information Processing Letters (2003)

A bisection of an n-vertex graph is a partition of its vertices into two sets S and T, each of size n/2. The bisection cost is the number of edges connecting the two sets. In directed graphs, the cost is the number of arcs going from S to T. Finding a minimum cost bisection is NP-hard for both undirected and directed graphs. For the undirected case, an approximation of ratio O(log2n) is known. We show that directed minimum bisection is not approximable at all. More specifically, we show that it is NP-hard to tell whether there exists a directed bisection of cost 0, which we call oneway bisection. In addition, we study the complexity of the problem when some slackness in the size of S is allowed, namely, (1/2 - ε)n ≤ |S| ≤ (1/2 + ε)n. We show that the problem is solvable in polynomial time when ε = Ω(1/logn), and provide evidence that the problem is not solvable in polynomial time when ε = o(1/(logn)4).
Software Process Standardization for Distributed Working Groups
Authors: Carmen Maidantchik, Ana Regina C. Rocha, Geraldo Xexéo
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Continuous software process improvement corresponds to one of the major goals of software organizations. Standardization is a necessary prerequisite for software process improvement, but first, it is necessary to understand the restrictions of the development environment. In geographically distributed environments, working groups usually have different characteristics. It is very hard to define a unique and suitable software process. We propose a model to standardize software processes and to support their continuous improvement. An initial software process is defined according to the restrictions of the environment. Then, four other software processes are specialized, each corresponding to a different maturity level. An evaluating process defines the maturity level of each group and verifies whether the working group correctly used its software process. Then, an action list determines activities to be done to continuously improve the software process of each single working group.
Making Software Timing Properties Easier to Inspect and Verify
Authors: Jia Xu
Venue: IEEE Software (2003)

A general method or tool that can verify the timing properties of any arbitrary piece of software will probably never exist. So, software with hard timing requirements should be designed using a systematic approach to make its timing properties easier to inspect and verify. Preruntime scheduling provides such an approach by placing restrictions on software to reduce complexity.
Concern-driven design for a specification language supporting component-based software engineerin
Authors: W. V. Kozaczynski, J. Q. Ning
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The paper concerns an approach to software development which is referred to as Component Based Software Engineering (CBSE). The approach is based on the principle of extensive use of preexisting, standard or customizable components in building new systems. CBSE has received considerable attention recently since it promises to bring to software development the engineering discipline that has been long accepted in more mature engineering domains. We describe the design of a specification language intended for support of basic CBSE activities; the Architecture Specification Language (ASL). More specifically, we show how the language design choices have been driven by our understanding and prioritization of the concerns of the key stakeholders involved in the software development process.
Elementary versus Composite Interfaces in Distributed Real-Time Systems
Authors: H. Kopetz
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

To manage the complexity of large distributed real-time systems, a system must be partitioned into nearly autonomous subsystems that communicate across small well-specified interfaces. The form and placement of these interfaces determines the system structure and its understandability. This paper investigates two different types of unidirectional information-flow interfaces, the elementary interface and the composite interface. It is argued that systems that interact by elementary interfaces support composability, and are easier to understand and validate than systems that are based on composite interfaces.
Nonuniform web-splines
Authors: Klaus Höllig, Ulrich Reif
Venue: Computer Aided Geometric Design (2003)

The construction of weighted extended B-splines (web-splines), as recently introduced by the authors and J. Wipper for uniform knot sequences, is generalized to the nonuniform case. We show that web-splines form a stable basis for splines on arbitrary domains in Rm which provides optimal approximation power. Moreover, homogeneous boundary conditions, as encountered frequently in finite element applications, can be satisfied exactly by using an appropriate weight function. To illustrate the performance of the method, it is applied to a scattered data fitting problem and a finite element approximation of an elliptic boundary value problem.
Finite Population Task Oriented Queueing: A Model for Internet Server Capacity Planning
Authors: Robert Lackman, ShengJun Li
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In recent years there has been an explosive growth in Internet servers such as Web andFTP servers. Because of the growth in the amount and importance of Internet serving, internet server capacity planning has become very important. [1] As critical e-business applications are developed, it is vital that tools exist to ensure adequate performance as traffic grows. Adequate performance includes both user perceived performance measures such as response time, service provider measures of interest such as throughput and measures of interest to both parties such as fraction of timeouts due to excessive response time.
Applications of the pseudo residual-free bubbles to the stabilization of convection-diffusion problems
Authors: Franco Brezzi, Donatella L. Marini, Alessandro Russo
Venue:  (1997)

Residual-free bubbles have been recently introduced in order to compute optimal values for the stabilization methods \`a la Hughes-Franca. However, unless in very special situations, (one-dimensional problems, limit cases, etc.) they require the actual solution of PDE problems (the bubble problems) in each element. Thus, they are very difficult to be used in practice. In this paper we present, for the special case of convection-dominated elliptic problems, a cheap way to compute approximately the solution of the bubble problem in each element. This provides, as a consequence, a cheap way to compute good approximations for the optimal values of the stabilization parameters. EMAIL:: ian@microian.ian.pv.cnr.it
Statistical synchronization among participants in real-time multimedia conference
Authors: P. N. Zarros, M. J. Lee, T. N. Saadawi
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the average packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. The error of the proposed algorithm is enumerated by the Chernoff bound and is shown to be acceptable in practical application.
The Prism distributed multimedia platform
Authors: L. Toutain, H. Afifi, J.-P. Le Narzul
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The paper describes the Prism distributed multimedia platform. The paper is divided in three parts. The first part resumes the main components of the platform. The authors show the different planes that interact with both multimedia applications and network resources. The second part describes a different approach being developed for the platform to ease the distribution of multimedia objects. It is based on fragmented objects. The third part enumerates two different applications that have been developed for and on that platform. The first is a specific multimedia protocol and the second is a whiteboard used for tele-teaching.
Detecting Steganographic Messages in Digital Images
Authors: Hany Farid
Venue:  (2001)

Techniques and applications for information hiding have become increasingly more sophisticated and widespread. With high-resolution digital images as carriers, detecting the presence of hidden messages has also become considerably more difficult. It is sometimes possible, nevertheless, to detect (but not necessarily decipher) the presence of embedded messages. The basic approach taken here works by finding predictable higher-order statistics of ``natural'''' images within a multi-scale decomposition, and then showing that embedded messages alter these statistics.
Estimating Mixed Software Reliability Models Based on the EM Algorithm
Authors: Hiroyuki Okamura, Yasuhiro Watanabe, Tadashi Dohi
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

This paper considers the mixture models to unify software reliability models (SRMs). The modeling framework is based on the randomization of a software fault detection rate. Our models, called the mixed SRMs in this paper, can include some existing SRMs such as Littlewood NHPP model and the hyperexponential SRM. We develop an efficient parameter estimation algorithm for the mixed SRMs based on the EM (Expectation-Maximization) principle, and investigate both the effectiveness of the EM algorithm and the validity of the mixed SRMs through the numerical examples with real software failure data.
Some sparse time-relaxed broadcast communication networks
Authors: A. Shastri
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Broadcasting is the process of information dissemination in communication networks (modelled as graphs) whereby a message originated at one vertex becomes known to all members under the constraints that each call requires one unit of time and at every step any member can call at most one of its neighbours. A broadcast graph on n vertices is a network in which message can be broadcast in minimum possible (=[log2n]) time regardless of originator. Broadcast graphs having the smallest number of edges are called Minimum Broadcast Graphs, and are subject of intensive study. On the other hand, in Shastri (1995) we have considered how quickly broadcasting can be done in trees. In this paper, we construct more and more sparse time-relaxed broadcast graphs for some small values of n, as we allow additional time over [log2n], until we get a tree.
Algorithms for Parallel Memory I: Two-Level Memories
Authors: Jeffrey S Vitter, Elizabeth A.M. Shriver
Venue:  (1992)

We provide the first optimal algorithms in terms of the number of input/outputs (I/Os) required between internal memory and multiple secondary storage devices for the problems of sorting, FFT, matrix transposition, standard matrix multiplication, and related problems. Our two-level memory model is new and gives a realistic treatment of parallel block transfer, in which during a single I/O each of the P secondary storage devices can simultaneously transfer a contiguous block of B records. The model pertains to a large-scale uniprocessor system or parallel multiprocessor system with P disks. In addition, the sorting, FFT, permutation network, and standard matrix multiplication algorithms are typically optimal in terms of the amount of internal processing time. The difficulty in developing optimal algorithms is to cope with the partitioning of memory into P separate physical devices. Our algorithms'' performance can be significantly better than those obtained by the well-known but nonoptimal technique of disk striping. Our optimal sorting algorithm is randomized, but practical; the probability of using more than $l$ times the optimal number of I/Os is exponentially small in $l$ $(\log l) \log (M/B)$, where $M$ is the internal memory size.