ppxscal/embedding_network huggingface dataset:
A sparse program dependence graph for object oriented programming languages
Authors: Charles E. Hughes
Venue:  (2006)

The Program Dependence Graph (PDG) has achieved widespread acceptance as a useful tool for software engineering, program analysis, and automated compiler optimizations. This thesis presents the Sparse Object Oriented Program Dependence Graph (SOOPDG), a formalism that contains elements of traditional PDGs adapted to compactly represent programs written in object-oriented languages such as Java. This formalism is called sparse because, in contrast to other OO and Java-specific adaptations of PDGs, it introduces few node types and no new edge types beyond those used in traditional dependence-based representations. This results in correct program representations using smaller graph structures and simpler semantics when compared to other OO formalisms. We introduce the Single Flow to Use (SFU) property which requires that exactly one definition of each variable be available for each use. We demonstrate that the SOOPDG, with its support for the SFU property coupled with a higher order rewriting semantics, is sufficient to represent static Java-like programs and dynamic program behavior. We present algorithms for creating SOOPDG representations from program text, and describe graph rewriting semantics. We also present algorithms for common static analysis techniques such as program slicing, inheritance analysis, and call chain analysis. We contrast the SOOPDG with two previously published OO graph structures, the Java System Dependence Graph and the Java Software Dependence Graph. The SOOPDG results in comparatively smaller static representations of programs, cleaner graph semantics, and potentially more accurate program analysis. Finally, we introduce the Simulation Dependence Graph (SDG). The SDG is a related representation that is developed specifically to represent simulation systems, but is extensible to more general component-based software design paradigms. The SDG allows formal reasoning about issues such as component composition, a property critical to the creation and analysis of complex simulation systems and component-based design systems.
Autorating: getting individual marks from team marks and enhancing teamwork
Authors: R. W. Brown
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

In most academic training institutes, projects performed by teams are used because of their efficient use of teaching and material resources. With the use of teams comes attendant problems. How to assess individual performance within teams from the results of team assessments? More importantly, how to ensure that individuals contribute equitably to team outcomes-the "passenger" syndrome? The Autorating system not only allows derivation of individual marks from team marks, but by devolving some power to team members in determining individual marks, the system promotes effective teamwork and discipline. This, in turn, promotes individual learning in team projects. The system is not a student self marking system, but combines the best features of supervisor team assessment with weightings determined by the team members. The system has been in widespread use for more than four years in the Departments of Communication and Electronic Engineering, and Computer Systems Engineering at the RMIT. With correct application, it has proven effective and reliable and is simple to implement, requiring only the use of a spreadsheet package.
Fast algorithm for the 3-D discrete Hartley transform
Authors: S. Boussakta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The application of multidimensional fast transforms to solve problems in image processing, motion analysis and multidimensional signal processing is growing. The discrete Hartley transform (DHT) is one of the new tools used in many applications including signal and image processing, digital filters, communication etc. This transform is closely related to the discrete Fourier transform, but it is a real-to-real transform and it has the same inverse. Many fast algorithms have been developed for the calculation of one-dimensional DHT. These algorithms are then used for the calculation of multidimensional Hartley transform through an intermediate transform using the row-column approach. However proper multidimensional algorithms can be more efficient and need to be developed. It is the aim of this paper to derive the 3-D vector radix for the 3-D discrete Hartley transform. The arithmetic operations of this algorithm are compared to similar algorithms using the row-column approach.
Modeling Environment for Component Model Checking from Hierarchical Architecture
Authors: Pavel Parizek, Frantisek Plasil
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Application of model checking to isolated software components is not directly possible because a component does not form a complete program - the problem of missing environment occurs. A solution is to create an environment of some form for the component subject to model checking. As the most general environment can cause model checking of the component to be infeasible, we model the environment on the basis of a particular context the component is to be used in. More specifically, our approach exploits hierarchical component architecture and component behavior specification defined via behavior protocols, all that provided in ADL. This way, the environment represents the behavior of the rest of the particular application with respect to the target component. We present an algorithm for computing the model of environment's behavior that is based on syntactical expansion and substitution of behavior protocols.
Improving the write performance of an NFS server
Authors: Chet Juszczak
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

The Network File System (NFS) utilizes a stateless protocol between clients and servers; the major advantage of this statelessness is that NFS crash recovery is very easy. However, the protocol requires that data modification operations such as write be fully committed to stable storage before replying to the client. The cost of this is significant in terms of response latency and server CPU and I/O loading. This paper describes a write gathering technique that exploits the fact that there are often several write requests for the same file presented to the server at about the same time. With this technique the data portions of these writes are combined and a single metadata update is done that applies to them all. No replies are sent to the client until after this metadata update has been fully committed, thus the NFS crash recovery design is not violated. This technique can be used in most NFS server implementations and requires no client modifications.
2D and 3D Neural-Network Based Visualization of High-Dimensional Biomedical Data
Authors: Urska Cvek, Marjan Trutschl, John C. Cannon, Rona S. Scott, Robert E. Rhoads
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this paper we integrate self-organizing map algorithm (SOM) with scatter plot and Radviz, extending these visualizations into the third dimension and reducing overlap. Classic visualizations are used as the twodimensional base, combined with a self-organizing map that extends them into the third dimension, with an adjusted neighborhood function. This approach solves the problem of overlap where more than one point plots to the same space and uncovers additional information about relationships inherent in high-dimensional data sets, including distribution of points, outliers and associations. Case studies are presented on a microarray and miRNA data sets.
Boosting for transfer learning
Authors: Wenyuan Dai, Qiang Yang, Gui-Rong Xue, Yong Yu
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However, in many cases, this identical-distribution assumption does not hold. The assumption might be violated when a task from one new domain comes, while there are only labeled data from a similar old domain. Labeling the new data can be costly and it would also be a waste to throw away all the old data. In this paper, we present a novel transfer learning framework called TrAdaBoost, which extends boosting-based learning algorithms (Freund & Schapire, 1997). TrAdaBoost allows users to utilize a small amount of newly labeled data to leverage the old data to construct a high-quality classification model for the new data. We show that this method can allow us to learn an accurate model using only a tiny amount of new data and a large amount of old data, even when the new data are not sufficient to train a model alone. We show that TrAdaBoost allows knowledge to be effectively transferred from the old data to the new. The effectiveness of our algorithm is analyzed theoretically and empirically to show that our iterative algorithm can converge well to an accurate model.
Knowledge Management Systems Track Introduction
Authors: Murray Jennex, Dave Croasdell
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

After a very successful inaugural year at HICSS 39, the Knowledge Management Systems Track returns with another great set of papers. We trust participants will continue to find the KMS track interesting and useful. As always we want to foster engaging research in KMS and associated topics. The track includes manuscripts that cover Knowledge Management (KM) Organizational Memory (OM) Organizational Learning (OL). The track seeks to preserve and grow the strong KM community developed at HICSS over the last fourteen years. We appreciate the efforts of all our colleagues who submitted and/or reviewed papers -- your ideas, insights and comments are invaluable. Through the collective efforts of all those associated with the track, we continue to see interrelated research domains grow and flourish with respect to KMS research. The sustained interest is reflected in the ninety four submissions this year. The profile of accepted papers reflects the breadth and diversity of the research domain that the KMS track supports.
Disjoint complete minors and bipartite minors
Authors: Andrew Thomason
Venue: European Journal of Combinatorics (2007)

Let r, s and t be integers and let c(r) be such that every graph G with at least c(r)|G| edges has a K"r minor. We prove that there is a function f"r","s","t(n), with f"r","s","t(n)=o(n) as n->~, such that every graph of order n and having at least (c(r)+s-1)n+f"r","s","t(n) edges contains either t disjoint K"r minors or a K"s","t minor.
Generalizing TOPSIS for fuzzy multiple-criteria group decision-making
Authors: Yu-Jie Wang, Hsuan-Shih Lee
Venue: Computers Mathematics with Applications (2007)

In this paper, we generalize TOPSIS to fuzzy multiple-criteria group decision-making (FMCGDM) in a fuzzy environment. TOPSIS is one of the well-known methods for multiple-criteria decision-making (MCDM). Most of the steps of TOPSIS can be easily generalized to a fuzzy environment, except max and min operations in finding the ideal solution and negative ideal solution. Thus we propose two operators Up and Lo which satisfy the partial ordering relation on fuzzy numbers to the generalization of TOPSIS. In generalized TOPSIS, these two operations (Up and Lo) are employed to find ideal and negative ideal solutions under a fuzzy environment. Then the FMCGDM problem can be solved effectively and efficiently.
Applying Tunstall Coding in the existing SEED format for Seismographic Data
Authors: Edwin S. Hong, Shu-Fang Newman
Venue: Proceedings of the 2007 Data Compression Conference (2007)

The Standard for the Exchange of Earthquake Data (SEED) is a commonly used file format for recording seismographic data. The data description language (DDL) is part of the specification of the SEED format; it is used to describe the way in which the data has been encoded in the SEED file. All SEED files contain a piece of DDL code that describes how to read the data contained in the file. In this project, we explore the best possible way of compressing seismographic data losslessly under the constraint that it must be describable in DDL. Since DDL is not a Turing-complete language, it is impossible to implement many standard compression algorithms with it. However, we show it is possible to implement a modified Tunstall code under DDL that produces files that are on average 14% smaller than the traditionally used Steim2 compression technique. We also compare our results with a standard linear predictive coding scheme (which is not implementable in DDL) and show that our technique is on average 18% worse on the same set of files.
Application of the reversible jump Markov chain Monte Carlo method to real-life propagation measurements
Authors: J.-R. Larocque
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper shows the application of the reversible jump Markov chain Monte Carlo (RJMCMC) method to a joint detection-estimation angle-of-arrival (AOA) problem, with simulations and processing of real-life propagation measurements. A minimum number of assumptions are made as the number of sources impinging the array, their AOA and amplitude, as well as the noise variance, are considered random variables. The algorithm jointly estimates all these parameters by sampling the posterior distribution that is made up of the union of disjoint subspaces of different dimensions. We apply the RJMCMC technique to simulations and to real data to jointly detect and estimate the parameters and the noise characteristics. We also present an approach, using space projection, which avoids the manipulation of the nuisance parameters.
PROXSEM: Interest-Based Proximity Measure to Improve Search Efficiency in P2P Systems
Authors: Yann Busnel, Anne-Marie Kermarrec
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Peer-to-peer (P2P) file sharing systems are now at the origin of most of Internet traffic. Improving the performance of the query mechanism of such systems has generated a lot of interest both in industry and academia. In a P2P system, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the system. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. Nevertheless, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of peer-to-peer file sharing systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. In this paper we propose PROXSEM, a refined proximity measure taking into account peer generosity and file popularity. We evaluated the proposed solution by simulation against a real peer-to-peer file sharing system (eDonkey) workload and results show the effectiveness of the proposed approach. While peers generosity can easily be computed locally, file popularity may require a global knowledge of the system. We also propose in this paper an epidemic algorithm to compute in a fully decentralised fashion an estimation of files popularity.
A peer-to-peer message exchange scheme for large scale networked virtual environments
Authors: Y. Kawahara, H. Morikawa, T. Aoyama
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Massively multiplayer online games and other multi-user based networked applications are becoming a big business today. Such technology has long been researched in the area called networked virtual environments (Net-VE). With the recent deployment of broadband access technologies, the increase of the number of participants is putting pressure on the Net-VE systems. The conventional systems coped with the scalability problem by segmenting players onto multiple servers or multicast groups. limiting the number of users that could interact with each other. These schemes. however, force developers to invest enormous money on hardware and spend much time on building complex software systems. In this paper, we present a fully distributed communication protocol for large-scale networked virtual environments. As the entities in this scheme are directly connected to each other by unicast no special infrastructure such as multicast or costly central servers is needed. Simulation results show that this architecture is scalable to the increase of the number of participants in the Net-VE system.
Organizing Gaussian mixture models into a tree for scaling up speaker retrieval
Authors: J. E. Rougui, M. Gelgon, D. Aboutajdine, N. Mouaddib, M. Rziza
Venue: Pattern Recognition Letters (2007)

Numerous pattern recognition tasks set in the probabilistic framework face the following issue: it is expensive to evaluate the likelihood function for test data, when there are given very many candidate probabilistic models for explaining this data. We consider the application of this general and important problem to speaker recognition for indexing and retrieval purposes in radio archives. More precisely, we propose to reduce complexity at query time, by prior organization of speaker models into a hierarchy. This is very classically done for multi-dimensional vectors, but we propose herein a technique for building a hierarchy of probabilistic models, in the case these models take the form of a Gaussian mixture. From a closed-form approximation of Kullback-Leibler divergence between parent and children, an optimality criterion and an optimization technique are derived, from which we propose an efficient approach for building a tree of models, using clustering techniques (dendrogram-based or k-means-like). The proposed scheme is evaluated on real data.
Efficient implementation of video post-processing algorithms on the BOPS parallel architecture
Authors: D. Petrescu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Deblocking and deringing are two video post-processing techniques largely used to remove coding artifacts and improve the visual quality when rendering low bit rate coded video. The algorithms used to achieve these tasks are computationally intensive and usually require high speed processors to be able to run in real time. Efficient implementations of signal adaptive filters for video post-processing can be obtained using the specialized features of the parallel BOPS(R) DSP cores. The performance achieved by deblocking and deringing CIF and SDTV size video sequences on the MANTA/sup TM/ prototype chip are illustrated. It is shown that such complex tasks may be executed at low clock rates using the BOPS ManArray/sup TM/ technology. 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
Lab on a Chip for Live-Cell Manipulation
Authors: Gianni Medoro, Roberto Guerrieri, Nicolo Manaresi, Claudio Nastruzzi, Roberto Gambari
Venue: IEEE Design Test (2007)

Microelectronic technology allows precise manipulation of cells without any effect on their phenotype. This article shows that current fabrication and design techniques are spawning new methods in biotechnology with potential application for research, diagnosis, and therapy related to many severe diseases. Recent advances in life sciences have been achieved thanks to a convergence of information technology with new tools and machines for large-scale analysis of the structure of DNA, proteins, and cells. Although the possibility of obtaining information directly from DNA has been demonstrated, the complexity of this task is enormous and far from achievable with our current understanding of the basic processes that translate DNA into structures. Fortunately, IT can provide a bridge between DNA and cells. This article examines the possibility, recently provided by microelectronic technology, of monitoring, sorting, and analyzing vast populations of cells, with the ability to interact with each of them individually. Investigations carried out in recent years have shown that a few cells changing their behavior unexpectedly can induce deadly diseases such as cancer. Thus, the needs that these techniques aim to address are clear and urgent.
ACPR prediction of CDMA systems through statistical behavioural modelling of power amplifiers with memory
Authors: T. S. L. Goh, R. D. Pollard
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Behavioural models for power amplifiers (PA) have traditionally been developed based on conventional AM-AM and AM-PM curves from one-tone measurements, which discounts the presence of memory in the system. However, as signal bandwidth increases in spread spectrum systems, memory effects become more severe. These effects result from the frequency response of matching networks, nonlinear capacitances of the transistors and the response of the bias networks. Multi-stage high power amplifiers require more accurate behavioural models to provide a better description of memory effects and highly nonlinear characteristics than memoryless models based on single-tone transfer characteristics. This is achieved using measured two-tone transfer characteristics of the amplitude and phase of the fundamental, IM3 and IM5 components, which have highly nonlinear components that represent the amplifier's significant memory. A statistical technique is then applied which allows accurate, fast and efficient prediction of the adjacent channel power ratio (ACPR) of the communication system without time-consuming time-domain simulations.
Cryptanalysis of a Cognitive Authentication Scheme (Extended Abstract)
Authors: Philippe Golle, David Wagner
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

We present attacks against two cognitive authentication schemes [9] proposed at the 2006 IEEE Symposium on Security and Privacy. These authentication schemes are designed to be secure against eavesdropping attacks while relying only on human cognitive skills. They achieve authentication via challenge response protocols based on a shared secret set of pictures. Our attacks use a SAT solver to recover a user's secret key in a few seconds, after observing only a small number of successful logins. These attacks demonstrate that the authentication schemes of [9] are not secure against an eavesdropping adversary.
Making the Code Look Like the Design - Aspects and Other Recent Work
Authors: Gregor Kiczales
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The idea that programs should clearly reflect the design decisions they embody has a long history. Higher-level languages, syntactic macros, domain-specific languages, and intentional programming are different approaches to this common goal.