ppxscal/embedding_network huggingface dataset:
Integrating top-down and scenario-based methods for constructing software specifications
Authors: Shaoying Liu
Venue: Information and Software Technology (2009)

How to achieve a complete and consistent software specification by construction is an important issue for software quality assurance but still remains an open problem. The difficulty lies in the fact that the assurance of the completeness needs user's judgments and the specification keeps changing as requirements analysis progresses. To allow the user to easily make such judgments and to reduce chances for creating inconsistencies due to frequent specification modifications, in this paper we describe an intuitive, formal, and expressive specification method that integrates top-down decompositional and scenario-based compositional methods. The decompositional method is used at an informal level with the goal of achieving a complete coverage of the user's functional requirements, while the compositional method is used to precisely define the functionality of each scenario and to construct complex scenarios by composition of simple scenarios in a formal, intuitive language called SOFL. Combination of the decompositional and compositional processes can facilitate the analyst in completing a specification in a hierarchical structure. We present an example to illustrate how the integrated method is used in practice and describe a software support tool for the method.
Connectivity-preserving transformations of binary images
Authors: Prosenjit Bose, Vida Dujmović, Ferran Hurtado, Pat Morin
Venue: Computer Vision and Image Understanding (2009)

A binary image I is B"a, W"b-connected, where a,b@?{4,8}, if its foreground is a-connected and its background is b-connected. We consider a local modification of a B"a, w"b-connected image I in which a black pixel can be interchanged with an adjacent white pixel provided that this preserves the connectivity of both the foreground and the background of I. We have shown that for any (a,b)@?{(4,8), (8,4), (8,8)}, any two B"a, w"b-connected images I and J each with n black pixels differ by a sequence of @Q(n^2) interchanges. We have also shown that any two B"4, W"4-connected images I and J each with n black pixels differ by a sequence of O(n^4) interchanges.
A Simulation Model for Transit Service Unreliability Prevention Based on AVL-APC Data
Authors: Wei-Ya Chen, Zhi-Ya Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A stochastic simulation model using archived automatic vehicle location (AVL) and automatic passenger count (APC) data to simulate a fixed transit route service and test preventive bus operation control strategies against unreliability was developed. In this model, the bus operation and passenger demand were simulated based on AVL and APC data, and the decision-making process of preventive strategies was involved. A case study of bus services on the Route 20 at Chicago Transit Authority (CTA) was performed to demonstrate and test the simulator. All the parameters for the simulator in this case were derived only from CTA’s AVL and APC data. Preventive strategies on bus operation were triggered according to the prediction of unreliability. The simulation result showed that preventive control strategies were effective on preventing headway irregularity.
A model for matching and integrating heterogeneous relational biomedical databases schemas
Authors: Yaser Karasneh, Hamidah Ibrahim, Mohamed Othman, Razali Yaakob
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

Database integration aims at providing a uniform and consistent view called global schema, over a set of autonomous and heterogeneous data sources, so that data residing in different sources can be accessed as if it was in a single schema. The integration of data sources can be performed in two steps, a matching and a data transformation step. Schema matching, the focus of this paper, is a fundamental operation in the manipulation of schema in formatting match, which takes two schemas that correspond semantically to each other. Manually specifying schema matches is a tedious, time consuming, error-prone, and therefore expensive process, which is a growing problem given the rapidly increasing number of data sources to integrate. As systems become able to handle more complex databases and applications such as biomedical databases schemas, their schemas become large, further increasing the number of matches to be performed. Several solutions in solving the issues of schema matching have been proposed. However, these solutions are still limited as (i) they do not explore most of the available information related to schemas, (ii) the approaches rely strictly on the assumption that the schemas to be matched are from the same application domain, and (iii) the approaches either match schemas by comparing the strings of the elements' names or by checking if those names are synonyms. This paper addresses the above limitations by proposing a model for matching heterogeneous relational biomedical databases' schemas that further improves the results of the integration.
A Robust Algorithm for Shadow Removal of Foreground Detection in Video Surveillance
Authors: Chuanxu Wang, Weijuan Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

We proposed an accurate algorithm to prevent moving shadows from being misclassified as part of moving objects in video target segmentation in this paper. Firstly, moving objects were achieved through background subtraction using adaptive Gaussian mixture models. Then, moving shadows were eliminated by a shadow detection algorithm. Finally, we performed a morphological reconstruction algorithm to recover the foreground distorted after shadow removal process. The experimental results proved its validity and accuracy in various fixed outdoor video scenes.
Cause Marketing: Spillover Effects of Cause-Related Products in a Product Portfolio
Authors: Aradhna Krishna, Uday Rajan
Venue: Management Science (2009)

The number of firms carrying a cause-related product has significantly increased in recent years. We consider a duopoly model of competition between firms in two products to determine which products a firm will link to a cause. We first test the behavioral underpinnings of our model in two laboratory experiments to demonstrate the existence of both a direct utility benefit to consumers from cause marketing (CM) and a spillover benefit onto other products in the portfolio. Linking one product in a product portfolio to a cause can therefore increase sales both of that product and, via a spillover effect, of other products in the firm's portfolio. We construct a CM game in which each firm chooses which products, if any, to place on CM. In the absence of a spillover benefit, a firm places a product on CM if and only if it can increase its price by enough to compensate for the cost of CM. Thus, in equilibrium, firms either have both products or neither product on CM. However, with the introduction of a spillover benefit to the second product, this result changes. We show that if a single firm in the market links only one product to a cause, it can raise prices on both products and earn a higher profit. We assume each firm has an advantage in one product and show that there is an equilibrium in which each firm links only its disadvantaged product to a cause. If the spillover effect is strong, there is a second equilibrium in which each firm links only its advantaged product to a cause. In each case, firms raise their prices on both products and earn higher profits than when neither firm engages in CM. We also show that a firm will never place its entire portfolio on CM. Overall, our work implies that, by carrying cause-related products, companies can not only improve their image in the public eye but also increase profits.
Optimization of risk bearing in a statistical model with reinsurance
Authors: A. Yu. Golubin, V. N. Gridin, A. I. Gazov
Venue: Automation and Remote Control (2009)

The paper is devoted to solving problems of optimal choice of client's risk bearing by the insurer at the level insurer-client and at the level insurer-reinsurer. It was shown that in the model of additional restrictions, the most profitable for the insurer will be the refusal from reinsurance and application of stop-loss insurance strategy. In the problem that takes the restriction on insurer's risk into account, reinsurance of excess of loss and insurance that is a combination of the stop-loss strategy and deductible are optimal. Necessary and sufficient conditions of optimality of parameters of the stated strategies are obtained; an example illustrating the proved results in case of exponential utility functions is given.
Applying Interval Number for Multi-sensor Information Fusion
Authors: Dong Jiuying
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Aimed at the object recognition problem in which the characteristic values of object types and observations of sensors are in the form of interval numbers, a new fusion method for multi-sensor data is proposed from the viewpoint of decision making theory. The method defines the distance between the two interval numbers, obtains the distance matrix between all object types and unknown object. After solving the optimization problem of maximizing the distance ranges of each object type, the weights of the attributes are obtained. Thus, the result of recognition for the unknown object is given by the overall distance. This method can avoid the subjectivity of selecting attributes weights. It is straightforward and can be performed on computer easily. Finally, a simulated example is given to demonstrate the feasibility and practicability of the proposed method.
IEEE Interval Standard Working Group - P1788: Current Status
Authors: William Edmonson, Guillaume Melquiond
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

Late 2008, at SCAN 2008 in El Paso, TX, an effort to standardize interval computations was started by a working group of the IEEE Microprocessor Standards Committee, titled the Interval Arithmetic Working Group of the IEEE P1788 Standard. This paper describes the goals of this effort, the history of the working group, and how it relates to the IEEE 754 Standard. It gives a brief overview of the policies and procedures for constructing the standard, and its expected structure. It also presents some of the questions the group may have to solve in the future.
Combinatorics of Compositions and Words: Solutions Manual
Authors: Silvia Heubach, Toufik Mansour
Venue:  (2009)

A comprehensive resource for those who are interested in statistics in compositions. It coves six major areas such as: compositions with restricted arrangement, compositions with restricted parts, statistics on compositions, pattern avoidance, random compositions, and variations of compositions.
Image Enhancement Algorithm Based on Gabor Wavelet Coefficients Fusion
Authors: Zong Junbin, Zhou Delong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In this paper, we present a new image enhancement algorithm based on Gabor wavelet coefficients fusion. The main idea of the algorithm: firstly we get a set of different directions Gabor features images, by filtering on the image with a set of Gabor wavelet filter; then integrate these Gabor features images under a certain scale by using the weighted average approach; and then, get edge image by thresholding; Finally, get the final enhanced image by adding the image using histogram equalization methods and edge image multiplied by a factor. Experiment results show that the method proposed by the paper can get a better enhanced image.
Workshop: game design for social networks
Authors: Aki Järvinen
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

Game Design for Social Networks is a one-day workshop where the participants will learn about creating and designing game concepts for online social networking platforms, such as Facebook and Twitter. The workshop will center around exercises that enable participants to come up with new game concepts. Participants will also be able to bring existing ideas to the workshop, and have a chance to refine them through the analytical design approaches introduced throughout the day. This paper outlines the theoretical backgrounds of the workshop.
State Visibility and Communication in Unifying Theories of Programming
Authors: Andrew Butterfield, Pawel Gancarski, Jim Woodcock
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

We explore the interactions between program-variable state visibility and communication behaviour in state-rich CSP-like processes, using the Unifying Theories of Programming (UTP) framework. The key results of this work are: having variable state visible while a process is waiting to communicate, results in an operationally complex theory of behaviour; by contrast, considering state as unobservable during communication wait periods results in an elegant theory, with much cleaner operational intuitions. The language constructs most affected by this observability choice are those of external choice and parallel composition. We also discuss situations where this state hiding can prevent the adoption of interesting operators that seize control from waiting processes.
Exploring Employee Perspectives on Information Privacy and Security in the Mobile Environment
Authors: Peter Tarasewich, Benjamin Ngugi, Mansi Sanghavi
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Maintaining information privacy and security in the mobile environment, an issue having personal and organizational implications, remains a challenge because the context of a mobile device can change rapidly. In response to this, the authors have been investigating methods of maintaining the privacy of sensitive information accessed in mobile environments (i.e. potentially in public places). This particular study, still in progress, will collect and analyze data on employee information privacy and security practices and perceptions. A complicating factor is that the classification of information as "private" may not be absolute. Privacy levels of organizational information will be dictated by company policy, while privacy concerns with personal information are based on the employee's own comfort level. Hence potential conflict arises if an individual uses a single mobile device for both personal and organizational information access. A summary and status of design activities and the planned implementation of the study is provided.
EmoHeart: Automation of Expressive Communication of Emotions in Second Life
Authors: Alena Neviarouskaya, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

In this paper, we describe lexical rule-based approach to affect sensing from text, and application of the developed Affect Analysis Model in 3D virtual world Second Life. To enrich user experience in virtual environment, to automate emotional behaviour of avatar and to avoid thus manual control by user, we developed EmoHeart object that, driven by the result of Affect Analysis Model, triggers animations of avatar facial expressions and visualizes emotion by the heart-shaped textures.
Limits to List Decoding Random Codes
Authors: Atri Rudra
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 ¿ H q (ρ) ¿ ¿ (where 0 < ρ< 1 ¿ 1/q, ¿> 0 and H q (·) is the q-ary entropy function) with high probability is a (ρ,1/¿)-list decodable code. (That is, every Hamming ball of radius at most ρn has at most 1/¿ codewords in it.) In this paper we prove the "converse" result. In particular, we prove that for every 0 < ρ< 1 ¿ 1/q, a random code of rate 1 ¿ H q (ρ) ¿ ¿, with high probability, is not a (ρ,L)-list decodable code for any , where c is a constant that depends only on ρ and q. We also prove a similar lower bound for random linear codes.
Efficient no-regret multiagent learning
Authors: Bikramjit Banerjee, Jing Peng
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We present new results on the efficiency of no-regret algorithmsin the context of multiagent learning. We use a known approach to augment a large class of no-regret algorithms to allow stochastic sampling of actions and observation of scalar reward of only the action played. We show that the average actual payoffs of the resulting learner gets (1) close to the best response against (eventually) stationary opponents. (2) close to the asymptotic optimal payoff against opponents that playa converging sequence of policies. and (3) close to at least a dynamic variant of minimax payoff against arbitrary opponents. with a high probability in polynomial time. In addition the polynomial bounds are shown to be significantly better than previously known bounds. Furthermore, we do not need to assume that the learner knows the game matrices and can observe the opponents' actions, unlike previous work.
Computer Supported Collaborative Design Using Augmented Reality
Authors: Tor Gjosaeter
Venue: Proceedings of the 2009 International Workshop on Social Informatics (2009)

While doing a usability evaluation of an augmented reality application (FurnitAR), interesting aspects of the application in regards to collaborative design were uncovered. FurnitAR can perhaps make one step in the furniture design process – the creation of a mock-up model in for instance cardboard – more efficient. FurnitAR was proposed as a solution to make the creation of mock-ups more in line with the CAD process. An evaluation of FurnitAR revealed that it could enhance the prototyping process of furniture design and provides new ways to support collaboration during the design process.
Benefits and Challenges of Using Collaborative Development Environments with Social Software in Higher Computer Science Education
Authors: Daniel Kadenbach, Carsten Kleiner
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper addresses the question how to optimally support projects of students and employees of a higher education institution of computer science by means of a special software environment. At first the motivation to introduce such a supportive system is examined by describing the current situation in the authors' department of computer science, which is typical for many colleges and universities. On the one hand problems are pointed out, which hamper students and employees in their project work, on the other hand the additional possibilities of a supportive system, which far exceed the ones of a traditional approach, are drafted. The paper shows how a mutual value for students and employees can be generated from the projects by using social software. After the requirements are described we suggest an architecture for such a supportive system and finally the challenges for the implementation and application, which determine the success or failure of the system, are discussed.
Active Rule Processing Technology Application for Electronic Commerce
Authors: Guigang Zhang, Donghua Deng, Zhiyuan Gong, Phillip C. -Y. Sheu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

This paper introduces the active rule processing technology application in electronic commerce area. First, paper introduces two kinds of rule expression methods. In order to help understand the rule expression, paper takes some examples of rule application in electronic commerce area. In order to processing the complex application, paper introduced a kind of method which can process large-scale data in electronic commerce through construct the rule network. At last, paper summarizes and gives future work.
Non-asymptotic confidence regions for model parameters in the presence of unmodelled dynamics
Authors: Marco C. Campi, Sangho Ko, Erik Weyer
Venue: Automatica (Journal of IFAC) (2009)

This paper deals with the problem of constructing confidence regions for the parameters of truncated series expansion models. The models are represented using orthonormal basis functions, and we extend the 'Leave-out Sign-dominant Correlation Regions' (LSCR) algorithm such that non-asymptotic confidence regions for the parameters can be constructed in the presence of unmodelled dynamics. The constructed regions have guaranteed probability of containing the true parameters for any finite number of data points. The algorithm is first developed for FIR models and then extended to models with generalized orthonormal basis functions. The usefulness of the developed approach is demonstrated for FIR and Laguerre models in simulation examples.
The Application and Research of Fuzzy Neural Network Algorithm Using Additional Momentum
Authors: Jianjun Wu, Wei Ding, Yanfeng Fan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

According to the characteristics of artificial neural network and fuzzy logical system, this paper studies a FNN algorithm using additional momentum, it is introduced to data analysis of grain monitoring system, realized intelligent analysis of grain safety level. The application in center grain reserve depot shows that improved algorithm can realize intelligent analysis of grain safety level.
Using MPI to Implement Scalable Libraries
Authors: Ewing Lusk
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

MPI is an instantiation of a general-purpose programming model, and high-performance implementations of the MPI standard have provided scalability for a wide range of applications. Ease of use was not an explicit goal of the MPI design process, which emphasized completeness, portability, and performance. Thus it is not surprising that MPI is occasionally criticized for being inconvenient to use and thus a drag on software developer productivity. One approach to the productivity issue is to use MPI to implement simpler programming models. Such models may limit the range of parallel algorithms that can be expressed, yet provide sufficient generality to benefit a significant number of applications, even from different domains.We illustrate this concept with the ADLB (Asynchronous, Dynamic Load-Balancing) library, which can be used to express manager/worker algorithms in such a way that their execution is scalable, even on the largestmachines. ADLB makes sophisticated use ofMPI functionality while providing an extremely simple API for the application programmer.We will describe it in the context of solving Sudoku puzzles and a nuclear physics Monte Carlo application currently running on tens of thousands of processors.