ppxscal/embedding_network huggingface dataset:
Efficient schemes for managing multiversionXML documents
Authors: S.-Y. Chien, V. J. Tsotras, C. Zaniolo
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2002)

Multiversion support for XML documents is needed in many critical applications, such as software configuration control, cooperative authoring, web information warehouses, and &rdquo;e-permanence&rdquo; of web documents. In this paper, we introduce efficient and robust techniques for: (i) storing and retrieving; (ii) viewing and exchanging; and (iii) querying multiversion XML documents. We first discuss the limitations of traditional version control methods, such as RCS and SCCS, and then propose novel techniques that overcome their limitations. Initially, we focus on the problem of managing secondary storage efficiently, and introduce an edit-based versioning scheme that enhances RCS with an effective clustering policy based on the concept of page-usefulness. The new scheme drastically improves version retrieval at the expense of a small (linear) space overhead. However, the edit-based approach falls short of achieving objectives (ii) and (iii). Therefore, we introduce and investigate a second scheme, which is reference-based and preserves the structure of the original document. In the reference-based approach, a multiversion document can be represented as yet another XML document, which can be easily exchanged and viewed on the web; furthermore, simple queries are also expressed and supported well under this representation. To achieve objective (i), we extend the page-usefulness clustering technique to the reference-based scheme. After characterizing the asymptotic behavior of the new techniques proposed, the paper presents the results of an experimental study evaluating and comparing their performance.
Experiments with a social learning model
Authors: Yuval Marom, George Maistros, Gillian R. Hayes
Venue: Adaptive Behavior (2001)

We present a system that models perception-action coupling through imitation and attention. Our interest is in imitation and in social learning more generally. Through social learning the experience of an agent is governed by the actions of an expert, and the structures that develop within the agent's "brain" are influenced by its social situatedness. We are inspired from biological findings in primates of the existence of mirror neurons, which are believed to be involved in imitation. The visual and motor properties of these neurons suggest a tight perception-action coupling, where affordances could be expressed. Our system is designed to model the functional properties of the mirror neurons and therefore express the functionality of objects. The system builds up perceptual and motoric structures from experience using temporal attention and forms perceptual-motor connections. The experience arises through imitation, where an agent can perceive objects and the interactions upon them. We have successfully applied our system on three different platforms, two in simulation and the third on a real robot learning from a human. The system is able to segment the perceptual-motor experience into distinct structures that can be used to recognize and reproduce the task in each experiment. Some unexpected results showed us that the motoric complexity in these experiments was not high enough to expose the full potential of our system, and we suggest future work that will address these results.
Fuzzy controller for a system with uncertain load
Authors: Piotr Kulczycki, Rafal Wisniewski
Venue: Fuzzy Sets and Systems (2002)

In many applications of motion control, problems associated with imprecisely measured or changing load (a mass or a moment of inertia) can be a serious obstacle in the formation of satisfactory controlling systems. This barrier compels the designer to include various kinds of uncertainties in engineering solutions. The present paper deals with the time-optimal control for mechanical systems with uncertain load. A fuzzy approach is used in the design of suboptimal feedback controllers, robust with respect to the load. The methodology proposed in this work may be easily adapted to other modeling uncertainties of mechanical systems, e.g. parameters of drive or motion resistance.
Feature engineering for a gene regulation prediction task
Authors: George Forman
Venue: ACM SIGKDD Explorations Newsletter (2002)

This paper describes an approach that won honorable mention for the gene regulation prediction task of the 2002 KDD Cup competition [1]. Our methodology used extensive cross-validation to direct the search for an appropriate problem representation and the selection of an 'off-the-shelf' induction algorithm. A prominent trait of the dataset is the presence of three hierarchical attributes, for each of which we generated a novel predictive feature: the percentage of positives hierarchically aggregated at the node specified by the instance.
Managing data flow in a DAC supporting security system
Authors: Rudolf Hörmanseder, Johann Murauer, Jörg R. Mühlbacher
Venue: Journal of Network and Computer Applications (2002)

The most frequently used operating systems with integrated security features (like Unix, Windows NT) use a security approach that is based on discretionary access control (DAC). DAC does not deal with data-flow, but access rights, which are assigned to subjects or objects. A subject is granted or denied access to an object based on its identity and assigned rights. In this paper, we present a method for finding all allowed data-flow paths within an arbitrary computer network that has a DAC-based security system. Of course, the organisation, from the point of view of the management, determines what is allowed and what is not allowed. So the organisational environment in which the computer network is integrated has to be considered. The DAC-based security system has to fulfil the requirements of the organisation. The computer network is modelled as a graph. Each node represents a resource and may have assigned to it some users together with their access rights for this resource. Each edge represents possible data-flow between the nodes it connects. Network resources as well as users also belong to the organisational model. This model is also described by a graph. It consists of labelled edges describing the hierarchical relationship between the connected nodes. Nodes in this model stand for organisational units. The model of the computer network and the model of proposed data-flow in the organisation can be compared with each other. Such a comparison highlights any inconsistencies between the two models. This allows us to improve the security setup--either by adjusting the configuration until the needs of the organisation are met or by implementing some organisational guidelines to overcome the problems. The proposed method is supported by a security tool named SecSim1 (Security Simulator Version 1). This tool supports the data input for the two models and also performs the comparison. It thus serves as a proof of our proposed concept.
DFTS: a novel distributed high fault-tolerance storage mechanism
Authors: Qingsong Wei, Xianliang Lu, Xu Zhou
Venue: ACM SIGOPS Operating Systems Review (2003)

Computerized data is becoming critical to the survival of an enterprise. RAID is a popular mechanism to offer fault-tolerance storage. But RAID can not work when two more disks fail and the distance it can reach is very limited. This paper presents a novel distributed high fault-tolerance storage mechanism called DFTS. DFTS makes use of disk space of the node in distributed network to build a public storage space which users can access like local disk. File is stored in form of original file fragments and their mutual XOR verification fragments among the nodes of the network. File is available even when a part of nodes fail. DFTS realizes long-distance fault-tolerance storage. In addition, performance of the DFTS is more than an order of magnitude higher than that of single computer. The experiments in this paper show that DFTS can offer high fault-tolerance and advanced performance.
Compact application signatures for parallel and distributed scientific codes
Authors: Charng-da Lu, Daniel A. Reed
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

Understanding the dynamic behavior of parallel programs is key to developing efficient system software and runtime environments; this is even more true on emerging computational Grids where resource availability and performance can change in unpredictable ways. Event tracing provides details on behavioral dynamics, albeit often at great cost. We describe an intermediate approach, based on curve fitting, that retains many of the advantages of event tracing but with lower overhead. These compact "application signatures" summarize the time-varying resource needs of scientific codes from historical trace data. We also developed a comparison scheme that measures similarity between two signatures, both across executions and across execution environments.
Sales-Force Decision Models: Insights From 25 Years of Implementation
Authors: Prabhakant Sinha, Andris A. Zoltners
Venue: Interfaces (2001)

Over 25 years, we have developed many sales-force and modeling insights through over 2,000 projects with several hundred selling organizations in over 50 countries. Content insights are useful in making sales-force decisions. Examples are that profitability is flat for a wide range of sales-force sizes; phased sales-force growth is rarely optimal; focused strategies dominate scattered strategies; most sales territories (55 percent) are too large or too small; and no compensation plan satisfies everyone. Implementation insights concern model building, use, and implementation, for example, a model's economic value can come from such sources as reduced uncertainty, accuracy, increased speed, objectivity, and stakeholder involvement; theory and practice have different and complementary perspectives; experience and wisdom are sometimes better than models; and models provide insights, while people make decisions.
A computable filled function used for global minimization
Authors: Xian Liu
Venue: Applied Mathematics and Computation (2002)

The filled function method is an approach to find the global minimum of multimodal and multidimensional functions. This paper proposes a new filled function. This function needs only one parameter and includes neither exponential terms nor logarithmic terms. Furthermore, the lower bound of weight factor a is usually smaller than that of one previous formulation. Therefore, it is reasonable to expect that the proposed function has better computability than the previously reported ones.
Calculating functional programs
Authors: Jeremy Gibbons
Venue: Algebraic and coalgebraic methods in the mathematics of program construction (2002)

Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate programs, in the same way that one calculates numeric values in arithmetic. Many useful theorems for such reasoning derive from an algebraic view of programs, built around datatypes and their operations. Traditional algebraic methods concentrate on initial algebras, constructors, and values; dual co-algebraic methods concentrate on final co-algebras, destructors, and processes. Both methods are elegant and powerful; they deserve to be combined.
Mathematical models for simulation of continuous grinding process with recirculation
Authors: Piroska B. Kis, Csaba Mihálykó, Béla G. Lakatos
Venue: Acta Cybernetica (2002)

New mathematical and computer models and simulation programs were elaborated for studying processes of continuous grinding mills working with classification and partial recirculation of the product. The computer models were developed on the basis of the axial dispersion model taking into consideration also the effects of the mixing of the material to be ground. The effects of changes of parameters of both the mill and the material were studied. The stationary states of the continuous grinding mills working with and without classification and recirculation were compared to each other. The mathematical models and the computer programs developed are suitable for computing the processes of the grinding mills either with or without recirculation. They are usable for simulation based analysis and design of both continuous and batch grinding devices.
A Model of Thematic Differentiation of Access to Information for the Hierarchical Classifier in Automatic Control Systems
Authors: N. A. Gaidamakin
Venue: Automation and Remote Control (2003)

A thematic principle of differentiation of access to information on the basis of hierarchical classifier was proposed. The notion of thematic multirubric was introduced. A lattice of multirubrics was constructed and used to develop a formal model of thematic differentiation of access to the information resources (objects) which enables design of protected automatic control system with full monitoring of the information flows. 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
Skew Minimization Problem with Possible Sink Displacement
Authors: A. I. Erzin, J. D. Cho
Venue: Automation and Remote Control (2003)

In applications such as design of integrated circuits (chips), it is sometimes required to connect the terminals (receivers) and the central vertex (source) by a weight-minimal tree where the signal delays between the source and the terminals are the same or differ by a minimal value. Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminals for which these conditions are not satisfied, and a new polynomial algorithm to determine an approximate solution were presented.
On mask layout partitioning for electron projection lithography
Authors: Ruiqi Tian, Ronggang Yu, Xiaoping Tang, D. F. Wong
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Electron projection lithography (EPL) is a leading candidate for next generation lithography (NGL) in VLSI production. The membrane mask used in EPL is divided into sub-fields by struts for structural support. A layout must be partitioned into these sub-fields on mask and then stitched back together by the EPL tool on wafer. To minimize possible stitching errors, partitioning of a mask layout should minimize cuts of layout features in the overlapping area between two adjacent sub-fields. This paper presents the first formulation of the mask layout partitioning problem for EPL as a graph problem. The graph formulation is optimally solved with a shortest path approach. Two other techniques are also presented to speed up computation. Experimental runs on data from a real industry design show excellent results.
On the Time-Continuous Mass Transport Problem and Its Approximation by Augmented Lagrangian Techniques
Authors: K. Guittet
Venue: SIAM Journal on Numerical Analysis (2003)

In [J. D. Benamou and Y. Brenier}, Numer. Math., 84 (2000), pp. 375--393], a computational fluid dynamic approach was introduced for computing the optimal map occurring in the Monge--Kantorovich problem. Though the described augmented Lagrangian method involves a Hilbertian framework, the discussion was purely formal. Taking advantage of the recent progress in optimal transport theory [L. A. Caffarelli, Comm. Pure Appl. Math., 45 (1992), pp. 1141--1151], [L. A. Caffarelli, Ann. of Math. (2), 144 (1996), pp. 453--496], [D. Cordero-Erausquin, C. R. Acad. Sci. Paris Sér. I Math., 329 (1999), pp. 199--202], [R. J. McCann, Geom. Funct. Anal., 11 (2001), pp. 589--608] and despite the lack of coercivity of the Hilbertian problem, we establish an existence result. Then, under a reasonable assumption of positivity for the density, we prove the existence of saddle-points for both Lagrangians defined in Benamou and Brenier, and finally prove the convergence of the numerical method.
Convergence of an iterative algorithm for solving Hamilton-Jacobi type equations
Authors: Jerry Markman, I. Norman Katz
Venue: Mathematics of Computation (2002)

Solutions of the optimal control and H∞-control problems for non-linear affine systems can be found by solving Hamilton-Jacobi equations. However, these first order nonlinear partial differential equations can, in general, not be solved analytically. This paper studies the rate of convergence of an iterative algorithm which solves these equations numerically for points near the origin. It is shown that the procedure converges to the stabilizing solution exponentially with respect to the iteration variable. Illustrative examples are presented which confirm the theoretical rate of convergence.
Decentralized Adaptive Flow Control of High-Speed Connectionless Data Networks
Authors: Felisa J. Vazquez-Abad, Lorne G. Mason
Venue: Operations Research (1999)

We introduce a permit-based adaptive control scheme for regulating traffic admission in high-speed connectionless data networks, such as the internet. Permits are awarded to potential customers arriving from outside and travel with them towards their destinations, where the permits are assigned to the local controllers. The controllers randomly distribute the permits among the entry gates at the nodes. Customers from outside are not allowed to enter the network unless there are permits available at the entrance node, thus the model is that of a closed queueing network if we model the dynamics of the permits. The goal is to find the permit distribution strategy that maximizes network performance subject to the restrictions of the network topology. A traffic balance approach is used to establish nonuniqueness of the optimal distribution probabilities for the decentralized operation. We exploit nonuniqueness introducing the concept of the automata actions, focusing on two strategies for the actions. For each strategy, a learning automaton is implemented at the controllers using the Kuhn-Tucker conditions for optimality. Our first learning algorithm converges weakly to a unique limit point, which is optimal, while the limit behaviour of our second learning algorithm may be suboptimal. We illustrate our results using computer simulations in order to compare the two strategies for the same network.
Lift-and-project for mixed 0-1 programming: recent progress
Authors: Egon Balas, Michael Perregaard
Venue: Discrete Applied Mathematics (2002)

This article reviews the disjunctive programming or lift-and-project approach to 0-1 programming, with an emphasis on recent developments. Disjunctive programming is optimization over unions of polyhedra. The first three sections of the paper define basic concepts and introduce the two fundamental results underlying the approach. Thus, section 2 describes the compact higher dimensional representation of the convex hull of a union of polyhedra, and its projection on the original space; whereas section 3 is devoted to the sequential convexifiability of facial disjunctive programs, which include mixed 0-1 programs. While these results originate in Balas' work in the early- to mid-seventies, some new results are also included: it is shown that on the higher dimensional polyhedron representing the convex hull of a union of polyhedra, the maximum edge-distance between any two vertices in 2. Also, it is shown that in the process of sequential convexification of a 0-1 program, fractional intermediate values of the variables can occur only under very special circumstances. The next section relates the above results to the matrix-cone approach of Lovász and Schrijver and of Sherali and Adams. Section 5 introduces the lift-and-project cuts of Balas, Ceria and Cornuéjols from the early nineties, and discusses the cut generating linear program (CGLP), cut lifting and cut strengthening. The next section briefly outlines the branch and cut framework in which the lift-and-project cuts turned out to be computationally useful, while section 7 discusses some crucial aspects of the cut generating procedure: alternative normalizations of (CGLP), complementarity of the solution components, size reduction of (CGLP), and ways of deriving multiple cuts from a disjunction. Finally, section 8 discusses computational results in branch-and-cut mode as well as in cut-and-branch mode.
MPI and OpenMP paradigms on cluster of SMP architectures: the vacancy tracking algorithm for multi-dimensional array transposition
Authors: Yun He, Chris H. Q. Ding
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

We investigate remapping multi-dimensional arrays on cluster of SMP architectures under OpenMP, MPI, and hybrid paradigms. Traditional method of array transpose needs an auxiliary array of the same size and a copy back stage. We recently developed an in-place method using vacancy tracking cycles. The vacancy tracking algorithm outperforms the traditional 2-array method as demonstrated by extensive comparisons. The independence of vacancy tracking cycles allows efficient parallelization of the in-place method on SMP architectures at node level. Performance of multi-threaded parallelism using OpenMP are tested with different scheduling methods and different number of threads. The vacancy tracking method is parallelized using several parallel paradigms. At node level, pure OpenMP outperforms pure MPI by a factor of 2.76. Across entire cluster of SMP nodes, the hybrid MPI/OpenMP implementation outperforms pure MPI by a factor of 4.44, demonstrating the validity of the parallel paradigm of mixing MPI with OpenMP.
Complexity in the interface age
Authors: Ubiquity staff
Venue: Ubiquity (2001)

Do you control technology or does it control you? Jeremy J. Shapiro talks about the power struggle in machine/human relationships and what it means today to be information-technology literate. Shapiro is a faculty member in the Human and Organization Development Program at the Fielding Graduate Institute.
Surface preparation and interfacial stability of high-k dielectrics deposited by atomic layer chemical vapor deposition
Authors: W. Tsai, R. J. Carter, H. Nohira, M. Caymax, T. Conard, V. Cosnier, S. DeGendt, M. Heyns, J. Petry, O. Richard, W. Vandervorst, E. Young, C. Zhao, J. Maes, M. Tuominen, W. H. Schulte, E. Garfunkel, T. Gustafsson
Venue: Microelectronic Engineering (2003)

The effects of various interface preparations on atomic layer chemical vapor deposition (ALCVD) deposited Al2O3 and ZrO2 dielectrics properties were investigated by X-ray photoelectron spectroscopy (XPS), attenuated total reflection Fourier transform infrared spectroscopy (ATR-FTIR), medium energy ion scattering (MEIS) and transmission electron microscopy (TEM). H-terminated Si, SiO2 and SiOxNy surfaces were used as substrates upon which the dielectric was deposited. Thermal annealing of SiO2 in NH3 forms an oxynitride; subsequent deposition of a ZrO2/Al2O3 bi-layer stack resulted in a capacitor structure with an equivalent oxide thickness (EOT) of ˜ 0.8 nm and a leakage current of 3 × 10-4 A/cm2 at - 1 + Vfb. This is in contrast to capacitor structures grown on H-terminated Si where high leakage was found. The growth of additional interfacial SiO2 during processing, a critical problem in nano-electronic device applications, is temperature dependent with ZrO2 exhibiting a higher oxygen permeability than Al2O3. Use of a polysilicon cap was shown to be effective at blocking oxygen absorption and transport through the high-k dielectrics, with stability up to 1100 °C.