ppxscal/embedding_network huggingface dataset:
Reducing biases in individual software effort estimations: a combining approach
Authors: Qi Li, Qing Wang, Ye Yang, Mingshu Li
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software effort estimation techniques abound, each with its own set of advantages and disadvantages, and no one proves to be the single best answer. Combining estimating is an appealing approach. Avoiding the difficult problem of choosing the single "best" technique, it solves the problem by asking which techniques would help to improve accuracy, assuming that each has something to contribute. In this paper, we firstly introduce the systematic "external" combining idea into the field of software effort estimation, and estimate software effort using Optimal Linear Combining (OLC) method with an experimental study based on a real-life data set. The result indicates that combining different techniques can significantly improve the accuracy and consistency of software effort estimation by making full use of information provided by all components, even the much "worse" one.
About Structure of Shannon Information Amount for Joint Filtering and Extrapolation Problem by Continuous-Discrete Memory Observations
Authors: Nikolas Dyomin, Irina Safronova, Svetlana Rozhkova
Venue: Informatica (2004)

In this paper on basis of the results (Dyomin et al., 2003a) the structure of Shannon information amount in the joint filtering and extrapolation problem of the stochastic processes by continuous-discrete time memory observations is investigated. For particular class of processes with applying of the general results the problem of optimal transmission over the lag channels is considered and efficiency of filtering and extrapolation receptions under transmission over channels with memory or lag is investigated.
Texture-Based Multiscale Segmentation: Application to Stromal Compartment Characterization on Ovarian Carcinoma Virtual Slides
Authors: Nicolas Signolle, Benoît Plancoulaine, Paulette Herlin, Marinette Revenu
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

A multiscale segmentation strategy using wavelet-domain hidden Markov tree model and pairwise classifiers selection is tested in the present paper for histopathology virtual slide analysis. The classifiers selection is based on a study of the influence of hyper-parameters of the method. Combination of outputs of selected classifiers is then done with majority vote. The results of the segmentation of various types of stroma of ovarian carcinomas are presented and discussed.
Detail Enhance FRIT Denoisy Method Based on Energy Delamination
Authors: Dan-dan Liu, Chun-rui Tang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Image denoising is an important step in the pre-processing of image, the noisy image will bear different characteristic. For an anisotropic image, wavelet loses their effect on singularity detection because discontinuities across edges are spatially distributed. The Finite Ridgelet transform is a new directional resolution transform and it is more suitable for describing the signals with line or hyperplane singularities. The method could conquer the defect of Wavelet in high dimension. The method changes the line singularity in the image into the point singularity via the Radon Transform, then deal the point singularity with Wavelet Transform. In this paper, we show that the energy is compact by using the Radon Transform on the image, and applie the characteristic of the Ridgelet Transform in the image denoising processing. The method obtains good result in the denoising and edge keeping of the image. Especially under the strong noisy, it is better than other method.
A Uniform Lower Error Bound for Half-Space Learning
Authors: Andreas Maurer, Massimiliano Pontil
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound is uniform in the choice of the target half-space and has an exponentially decaying deviation probability in the sample. The technique of proof is related to a proof of the Johnson Lindenstrauss Lemma. We argue that, unlike previous lower bounds, our result is well suited to evaluate the benefits of multi-task or transfer learning, or other cases where an expense in the acquisition of domain knowledge has to be justified.
On Some City Guarding Problems
Authors: Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon Ntafos, Junqiang Zhou
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We consider guarding a city of k vertical buildings, each having a rectangular base, by placing guards only at vertices. The aim is to use the smallest number of guards. The problem is a 2.5D variant of the traditional art gallery problem, and finds applications in urban security.We give upper and lower bounds on the number of guards needed for a few versions of the problem. Specifically, we prove that $\lfloor\frac{2(k-1)}{3}\rfloor + 1$ guards are always sufficient and sometimes necessary to guard all roofs, and $1 + k + \lfloor \frac{k}{2}\rfloor$ guards are always sufficient to guard the roofs, walls, and the ground, while each roof has at least one guard on it.
Effectively Checking the Finite Variant Property
Authors: Santiago Escobar, José Meseguer, Ralf Sasse
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

An equational theory decomposed into a set B of equational axioms and a set Δ of rewrite rules has the finite variant (FV) property in the sense of Comon-Lundh and Delaune iff for each term t there is a finite set {t 1,...,t n } of ¿ Δ,B -normalized instances of t so that any instance of t normalizes to an instance of some t i modulo B. This is a very useful property for cryptographic protocol analysis, and for solving both unification and disunification problems. Yet, at present the property has to be established by hand, giving a separate mathematical proof for each given theory: no checking algorithms seem to be known. In this paper we give both a necessary and a sufficient condition for FV from which we derive an algorithm ensuring the sufficient condition, and thus FV. This algorithm can check automatically a number of examples of FV known in the literature.
Piavca: A Framework for Heterogeneous Interactions with Virtual Characters
Authors: Marco Gillies, Xueni Pan, Mel Slater
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Animated virtual humans are a vital part of many virtual environments today. Of particular interest are virtual human that we can interact with in some approximation of social interaction. However, creating characters that we can interact with believably is an extremely complex problem. Part of this difficulty is that human interaction is highly multi-modal. This multi-modality implies that there will be a great variety of ways of interacting with a virtual character. The diverse styles of interaction also imply diverse methods of generating behavior. For example animation can be played back from motion capture, generated procedurally, or generated by transforming existing motion capture
Bayesian Ying-Yang Learning on Orthogonal Binary Factor Analysis
Authors: Ke Sun, Lei Xu
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Binary Factor Analysis (BFA) aims to discover latent binary structures in high dimensional data. Parameter learning in BFA suffers from exponential complexity and a large number of local optima. Model selection in BFA is therefore difficult. The traditional approach for model selection is implemented in a two phase procedure. On a prefixed range of model scales, maximum likelihood (ML) learning is performed for each candidate scale. After this enumeration, the optimum scale is selected according to some criterion. In contrast, the Bayesian Ying-Yang (BYY) learning starts from a high dimensional model and automatically deducts the dimension during parameter learning. The enumeration overhead in the two phase approach is saved. This paper investigates a subclass of BFA called Orthogonal Binary Factor Analysis (OBFA). A BYY machine for OBFA is constructed. The harmony measure, which serves as the objective function in the BYY harmony learning, is more accurately estimated by recovering a term that was missing in the previous studies on BYY learning based BFA. Comparison with traditional two phase implementations shows good performance of the proposed approach.
Using Load Transformations to Predict the Impact of Packet Fragmentation and Losses on Markovian Arrival Processes
Authors: Stephan Heckmüller, Bernd E. Wolfinger
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

Load transformation can be used to derive valid load models for secondary loads in computer networks, as they can be observed at lower layer interfaces in protocol stacks. In this paper we apply the technique of load transformation onto load represented by BMAP (Batch Markov Arrival Process) models and choose as concrete transformations the following two practically relevant classes of load transforming processes in packet-switched networks: "Fragmentation" and "Losses of Packets". Comparing the analytical characteristics of load after transformation with corresponding load predictions based on load transformation by simulation, we are able to show that realistic modeling is feasible for both classes of transformations considered. We also illustrate the usefulness of the analytical models elaborated by deriving a detailed prediction of secondary load characteristics which, in turn, can be used to specifically optimize performance measures (such as network throughput).
Simulation Research on the Stock Control Strategy of VMI Combined Revenue Sharing
Authors: Zhang Tie Zhu, Wang Yue Peng
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

A mixed strategy which combines VMI and revenue sharing is put forward in this paper due to the problem of supply chain's hierarchy stock control strategy. A hierarchy and multi-cycle simulation model is constructed by Multi-Agent as well. The stock strategy of(S, Q), VMI, and VMI which is combined with revenue-sharing is carried out by discrete event simulation software EM-Plant. As the result, the stock strategy of VMI combined with revenue sharing not only reduces bullwhip effect and average holding stock cost but also distributes the profit of supply chain members reasonable and coordinates the supply chain well.
Reliability of a large REAC installation
Authors: Bernard Loveman
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

Project cyclone at the Reeves Instrument Corporation is under the cognizance of the Bureau of Aeronautics of the Department of the Navy. The primary function of Project Cyclone is the development and operation of a Guided Missile Simulator and the establishment and operation of a Simulation Laboratory. Problems in aeroelasticity, engine control, aircraft stability, dynamics, and navigation have also been studied with the aid of the computing facilities of the Simulation Laboratory. 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
The JavaFest: a collaborative learning technique for Java programming courses
Authors: Matthias Hauswirth, Dmitrijs Zaparanuks, Amirhossein Malekpour, Mostafa Keikha
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

Learning to create well-designed and robust Java programs requires, besides a good understanding of the language, a significant amount of practice. In this paper we present the JavaFest, a collaborative learning technique for teaching Java to beginning programmers. A JavaFest is a group exercise that instructors can add to their repertoire of teaching techniques. It provides an opportunity for students to practice programming in a motivating but non-threatening environment, and to learn from the experience of their peers. Moreover, a JavaFest allows the instructor to gain insight into the current standing of the students in her class. We describe the concept of a JavaFest and present three case studies in the form of three concrete JavaFests we developed and evaluated in our own object-oriented programming course. The general idea of a JavaFest, and the three specific examples we describe and evaluate, can easily be adopted to enhance any Java programming course.
Analysis of an M/G/1 Queue with Repeated Inhomogeneous Vacations with Application to IEEE 802.16e Power Saving Mechanism
Authors: Sara Alouf, Eitan Altman, Amar P. Azad
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

The goal of this paper is to establish a general approach for analyzing queueing models with repeated in homogeneous vacations. At the end of a vacation, the server goes on another vacation, possibly with a different probability distribution, if during the previous vacation there have been no arrivals. In case there have been one or more arrivals during a vacation then a busy period starts after a warm-up time. In order to get an insight on the influence of parameters on the performance, we choose to study a simple M/G/1 queue (Poisson arrivals and general independent service times) which has the advantage of being tractable analytically. The theoretical model is applied to the problem of power saving for mobile devices in which the sleep durations of a device correspond to the vacations of the server. Various system performance metrics such as the frame response time and the economy of energy are derived. A constrained optimization problem is formulated to maximize the economy of energy achieved in power save mode, with constraints as QoS conditions to be met. An illustration of the proposed methods is shown with a WiMAX system scenario to obtain design parameters for better performance. Our analysis allows us not only to optimize the system parameters for a given traffic intensity but also to propose parameters that provide the best performance under worst case conditions.
Penetration Testing of OPC as Part of Process Control Systems
Authors: Maria B. Line, Martin Gilje Jaatun, Zi Bin Cheah, A. B. Faruk, Håvard Husevåg Garnes, Petter Wedum
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

We have performed penetration testing on OPC, which is a central component in process control systems on oil installations. We have shown how a malicious user with different privileges --- outside the network, access to the signalling path and physical access to the OPC server --- can fairly easily compromise the integrity, availability and confidentiality of the system. Our tentative tests demonstrate that full-scale penetration testing of process control systems in offshore installations is necessary in order to sensitise the oil and gas industry to the evolving threats.
The stable marriage problem with master preference lists
Authors: Robert W. Irving, David F. Manlove, Sandy Scott
Venue: Discrete Applied Mathematics (2008)

We study variants of the classical stable marriage problem in which the preferences of the men or the women, or both, are derived from a master preference list. This models real-world matching problems in which participants are ranked according to some objective criteria. The master list(s) may be strictly ordered, or may include ties, and the lists of individuals may involve ties and may include all, or just some, of the members of the opposite sex. In fact, ties are almost inevitable in the master list if the ranking is done on the basis of a scoring scheme with a relatively small range of distinct values. We show that many of the interesting variants of stable marriage that are NP-hard remain so under very severe restrictions involving the presence of master lists, but a number of special cases can be solved in polynomial time. Under this master list model, versions of the stable marriage problem that are already solvable in polynomial time typically yield to faster and/or simpler algorithms, giving rise to simple new structural characterisations of the solutions in these cases.
Bebras International Contest on Informatics and Computer Literacy: Criteria for Good Tasks
Authors: Valentina Dagienė, Gerald Futschek
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

The Bebras International Contest on Informatics and Computer Literacy is a motivation competition in informatics that addresses all lower and upper secondary school pupils divided into three age groups: Benjamin (age 11-14), Junior (age 15-16) and Senior (for upper secondary level). Using a computer the pupils have to solve 15 to 21 tasks of different levels within 45 minutes. Two general types of problems have been used: interactive tasks and multiple-choice tasks. Creating interesting and attractive tasks that are also motivating and funny for the pupils is very challenging. The paper deals with criteria for good tasks. Some examples of tasks are presented and discussed as well.
Enabling attribute delegation in ubiquitous environments
Authors: Isaac Agudo, Javier Lopez, Jose A. Montenegro
Venue: Mobile Networks and Applications (2008)

When delegation is implemented using the attribute certificates in a Privilege Management Infrastructure (PMI), it is possible to reach a considerable level of distributed functionality. However, the approach is not flexible enough for the requirements of ubiquitous environments. The PMI can become a too complex solution for devices such as smartphones and PDAs, where resources are limited. In this work we present an approach to solve the previous limitations by defining a second class of attributes, called domain attributes, which are managed directly by users and are not right under the scope of the PMI, thus providing a light solution for constrained devices. However, we relate the two classes of attributes are related by defining a simple ontology. While domain attribute credentials are defined using SAML notation, global attributes are defined using X.509 certificates. For this reason, we additionally introduce XSAML so that both kinds of credentials are integrated. We also introduce the concept of Attribute Federation which is responsible for supporting domain attributes and the corresponding ontology.
First International Workshop on the Model-Based Design of Trustworthy Health Information Systems
Authors: Ákos Lédeczi, Ruth Breu, Bradley Malin, Janos Sztipanovits
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

The objective of the MOTHIS workshop was to discuss model-based methods for the design of Health Information Systems (HIS) offering a revolutionary new way for the interaction between medical patients and Health Care Providers. Although healthcare, like other information-intensive industries, has developed and deployed standards-based, secure information infrastructures it is still dependent upon paper records and fragmented, error-prone approaches to service delivery. The primary concern is that security and privacy need to be organically integrated into HIS architectures. The workshop brought together computer scientists, medical experts, and legal policy experts to discuss research results in the development and application of model-based methods for representing, analyzing and integrating, architectures, privacy and security policies, computer security mechanisms, web authentication, and human factors engineering.
Relative distance identification in "Smart Dust" networks for environmental modelling
Authors: Graham A. Rollings, David W. Corne
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Smart dust (wireless sensor) networks have many applications in environmental monitoring. In many such applications, the data gathered by the motes is only useful in combination with knowledge of the motes' positions, and this needs to be estimated in cases where they are airborne, or otherwise not statically fixed. GPS based location solutions are prohibitively expensive and also present some operational difficulties, so it is important to find others ways to determine location. This is usually termed 'Localisation', a problem made more complex where the position and velocity of the motes are subject to external forces. We investigate this by exploring the use of optimisation algorithms to find relative distance configurations that minimise a straightforward error function based on the Received Signal Strength Indication (RSSI). In this paper we focus on simulating noise-free conditions; although less realistic, this provides information about whether or not this problem can be satisfactorily solved at all in reasonable time, and, if so, for what sizes of mote network will this be possible. We find that for the range of mote clusters sizes considered as a static field model the results are indeed sufficiently encouraging to indicate the need to continue the research.
Query Processing to Efficient Search in Ubiquitous Computing
Authors: Byung-Ryong Kim, Ki-Chang Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Both ubiquitous computing and mobile ad-hoc networks (MANET) have recently attracted a lot of attention in the research community as well as the industry. Both the domains share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Distributed hash table (DHT) provides a very effective and reliable search scheme in Both Networks. However, when the search involves query consist of a set of common words, it suffers heavy network traffic due to the passing around of a large inverted list among nodes. In this paper, we suggest a technique based on the concept of distance between keywords that can remove irrelevant indices from the list. It utilizes the concept of distance between keywords in the query and removes those entries in the inverted list that are going to be dropped sooner or later. We prove this prediction is accurate and effective such that it reduces the size of the inverted list.