ppxscal/embedding_network huggingface dataset:
Managing Knowledge in Global Software Development Efforts: Issues and Practices
Authors: Kevin C. Desouza, Yukika Awazu, Peter Baloh
Venue: IEEE Software (2006)

The knowledge-intensive nature of current global software development efforts poses interesting challenges. Organizations must manage knowledge in all stages of software development effortsfrom encapsulating design requirements to creating and testing programs, installation, and maintenance. Knowledge even extends to the improvement of organizational software development processes and practices. This article examines knowledge management practices in more than 50 software organizations over the last three years, describing the major findings in the context of knowledge management in software development efforts on a global scale.This article is part of a special issue on Global Software Development.
Pricing for customers with probabilistic valuations as a continuous knapsack problem
Authors: Michael Benisch, James Andrews, Norman Sadeh
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. We show that under certain assumptions this problem can be reduced to the continuous knapsack problem (CKP). We present a new fast &epsilon;-optimal algorithm for solving CKP instances with asymmetric concave reward functions. We also show that our algorithm can be extended beyond the CKP setting to handle pricing problems with overlapping goods (e.g.goods with common components or common resource requirements), rather than indistinguishable goods.We provide a framework for learning distributions over customer valuations from historical data that are accurate and compatible with our CKP algorithm, and we validate our techniques with experiments on pricing instances derived from the Trading Agent Competition in Supply Chain Management (TAC SCM). Our results confirm that our algorithm converges to an &epsilon;-optimal solution more quickly in practice than an adaptation of a previously proposed greedy heuristic.
Advances in phase-only signal processing
Authors: H. Ge, D. W. Tufts
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The problem of estimating the frequencies of two sinusoids in white Gaussian noise using only the sequence of phase angles of the complex-valued data is addressed. The authors extend the single sinusoid results of Tretter (1985), Kay (1989), Lang and Musicus (1989), and Lovell et al. (1991) to two sinusoids. A computationally simple estimation scheme is proposed, which uses only phase data to estimate the frequencies, and uses envelope data to resolve the inherent ambiguity. A computer simulation was performed to compare the estimation performance of the scheme with weighted phase averaging and with Cramer-Rao lower bounds.
Perfectly reliable message transmission
Authors: Arvind Narayanan, K. Srinathan, C. Pandu Rangan
Venue: Information Processing Letters (2006)

We consider the problem of reliable message transmission between two synchronous players connected by n wires, some t < n/2 of which may be faulty. We show how to get reliability "for free"--reliable transmission of b bits involves a total communication of only O(b) bits, when b is large enough. We also construct an efficient Perfectly Secure Message Transmission Protocol.
Navigational Indices and Content Interlinkage on the Fly
Authors: Peter Ziewer
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Lecture recording provides learning material for local and distance education. The TeleTeachingTool uses the most flexible screen recording technique to capture virtually any material displayed during a presentation. With its built-in annotation system teachers can add freehand notes and emphasize important parts. Unlike other screen recorders, our implementation offers slide-based navigation, full text search and annotated scripts, which is obtained by automated post-production. This paper presents how to achieve live access to any slide with corresponding annotations created earlier during the presentation, although annotations are not associated with slides. For this the post-processing algorithms must be adapted to work on the fly while the presentation is still in progress and an interlinkage between slides and annotations must be achieved.
An Image Hiding Scheme Based on Du's Disk Allocation Method
Authors: Chia-Chen Lin, Chin-Chen Chang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we discuss whether there is any possibility of applying declustering to design various image hiding schemes. To test our theory, we propose a novel image hiding scheme based on Du's disk allocation method, which is a typical declustering scheme, to hide binary secret images and gray scale secret images in a gray scale secret image. From the experimental results, we found that our scheme performs better than the simple LSB substitution method when the secret images are binary or the size of the gray scale is smaller than or equal to the gray scale host image.
Enhancing evolutionary algorithms with statistical selection procedures for simulation optimization
Authors: Peter Buchholz, Axel Thümmler
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper, we present an evolution strategy for the optimization of simulation models. Our approach incorporates statistical selection procedures that efficiently select the best individual, where best is defined by the maximum or minimum expected simulation response. We use statistical procedures for the survivor selection during the evolutionary process and for selecting the best individual from a set of candidate best individuals, a so-called elite population, at the end of the evolutionary process. Furthermore, we propose a heuristic selection procedure that reduces a random-size subset, containing the best individual, to at most a predefined size. By means of a stochastic sphere function and a simulation model of a production line, we show that this procedure performs better in terms of number of model evaluations and solution quality than other state-of-the-art statistical selection procedures.
Quote quad letters
Venue: ACM SIGAPL APL Quote Quad (1996)

Here's a sampling from the Editors' mailbag:Roy's comment about "IBM's introduction of APVs..." in the "early 1980's" is way too late. APVs were first introduced, to my knowledge, in APL/4004 (Siemens APL) by Eric Iverson and others in early 1973. See Eric's article in the APL73 Proceedings. 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
Inverse heat conduction analysis of quenching process using finite-element and optimization method
Authors: Li Huiping, Zhao Guoqun, Niu Shanting, Luan Yiguo
Venue: Finite Elements in Analysis and Design (2006)

The calculation of surface heat transfer coefficient during quenching process is one of the inverse heat conduction problems, and it is a nonlinear and ill-posed problem. A new method to calculate the temperature-dependent surface heat transfer coefficient during quenching process is presented, which applies finite-element method (FEM), advance-retreat method and golden section method to the inverse heat conduction problem, and can calculate the surface heat transfer coefficient according to the temperature curve gained by experiment. In order to apply the advance-retreat method to the inverse heat conduction problem during quenching process, the arithmetic is improved, so that the searching interval of optimization can be gained by the improved advance-retreat method. The optimum values of surface heat transfer coefficient can be easily obtained in the searching interval by golden section method. During the calculation process, the phase-transformation volume and phase-transformation latent heat of every element in every time interval can be calculated easily by FEM. The temperature and phase-transformation volume of every element are calculated with the coupling calculation of phase-transformation latent heat.
Flexible module-based modeling and analysis for large-scale transportation-inventory systems
Authors: Kanna Miwa, Soemon Takakuwa
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A method of modeling large-scale transportation-inventory systems is proposed as an attempt to describe the systems flexibly. Such a system has a lot of items that are ordered, transported, and stored at the warehouses of the distribution centers. The system consists of any required numbers of "sources" and "destinations" as the need arises to build a simulation model. The order by a destination is made toward the associated source, based on the inventory policy at the distribution center. A more flexible module-based method is proposed to generate simulation models for transportation-inventory systems and by adopting Excel VBA. The proposed method is applied to the actual system. It was found that the time to build simulation models could be drastically reduced. Furthermore, the proposed method was found to be both practical and powerful.
Fast On-line Kernel Learning for Trees
Authors: Fabio Aiolli, Giovanni Da San Martino, Alessandro Sperduti, Alessandro Moschitti
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational demanding to be applied to complex learning algorithms, e.g. Support Vector Machines. Consequently, in order to apply kernels to large amount of structured data, we need fast on-line algorithms along with an efficiency optimization of kernel-based computations. In this paper, we optimize this computation by representing set of trees by minimal Direct Acyclic Graphs (DAGs) allowing us i) to reduce the storage requirements and ii) to speed up the evaluation on large number of trees as it can be done 'one-shot' by computing kernels over DAGs. The experiments on predicate argument subtrees from PropBank data show that substantial computational savings can be obtained for the perceptron algorithm.
Approximation and identification of diffusive interfaces by fractional models
Authors: A. Benchellal, T. Poinot, J.-C. Trigeassou
Venue: Signal Processing (2006)

Heat transfer problems obey to diffusion phenomenon. In this paper we show that they can be modelled with the help of fractional systems. The simulation is based on a fractional integrator operator where the non-integer behaviour acts only over a limited spectral band. Starting with frequency considerations derived from the analysis of a diffusion problem, a more general approximation of the fractional system is proposed. A state-space model is presented that gives an accurate simulation for transients, and with which it is possible to carry out an output-error technique to estimate the model parameters. Numerical simulations of the heat transfer problem are used to illustrate the improvements of the proposed model.
On arrays with small loops and short dipoles
Authors: J. Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The author shows that when polarization sensitive arrays consisting of crossed small loops and short dipoles are used, one can eliminate the requirement in the ESPRIT algorithm that sensors must occur in matched pairs. The dipoles are sensitive to the incident electric field components, and the loops to magnetic field components of the incident waves. The invariance properties are exploited among the dipole and loop outputs of an arbitrary array of orthogonal loops and orthogonal dipoles to compute both the two-dimensional arrival angles and polarization of incoming narrowband signals. 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
Evaluating guidelines for empirical software engineering studies
Authors: Barbara Kitchenham, Hiyam Al-Khilidar, Muhammad Ali Babar, Mike Berry, Karl Cox, Jacky Keung, Felicia Kurniawati, Mark Staples, He Zhang, Liming Zhu
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Background. Several researchers have criticized the standards of performing and reporting empirical studies in software engineering. In order to address this problem, Andreas Jedlitschka and Dietmar Pfahl have produced reporting guidelines for controlled experiments in software engineering. They pointed out that their guidelines needed evaluation. We agree that guidelines need to be evaluated before they can be widely adopted. If guidelines are flawed, they will cause more problems that they solve.Aim. The aim of this paper is to present the method we used to evaluate the guidelines and report the results of our evaluation exercise. We suggest our evaluation process may be of more general use if reporting guidelines for other types of empirical study are developed.Method. We used perspective-based inspections to perform a theoretical evaluation of the guidelines. A separate inspection was performed for each perspective. The perspectives used were: Researcher, Practitioner/Consultant, Meta-analyst, Replicator, Reviewer and Author. Apart from the Author perspective, the inspections were based on a set of questions derived by brainstorming. The inspection using the Author perspective reviewed each section of the guidelines sequentially. Results. The question-based perspective inspections detected 42 issues where the guidelines would benefit from amendment or clarification and 8 defects.Conclusions. Reporting guidelines need to specify what information goes into what section and avoid excessive duplication. Software engineering researchers need to be cautious about adopting reporting guidelines that differ from those used by other disciplines. The current guidelines need to be revised and the revised guidelines need to be subjected to further theoretical and empirical validation. Perspective-based inspection is a useful validation method but the practitioner/consultant perspective presents difficulties.
Principles for the Prediction of Video Decoding Times Applied to MPEG-1/2 and MPEG-4 Part 2 Video
Authors: Michael Roitzsch, Martin Pohlack
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

In this paper, we present a method to predict per-frame decoding times of modern video decoder algorithms. By examining especially the MPEG-1, MPEG-2, and MPEG- 4 pt. 2 algorithms, we developed a generic model for these decoders, which also applies to a wide range of other decoders. From this model, we derived a method to predict decoding times with an up-to-now unmatched accuracy while keeping the overhead low. We show the effectiveness of this method with an example implementation and compare the resulting predictions with the actual decoding times using video material from commercial DVDs.
Interfaces for Video Based Web Lectures
Authors: Nuno Correia, Diogo Cabral
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper describes the current status of the VideoStore project. This project has the goal of developing a Web based system to store, transmit, search, and share the contents of courses captured in video. The current version includes a stable version of the architecture, and a set of advanced interfaces. The application synchronizes video streaming and slideshow presentations, and currently it provides several video based interfaces, and a video annotation system. The paper describes the system features, the architecture and the interfaces developed.
Scale Variant Image Pyramids
Authors: Joshua Gluckman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Multi-scale representations are motivated by the scale invariant properties of natural images. While many low level statistical measures, such as the local mean and variance of intensity, behave in a scale invariant manner, there are many higher order deviations from scale invariance where zero-crossings merge and disappear. Such scale variant behavior is important information to represent because it is not easily predicted from lower resolution data. A scale variant image pyramid is a representation that separates this information from the more redundant and predictable scale invariant information.
Stereoscopic Illusory Contours&mdash;Cortical Neuron Responses and Human Perception
Authors: Barbara Heider
Venue: Journal of Cognitive Neuroscience (2002)

In human perception, figure&ndash;ground segregation suggests that stereoscopic cues are grouped over wide areas of the visual field. For example, two abutting rectangles of equal luminance and size are seen as a uniform surface when presented at the same depth, but appear as two surfaces separated by an illusory contour and a step in depth when presented with different retinal disparities. Here, we describe neurons in the monkey visual cortex that signal such illusory contours and can be selective for certain figure-ground directions that human observers perceive at these contours. The results suggest that these neurons group stereoscopic cues over distances up to 8&deg;. In addition, we compare these results with human perception and show that the mean stimulus parameters required by these neurons also induce optimal percepts of illusory contours in human observers.
Structural Patterns for the Transformation of Business Process Models
Authors: Marion Murzek, Gerhard Kramler, Elke Michlmayr
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Due to company mergers and business to business interoperability, there is a need for model transformations in the area of business process modeling to facilitate scenarios like model integration and model synchronization. General model transformation approaches do not consider the special properties of business process models and horizontal transformation scenarios. Therefore, we propose a model transformation approach based on domainspecific patterns which are applied for analyzing business process models in a precise way. This approach facilitates the definition of business process model transformations, which can be easily adapted to different business process modeling languages and specific transformation problems. At the same time it supports the intuitive understanding of the domainexperts in business process modeling.
Job Failure Analysis and Its Implications in a Large-Scale Production Grid
Authors: Hui Li, David Groep, Lex Wolters, Jeff Templon
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper we present an initial analysis of job failures in a large-scale data-intensive Grid. Based on three representative periods in production, we characterize the interarrival times and life spans of failed jobs. Different failure types are distinguished and the analysis is carried out further at the Virtual Organization (VO) level. The spatial behavior, namely where job failures occur in the Grid, is also examined. Cross-correlation structures, including how arrivals correlate with life spans of job failures, are analyzed and illustrated. We further investigate statistical models to fit the failure data and propose several failureaware scheduling strategies at the Grid level. Our results show that the overall failure rates in the Grid are quite significant, ranging from 25% to 33% of all submitted jobs. However, only 5% to 8% of the jobs failed after running on a certain Computing Element (CE). The rest of failed jobs are aborted or cancelled without running. A majority of failed jobs come from several large production VOs and a large amount of these failures are centered around several main CEs. The interarrival time processes of failed jobs are shown to be bursty, and the life spans exhibit strong autocorrelations. Based on the failure patterns we argue that it is important for the Grid resource brokers to track historical failure and take it into account in decision making. Some proactive measures and accountability issues are also discussed.
The Analyses of Strategic Deterrence Effect's Impact on Strategic Alliance's Decision-Making Based on Horizontally Differentiated Product Market
Authors: Tiebo Song, Wenfeng Cen, Liangxing Zhang, Xiong Chen
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper, we used the Salop's circular city model to analyze the effect of strategic alliance to the potential entrant's enter decision, and the alliance room for the incumbents themselves, under the horizontally differentiated product market. Here we used a three stages game model, and consider the decrease of marginal cost to be the main function of alliance. What's difference in this paper is that: Strategic alliance may not only have direct profit for the firms, but also have indirect profit for them, which come from deterring the potential entrant. So, the effect of entry deterring enlarges the alliance room of the incumbents.
IQU: practical queue-based user association management for WLANs
Authors: Amit P. Jardosh, Kimaya Mittal, Krishna N. Ramachandran, Elizabeth M. Belding, Kevin C. Almeroth
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Flash crowds and high concentrations of users in wireless LANs (WLANs) cause significant interference problems and unsustainable load at access points. This leads to poor connectivity for users, severe performance degradation, and possible WLAN collapse. To validate this claim, we present two case studies of large, heavily loaded operational WLANs. These studies provide significant insight into the degraded performance and collapse of a WLAN during heavy use. To address these problems, we propose IQU, a practical queue-based user association management system for heavily loaded WLANs. IQU grants users fair opportunities to access the WLAN while maintaining high overall throughput, even when the WLAN is heavily loaded. The basic premise of IQU is to control user associations with the WLAN through request queues and work period allocations. We implement a prototype of IQU and evaluate it on a wireless testbed. Our evaluation demonstrates that IQU significantly improves network throughput under heavy load; the tradeoff is that users have to wait for network access. We explore the impact of IQU parameters on system performance, and validate the robustness of IQU under heavy load conditions. Through IQU, WLANs can be utilized efficiently and network collapse prevented.