ppxscal/embedding_network huggingface dataset:
IMPS: an experimentation based investigation of a nationwide software development reference model
Authors: Marcos Kalinowski, Kival Chaves Weber, Guilherme Horta Travassos
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Experimentation in software engineering represents a means to understand the impact of adopting software technologies. In this paper we describe an on-going experimentation work aiming at to address a real industry need in Brazil: the understanding of how performance variables (such as cost, productivity, and quality) are affected by the adoption of a nationwide software development reference model. The main strategy consists in integrating the application of carefully planned surveys into the model implementation and assessment procedures. Besides the expected performance results, we hope it can be useful to reinforce to the Brazilian software industry the importance of experimentation to support software technologies evaluation.
Closing the Gap Between Organizational Models and Multi-Agent System Deployment
Authors: Michael Köhler, Matthias Wester-Ebbinghaus
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Multi-agent system research deals with organization theoretical concepts in order to analyse and control supra-individual phenomena. However, there exists a conceptual gap between organizational specifications and their multi-agent implementation. We address this problem by presenting an integrated approach for the specification and deployment of organizational models based on Petri nets.
Visual face tracking and its applications
Authors: Thomas Huang
Venue:  (2007)

Human faces convey very important information, i.e., identity, emotion, focus of attention, etc., in human daily communications. People therefore have long contemplated the possibility of automatic analysis of human faces for convenient human-computer interaction. Compared to the other body parts, the human face is the part that can be captured most conveniently by video camera, and it is the most statistically consistent in color, shape, and texture for modeling. As the computational power of machines increases and many efficient face analysis techniques emerge, automatic detecting and tracking of human faces by video cameras is becoming a possibility for such purposes. This dissertation aims at developing algorithms for tracking human faces in videos for two scenarios: (1) human computer interaction HC), and (2) meeting room video analysis (MRVA). In the HCI scenario, the face usually appears close to the camera in high resolution. We explore Active Shape Model (ASM) techniques for localizing the 2D facial features in a CONDENSATION framework. The 3D face location and orientation can be inferred using an optical flow based 3D model face tracker. In the MRVA scenario, the faces are usually far away from the camera and the resolution is low. Tensor techniques are explored for localizing the faces. Various techniques, i.e., meanshift tracking, annealed particle filtering, and online model updating in generative Bayesian model and in subspaces, are explored for tracking the 212 head locations and 3D head poses. The focus of attention of the meeting attendants can then be inferred based on the head pose. As many inference tasks depend on the object appearances cropped according to the tracking result, which however is usually noisy due to outliers and imperfect models, we also explore the possibility of eliminating the appearance inconsistency caused by misalignments by simultaneously refining PCA models from the data using variational message passing (VMP) techniques, Based on the algorithms we have developed, we show the performance of a camera mouse in the HCI scenario, We also show some experiments for meeting room video indexing and retrieval in the MRVA scenario.
Integrated Application Domain Models for Chemical Engineering
Authors: J. Morbach, M. Theißen, W. Marquardt
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

A comprehensive summary of the application domain models presented in this chapter is given, and their integration into a common framework is discussed. Other existing application domain models of comparable scope are reviewed and compared to the models presented herein.
Design of a Distributed Traffic Monitoring System and Algorithm Based on Web-Camera
Authors: Hong Shi
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Traffic management in an urban area is highly facilitated by the knowledge of the traffic conditions in every street or highway involved in the vehicular mobility system. Aim of the paper is to propose a neuro-fuzzy approach able to compute the main parameters of a traffic system, i. e., car density, velocity and flow, by using the images collected by the web-cams located at the crossroads of the traffic network. The performances of this approach encourage its application when the traffic system is far from the saturation. A fuzzy model is also outlined to evaluate when it is suitable to use more accurate, even if more time consuming, algorithms for measuring traffic conditions near to saturation. 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
Use of cooperative learning and computer assisted instruction to investigate mathematics achievement scores, student's attitude toward cooperative learning and confidence in subject matter
Authors: Kathy R. Griffin
Venue:  (2008)

This study investigated mathematics achievement scores between students working in cooperative learning groups using computer assisted instruction (CAI), and students working alone using CAI in a post-secondary developmental mathematics class. Fifty-one students enrolled in a basic mathematics course participated in the study. Two classes were assigned to work alone using CAI, and two classes were assigned to work in cooperative pairs using CAI. This study was a pre-post-test design, and was administered to all participants to determine their mathematics achievement scores. A survey using a 5 point Likert Scale further examined if using cooperative learning and CAI would change students' attitude towards their confidence in the subject matter, their attitude towards working in cooperative learning groups. 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
GeoCLEF 2007: The CLEF 2007 Cross-Language Geographic Information Retrieval Track Overview
Authors: Thomas Mandl, Fredric Gey, Giorgio Nunzio, Nicola Ferro, Ray Larson, Mark Sanderson, Diana Santos, Christa Womser-Hacker, Xing Xie
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

GeoCLEF ran as a regular track for the second time within the Cross Language Evaluation Forum (CLEF) 2007. The purpose of GeoCLEF is to test and evaluate cross-language geographic information retrieval (GIR): retrieval for topics with a geographic specification. GeoCLEF 2007 consisted of two sub tasks. A search task ran for the third time and a query classification task was organized for the first. For the GeoCLEF 2007 search task, twenty-five search topics were defined by the organizing groups for searching English, German, Portuguese and Spanish document collections. All topics were translated into English, Indonesian, Portuguese, Spanish and German. Several topics in 2007 were geographically challenging. Thirteen groups submitted 108 runs. The groups used a variety of approaches. For the classification task, a query log from a search engine was provided and the groups needed to identify the queries with a geographic scope and the geographic components within the local queries.
Multi Layered System for High Performance Network Security Solution
Authors: Dae-Hyo Lee, Hong-Sun Kim, Tai-Myoung Chung
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Many network security solutions like firewall, IDS are available and development of network security changing paradigm is continuing its evolution. However many solutions using general CPU, called 'security appliance' have their limit to performance and expansion in environment changes. In this paper we present a vastly improved architecture of the Multi-Layered System (MLS) to solve the problem.
Enabling Change
Authors: Rebecca J. Wirfs-Brock
Venue: IEEE Software (2008)

Enabling continued, steady change requires that we integrate design corrections and adjustments into the natural course of development.
Service Orchestration Using the Chemical Metaphor
Authors: Jean-Pierre Banâtre, Thierry Priol, Yann Radenac
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

Service-oriented architectures (SOA) provide sets of operations through a network. A program built mainly upon calling services is called an orchestration of services. Different programming languages can be used to be the "glue" between services in an orchestration. This article shows how a programming language inspired by a chemical metaphor can be used to program service orchestration.
Multi-Return Macro Tree Transducers
Authors: Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.
Opening up the Interpretation Process in an Open Learner Model
Authors: Nicolas Van Labeke, Paul Brna, Rafael Morales
Venue: International Journal of Artificial Intelligence in Education (2007)

Opening a model of the learner is a potentially complex operation. There are many aspects of the learner that can be modelled, and many of these aspects may need to be opened in different ways. In addition, there may be complicated interactions between these aspects which raise questions both about the accuracy of the underlying model and the methods for representing a holistic view of the model. There can also be complex processes involved in inferring the learner's state, and opening up views onto these processes - which leads to the issues that are the main focus of this paper: namely, how can we open up the process of interpreting the learner's behaviour in such a manner that the learner can both understand the process and challenge the interpretation in a meaningful manner. The paper provides a description of the design and implementation of an open learner model (termed the xOLM) which features an approach to breaking free from the limitations of "black box" interpretation. This approach is based on a Toulmin-like argumentation structure together with a form of data fusion based on an adaptation of Dempster-Shafer. However, the approach is not without its problems. The paper ends with a discussion of the possible ways in which open learner models might open up the interpretation process even more effectively.
Aspect Mining in Procedural Object Oriented Code
Authors: Muhammad Usman Bhatti, Stéphane Ducasse, Awais Rashid
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Although object-oriented programming promotes reusable and well factored entity decomposition, industrial software often shows traces of lack of object-oriented design and procedural thinking. This results in scattered and tangled code related to domain entities. This is especially true in data intensive applications. Aspect mining techniques search for various patterns of scattered and tangled code pertaining to crosscutting concerns. However, in the presence of non-abstracted domain logic, the crosscutting concerns identified are inaccurately related to aspects even when they result from lack of OO abstraction. This paper identifies the difficulty of identifying crosscutting concerns in systems lacking elementary object-oriented structure. It presents an approach classifying various crosscutting concerns. We report our experience on an industrial software system.
Lattice Gas Automata Simulation of 2D Site-Percolation Diffusion: Configuration Dependence of the Theoretically Expected Crossover of Diffusion Regime
Authors: Mehrdad Ghaemi, Nasrollah Rezaei-Ghaleh, Yazdan Asgari
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Theoretical analysis of random walk on percolation lattices has predicted that, at the occupied site concentrations of above the threshold value, a characteristic crossover between an initial sub-diffusion to a final classical diffusion behavior should occur. In this study, we have employed the lattice gas automata model to simulate random walk over a square 2D site-percolation lattice. Quite good result was obtained for the critical exponent of diffusion coefficient. The random walker was found to obey the anomalous sub-diffusion regime, with the exponent decreasing when the occupied site concentration decreases. The expected crossover between diffusion regimes was observed in a configuration-dependent manner, but the averaging over the ensemble of lattice configurations removed any manifestation of such crossovers. This may have been originated from the removal of short-scale inhomogeneities in percolation lattices occurring after ensemble averaging.
Active Learning and Examination Methods in a Data Structures and Algorithms Course
Authors: Lauri Malmi, Ari Korhonen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

In this chapter, the implementation of two courses on data structures and algorithms at the Helsinki University of Technology is presented. The courses are based on the constructivist learning paradigm in which the students participate actively and feedback is provided on their performance despite the very large number of enrolled students each year. Moreover, an Internet-based learning environment is an integral part of the larger course because it provides an opportunity to apply active learning methods. Examples of the active learning methods are algorithm simulations exercises and analysis of algorithms for small-scale problems. In addition, students design algorithms and solutions for non-trivial practical applications. Moreover, in the more advanced course they carry out a small-scale research project to determine the empirical efficiency of given algorithms and the corresponding data structures.
Knowledge-based Autonomous Agents for Pervasive Computing Using AgentLight
Authors: Fernando L. Koch, John-Jules C. Meyer
Venue: IEEE Distributed Systems Online (2003)

Project AgentLight is a multiagent system-building framework targeting handheld and embedded computational devices. AgentLight applications will run in J2ME and J2SE environments using as little as 128 KBytes of RAM. The platform provides a built-in first-order logic inference system and interface for agent management and communication.
Histogram-based reversible data hiding technique using subsampling
Authors: Kyung-Su Kim, Min-Jeong Lee, Heung-Kyu Lee, Young-Ho Suh
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

Reversible data hiding technique guarantees that the original cover image is completely recovered from the marked image after the hidden data are extracted. This technique can be applied in some applications such as medical imaging and law enforcement where any distortion to the original image is not acceptable. In this paper, we present a reversible data hiding algorithm that shifts the histogram of the differences between subimages obtained through subsampling and embeds secret data by modifying the pixel value. Since the subimages are highly correlated and have strong spatial correlations, it utilizes the bins whose differences have smaller magnitude in the difference histogram. Moreover, the proposed scheme prevents possible over/underflow problem and no location map is needed during the retrieval. Experimental results prove that the proposed algorithm provides high embedding capacity while keeping the distortions low. In order to demonstrate the validity of our algorithm, we compare to other histogram-based reversible data hiding algorithms in terms of capacity and visual quality.
Gathering with Minimum Delay in Tree Sensor Networks
Authors: Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. In this paper we suppose that each sensor is equipped with an half---duplex interface; hence, a node cannot receive and transmit at the same time. Moreover, each node is equipped with omnidirectional antennas allowing the transmission over distance R. The network is a multi-hop wireless network and the time is slotted so that one---hop transmission of one data item consumes one time slot. We model the network with a graph where the vertices represent the nodes and two nodes are connected if they are in the transmission/interference range of each other. Due to interferences a collision happens at a node if two or more of its neighbors try to transmit at the same time. Furthermore we suppose that an intermediate node should forward a message as soon as it receives it. We give an optimal collision free gathering schedule for tree networks whenever each node has at least one data packet to send.
The Böhm---Jacopini Theorem Is False, Propositionally
Authors: Dexter Kozen, Wei-Lung Dustin Tseng
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

The Böhm---Jacopini theorem (Böhm and Jacopini, 1966) is a classical result of program schematology. It states that any deterministic flowchart program is equivalent to a while program. The theorem is usually formulated at the first-order interpreted or first-order uninterpreted (schematic) level, because the construction requires the introduction of auxiliary variables. Ashcroft and Manna (1972) and Kosaraju (1973) showed that this is unavoidable. As observed by a number of authors, a slightly more powerful structured programming construct, namely loop programs with multi-level breaks, is sufficient to represent all deterministic flowcharts without introducing auxiliary variables. Kosaraju (1973) established a strict hierarchy determined by the maximum depth of nesting allowed. In this paper we give a purely propositional account of these results. We reformulate the problems at the propositional level in terms of automata on guarded strings, the automata-theoretic counterpart to Kleene algebra with tests. Whereas the classical approaches do not distinguish between first-order and propositional levels of abstraction, we find that the purely propositional formulation allows a more streamlined mathematical treatment, using algebraic and topological concepts such as bisimulation and coinduction. Using these tools, we can give more mathematically rigorous formulations and simpler and more revealing proofs.
An ant algorithm for balanced job scheduling in grids
Authors: Ruay-Shiung Chang, Jih-Sheng Chang, Po-Sheng Lin
Venue: Future Generation Computer Systems (2009)

Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Grid can be classified into two types: computing grid and data grid. Job scheduling in computing grid is a very important problem. To utilize grids efficiently, we need a good job scheduling algorithm to assign jobs to resources in grids. In the natural environment, the ants have a tremendous ability to team up to find an optimal path to food resources. An ant algorithm simulates the behavior of ants. In this paper, we propose a Balanced Ant Colony Optimization (BACO) algorithm for job scheduling in the Grid environment. The main contributions of our work are to balance the entire system load while trying to minimize the makespan of a given set of jobs. Compared with the other job scheduling algorithms, BACO can outperform them according to the experimental results.
Selective self ICI cancellation scheme for OFDM systems
Authors: Arvind Kumar, Rajoo Pandey
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Orthogonal frequency division multiplexing (OFDM) is a well-suited multiplexing scheme for the fourth generation (4G) communication systems. The major drawback of OFDM systems is intercarrier interference (ICI), which degrades the system performance considerably. A self ICI cancellation scheme, proposed by Zaho, and Armstrong, improves the system performance in terms of symbol error rate (SER) and carrier to interference ratio (CIR) but reduces the system throughput to half as compared to normal OFDM. This paper presents a selective ICI self-cancellation scheme that improves the system throughput and reduces the SER for higher order modulation schemes (i.e. for 16-QAM, 32-QAM etc).
On the Behaviour of the (1+1)-ES for a Simple Constrained Problem
Authors: Dirk V. Arnold, Daniel Brauer
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper studies the behaviour of the (1 + 1)-ES when applied to a linear problem with a single linear constraint. It goes beyond previous work by considering constraint planes that do not contain the gradient direction. The behaviour of the distance of the search point from the constraint plane forms a Markov chain. The limit distribution of that chain is approximated using an exponential model, and progress rates and success probabilities are derived. Consequences for the working of step length adaptation mechanisms based on success probabilities are discussed.
A Semi-automatic Wizard of Oz Technique for Let'sFly Spoken Dialogue System
Authors: Alexey Karpov, Andrey Ronzhin, Anastasia Leontyeva
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The paper presents Let'sFly spoken dialogue system intended for natural human-computer interaction via telephone lines in travel planning domain. The system uses ASR, keyword spotting and TTS methods for continuous Russian speech and a dialogue manager with mixed-initiative strategy. Semi- automatic Wizard of Oz technique used for collecting speech data and real dialogues is described. Semi-automatic model is a tradeoff between a fully automatic spoken dialogue system and an interaction with a hidden human-operator working like a computer system. The experimental data obtained with this technique are discussed in the paper.