ppxscal/embedding_network huggingface dataset:
Verifying the Concept of Union Slices on Java Programs
Authors: Attila Szegedi, Tamas Gergely, Arpad Beszedes, Tibor Gyimothy, Gabriella Toth
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Static program slicing is often proposed for software maintenance-related tasks. Due to different causes static slices are in many cases overly conservative and hence too large to reduce the program-part of interest meaningfully. In this paper we further investigate the concept of union slices, which are defined as the unions of dynamic slices computed for the same (static) slicing criteria, but for different executions of the program. We verify on real-world Java programs their usefulness as a replacement to static slices. For this we investigate the sizes of a number of backward and forward dynamic and union slices, also by comparing them to the corresponding static slices. Our results show that the union slices are precise enough (backward slices are 5 20% of the program and forward slices are 5 10%, the corresponding static slices being 25-45%), and that with the saturation of the overall coverage given many different executions, union slices also reach a steady level and typically do not grow further by adding new test cases.
Empowering distributed workflow with the data capacitor: maximizing lustre performance across the wide area network
Authors: Stephen C. Simms, Gregory G. Pike, S. Teige, Bret Hammond, Yu Ma, Larry L. Simms, C. Westneat, Douglas A. Balog
Venue: Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches (2007)

The Indiana University Data Capacitor is a 535 TB distributed parallel filesystem constructed for short to mid term storage of large research data sets. Spanning multiple, geographically distributed compute, storage, and visualization resources and showing unprecedented performance across the wide area network, the Data Capacitor's Lustre filesystem can be used as a powerful tool to accommodate loosely coupled, service oriented computing. In this paper we demonstrate single file/single client write performance from Oak Ridge National Laboratory to Indiana University in excess of 750 MB/s. We evaluate client parameters that will allow widely distributed services to achieve data transfer rates closely matching those of local services. Finally, we outline the tuning strategy used to maximize performance, and present the results of this tuning.
Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms
Authors: Markus Flierl, Bernd Girod
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Motion-compensated lifted wavelets have received much interest for video compression. While they are biorthogonal, they may substantially deviate from orthonormality due to motion compensation, even if based on an orthogonal or near-orthogonal wavelet. A temporal transform for video sequences that maintains orthonormality while permitting flexible motion compensation would be very desirable. We have recently introduced such a transform for integer- pel accurate motion compensation from one previous frame. In this paper, we extend this idea to half-pel accurate motion compensation. Orthonormality is maintained for arbitrary half-pel motion compensation by cascading a sequence of incremental orthogonal transforms. The half-pel intensity values are obtained by averaging neighboring integer-pel positions. Depending on the number of averaged integer-pel values, we use different types of incremental transforms. The cascade of incremental transforms allows us to choose in each step the optimal type of incremental transform and, hence, the optimal half-pel position. Half-pel motion-compensated blocks of arbitrary shape and size can be used as the granularity of the cascade can be as small as one pixel. The new half-pel accurate motion-compensated orthogonal video transform compares favorably with the integer-pel accurate orthogonal transform.
Charity telethon supported by Tcl/Tk
Authors: Dave Griffin
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

A set of Tcl/Tk Version 8 scripts supports a telethon that raises money for needy families. This paper describes the system and how it was constructed. Because the system uses nearly every major feature of the Tcl and Tk system, including the Tcl web server, this paper serves as an example that emphasizes the power of universal scripting in both the development and deployment of a distributed system.
Efficient Monitoring Algorithm for Fast News Alerts
Authors: Ka Cheung Sia, Junghoo Cho, Hyun-Kyu Cho
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Recently, there has been a dramatic increase in the use of XML data to deliver information over the Web. Personal Weblogs, news Web sites, and discussion forums are now publishing RSS feeds for their subscribers to retrieve new postings. As the popularity of personal Weblogs and RSS feeds grows rapidly, RSS aggregation services and blog search engines have appeared, which try to provide a central access point for simpler access and discovery of new content from a large number of diverse RSS sources. In this paper, we study how the RSS aggregation services should monitor the data sources to retrieve new content quickly using minimal resources and to provide its subscribers with fast news alerts. We believe that the change characteristics of RSS sources and the general user access behavior pose distinct requirements that make this task significantly different from the traditional index refresh problem for Web search engines. Our studies on a collection of 10,000 RSS feeds reveal some general characteristics of the RSS feeds and show that, with proper resource allocation and scheduling, the RSS aggregator provides news alerts significantly faster than the best existing approach.
Parallel Computation of the Singular Value Decomposition on Tree Architectures
Authors: B. B. Zhou, R. P. Brent
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We describe a new Jacobi ordering for parallel computation of SVD problems. The ordering uses the high bandwidth of a perfect binary fat-tree to minimise global interprocessor communication costs. It can thus be implemented efficiently on fat-tree architectures.
Analytic study of models of complex non-newtonian fluids
Authors: Peter Constantin, Leonid Ryzhik
Venue:  (2006)

We study the existence and regularity of models of complex non-Newtonian fluids containing liquid crystalline polymers. We prove a local existence result for a type I Smoluchowski-Stokes system and a global existence result for a type II Smoluchowski Navier-Stokes system. The proof is based on an apriori logarithmic estimate for the Navier-Stokes equations.We consider a simplified version of the type II Smoluchowski Navier-Stokes system so that the system reduces to just one equation, the Smoluchowski equation. In this case the flow is externally given and has a simple structure: it has constant gradient matrix. We prove that the stationary solutions at high flow intensity can be of only two types: isotropic or nematic. We also analyze the dynamical behavior of the above system. When the flow influence is neglected the equation has a gradient structure. A simple flow generates significant structural changes in the dynamics. We study the case of an externally imposed flow with homogeneous gradient. We show that the equation is still dissipative but new phenomena appear. The dynamics depend on both the concentration intensity and the structure of the flow. In certain limit cases the equation has a gradient structure, in an appropriate reference frame, and the solutions evolve to either a steady state or a tumbling wave. For small perturbations of the gradient structure some features of the gradient dynamics survive: for small concentrations the solutions evolve to a steady state and for high concentrations there is a tumbling wave.
A Proposed Algorithm for Optimizing the Toolpoint Path of the Small-Hole EDM-Drilling
Authors: Tawfik T. EL-Midany, Ahmed M. Kohail, Hamdy Tawfik
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

The main objective of the present work was to propose a small-hole EDM-drilling methodology using the heuristic search techniques to calculate the optimal toolpoint path that minimizes the small-hole EDM-drilling total machining time. Firstly, the tool points of the small-hole EDM-drilling are formulated as a Traveling Salesman Problem (TSP), and a new heuristic search technique algorithm of Guided Fast Local Search (GFLS) is proposed; to find the optimal small-hole EDM-drilling toolpoint path. This optimal toolpoint path; is the path that passes through all toolpoints and has the minimum machining time.The proposed algorithm implemented in Visual C ++, and was applied to many examples, the results showed its quickness and robustness.
Stream execution on wide-issue clustered VLIW architectures
Authors: Shan Yan, Bill Lin
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

This paper investigates the mapping of stream programs to wide-issue clustered VLIW processors so that designers can leverage their existing investments in VLIW-based platforms to harness the advantages of stream programming.
Software generation of practically strong random numbers
Authors: Peter Gutmann
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

Although much thought usually goes into the design of encryption algorithms and protocols, less consideration is often given to equally important issues such as the selection of cryptographically strong random numbers, so that an attacker may find it easier to break the random number generator than the security system it is used with. This paper provides a comprehensive guide to designing and implementing a practically strong random data accumulator and generator which requires no specialised hardware or access to privileged system services. The performance of the generator on a variety of systems is analysed, and measures which can make recovery of the accumulator/generator state information more difficult for an attacker are presented. The result is an easy-to-use random number generator which should be suitable even for demanding cryptographic applications.
High-impact Refactoring Based on Architecture Violations
Authors: Fabrice Bourqun, Rudolf K. Keller
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software refactoring has been identified as a key technique for the maintenance and evolution of object oriented systems. Most interesting are high-impact refactorings, that is, refactorings that have a strong impact on the quality of the system's architecture. "Bad smells" and code metrics have been suggested as means for identifying refactoring needs. According to our experience these techniques are useful, yet, in order to spot opportunities for high-impact refactorings, they should be complemented with the analysis of architectural violations. The subject of this report is a mid-sized Java enterprise application from the telecommunications domain whose functionality had to be radically extended. We show how we combined several tools and techniques to identify opportunities for high-impact refactorings, and discuss the resulting architecture, the refactoring process, too1 support as well as related experiences.
Rapid Automated Polygonal Image Decomposition
Authors: Sriram Swaminarayan, Lakshman Prasad
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

We present RaveGrid, a software that efficiently converts a raster image to a scalable vector image comprised of polygons whose boundaries conform to the edges in the image. The resulting vector image has good visual quality and fidelity and can be displayed at various sizes and on various display screen resolutions. The software can render vector images in the SVG (Scalable Vector Graphics) format or in EPS (Encapsulated Postscript). The ubiquity of image data in graphics, on the Web, and in communications, as well as the wide range of devices, from big screen TVs to hand-held cellular phones that support image display, calls for a scalable and more manipulable representation of imagery. Moreover, with the growing need for automating image-based search, object recognition, and image understanding, it is desirable to represent image content at a semantically higher level by means of tokens that support computer vision tasks.
Unsupervised clustering of ambulatory audio and video
Authors: B. Clarkson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A truly personal and reactive computer system should have access to the same information as its user, including the ambient sights and sounds. To this end, we have developed a system for extracting events and scenes from natural audio/visual input. We find our system can (without any prior labeling of data) cluster the audio/visual data into events, such as passing through doors and crossing the street. Also, we hierarchically cluster these events into scenes and get clusters that correlate with visiting the supermarket, or walking down a busy street.
Exploring mutual engagement in creative collaborations
Authors: Nick Bryan-Kinns, Patrick G. T. Healey, Joe Leach
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Group creativity is a fundamental form of human activity. In this paper we explore what constitutes mutually engaging interaction between people _ interaction in which creative sparks fly and we lose ourselves in the joint action. In this paper we present the results of an experiment to compare the effect representation of identity in a user interface, and task instruction, has on mutual engagement between remote participants. Surprisingly the results indicate that providing no cues to identity increased mutual engagement between participants. We also discuss the appropriateness of quantitative, qualitative, and self-report data for identifying points of mutual engagement.
Secure information flow and program logics
Authors: Lennart Beringer, Martin Hofmann
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-line non-interference, multi-level security and flow sensitivity for a while language, we show how typing derivations may be used to automatically generate proofs in the program logic that certify the absence of illicit flows. In addition, we present proof rules for baseline non-interference for object-manipulating instructions, As a consequence, standard verification technology may be used for verifying that a concrete program satisfies the noninterference property. Our development is based on a formalisation of the encodings in Isabelle/HOL.
Separating Pistachio Varieties Using Automatic Trainable Classifier
Authors: M. Omid, A. Mahmoudi, A. Aghagolzadeh, A. M. Borghaee
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

In this study an automatic trainable classifier, based on artificial neural network (ANN), for separating four different varieties of pistachio nuts is presented. In total 3200 sample data were selected in the development of the ANN models. Signal analysis procedures from time-domain and frequency-domain as well as statistical procedures were used for feature extraction. By performing principal component analysis on the input data set, more than 98% reduction in the dimension of the feature vector was achieved. Altogether 40 features were selected as input vector to ANN models. In order to find optimal configuration, several architectures, each having different number of neurons in the hidden layer, were designed and evaluated. The ANN models were trained using the gradient descent with momentum learning rule. Optimal configuration had a 40-12-4 structure, i.e., a network having one hidden layer with 12 neurons. This selection was based on the minimization of mean square error (MSE) and correct separation rates (CSR). The estimated MSE and CSR were 0.018 and 97.5%, respectively. I.e., only 2.5 % of pistachio nuts were misclassified.
Geographic locality of IP prefixes
Authors: Michael J. Freedman, Mythili Vutukuru, Nick Feamster, Hari Balakrishnan
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Information about the geographic locality of IP prefixes can be useful for understanding the issues related to IP address allocation, aggregation, and BGP routing table growth. In this paper, we use traceroute data and geographic mappings of IP addresses to study the geographic properties of IP prefixes and their implications on Internet routing. We find that (1) IP prefixes may be too coarse-grained for expressing routing policies, (2) address allocation policies and the granularity of routing contribute significantly to routing table size, and (3) not considering the geographic diversity of contiguous prefixes may result in overestimating the opportunities for aggregation in the BGP routing table.
Composite Performance and Reliability Analysis for Hypercube Systems
Authors: Samir M. Koriem
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In this paper we propose a novel technique to model and ana¬ lyze the performability of parallel and distributed architectures using GSPN-reward models.
Valuating Software Service Development: Integrating COCOMO II and Real Options Theory
Authors: Brendan Tansey, Eleni Stroulia
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Modern businesses increasingly attempt to innovate by offering competitive, value-added services, as opposed to goods, and an important requirement in this regard is the evolution of their software infrastructure. Most related strategic decision making relies on model-based estimation of the costs and benefits involved with alternative courses of action. Therefore, reasoning about the economic tradeoffs related to the evolution and management of software is becoming an increasingly relevant problem. More specifically, we are interested in the problem of estimating the relative costs of managing, evolving, and adapting software applications in light of the business value this activity can generate in terms of enabling new and/or improved service offerings.
Lattice structure on fuzzy congruence relations of a hypergroupoid
Authors: M. Bakhshi, R. A. Borzooei
Venue: Information Sciences: an International Journal (2007)

In this manuscript, we first define the notion of fuzzy (left, right) congruence relation on a hypergroupoid and then we investigate the lattice structure of the set of these fuzzy relations. Finally, we show that a special class of fuzzy equivalence relations on the hypergroupoid forms a distributive lattice.
Integrating ergonomics into engineering: Empirical evidence and implications for the ergonomists: Research Articles
Authors: Ole Broberg
Venue: Human Factors in Ergonomics Manufacturing (2007)

Engineering design is a strong determinant of workplace ergonomics. A survey among 680 engineers in 20 Danish enterprises indicated that engineers are not aware that they influence the work environment of other people. Ergonomics had a low rating among engineers, perhaps because neither management nor safety organizations expressed any expectations in this area. The study further indicated that effects of ergonomics training in engineering schools were very limited. The engineering cultures in enterprises, together with other organizational factors, are suggested to be of greater importance than the professional training. The implications for industrial ergonomists might be an acknowledgement of the role as change agent when trying to integrate ergonomics into engineering. In doing so, they need also to acknowledge that engineers are widely different. They have different backgrounds and a &ldquo;sensitivity&rdquo; to ergonomics depending on their current engineering domain, tasks, organizational position, and the industrial branch of their organization. &copy; 2007 Wiley Periodicals, Inc. Hum Factors Man 17: 353&ndash;366, 2007.
A statistical approach for image difficulty estimation in x-ray screening using image measurements
Authors: Adrian Schwaninger, Stefan Michel, Anton Bolfing
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

The relevance of aviation security has increased dramatically at the beginning of this century. One of the most important tasks is the visual inspection of passenger bags using x-ray machines. In this study, we investigated the role of image based factors on human detection of prohibited items in x-ray images. Schwaninger, Hardmeier, and Hofer (2004, 2005) have identified three image based factors: View Difficulty, Superposition and Bag Complexity. This article consists of 4 experiments which lead to the development of a statistical model that is able to predict image difficulty based on these image based factors. Experiment 1 is a replication of earlier findings confirming the relevance of image based factors as defined by Schwaninger et al. (2005) on x-ray detection performance. In Experiment 2, we found significant correlations between human ratings of image based factors and human detection performance. In Experiment 3, we introduced our image measurements and found significant correlations between them and human detection performance. Moreover, significant correlations were found between our image measurements and corresponding human ratings, indicating high perceptual plausibility. In Experiment 4, it was shown using multiple linear regression analysis that our image measurements can predict human performance as well as human ratings can. Applications of a computational model for threat image projection systems and for adaptive computer-based training are discussed.
WebMiner--Anatomy of Super Peer Based Incremental Topic-Specific Web Crawler
Authors: Om Vikas, Nitin J. Chiluka, Purushottam K. Ray, Girraj Meena, Akhil K. Meshram, Amit Gupta, Abhishek Sisodia
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This paper introduces "WebMiner", a super-peer based P2P system for building an incremental topic-specific web crawler. This develops a topic-based repository of web pages that would later be used in the construction of ontologies. Current crawlers suffer from centralized architecture, having single point of failure and heavy load. Super-peer systems strike a balance between the inherent efficiency of centralized search and the autonomity, load balancing and robustness to attacks, provided by distributed search, with heterogeneity of capabilities across peers. In this paper, we discuss the architecture of WebMiner in detail including the construction of the super-peer overlay network and the working of the system, which includes feature of crawling the hidden web.