ppxscal/embedding_network huggingface dataset:
Mixed mode XML query processing
Authors: Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis D. Viglas, Yuan Wang, Jeffrey F. Naughton, David J. DeWitt
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Querying XML documents typically involves both tree-based navigation and pattern matching similar to that used in structured information retrieval domains. In this paper, we show that for good performance, a native XML query processing system should support query plans that mix these two processing paradigms. We describe our prototype native XML system, and report on experiments demonstrating that even for simple queries, there are a number of options for how to combine tree-based navigation and structural joins based on information retrieval-style inverted lists, and that these options can have widely varying performance. We present ways of transparently using both techniques in a single system, and provide a cost model for identifying efficient combinations of the techniques. Our preliminary experimental results prove the viability of our approach.
Generalization in Holistic versus Analytic Processing of Faces
Authors: M. Bicego, A. A. Salah, E. Grosso, M. Tistarelli, L. Akarun
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The distinction between holistic and analytical (or feature-based) approaches to face recognition is widely held to be an important dimension of face recognition research. Holistic techniques analyze the whole face in order to recognize a subject, whereas analytical methodologies are devoted to the processing of different local parts of the face. This paper proposes a principled experimental comparison between these two approaches. Local and global face processing architectures that have access to similar feature representations and classifiers are implemented and tested under the same training and testing conditions. The analysis is performed with a recognition scenario on the difficult BANCA dataset, containing images acquired in degraded and adverse conditions. Different classifiers of increasing complexity are used in each scenario, and different classifier fusion methods are used for combining the local classifers. Our results show that holistic approaches perform accurately only with complex classifiers, whereas feature-based approaches work better with simple classifiers. We were able to show a clear boosting effect by fusing a large number of simple classifiers.
Protecting users from "themselves"
Authors: William Enck, Sandra Rueda, Joshua Schiffman, Yogesh Sreenivasan, Luke St. Clair, Trent Jaeger, Patrick McDaniel
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

Computer usage and threat models have changed drastically since the advent of access control systems in the 1960s. Instead of multiple users sharing a single file system, each user has many devices with their own storage. Thus, a user's fear has shifted away from other users' impact on the same system to the threat of malice in the software they intentionally or even inadvertently run. As a result, we propose a new vision for access control: one where individual users are isolated by default and where the access of individual user applications is carefully managed. A key question is how much user administration effort would be required if a system implementing this vision were constructed. In this paper, we outline our work on just such a system, called PinUP, which manages file access on a per application basis for each user. We use historical data from our lab's users to explore how much user and system administration effort is required. Since administration is required for user sharing in PinUP, we find that sharing via mail and file repositories requires a modest amount of administrative effort, a system policy change every couple of days and a small number of user administrative operations a day. We are encouraged that practical administration on such a scale is possible given an appropriate and secure user approach.
Expressive communication and social conventions in virtual worlds
Authors: John Carey
Venue: ACM SIGMIS Database (2007)

Technological innovation is always social innovation, if the application will be used by people. Yet, many technologies have been introduced with little concern for the social side of the innovation. Virtual worlds are intended to be immersive social experiences that can offer an alternative to face-to-face interactions, as well as provide new forms of human experience. People living in virtual worlds will need a rich array of communication tools if they are to get the kinds of emotional satisfaction that are possible in everyday social exchanges. Expressive communication is one of those tools. Expressive communication includes gestures, tone of voice, body orientation, and other nonverbal signals that are present in face-to-face settings. Two related issues are the sense of space people experience in virtual worlds and the social conventions that govern how people behave. One of our first research tasks will be to collect and analyze research from related areas that can inform us about human factors in virtual worlds. This would include research about videoconferencing, virtual reality, videogames, the Web, and computer mediated communication. Are people communicating effectively and do they feel comfortable in virtual worlds? Have communities emerged and, if so, what is the shape of those communities? In assessing expressive communication, it will be useful to understand how avatars, gestures, and voice are integrated into social interactions, and how these interactions differ from early text-based interactions such as forums.
Finiteness of the fixed point set for the simple genetic algorithm
Authors: Alden H. Wright, Michael D. Vose
Venue: Evolutionary Computation (1995)

The infinite population simple genetic algorithm is a discrete dynamical system model of a genetic algorithm. It is conjectured that trajectories in the model always converge to fixed points. This paper shows that an arbitrarily small perturbation of the fitness will result in a model with a finite number of fixed points. Moreover, every sufficiently small perturbation of fimess preserves the finiteness of the fixed point set. These results allow proofs and constructions that require finiteness of the fixed point set. For example, applying the stable manifold theorem to a fixed point requires the hyperbolicity of the differential of the transition map of the genetic algorithm, which requires (among other things) that the fixed point be isolated.
Asymptotic Weighted Periodic Oscillations for Dynamic Systems Caused by Impulse and Time Delay
Authors: Huifeng Li, Jinliang Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

It is known that the impulse and time delay can all bring oscillations to a system, which troubles the engineers time and time. So it is a meaningful matter to reveal the inherent mechanism of the system itself, particularly, the key point is to reveal the relationship between the required parameters and the asymptotic behavior of the system. To this end, a partial di®erential equation with impulse and time-delay is considered by using a new iteration scheme. The results show that the solution oscillates in a particular manner-- it has some \asymptotic weighted-periodicity", provided that the impulse, the time-delay and the coe±cients of the equa- tion meet a certain condition.
Sequential Machines Realizable with Delay Elements Only
Authors: W. A. Davis
Venue: IEEE Transactions on Computers (1970)

This note is concerned with the realization of sequential machines without logic, i. e., using delay elements only. The other approach to the problem deals with only the next-state behavior and tends to be rather long. A new approach is presented for not only the next-state behavior, but also for the complete behavior. Beginning with the output partitions, the predecessors are found until the process terminates with an input partition, a trivial partition, a previously found partition, or a nontrivial function of input and internal states. Whenever the latter occurs, the machine requires logic. With respect to the next-state behavior, it is first shown that a permutation machine is logic-free if and only if it is autonomous. Then since the next-state behavior of a feedback-free machine is realizable without logic, a machine is logic-free realizable if and only if M, is autonomous.
MB++: An Integrated Architecture for Pervasive Computing and High-Performance Computing
Authors: David J. Lillethun, David Hilley, Seth Horrigan, Umakishore Ramachandran
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and consumers of stream data. The architecture encompasses several elements: The type server allows clients to dynamically inject transformation code that operates on data streams. The transformation engine executes dataflow graphs of transformations on high-performance computing resources. The stream server manages all data streams in the system and dispatches new dataflow graphs to the transformation engine. We have implemented the architecture and show performance results that demonstrate that our implementation scales well with increasing workload, commensurate with the available HPC resources. Further, we show that our implementation can exploit opportunities for parallelism in dataflow graphs, as well as efficiently sharing common subgraphs between dataflow graphs.
Control of a Heterogeneous Two-Server Exponential Queueing System
Authors: R. L. Larsen
Venue: IEEE Transactions on Software Engineering (1983)

A dynamic control policy known as "threshold queueing" is defined for scheduling customers from a Poisson source on a set of two exponential servers with dissimilar service rates. The slower server is invoked in response to instantaneous system loading as measured by the length of the queue of waiting customers. In a threshold queueing policy, a specific queue length is identified as a "threshold," beyond which the slower server is invoked. The slower server remains busy until it completes service on a customer and the queue length is less than its invocation threshold. Markov chain analysis is employed to analyze the performance of the threshold queueing policy and to develop optimality criteria. It is shown that probabilistic control is sub-optimal to minimize the mean number of customers in the system. An approximation to the optimum policy is analyzed which is computationally simple and suffices for most operational applications.
Poloidal-toroidal decomposition in a finite cylinder
Authors: Piotr Boronski, Laurette S. Tuckerman
Venue: Journal of Computational Physics (2007)

The Navier-Stokes equations in a finite cylinder are written in terms of poloidal and toroidal potentials in order to impose incompressibility. Regularity of the solutions is ensured in several ways: First, the potentials are represented using a spectral basis which is analytic at the cylindrical axis. Second, the non-physical discontinuous boundary conditions at the cylindrical corners are smoothed using a polynomial approximation to a steep exponential profile. Third, the nonlinear term is evaluated in such a way as to eliminate singularities. The resulting pseudo-spectral code is tested using exact polynomial solutions and the spectral convergence of the coefficients is demonstrated. Our solutions are shown to agree with exact polynomial solutions and with previous calculations of axisymmetric vortex breakdown and of onset of non-axisymmetric helical spirals. Parallelization by azimuthal wavenumber is shown to be highly effective.
TAPER: A generic framework for establishing an offshore development center
Authors: Gerd Hofner, V S. Mani
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Increasingly software product development is being globally distributed. Earlier research has discussed the challenges of global software development and practices to mitigate them. We describe a generic framework for establishing offshore development centers that is based on good practices to overcome these challenges. We share our successful experience in applying this framework to a new offshore software development center in India for a German organization. We believe that the framework scales multiple engagement models.
Adapting Game Technology to Support Software Engineering Process Teaching: From SimSE to MO-SEProcess
Authors: Qing Zhu, Tao Wang, Shenglong Tan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

It is well known that traditional educational techniques can be complemented by simulation to achieve a more effective learning experience. One would expect the same phenomenon to be true in software development. Meanwhile, a typical software engineering course fails to teach its students many of the skills needed in software development organizations. Because lectures and class projects alone cannot adequately teach about the software process, we have used a pair of games in which the process is simulated, giving students an opportunity to practice it firsthand. SimSE is an educational computer simulation of software process and MO- SEProcess is a Multiplayer Online Software Engineering Process game based on SimSE.
Calder: enabling grid access to data streams
Authors: Nithya Vijayakumar, Ying Liu, B. Plale
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This paper presents an experimental evaluation of a grid-based continuous query solution to access data streams. The results presented in this study are mixed, however. We are migrating to a netCDF-based streaming model to measure system behavior in a setting that more accurately reflects a real use scenario. We are also working on enabling approximate query processing support to Calder to deal with sudden drop offs and changes in stream rates.
An Architecture for Secure and Accountable Multicasting
Authors: J. William Atwood
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Delivery of streaming media to individual users is very successful, and the e-commerce models for this are well established, based on a one-to-one relationship between the purchaser and the content provider. However, as the demand for a particular product goes up, it is possible to exceed the processing limit of the content provider. The use of multicast distribution technology can lower the processing needs of the content provider and the bandwidth needs of the network operator. However, it requires the introduction of security features (to prevent theft by non-purchasers) and distributed accounting features (to collect revenue from the multiple purchasers). We identify the parties that participate in a multicast session, either before the session or during it. We then discuss the communications paths and security requirements that exist among and within these parties, for the support of this secure, accountable multicasting. We present an enhanced multicasting architecture, which enables the necessary security and accounting features, while keeping the additional load on the routers at a minimum. We then extend the architecture to facilitate deployment of multicast in parts of the network where no "native" multicast support is available.
Efficient least squares fusion of MRI and CT images using a phase congruency model
Authors: Alexander Wong, William Bishop
Venue: Pattern Recognition Letters (2008)

This paper presents an efficient and robust approach for MRI-CT image fusion using a phase congruency model. The fast fourier transform (FFT) is used to efficiently evaluate the similarity cost function. This approach is largely invariant to pixel intensity mappings.
Discovery and inclusion of SOFA score episodes in mortality prediction
Authors: Tudor Toma, Ameen Abu-Hanna, Robert-Jan Bosman
Venue: Journal of Biomedical Informatics (2007)

Predicting the survival status of Intensive Care patients at the end of their hospital stay is useful for various clinical and organizational tasks. Current models for predicting mortality use logistic regression models that rely solely on data collected during the first 24h of patient admission. These models do not exploit information contained in daily organ failure scores which nowadays are being routinely collected in many Intensive Care Units. We propose a novel method for mortality prediction that, in addition to admission-related data, takes advantage of daily data as well. The method is characterized by the data-driven discovery of temporal patterns, called episodes, of the organ failure scores and by embedding them in the familiar logistic regression framework for prediction. Our method results in a set of D logistic regression models, one for each of the first D days of Intensive Care Unit stay. A model for day d=
Research on Store XML Data in Relational Database Based on XML Schema
Authors: XIE Yi-wu, WANG Chen-yang, CAO Zhi-ying, CHEN Yan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Firstly, the problem of XML data management is analyzed, and some storage methods of XML data are discussed. Secondly, the method converting XML Schema into relational schema is proposed. Finally, the hierarchical and sequential characteristics are taken fully into consideration during the storage XML data into RDB. The method of create XML tree and algorithm of the storage of XML data is proposed. Experimental results show that the proposed method betters the performance of XML file management.
A measurement study of the structured overlay network in P2P file-sharing systems
Authors: Mo Zhou, Yafei Dai, Xiaoming Li
Venue: Advances in Multimedia (2007)

The architecture of P2P file-sharing applications has been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, and robustness of the system, and to make it free from single-point failure. We believe that the measurement study of the overlay network used in the real filesharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, a modified client is designed to provide view to the overlay network from a single-user vision. Second, the instances of crawler programs deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We also find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDoS attack can be launched.
Binocular Stereo Matching Algorithm for Wide Baseline Based on Stable Extremal Regions
Authors: Zhu-lin Li, Zong-tao Zhao, Hong-lei Zhang, Yan Ma
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Stereo matching with regions is a master method for binocular image matching of wide baseline. It is most difficult that extracting invariant region. Stable extremal region(SER) is proposed in this paper, and its extracting algorithm. To magnify the intensity change and identify its edge easily, the exponent transform has been used. Then, the affine invariant moments of SER and the Euclid- distance between the region and another are computed using in measuring similarity. The experiment result show the extremal points locate accurately, the SER are stable, and correspondence regions are exact, it is improved to 70.9%.
Towards a system for reusable 3D interaction techniques
Authors: Andrew Ray, Doug A. Bowman
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Although 3D interaction techniques (3DITs) such as the Go-Go technique for object manipulation can be conceptually very simple, implementing these techniques can be a difficult task. Hidden complexities are often revealed at the low-level implementation stage. VR toolkits, which are commonly used to implement 3DITs, solve the problem of allowing applications to run in any hardware environment, but rarely provide support for the technique development process or technique reuse. Because VR toolkits are not interoperable, 3DIT developers cannot share their working techniques with others. In this paper, we describe IFFI, a toolkit that has been designed specifically to support 3DIT development and to allow for reuse of techniques in different VR toolkits. We are using IFFI to move towards the goal of implementing a library of reusable 3DITs to help increase their usage, increase consistency, and provide a foundation for future technique development.
Proceedings of the 2007 ACM workshop on Recurring malcode
Venue: Workshop On Rapid Malcode (2007)

On behalf of the program committee, it is my great pleasure to present the proceedings of the 5th ACM Workshop on Recurring Malcode (WORM). Internet-wide infectious epidemics have emerged as one of the leading threats to information security and service availability. Self-propagating threats, often termed worms, exploit software weaknesses, hardware limitations, Internet topology, and the open Internet communication model to compromise large numbers of networked systems. Malware is increasingly used as a beachhead to launch further malicious activities, such as installing spyware, deploying phishing servers and spam relays, or performing information espionage. Unfortunately, current operational practices still face significant challenges in containing these threats as evidenced by the rise in automated botnet networks and the continued presence of worms released years ago This year's workshop continues the efforts of the previous years by providing a forum for exchanging ideas, increasing understanding, and relating experiences on malicious code. To this end, we invited participation from a wide range of communities, including researchers and practitioners from academia, industry, and the government. The WORM program committee received 30 paper submissions from all over the world. All submissions were carefully reviewed by at least three members of the program committee and judged on the basis of scientific novelty, importance to the field, and technical quality. The final selection took place at the program committee meeting held in Boston, USA, on August 7th 2007. The program committee selected nine papers based on quality, focus, and the likelihood of stimulating productive discussion at the workshop. Moreover, the program committee also solicited invited talks from leading practitioners to share their perspectives
Technology Constraints, Present and Future
Authors: P. W. J. Verhofstadt
Venue: Computer (1976)

The technology session of the Asilomar Workshop was oriented mainly towards the constraints of future technologies rather than towards discussing present generally-accepted processes. Four specific areas were highlighted: testing of micro-processors, the future of silicon-on-sapphire (SOS) approaches, the impact of integrated injection logic (I2L), and the role of less-high-density technologies (TTL, ECL, CMOS) in microprocessor development. 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