ppxscal/embedding_network huggingface dataset:
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Venue: Conference on Programming Language Design and Implementation (2008)

The Program Committee and I are pleased to present the proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation. This volume contains 34 papers selected out of 184 submissions. We believe this volume demonstrates that our field is vibrant, influential and expanding. We hope you find these papers innovative, informative, and exciting. In consultation with the program committee, I also selected two additional external reviewers. All together 837 reviews were collected from the PC and 371 external reviewers. In order to maintain the quality of this premier conference, it is important to get detailed and thoughtful reviews from the experts in the community. While arranging all these reviews was a nightmare, I am extremely appreciative of all of you who took on the review task and provided the PC with many important insights. Your reviews made a big difference and were influential in most decisions during the PC meeting. We used a double-blind review process to reduce the reviewer bias against authors or institutions. However, we recognized that when authors build upon their previous work, double blind reviews can leave the reviewer without sufficient information to do a credible review. Thus, we asked the authors to submit a separate list of URLs for their own related work and indicate in the submission that the citations were available from the PC chair. In the instructions to the reviewers, I asked them to do a first read and then contact me if they felt the need to look at the omitted material. About 10 reviewers requested this information. Another issue that came up during the process was double submission. On more than one occasion we found that the same or a similar paper was submitted to a different conference with an overlapping review period. In all these cases, in accordance with the SIGPLAN policy, we informed the other PC chair and summarily rejected the paper. One exception was the co-located International Symposium on Memory Management (ISMM), whose review period overlapped with PLDI. After a long discussion, we allowed co submission to both PLDI and ISMM with the explicit rule that if the paper is accepted to PLDI it will be automatically rejected from ISMM. We also required the authors to inform both PC chairs that they were also submitting to the other conference. At the end of the review period, the authors were given three days to provide a short rebuttal. Then the program committee met in Cambridge, Massachusetts on January 25th and 26th and after much discussion and debate selected this program. We hope you enjoy the program and the presentations. We are also recording the presentations and are planning to make them available to the community via YouTube.
Cyclic Cellular Automata: A Tool for Self-Organizing Sleep Scheduling in Sensor Networks
Authors: K. J. Kwak, Y. M. Baryshnikov, E. G. Coffman
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Cyclic Cellular Automata (CCAs) have been found to provide a natural, beguilingly simple, and elegant infrastructure for the design of sensor systems with sleep-wake scheduling to maximize system lifetime. The Greenberg-Hastings model (GHMZ) [3, 2] defined on the integer lattice Z2 is particularly appropriate and is described as follows. Each grid square of the integer lattice is a cell with a set of k > 1 states and a neighborhood N; the neighborhoods of interest here are the von Neumann neighborhood and the Moore neighborhood. The von Neumann neighborhood Nx of cell x consists of just those cells to thenorth, east, south, and west of x, whereas the Moore neighborhood expands to that 3 £ 3 array of cells with x at its center, i.e., all cells that touch x at a side or vertex. All cells change state synchronously step by step according to aclock cycle and transition function common to all. The local rule for state changes is little more than a counter: The state »t+1(x) of cell x at time t + 1 is a simple mod k increment: »t+1(x) = »t(x) + 1 if »t(x) > 0. But if »t(x) = 0;the state is incremented to 1 if and only if it has at least one neighbor in Nx which is currently in state 1.
Estimating the Reliability of Protein-Protein Interactions
Authors: Byungkyu Park, Kyungsook Han
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Many methods developed for estimating the reliability of protein-protein interactions are based on the topology analysis of protein-protein interaction networks. This paper describes a new reliability measure of protein-protein interactions, which is theoretically rigorous, yet biologically meaningful. The new measure does not rely on the topology of protein interaction networks, but formulates the biological information on functional roles, sub-cellular localizations and protein classes into a theoretically rigorous scoring scheme. Comparison of the new measure with IG1, IG2, and IRAP shows that the new measure is better than IG1 and IG2, and slightly better than IRAP. The new measure will be useful for filtering many spurious interactions as well as for estimating the reliability of protein interaction data.
Infinite paths in planar graphs II, structures and ladder nets
Authors: Xingxing Yu
Venue: Journal of Graph Theory (2005)

A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertices results in at most k &ndash; 1 infinite components. In 1971, Nash-Williams conjectured that a 4-connected infinite planar graph contains a spanning 2-way infinite path if and only if it is 3-indivisible. In this paper, we prove a structural result for 2-indivisible infinite planar graphs. This structural result is then used to prove Nash-Williams conjecture for all 4-connected 2-indivisible infinite planar graphs. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 247&ndash;266, 2005
Note on limits of finite graphs
Authors: G&#x00e1;bor Elek
Venue: Combinatorica (2007)

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
Pileus the internet-ready umbrella: full-embodied web in a real space
Authors: Takashi Matsumoto, Sho Hashimoto, Naohito Okude
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

This paper introduces a new approach for a mobile HCI design with a concept of "Full- Embodied Web". The goal of Full-Embodied Web is that, when user takes natural embodied interactions to a special mobile device, it augments their experiences in real world accessing information on social resources on the web. The growth of the web has been supported by immersive interaction of GUI, and it has been strengthening cyber space separated from our real world experiences. Now Full-Embodied Web tries to use context information and physical abilities of users to provide a natural way to access web services in a mobile situation. Its design consider 1) to use embodied interactions to operate information on the device, 2) to react to user contexts automatically from a combination of sensors, and 3) to synchronize information of user activities with social web services. As one example of Full-embodied Web, The Inetenet-Ready Umbrella named Pileus was designed. Pileus is an umbrella-type mobile web browser enables us to access a social-photo sharing (Flickr) and a 3D Map Navigation (Google Earth) by a natural embodied interaction and contextual activities in a city.
Artificial Intelligence in Sports Prediction
Authors: Alan McCabe, Jarrod Trevathan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents an extension of earlier work in the use of artificial intelligence for prediction of sporting outcomes. An expanded model is described, as well as a broadening of the area of application of the original work. The model used is a form of multi-layer perceptron and it is presented with a number of features which attempt to capture the quality of various sporting teams. The system performs well and compares favourably with human tipsters in several environments. A study of less rigid "World Cup'' formats appears, along with extensive live testing results in a major international tipping competition.
Cooperative information fusion in a network robot system
Authors: Kevin LeBlanc, Alessandro Saffiotti
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

The vision of network robot systems involves robots embedded in smart environments, with which they can collaborate and communicate. In such systems, robots have access to many different sources and types of information, which need to be coordinated and combined effectively. In this work, we propose a framework which addresses the problem of combining heterogeneous information in a network robot system. The approach is inspired by work on conceptual spaces and perceptual anchoring, and is implemented using tools from fuzzy logic.
Evolution Analysis of Homogenous Source Code and its Application to Plagiarism Detection
Authors: Jeong-Hoon Ji, Gyun Woo, Su-Hyun Park, Hwan-Gue Cho
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Due to intelligent softwares and worldwide internet environment, unauthorized source code theft/copying and partial plagiarism is widespread. So the detecting the plagiarized source codes and software is getting important, especially in academic field. Though there have been announced lots of studies for detecting plagiarized pair of codes, we did not find somewhat more fundamental work for understanding the mechanism of plagiarism. So in order to improve the plagiarism detecting algorithm, it is desirable to reveal the whole procedure of code plagiarism. The basic idea of this paper is that software plagiarism can be considered as an evolution process of a source code. The final goal of our paper is to reconstruct the phylogenetic tree with a set of plagiarized codes. The main contribution of this paper is to propose an asymmetric code similarity measure, which enables us to guess the direction of plagiarism. For this purpose, we applied local alignment approach to detect a region of similar codes with a novel adaptive matching score matrix. To show the effectiveness and efficiency of our procedure, we conducted experiments on 20 artificially generated phylogenetic trees whose roots are selected from four program groups of ICPC (International Collegiate Programming Contest). Experiment showed that the proposed algorithm can effectively estimate the evolution direction, which enables us to identify plagiarized codes more accurately and reliably.
ShoX: An Easy to Use Simulation Platform for Wireless Networks
Authors: Johannes Lessmann, Tales Heimfarth, Peter Janacik
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

For the evaluation of wireless network protocols, simulation has established itself as a good compromise between cost and complexity, on the one hand, and accuracy of results, on the other hand. Most established network simulators, however, were originally developed for wired networks and only later extended to the wireless domain. Some simulators like Opnet are not even restricted to communication networks at all, but can be used to simulate all kinds of networked systems. In this paper, we present ShoX, a network simulator explicitly designed for the simulation of wireless networks. Together with its strong GUI support, this allows a very efficient development and evaluation of network protocols without any considerable learning curve. All relevant concepts known from the domain of wireless networks like nodes, links, OSI layers, packets, mobility, signal propagation and traffic models are directly available. Defining new layers, packets or models is as easy as subclassing the existing abstract classes which ensures at compile time that all required methods are provided by the user. ShoX is completely based on Java and XML, thus superseding to learn unfamiliar languages like Tcl or NED. It features an integrated GUI for configuration, visualization and statistics.
Modeling Quality Of Services In Service-Oriented Environments
Authors: Jens Hündling, Mathias Weske
Venue: Journal of Integrated Design Process Science (2006)

Information technology is the core enabler for global businesses. Based on an integration of services provided by companies, virtual enterprises are built to achieve common business goals. This integration can be supported or even automated, if companies publish a standardized, sufficient description of the services they offer in a formal, computer-readable way. This paper argues that the service orientation paradigm offers a promising approach to achieve this goal, but some major aspects are currently not concerned sufficiently. Therefore, this paper introduces a model for enriched service description that goes beyond technical interface specifications as known from Web services by including Quality of Services properties. The Quality of Services model will be integrated in the general service model. We illustrate the usability of the model by sketching scenarios with examples like automated discovery, substitution and optimized composition of services to support service oriented processes.
Statecharts Composition To Model Topologically Distributed Applications
Authors: Michele Banci, Alessandro Fantechi, Stefania Gnesi
Venue: Journal of Integrated Design Process Science (2006)

Many real-world systems can be conveniently modelled by the replication and interconnection of simple components of a few types: different configurations of the same system may vary just for the number of components and for the topology of their interconnections. In industrial practice of formal modelling the tedious work of such a manual instantiation has to be automated, allowing the inexpensive production of new configurations for the same product. This paper presents a methodology to build statechart models of topologically distributed systems by instantiating generic components; the method is able to replicate as needed statechart components and to expand the terms that drive their behaviour to create complex interconnection patterns along the required topology. The methodology is illustrated on the example of a classical distributed algorithm (Byzantine Agreement) in order to show the potential of dealing with parameterized distributed structures. The proposed methodology is shown to be able to find several interesting industrial applications.
Fostering the Uptake of Secure Multiparty Computation in E-Commerce
Authors: Octavian Catrina, Florian Kerschbaum
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Secure Multiparty Computation (SMC) protocols enable a group of mutually distrustful parties to perform a joint computation with private inputs. Novel e-commerce applications have emerged that could benefit from strong privacy protection, e.g., benchmarking, auctions, and collaborative supply chain management and planning. However, the uptake of SMC in these applications is still rare. We argue that this is due to poor performance, functionality, and scalability, as well as architectures that do not meet the needs of e-commerce applications. This paper explores SMC approaches and research directions, aiming at providing better support for e-commerce applications.
Gestion des flux dans les r&eacute;seaux mobiles
Authors: Antoine Boutet, Benoit Le Texier, Nicolas Montavont, Tanguy Ropitault, César Viho
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

The Network Mobility Basic Support (NEMO BS) protocol is the IETF standard to support mobility of entire IPv6 networks. Every network movements are fully transparent to the nodes located inside the mobile network without interruption on their ongoing communications. In addition to the mobility support, a mobile router may be equipped with several wireless network interfaces in order to connect heterogeneous access technologies. These networks can be available at the same time, and consequently the mobile network may benefit from these multiple paths to connect the Internet. All access networks have different characteristics in terms of bandwidth, latency, cost, etc. It is therefore important to install flow policies on an embedded mobile network in order to distribute, adapt or filter communications according to preferences of the operator and the availability of the technologies. In this demonstration, we propose to show how to apply flow policies on an embeded mobile network inside a vehicule.
Wilhelm Fenner and the Development of the German Cipher Bureau, 1922-1939
Authors: David Alvarez
Venue: Cryptologia (2007)

Wilhelm Fenner was the central figure in the evolution of the German Cipher Bureau between 1922 and 1939, and a major personality in the history of German communications intelligence in the interwar period. Under his direction, the Cipher Bureau evolved into a highly professional communications intelligence service, which scored impressive cryptanalytic successes against the diplomatic and military systems of many countries.
Experience and History
Authors: Antony Galton
Venue: Journal of Logic and Computation (2008)

We develop a theory of processes which takes into account the observation that processes differ markedly from events in their relation to change. Whereas events are fixed items of history which cannot be described as undergoing change, processes are more like ordinary objects in that they can be directly present at one time and can undergo change as time proceeds. This leads to a fundamental ontological distinction between EXP, the dynamic experiential world of objects and processes as they exist at one time, and HIST, the static historical overview populated by events that are generated by the ongoing processes in EXP. Formally, this means that terms describing processes can serve as arguments to time-varying predicates, whereas terms describing events cannot. We illustrate this by presenting part of a suitable formalism and using it to give an account of the progressive aspect.
Virtual network stacks
Authors: Ghazi Bouabene, Christophe Jelger, Christian Tschudin
Venue: Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow (2008)

In this paper, we get inspiration from peer to peer file sharing networks to provide a new way of inter-networking. In our proposal, nodes having access to multiple network types can share their networking resources with other peers residing in networks with different protocols and (potentially) different addressing schemes. Such neighbor nodes will form a peer to peer overlay backbone; the purpose of it being to offer to applications and protocols access to remote network stacks that their running hosts do not implement or have no direct access to. This creates RPC-like access to foreign network stacks well in line with a federation approach that avoids introducing a global overlay for integrating heterogeneous networks.
RC-SIMD: Reconfigurable communication SIMD architecture for image processing applications
Authors: Hamed Fatemi, Bart Mesman, Henk Corporaal, Twan Basten, Richard Kleihorst
Venue: Journal of Embedded Computing (2006)

During the last two decades, Single Instruction Multiple Data (SIMD) processors have become important architectures in embedded systems for image processing applications. The main reasons are their area and energy efficiency. Often the processing elements (PEs) of an SIMD processor are only locally connected. This may result in a communication bottleneck (only access to direct neighbors). One way to solve this is to use a fully connected communication network (FC-SIMD) between PEs. However, this solution leads to an excessive communication area cost, low communication network utilization, and scalability problems. E.g., the area overhead of an FC-SIMD is more than 100% when the number of PEs gets bigger than 64. In this paper, we introduce a new type of SIMD architecture, called RC-SIMD, with a reconfigurable communication network. It uses a delay-line in the instruction bus, causing the accesses to the communication network to be distributed over time. This architecture requires only a very cheap communication network while performing almost the same as expensive FC-SIMD architectures. However, the new architecture causes irregular resource conflicts. We therefore introduce a conflict model that existing schedulers are able to cope with. Experimental results show that, on average (compared to locally connected SIMDs), RC-SIMD require 21% fewer cycles than architecture without the delay-line, while the area overhead is at most 10%.
Medical Image Segmentation based on a 3D-MRF
Authors: Zhou Zhenhuan
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

To 3D medical image, the 2D Markov Random Field(MRF) does not include z-direction’s information. In this paper, we propose a 3D-MRF image model based on 2D MRF by extending 2D planar to 3D space, define and describe the 3D neighbor, clique and potential function. We segment medical image using the 3D-MRF and the steps are as follows: 1.Initial images are segmented by using k-means clustering, to reduce the computational burden by using a special data structure: the k-d tree. 2. The parameters are estimated by using the maximum a posteriori (MAP) for the 3D-MRF model. 3. Computing optimal Solution is done using the Expectation-Maximization (EM) algorithm and the Iterated Conditional Models (ICM) algorithm. Experiments show the 3D-MRF includes more neighboring information and the results of segmentation are more stable and practical.
Automatic background substitution using monocular camera and temporal foreground probability model
Authors: Sooyeong Kwak, Ilkwon Park, Juyong Lee, Hyeran Byun, Guntae Bae
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

This paper describes an automatic background substitution for PC-softphone applications. Different from previous works on this topic which are mostly using stereo camera, we provide a solution which can segment the foreground region with monocular camera which is not moving. There are three main contributions from this paper. First, our proposed algorithm can segment the foreground region without any manual initialization. Second, we improve accuracy of the foreground segmentation using the Temporal Foreground Probability Model(TFPM). Finally, natural composite image was achieved by adaptive color and intensity correction method
Identifying Security Aspects in Early Development Stages
Authors: Takao Okubo, Hidehiko Tanaka
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Although aspect-oriented software development is regarded as a suitable way to build non-functional requirements such as security concerns, there are few researches for identifying security aspects in early development stages. This paper presents an approach for identifying security aspects and pointcuts in a requirement analysis stage with extending misuse cases.