ppxscal/embedding_network huggingface dataset:
Communication patterns in geographically distributed software development and engineers' contributions to the development effort
Authors: Marcelo Cataldo, James D. Herbsleb
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

This study seeks to shed light on how communication patterns in geographically distributed software development (GDSD) projects evolve over time and how they relate to developers' contributions to the development effort. Data from two GDSD projects from two distinct companies were collected. The analysis showed that the definition of formal roles had an important impact on patterns of communication across development locations. In one project a group of developers emerged over time as the liaisons between geographical locations. In addition to handling the communication and coordination load across locations, those same engineers contributed the most to the development effort. On the other hand, in the second project, communication across site was formalized and the developers involved in the cross site communication and coordination activities were not as productive.
An analyzer for extended compositional process algebras
Authors: Yang Liu, Jun Sun, Jin Song Dong
Venue: Companion of the 30th international conference on Software engineering (2008)

System simulation and verification become more demanding as complexity grows. PAT is developed as an interactive system to support composing, simulating and reasoning of process algebra with various extensions like fairness events, global variables and parameterized processes. PAT provides user friendly interfaces to support system modeling and simulation. Furthermore, it embeds two complementing model checking techniques catering for different systems and properties, namely, an explicit on-the-fly model checker which is designed to verify event-based fairness constraints efficiently and a bounded model checker based on state-of-the-art SAT solvers. The model checkers are capable of proving reachability, deadlock-freeness and the full set of Linear Temporal Logic (LTL) properties. Compared to other model checkers, PAT has two key advantages. Firstly, it supports an intuitive annotation of fairness constraints so that it handles large number of fairness constraints efficiently. Secondly, the compositional encoding of system models as SAT problems allows us to handle compositional process algebra effectively. The experimental results show that PAT is capable of verifying systems with large number of states and outperforms the state-of-the-art model checkers in some cases.
On the equivalence of parametric contexts for linear inequality systems
Authors: M. J. Cánovas, M. A. López, J. Parra
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we analyze the connections among different parametric settings in which the stability theory for linear inequality systems may be developed. Our discussion is focussed on the existence, or not, of an index set (possibly infinite). For some stability approaches it is not convenient to have a fixed set indexing the constraints. This is the case, for example, of discretization techniques viewed as approximation strategies (i.e., discretization regarded as data perturbation). The absence of a fixed index set is also a key point in the stability analysis of parametrized convex systems via standard linearization. In other frameworks the index set is very useful, for example if the constraints are perturbed one by one, even to measure the global perturbation size. This paper shows to what extent an index set may be introduced or removed in relation to stability.
A Very Low Bit Rate Video Coding for Ubiquitous Services
Authors: Ben-Shung Chow
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Shape compensation is proposed in this paper to replace the DCT residue coding used in standard video coding. That is, our binary images are coded by the motion vectors and the class of morphological filters. Therefore the very low bit rate 1k bps can be easily achieved for the image size 64*64. Our coding procedures are simple: reducing quantization after reducing resolution, and shape compensation after motion compensation. However, the visual quality can be tolerable considering the carrying convenience ofthe small display and the inexpensive pay rate of communication. Therefore, the proposed coding strategy is suitable for video coding for ubiquitous services.
A Multiple Instance Learning Strategy for Combating Good Word Attacks on Spam Filters
Authors: Zach Jorgensen, Yan Zhou, Meador Inge
Venue: The Journal of Machine Learning Research (2008)

Statistical spam filters are known to be vulnerable to adversarial attacks. One of the more common adversarial attacks, known as the good word attack, thwarts spam filters by appending to spam messages sets of "good" words, which are words that are common in legitimate email but rare in spam. We present a counterattack strategy that attempts to differentiate spam from legitimate email in the input space by transforming each email into a bag of multiple segments, and subsequently applying multiple instance logistic regression on the bags. We treat each segment in the bag as an instance. An email is classified as spam if at least one instance in the corresponding bag is spam, and as legitimate if all the instances in it are legitimate. We show that a classifier using our multiple instance counterattack strategy is more robust to good word attacks than its single instance counterpart and other single instance learners commonly used in the spam filtering domain.
Robosemantics: How Stanley the Volkswagen Represents the World
Authors: Christopher Parisien, Paul Thagard
Venue: Minds and Machines (2008)

One of the most impressive feats in robotics was the 2005 victory by a driverless Volkswagen Touareg in the DARPA Grand Challenge. This paper discusses what can be learned about the nature of representation from the car's successful attempt to navigate the world. We review the hardware and software that it uses to interact with its environment, and describe how these techniques enable it to represent the world. We discuss robosemantics, the meaning of computational structures in robots. We argue that the car constitutes a refutation of semantic arguments against the possibility of strong artificial intelligence.
A new local stabilized nonconforming finite element method for the Stokes equations
Authors: Jian Li, Zhangxin Chen
Venue: Computing (2008)

In this paper, we propose and study a new local stabilized nonconforming finite method based on two local Gauss integrations for the two-dimensional Stokes equations. The nonconforming method uses the lowest equal-order pair of mixed finite elements (i.e., NCP 1&#x2013;P 1). After a stability condition is shown for this stabilized method, its optimal-order error estimates are obtained. In addition, numerical experiments to confirm the theoretical results are presented. Compared with some classical, closely related mixed finite element pairs, the results of the present NCP 1&#x2013;P 1 mixed finite element pair show its better performance than others.
Challenges in Implementing the Real-Time Specification for Java (RTSJ) in a Commercial Real-Time Java Virtual Machine
Authors: Michael H. Dawson
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

The increasing complexity of modern real-time systems and the increasing need for real-time behavior in a broad range of applications such as network-centric warfare, telephony and stock trading has encouraged many developers to consider using Real-time Java™ for systems previously only written in C, Ada or assembly language. The RTSJ standard defines the baseline requirements for a Real-time Java implementation, and commercial Java virtual machine (JVM) implementations include additional features such as real-time garbage collectors and real-time compilation (compiling from Java to native code in a manner compatible with real-time), which make the use of Java practical for these applications. This paper describes some of the challenges that will be faced by implementers of the RTSJ standard based on our experience with implementing IBM’s RTSJ-compliant J2SE Java virtual machine, called IBM® WebSphere® Real-time
adegenet
Authors: Thibaut Jombart
Venue: Bioinformatics (2008)

Summary: The package adegenet for the R software is dedicated to the multivariate analysis of genetic markers. It extends the ade4 package of multivariate methods by implementing formal classes and functions to manipulate and analyse genetic markers. Data can be imported from common population genetics software and exported to other software and R packages. adegenet also implements standard population genetics tools along with more original approaches for spatial genetics and hybridization. Availability: Stable version is available from CRAN: http://cran.r-project.org/mirrors.html. Development version is available from adegenet website: http://adegenet.r-forge.r-project.org/. Both versions can be installed directly from R. adegenet is distributed under the GNU General Public Licence (v.2). Contact: jombart@biomserv.univ-lyon1.fr Supplementary information:Supplementary data are available at Bioinformatics online.
SensorScope: Out-of-the-Box Environmental Monitoring
Authors: Guillermo Barrenetxea, François Ingelrest, Gunnar Schaefer, Martin Vetterli, Olivier Couach, Marc Parlange
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Environmental monitoring constitutes an important field of application for wireless sensor networks. Given the severity of potential climate changes, environmental impact on cities, and pollution, it is a domain where sensor networks can have great impact and as such, is getting more and more attention. Current data collection techniques are indeed rather limited and make use of very expensive sensing stations, leading to a lack of appropriate observations. In this paper, we present SensorScope, a collaborative project between environmental and network researchers, that aims at providing an efficient and inexpensive out-of-the-box environmental monitoring system, based on a wireless sensor network. We especially focus on data gathering and present the hardware and network architecture of SensorScope. We also describe a real-world deployment, which took place on a rock glacier in Switzerland, as well as the results we obtained.
Implementation of a Specific Information System for a Web-Based E-learning Environment
Authors: Zheng-wang Ye, Ying Zhang, Jun Li, Jia-li Mao, Wen-gang Zhao
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

A suitable e-learning system management needs to carry out a web-information system in order to allow integrated fruition of data and metadata concerning the activities typical of e-learning environment. The definition of an "Information System" for e-learning takes advantage of the potentialities of Web technologies both as for the access to metadata present on the several platforms, and as for the implementation of courseware which make up the relative didactic environment. What information systems have in common is the technological environment on which they are generally implemented and the use of metadata in order to structure information at all cognitive and organization levels. In this work we are going to define a methodology for the implementation of a specific Information System for an e-learning environment.
Should LOGO keep going forward 1?
Authors: Ken Kahn
Venue: Informatics in education (2007)

LOGO has been evolving in incremental steps for 40 years. This has resulted in steady progress but some regions of the space of all programming languages for children cannot be reached without passing through unacceptable intermediate designs. What are the ultimate aims of LOGO? What criteria and aesthetics should be used in determining which areas of the design space are most promising? What would the ideal programming language look like? Would a family of special-purpose languages be more effective than a single language? In looking to the future what can we learn from the history of LOGO? What can we learn from other programming systems for children? Alan Kay is leading a new project entitled, "Steps toward the Reinvention of Programming". What are its strengths and weaknesses? We can conceptualise the design alternatives as defining an n-dimensional space. Some dimensions represent major alternatives for syntax, others for dealing with concurrency, others for the underlying computational models, and others for features of the programming environment. The goal of this paper is to spur a discussion of these issues. I will present my personal opinions based upon 30 years of research experience in this field.
Efficient Discovery of Spectrum Opportunities with MAC-Layer Sensing in Cognitive Radio Networks
Authors: Hyoil Kim, Kang G. Shin
Venue: IEEE Transactions on Mobile Computing (2008)

Sensing/monitoring of spectrum-availability has been identified as a key requirement for dynamic spectrum allocation in cognitive radio networks. One of the most important issues of MAC-layer sensing is how often to schedule concurrent measurements on licensed channels, and in which order to sense those channels. To resolve this issue, we address (i) how to maximize discovery of spectrum-opportunities by sensing-period adaptation, and (ii) how to minimize the delay in finding an available channel. Specifically, we develop a sensing-period optimization mechanism and an optimal channel-sequencing algorithm, as well as an environment-adaptive channel-usage pattern estimation method. Our simulation results demonstrate the efficacy of the proposed schemes and its significant performance improvement over non-optimal schemes. The sensing-period optimization discovers more than 98% of the analytical maximum of discoverable spectrum-opportunities, regardless of the number of channels sensed. For the scenarios tested, the proposed scheme is shown to discover up to 22% more opportunities than non-optimal schemes, which may become even greater with a proper choice of initial sensing-periods. The idle-channel discovery delay with the optimal channel-sequencing technique spans from 0.08 to 0.35 second under the tested scenarios, which is faster than non-optimal schemes. Moreover, our estimation method is shown to track time-varying channel-parameters accurately.
An analytical model for performance evaluation in a computational grid
Authors: Yongwei Wu, Likun Liu, Jiayin Mao, Guangwen Yang, Weimin Zheng
Venue: Proceedings of the 2007 Asian technology information program's (ATIP's) 3rd workshop on High performance computing in China: solution approaches to impediments for high performance computing (2007)

In this paper, an analytical model is introduced to evaluate the performance of a computational grid, which integrates distributed computing resources and supplies them through the Internet transparently. Because of the intrinsic heterogeneity and complexity, the performance evaluation approach for Grid is much more difficult than that of the traditional distributed computing environment. First, this paper presents a grid model of multi-server queue with different service rates and, then describes how to obtain the analytical performance evaluation solution in detail. The Markov chain is applied to solve the problem, and the final result can be expressed in a simple form. Simulation studies confirm the correctness and effectiveness of the solution too.
Effairness: Dealing with Time in Congestion Control Evaluation
Authors: Sergey Gorinsky, Harrick Vin
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Congestion control algorithms are traditionally evaluated in contrast to ideal capacity allocations that specify instantaneous efficient fair rates for application sessions but ignore time. While the latter is tenable for local networks and networks where all application sessions last long, instantaneous ideal allocations are inadequate standards for congestion control evaluation in dynamic wide-area networks. In this paper, we propose an alternative ideal of an effair allocation that explicitly accounts for unavoidable propagation delay. We develop an algorithm for computing the effair allocation and present a metric of effairness that quantifies how close the actual network services are to the effair allocation on the receiver, session, and network levels.
Executing SOA: A Practical Guide for the Service-Oriented Architect, 1st edition
Authors: Norbert Bieberstein, Robert G. Laird, Keith Jones, Tilak Mitra
Venue:  (2008)

The Expert, Practical Guide to Succeeding with SOA in the Enterprise In Executing SOA, four experienced SOA implementers share realistic, proven, from-the-trenches guidance for successfully delivering on even the largest and most complex SOA initiative. This book follows up where the authors best-selling Service-Oriented Architecture Compass left off, showing how to overcome key obstacles to successful SOA implementation and identifying best practices for all facets of executiontechnical, organizational, and human. Among the issues it addresses: introducing a services discipline that supports collaboration and information process sharing; integrating services with preexisting technology assets and strategies; choosing the right roles for new tools; shifting culture, governance, and architecture; and bringing greater agility to the entire organizational lifecycle, not just isolated projects. Executing SOA is an indispensable resource for every enterprise architect, technical manager, and IT leader tasked with driving value from SOA in complex environments. Coverage includes Implementing SOA governance that reflects the organizations strategic and business focus Running SOA projects successfully: practical guidelines and proven methodologies around service modeling and design Leveraging reusable assets: making the most of your SOA repository Enabling the architect to choose the correct tools and products containing the features required to execute on the SOA method for service design and implementation Defining information services to get the right information to the right people at the right time Integrating SOA with Web 2.0 and other innovative products and solutions Providing highly usable human interfaces in SOA environments
Feature sensitivity: A generalization of topological sensitivity
Authors: Sankara Hari Gopalakrishnan, Krishnan Suresh
Venue: Finite Elements in Analysis and Design (2008)

Shape and topology optimization have flourished over the last two decades, resulting in a number of powerful mathematical concepts. One such concept is that of topological sensitivity that quantifies the impact of adding infinitesimal holes (within a given continuum) on specific quantities of interest such as compliance, average stress, etc. In this paper we explore a novel generalization of topological sensitivity called feature sensitivity that captures the first-order change in quantities of interest when an arbitrary internal and boundary feature is created within an existing continuum. Specific algorithms are derived for computing the feature sensitivity of linear elasticity problems, and illustrated through numerical experiments.
Single-document and multi-document summarization techniques for email threads using sentence compression
Authors: David M. Zajic, Bonnie J. Dorr, Jimmy Lin
Venue: Information Processing and Management: an International Journal (2008)

We present two approaches to email thread summarization: collective message summarization (CMS) applies a multi-document summarization approach, while individual message summarization (IMS) treats the problem as a sequence of single-document summarization tasks. Both approaches are implemented in our general framework driven by sentence compression. Instead of a purely extractive approach, we employ linguistic and statistical methods to generate multiple compressions, and then select from those candidates to produce a final summary. We demonstrate these ideas on the Enron email collection - a very challenging corpus because of the highly technical language. Experimental results point to two findings: that CMS represents a better approach to email thread summarization, and that current sentence compression techniques do not improve summarization performance in this genre.
Automatic Mood-Transferring between Color Images
Authors: Chuan-Kai Yang, Li-Kai Peng
Venue: IEEE Computer Graphics and Applications (2008)

Reinhard and colleagues' ground-breaking work of color transfer between images provides a successful means for mood transferring between color images. However, two issues remain relatively unexplored. First, the approach leaves the choice of an appropriate reference image to users. Second, it's often difficult to evaluate a color transfer's effectiveness, especially when the input and reference images have significantly different content. A new approach, described here, tackles both issues. First, it provides a more intuitive interface, where users can convert the style of an input image with simply a mouse click, without having to find and provide their own reference image. Second, the system offers a more refined mechanism for converting the input image's color using a histogram matching approach that preserves spatial coherence.
Design and CAD for 3D integrated circuits
Authors: Paul D. Franzon, W. Rhett Davis, Michael B. Steer, Steve Lipa, Eun Chu Oh, Thor Thorolfsson, Samson Melamed, Sonali Luniya, Tad Doxsee, Stephen Berkeley, Ben Shani, Kurt Obermiller
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

High density Through Silicon Vias (TSV) can be used to build 3DICs that enable unique applications in computing, signal processing and memory intensive systems. This paper presents several case studies that are uniquely enhanced through 3D implementation, including a 3D CAM, an FFT processor, and a SAR processor. The CAD flow used to implement for these designs is described. 3DIC requires higher fidelity thermal modeling than 2DIC design. The rationale for this requirement is established and a possible solution is presented.
Remote specialization for efficient embedded operating systems
Authors: Sapan Bhatia, Charles Consel, Calton Pu
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2008)

Prior to their deployment on an embedded system, operating systems are commonly tailored to reduce code size and improve runtime performance. Program specialization is a promising match for this process: it is predictable and modules, and it allows the reuse of previously implemented specializations. A specialization engine for embedded systems must overcome three main obstacles: (i) Reusing existing compilers for embedded systems, (ii) supporting specialization on a resource-limited system and (iii) coping with dynamic applications by supporting specialization on demand. In this article, we describe a runtime specialization infrastructure that addresses these problems. Our solution proposes: (i) Specialization in two phases of which the former generates specialized C templates and the latter uses a dedicated compiler to generate efficient native code. (ii) A virtualization mechanism that facilitates specialization of code at a remote location. (iii) An API and supporting OS extensions that allow applications to produce, manage and dispose of specialized code. We evaluate our work through two case studies: (i) The TCP/IP implementation of Linux and (ii) The TUX embedded web server. We report appreciable improvements in code size and performance. We also quantify the overhead of specialization and argue that a specialization server can scale to support a sizable workload.