ppxscal/embedding_network huggingface dataset:
Method engineering process patterns
Authors: Mohsen Asadi, Raman Ramsin
Venue: Proceedings of the 2nd India software engineering conference (2009)

Method Engineering (ME) is based on the notion that no two software development projects are identical, and hence, the same development process is never executed twice. The need therefore arises for custom-built software development methodologies that are tailored to fit the specific project situation at hand, thus giving rise to the various Situational Method Engineering (SME) approaches currently in use. A process pattern is a description of a recurring development process fragment that can be used as a building block for engineering development processes. Software development process patterns are extensively used in SME, mainly as process components assembled together to form bespoke methodologies; however, the SME field itself has not been scrutinized as to the methodology development process fragments frequently encountered. Situational method engineering knowledge captured in the form of SME process patterns is not only useful for building and improving SME processes, but it also facilitates knowledge transfer among method engineers. We propose a set of SME process patterns obtained through studying existing method engineering approaches. The set of patterns has been used for developing http://www2.sheridanprinting.com/acm/isec/isec.cfm isec a generic pattern-based framework for SME. The framework can be used for developing SME processes according to the specific requirements of method engineering projects. The resulting process can then be enacted to yield custom-built, project-specific software development methodologies.
Tactical Navigation Support for Firefighters: The LifeNet Ad-Hoc Sensor-Network and Wearable System
Authors: Markus Klann
Venue: Mobile Response: Second International Workshop on Mobile Information Technology for Emergency Response, MobileResponse 2008. Bonn, Germany, May 29-30, 2008, Revised Selected Papers (2009)

We present a concept and implementation for supporting tactical navigation of firefighters in structural fires, called LifeNet. It is based on a sensor network that firefighters deploy on-the-fly during an intervention and a wearable system that provides them navigational support. The system was designed in collaboration with the Paris Fire Brigade and is based on intensive empirical studies of their work practice. The article focuses on the exploration of human factors related to the LifeNet concept, including appropriation, interaction, as well as the relation to current and potential future work practice. These aspects are discussed for LifeNet and a few related approaches against the findings from our empirical studies.
Boosting nonlinear additive autoregressive time series
Authors: Nivien Shafik, Gerhard Tutz
Venue: Computational Statistics Data Analysis (2009)

Several methods for the analysis of nonlinear time series models have been proposed. As in linear autoregressive models the main problems are model identification, estimation and prediction. A boosting method is proposed that performs model identification and estimation simultaneously within the framework of nonlinear autoregressive time series. The method allows one to select influential terms from a large number of potential lags and exogenous variables. The influence of the selected terms is modeled by an expansion in basis function allowing for a flexible additive form of the predictor. The approach is very competitive in particular in high dimensional settings where alternative fitting methods fail. This is demonstrated by means of simulations and two applications to real world data.
Incremental and on-demand random walk for iterative power distribution network analysis
Authors: Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an incremental and on-demand random walk to reduce iterative analysis time. During each iteration, we map the design changes as positive or negative random walks for observed nodes. To update PDN analysis result, we only need to apply these extra positive or negative walks, instead of doing all walks from scratch. We show that different execution orders for these walks do not affect accuracy but do affect the runtime because of the cancellation between positive and negative walks. Considering this cancellation effect, we optimize the walk order by solving a min-energy electromagnetic particles placement problem and, as a result, further reduce the runtime to about 8x compared to the worst order. Experiments show that, compared to random walk from scratch, our algorithm has similar accuracy but reduces the iterative analysis time by up to 18x for on-chip PDN sizing, and by up to 13x for package ball assignment with substrate routing. In addition, our incremental random walk has a linear time complexity with respect to the number of observed nodes and is more suitable for on-demand analysis, compared to random walk from scratch and its big warm-up cost.
Simultaneous registration of multiple views with markers
Authors: Tae-wan Kim, Yeong-hwa Seo, Sang-chul Lee, Zhouwang Yang, Minho Chang
Venue: Computer-Aided Design (2009)

We propose a new model for simultaneous registration of multiple range views. The registration model minimizes a hybrid metric that is a combination of the tangent distance error and the sliding penalty. As a result, the proposed method is capable of reducing the sliding error in registration, especially for an object containing flat features. We used kinematical geometry to linearize rigid-body motions and approximate the registration model with a quadratic objective function, which leads to solving linear equations at each iteration. We also describe experiments indicating that our registration algorithm is insensitive to the initial alignment and maintains global stability.
Implications of integrating test-driven development into CS1/CS2 curricula
Authors: Chetan Desai, David S. Janzen, John Clements
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testing in academia. This paper demonstrates how TDD can be integrated into existing course materials without reducing topic coverage. Two controlled experiments were conducted in a CS1/CS2 course in Winter 2008. Following a test-driven learning approach, unit testing was introduced at the beginning of the course and reinforced through example. Results indicate that while student work loads may increase with the incorporation of TDD, students are able to successfully develop unit tests while learning to program.
Probabilistic Information Flow Security
Authors: Damas P. Gruska
Venue: Fundamenta Informaticae (2008)

A formal model for description of probabilistic timing attacks is presented and studied. It is based on a probabilistic timed process algebra, on observations (mappings which make visible only a part of system behavior) and on an information flow. The resulting security properties are studied and compared with other security concepts.
The Underwater Acoustic MIMO OFDM System Channel Equalizer Basing on Independent Component Analysis
Authors: Xuefei Ma, Chun-hui Zhao, Gang Qiao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper we proposed a novel approach of blind channel equalizer for underwater Multiple-input multiple-output orthogonal frequency diversity multiple (MIMO-OFDM) system. convolutionnal encoder is applied on reference frequency bin and each block before entre the underwater MIMO-OFDM system. The transform imposed a correlation structure on the transmitted block, after every reference frequency signal being unmixed by fixed-point algorithm for independent component analysis (FastICA), the estimated reference are reordered and scaled. Then using minimum mean squared error (MMSE) to obtain others frequency bin channel impulse response inner the same block. We recover the user signal assuming that the channels are unknown and no training sequences are sent.
Design influence on social play in distributed exertion games
Authors: Florian 'Floyd' Mueller, Martin R. Gibbs, Frank Vetere
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Exertion games are an emerging form of interactive games that require players to invest significant physical effort as part of the gameplay, rather than just pressing buttons. These exertion games have potential health benefits by promoting exercise. It is also believed that they can facilitate social play between players and that social play can improve participation in exertion games. However, there is currently a lack of understanding of how to design games to support these effects. In this paper, we present a qualitative case study that illustrates how networked environments support social play in exertion games and how this can help to gain an understanding of existing games and support the design of future games. This work offers a preliminary analytical and descriptive account of the relationship between exertion and social play in such a game and highlights the influence of design with the aim of utilizing the attributed benefits of exertion and social play.
Intelligent Products: A survey
Authors: Gerben G. Meyer, Kary Främling, Jan Holmström
Venue: Computers in Industry (2009)

This paper presents an overview of the field of Intelligent Products. As Intelligent Products have many facets, this paper is mainly focused on the concept behind Intelligent Products, the technical foundations, and the achievable practical goals of Intelligent Products. A novel classification of Intelligent Products is introduced, which distinguishes between three orthogonal dimensions. Furthermore, the technical foundations in the areas of automatic identification and embedded processing, distributed information storage and processing, and agent-based systems are discussed, as well as the achievable practical goals in the contexts of manufacturing, supply chains, asset management, and product life cycle management.
Robust identification of face landmarks in profile images
Authors: Andrea Bottino, Sandro Cumani
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Identifying landmark points in facial images is a very important task in computer vision and has several applications. Here we present a fast and robust algorithm capable of identifying a specific set of landmarks on face profile images. The algorithm is based on the local curvature of the profile contour and on the local analysis of the face features. In order to validate the approach, the algorithm has been tested on a set of images. Ground truth data on the real location of the landmarks are compared with the results of our algorithm. A percentage of 92% correct identification and a mean error of 3.5 pixels demonstrate the robustness of the approach.
Life on the Treadmill
Authors: Krisztián Flautner
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Silicon technology evolution over the last four decades has yielded an exponential increase in integration densities with steady improvements of performance and power consumption at each technology generation. This steady progress has created a sense of entitlement for the riches that future process generations would bring. Today, however, classical process scaling seems to be dead and living up to technology expectations requires continuous innovation at many levels, which comes at steadily progressing implementation and design costs. Solutions to problems need to cut across layers of abstractions and require coordination between software, architecture and circuit features.
LazySOM: Image Compression Using an Enhanced Self-Organizing Map
Authors: Cheng-Fa Tsai, Yu-Jiun Lin
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

A self-organizing map (SOM), i.e. a congenital clustering algorithm, has a high compression ratio and produces high-quality reconstructed images, making it very suitable for generating image compression codebooks. However, SOMs incur heavy computation particularly when using large numbers of training samples. Thus, to speed up training, this investigation presents an enhanced SOM (named LazySOM) involving a hybrid algorithm combining LBG, SOM and Fast SOM. The proposed algorithm has a low computation cost, enabling the use of SOM with large numbers of training patterns. Simulations are performed to measure two indicators, PSNR and time cost, of the proposed LazySOM.
Using web service enhancements to bridge business trust relationships
Authors: Zhengping Wu, Alfred C. Weaver
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

1. With the development of web technology and distributed systems, online collaborations are becoming more common and more demanding. These collaborations require online business trust relationships among collaborating organizations. Online business trust relationships can protect the trust, integrity, and privacy of shared resources, which are the foundation for online business. Web services provide standard mechanisms to enable online interactions and further online collaborations. Yet security, privacy and trust-related protection mechanisms for web services need additional development. In an interconnected network environment, bridging extant business relationships to extend the business circle is a convenient and tempting way. Physical connections with proper privacy and security protections are required for bridging two autonomous organizations. Likewise, collaborating organizations need proper protection mechanisms for bridging extant business trust relationships among cooperating parties. These protection mechanisms must therefore ensure privacy and owner control in the entire process of bridging business trust relationships due to the subjectivity of the relationships. This paper describes an indirect trust establishment mechanism using web service enhancements to bridge and build new online business trust relationships from extant business trust relationships providing privacy protection and owner control simultaneously.
A Separator Theorem for String Graphs and Its Applications
Authors: Jacob Fox, János Pach
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly equal size by the removal of $O(m^{3/4}\sqrt{\log m})$ vertices. This result is then used to deduce that every string graph with n vertices and no complete bipartite subgraph K t,t has at most c t n edges, where c t is a constant depending only on t. Another application is that, for any c > 0, there is an integer g(c) such that every string graph with n vertices and girth at least g(c) has at most (1 + c)n edges.
Digital Signal Processing Bundle
Authors: Li Tan, Nasser Kehtarnavaz
Venue:  (2009)

Combining a 2007 favourite and a brand new title, this bundle will get you up to speed with the essential fundamentals of DSP principles and practice.Digital Signal Processing is the FIRST book that bridges the gap that separates DSP theory and hardware design. Covering DSP principles, applications and hardware issues, and including instructive examples, it is an invaluable resource for anyone studying or practicing engineering. Digital Signal Processing System is the ONLY DSP book to combine textual and graphical programming. It is an essential source for helping you to quickly develop DSP systems by integrating MATLAB/C code into the LabVIEW graphical programming environment. Learn how to easily and quickly design complex DSP systems with this great value bundle.
Local Two-Stage Myopic Dynamics for Network Formation Games
Authors: Esteban Arcaute, Ramesh Johari, Shie Mannor
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Network formation games capture two conflicting objectives of self-interested nodes in a network. On one hand, such a node wishes to be able to reach all other nodes in the network; on the other hand, it wishes to minimize its cost of participation. We focus on myopic dynamics in a class of such games inspired by transportation and communication models. A key property of the dynamics we study is that they are local: nodes can only deviate to form links with others in a restricted neighborhood. Despite this locality, we find that our dynamics converge to efficient or nearly efficient outcomes in a range of settings of interest.
Estimation of extra risk and benchmark dose in dose-response models
Authors: Ramesh C. Gupta, Na Wang
Venue: Mathematics and Computers in Simulation (2009)

An important goal in quantitative risk/safety analysis of chemical toxins or pharmaceutical agents is determination of toxic risk posed by exposure to the agent. For purpose of assessing exposure risks, the extra risk function is defined as the risk above the background level corrected for non-response in the unexposed population. Our interest, in this paper, is in statistical methods for obtaining upper confidence limits on the extra risk and lower confidence limits on the dose level at which a certain benchmark risk is achieved. Existing method on the above problem is examined and several examples from literature are provided. In addition, a new method of obtaining the desired confidence intervals is investigated and the results are compared with those obtained by the existing method.
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
Authors: José Fernández, Boglárka Tóth
Venue: Computational Optimization and Applications (2009)

Obtaining a complete description of the efficient set of multiobjective optimization problems can be of invaluable help to the decision-maker when the objectives conflict and a solution has to be chosen. In this paper we present an interval branch-and-bound algorithm which aims at obtaining a tight outer approximation of the whole efficient set of nonlinear biobjective problems. The method enhances the performance of a previous rudimentary algorithm thanks to the use of new accelerating devices, namely, three new discarding tests. Some computational studies on a set of competitive location problems demonstrate the efficiency of the discarding tests, as well as the superiority of the new algorithm, both in time and in quality of the outer approximations of the efficient set, as compared to another method, an interval constraint-like algorithm, with the same aim. Furthermore, we also give some theoretical results of the method, which show its good properties, both in the limit (when the tolerances are set equal to zero and the algorithm does not stop) and when the algorithm stops after a finite number of steps (when we use positive tolerances). A key point in the approach is that, thanks to the use of interval analysis tools, it can be applied to nearly any biobjective problem.
On the Optimality of Spatial Attention for Object Detection
Authors: Jonathan Harel, Christof Koch
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

Studies on visual attention traditionally focus on its physiological and psychophysical nature [16,18,19], or its algorithmic applications [1,9,21]. We here develop a simple, formal mathematical model of the advantage of spatial attention for object detection, in which spatial attention is defined as processing a subset of the visual input, and detection is an abstraction with certain failure characteristics. We demonstrate that it is suboptimal to process the entire visual input given prior information about target locations, which in practice is almost always available in a video setting due to tracking, motion, or saliency. This argues for an attentional strategy independent of computational savings: no matter how much computational power is available, it is in principle better to dedicate it preferentially to selected portions of the scene. This suggests, anecdotally, a form of environmental pressure for the evolution of foveated photoreceptor densities in the retina. It also offers a general justification for the use of spatial attention in machine vision.
TuG synopses for approximate query answering
Authors: Joshua Spiegel, Neoklis Polyzotis
Venue: ACM Transactions on Database Systems (TODS) (2009)

This article introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate approximate answers for complex relational queries. The proposed summarization framework adopts a &ldquo;semi-structured&rdquo; view of the relational database, modeling a relational data set as a graph of tuples and join queries as graph traversals, respectively. The key idea is to approximate the structure of the induced data graph in a concise synopsis, and to approximate the answer to a query by performing the corresponding traversal over the summarized graph. We detail the (TuG) synopsis model that is based on this novel approach, and we describe an efficient and scalable construction algorithm for building accurate (TuG) within a specific storage budget. We validate the performance of (TuG) with an extensive experimental study on real-life and synthetic datasets. Our results verify the effectiveness of (TuG) in generating accurate approximate answers for complex join queries, and demonstrate their benefits over existing summarization techniques.