ppxscal/embedding_network huggingface dataset:
Analytic tableaux calculi for KLM logics of nonmonotonic reasoning
Authors: Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We present tableau calculi for the logics of nonmonotonic reasoning defined by Kraus, Lehmann and Magidor (KLM). We give a tableau proof procedure for all KLM logics, namely preferential, loop-cumulative, cumulative, and rational logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. We provide a decision procedure for the logics considered and we study their complexity.
Unsupervised Activity Perception in Crowded and Complicated Scenes Using Hierarchical Bayesian Models
Authors: Xiaogang Wang, Xiaoxu Ma, W. E. L. Grimson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We propose a novel unsupervised learning framework to model activities and interactions in crowded and complicated scenes. Hierarchical Bayesian models are used to connect three elements in visual surveillance: low-level visual features, simple "atomic" activities, and interactions. Atomic activities are modeled as distributions over low-level visual features, and multi-agent interactions are modeled as distributions over atomic activities. These models are learnt in an unsupervised way. Given a long video sequence, moving pixels are clustered into different atomic activities and short video clips are clustered into different interactions. In this paper, we propose three hierarchical Bayesian models, Latent Dirichlet Allocation (LDA) mixture model, Hierarchical Dirichlet Process (HDP) mixture model, and Dual Hierarchical Dirichlet Processes (Dual-HDP) model. They advance existing language models, such as LDA [1] and HDP [2]. Our data sets are challenging video sequences from crowded traffic scenes and train station scenes with many kinds of activities co-occurring. Without tracking and human labeling effort, our framework completes many challenging visual surveillance tasks of board interest such as: (1) discovering typical atomic activities and interactions; (2) segmenting long video sequences into different interactions; (3) segmenting motions into different activities; (4) detecting abnormality; and (5) supporting high-level queries on activities and interactions.
Building high-resolution sky images using the Cell/B.E.
Authors: Ana Lucia Varbanescu, Alexander S. van Amesfoort, Tim Cornwell, Ger van Diepen, Rob van Nieuwpoort, Bruce G. Elmegreen, Henk Sips
Venue: Scientific Programming (2009)

The performance potential of the Cell/B.E., as well as its availability, have attracted a lot of attention from various high-performance computing (HPC) fields. While computation intensive kernels proved to be exceptionally well suited for running on the Cell, irregular data-intensive applications are usually considered as poor matches. In this paper, we present our complete solution for enabling such a data-intensive application to run efficiently on the Cell/B.E. processor. Specifically, we target radioastronomy data gridding and degridding, two resembling imaging filters based on convolutional resampling. Our solution is based on building a high-level application model, used to evaluate parallelization alternatives. Next, we choose the one with the best performance potential, and we gradually exploit this potential by applying platform-specific and application-specific optimizations. After several iterations, our target application shows a speed-up factor between 10 and 20 on a dual-Cell blade when compared with the original application running on a commodity machine. Given these results, and based on our empirical observations, we are able to pinpoint a set of ten guidelines for parallelizing similar applications on the Cell/B.E. Finally, we conclude the Cell/B.E. can provide high performance for data-intensive applications at the price of increased programming efforts and with a significant aid from aggressive application-specific optimizations.
Towards materialized view selection for distributed databases
Authors: Leonardo Weiss F. Chaves, Erik Buchmann, Fabian Hueske, Klemens Böhm
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogeneous nodes with different resource constraints (e.g., CPU, IO and network bandwidth) query and update numerous tables on different nodes. Such problems are typical for large enterprises, e.g., global retailers storing thousands of relations on hundreds of nodes at different subsidiaries. Choosing which views to materialize in a distributed, complex scenario is NP-hard. Furthermore, the solution space is huge, and the large number of input factors results in non-monotonic cost models. This prohibits the straightforward use of brute-force algorithms, greedy approaches or proposals from organic computing. For the same reason, all solutions for choosing MVs we are aware of do not consider either distributed settings or update costs. In this paper we describe an algorithmic framework which restricts the sets of considered MVs so that a genetic algorithm can be applied. In order to let the genetic algorithm converge quickly, we generate initial populations based on knowledge on database tuning, and devise a selection function which restricts the solution space by taking the similarity of MV configurations into account. We evaluate our approach both with artificial settings and a real-world RFID scenario from retail. For a small setting consisting of 24 tables distributed over 9 nodes, an exhaustive search needs 10 hours processing time. Our approach derives a comparable set of MVs within 30 seconds. Our approach scales well: Within 15 minutes it chooses a set of MVs for a real-world scenario consisting of 1,000 relations, 400 hosts, and a workload of 3,000 queries and updates.
Electronic Teaching (Training) Confrontation with Natural Disaster
Authors: Leila Mansourian, Babak Esmailpoor Ghochani, Saeed Setayeshi
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Using an electronic base is one of the training methods. In this method, the learner is not limited to time and place. Learning is possible in whatever time and place. Different facilities are used such as film, graphics and animation and the learner takes part in suitable exams. One of the best applications of the electronic base is people's training for confrontation with natural disasters such as earthquake. the best training methods are used to get the best results. this study, done in an electronic environment, deals with the ways to help and save wounded ones.
Multi-sample test-based clustering for fuzzy random variables
Authors: Gil González-Rodríguez, Ana Colubi, Pierpaolo D'Urso, Manuel Montenegro
Venue: International Journal of Approximate Reasoning (2009)

A clustering method to group independent fuzzy random variables observed on a sample by focusing on their expected values is developed. The procedure is iterative and based on the p-value of a multi-sample bootstrap test. Thus, it simultaneously takes into account fuzziness and stochastic variability. Moreover, an objective stopping criterion leading to statistically equal groups different from each other is provided. Some simulations to show the performance of this inferential approach are included. The results are illustrated by means of a case study.
The oz of wizard: simulating the human for interaction research
Authors: Aaron Steinfeld, Odest Chadwicke Jenkins, Brian Scassellati
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

The Wizard of Oz experiment method has a long tradition of acceptance and use within the field of human-robot interaction. The community has traditionally downplayed the importance of interaction evaluations run with the inverse model: the human simulated to evaluate robot behavior, or Oz of Wizard. We argue that such studies play an important role in the field of human-robot interaction. We differentiate between methodologically rigorous human modeling and placeholder simulations using simplified human models. Guidelines are proposed for when Oz of Wizard results should be considered acceptable. This paper also describes a framework for describing the various permutations of Wizard and Oz states.
Fast simulation of equity-linked life insurance contracts with a surrender option
Authors: Carole Bernard, Christiane Lemieux
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper, we consider equity-linked life insurance contracts that give their holder the possibility to surrender their policy before maturity. Such contracts can be valued using simulation methods proposed for the pricing of American options, but the mortality risk must also be taken into account when pricing such contracts. Here, we use the least-squares Monte Carlo approach of Longstaff and Schwartz coupled with quasi-Monte Carlo sampling and a control variate in order to construct efficient estimators for the value of such contracts. We also show how to incorporate the mortality risk into these pricing algorithms without explicitly simulating it.
On the Number of Spikes of Solutions for a Singularly Perturbed Boundary-Value Problem
Authors: Ognyan Christov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We study the stationary solutions of the famous Fisher - Kolmogorov - Petrovsky - Piscounov (FKPP) equation $$ u_t = D u_{x x} + \gamma u (1 - u), $$ where the diffusion parameter is small - D&thinsp;=&thinsp;&epsilon; 2 and &gamma; is normalized to be 1. Next, we state a singularly perturbed boundary-value problem (BVP) on the interval [0, 1]. $$ \left| \begin{array}{l} \epsilon^2 \ddot{u} + u (1 - u) = 0, \\ u( 0 ) = a, \quad u( 1 ) = a, \quad a \in (0, 1). \end{array} \right. $$ Asymptotic formulas, as &epsilon;&rarr;0&thinsp;+&thinsp; are obtained for the solutions of the above (BVP). The solutions of the (BVP) can have &rdquo;spikes&rdquo;. Estimates for the number of spikes and number of solutions to the (BVP) are given. 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
TC-SocialRank: Ranking the Social Web
Authors: Antonio Gulli, Stefano Cataudella, Luca Foschini
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

Web search is extensively adopted for accessing information on the web, and recent development in personalized search, social bookmarking and folksonomy systems has tremendously eased the user's path towards the desired information.In this paper, we discuss TC-SocialRank, a novel link-based algorithm which extends state-of-the-art algorithms for folksonomy systems. The algorithm leverages the importance of users in the social community, the importance of the bookmarks/resource they share, and additional temporal information and clicks information. Temporal information has a primary importance in social bookmarking search since users continuously post new and fresh information. The importance of this information may decay after a while, if it is no longer tagged or clicked.As a case study for testing the effectiveness of TC-SocialRank, we discuss JammingSearch a novel folksonomy system that unifies web search and social bookmarking by transparently leveraging a Wiki-based collaborative editing system. When an interesting search result is found, a user can share it with the JammingSearch community by simply clicking a button. This information is implicitly tagged with the query submitted to any commodity search engine. Later on, additional tags can be added by the user community. Currently, our system interacts with Ask.com, Google, Microsoft Live, Yahoo!, and AOL.
Hadoop at home: large-scale computing at a small college
Authors: Richard A. Brown
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

The potential benefits of data-intensive scalable computing (DISC) in CS education are considered in the context of a small college with an active student-operated Beowulf cluster initiative. The map-reduce computational model, of great importance in industry, is reviewed, and the Hadoop implementation of that model is connected to specific courses throughout the undergraduate CS curriculum. Concerns when running a local Hadoop-capable cluster at a small college are identified.
Quasi-Hierarchical Routing Algorithm for ZigBee/IEEE 802.15.4 Networks
Authors: Youn-Soo Kim, Eun Ju Lee, Bong Soo Kim, Hyung Seok Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

ZigBee recently has been used a lot in wireless sensor networks because of its low power consumption and affordable chips. However, ZigBee's existing hierarchical routing algorithm has a disadvantage in that a node may communicate with a nearby node over several hops. In this letter we propose a Quasi-Hierarchical Routing (QHR) algorithm that can improve the ZigBee hierarchical routing method's inefficiency by using brief information on neighbors within radio range. The network simulation evaluates this QHR's performance by comparing it to other ZigBee routing schemes.
Private sector needs for trusted/secure computer systems
Authors: Rein Turn
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Computer systems that have been subjected to formal verification of correctness of their access control mechanisms and that can provide multilevel security are called trusted systems. Their prototypes are now being developed under government programs and, to a much lesser scale, as a part of vendors' in-house research and development. While the need for trusted systems in national defense applications is well known, the need for trusted systems in private sector's business and industrial applications has been largely unexplored. This paper identifies several generic types of needs and incentives for the use of trusted systems, such as maintaining management control, complying with regulatory requirements, protecting computer representations of assets and resources, assuring safety and integrity, realizing certain operational economies, and enhancing marketing advantage or public image. It then examines the private sector's aspects of these generic needs, as well as disincentives that may surface. The paper concludes with an assessment of the prospects for commercial availability of trusted systems and the vendors' incentives for developing and marketing these systems.
A hybrid similarity matching algorithm for mapping and rading ontologies via a multi-agent system
Authors: Saravanan Muthaiyah, Marcel Barbulescu, Larry Kerschberg
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we present a hybrid similarity matching algorithm i.e. Semantic Relatedness Score (SRS) that is used to match ontological concepts and instances in the context of ontology evolution. We combine five out of thirteen well-tested semantic and syntactic algorithms to produce SRS. Specifically we focus on the issue of ontology upgrade and highlight how our hybrid matching algorithm produces higher precision and reliability compared to existing syntactical approaches. Managing evolution amongst shared ontologies is a laborious affair. This paper extends ongoing work in the area and focuses on changes made in a shared ontology such as inclusion of new classes, renaming, deletion and modification of existing classes. Since these changes will adversely impact shared concepts, users would have to update their local ontologies to be consistent with changes in the shared ontology. As such, a less laborious method is needed for an ontologist to update his local ontology. This paper illustrates how a multi-agent system (MAS) can be deployed to achieve this goal. A semi-automated approach is presented where agent systems would filter concept changes based on SRS and recommend them to the ontologist for upgrade. A MAS prototype has been implemented in the Java Agent DEvelopment Framework (JADE) which is a FIPA standard for proof-of-concept.
The APIOBPCS Deziel and Eilon parameter configuration in supply chain under progressive information sharing strategies
Authors: Salvatore Cannella, Elena Ciancimino
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The aim of this paper is to investigate how different smoothing parameter levels of the Automatic Pipeline Inventory and Order Based Production Control System smoothing replenishment rule impact on the bullwhip dampening efficacy, under progressive information sharing strategies. The main results of this work are: (1) The smoothing parameter variations significantly impact on performance of the supply chains characterised by low information sharing level. (2) As smoothing parameters increase, the supply chain process performance improves and the customer service level worsens. This opposite trend noticeably decreases as information sharing level increases. (3) Amongst the bullwhip dampening techniques, deeper information sharing weights more than the value of smoothing parameters. The analysis is performed through continuous time differential equation modelling.
A radio-over-fiber system with photonics generated OFDM signals and wavelength reuse for upstream data connection
Authors: L. Chen, J. Lu, Z. Dong, J. Yu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We have experimentally demonstrated a wavelength reuse scheme for up-link connection in a radio-over-fiber (ROF) system with photonics generated 2.5Gbit/s 16QAM OFDM signals. In this architecture, 2.5Gbit/s 16QAM OFDM signals carried by the optical millimeter-wave (mm-wave) carriers which are generated with four times frequency of the local oscillator (LO) signal, and both down- and up-stream signal delivery over 20km fiber with 1dB power penalty.
Bibliometric Analysis of Data Mining in the Chinese Social Science Circle
Authors: Chao Li, Jian Ke
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, papers about data mining recorded by CSSCI (1998 ~ 2007) are collected and analyzed with statistical analysis and bibliometric analysis such as year distribution, journal distribution, subject distribution, the core author and the geographical distribution of the author. So we can identify the core author, core journals, research institutes and the law of research on data mining in the Chinese social science circle, and reveal the review of data mining study and the main theme in the Chinese social science circle. In collusion, this paper indicates some problems and trends about study on data mining.
Urban Trunk Road Traffic Signal Coordinated Control Based on Multi-Objective Immune Algorithm
Authors: Pei Luo, Qian Ma, Hui-xian Huang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In order to reduce traffic delay, a novel urban trunk road traffic signal coordinated control method was presented. Firstly, a multi-objective immune algorithm based on multi-population was proposed. By this way, it can effectively prevent population retrogression; promote diversity and the whole optimal searching ability of genetic algorithm. Considering the traffic delay of the uplink vehicles and the down vehicles at different times on the trunk road, the objection function for total delay is set up, and the objection function optimization based on multi-population immune algorithm is implemented through adjusting the phase difference at intersections. Finally, compared with the genetic algorithms and the method of fixed phase difference, the simulation results of this novel control method have verified the obvious advantage.
Performance of generalized multilayered perceptons trained using the Levenberg-Marquardt method
Authors: Steele A. Russell,  II, Anthony S. Maida
Venue: Journal of Computing Sciences in Colleges (2009)

The generalized multilayer perceptron (gMLP) generalizes the multilayered perceptron (MLP) architecture to a fully connected feedforward architecture where connections are not restricted to adjacent layers. In this paper the performance of MLP and gMLP networks trained using the Levenberg-Marquardt method are compared. A number of different function approximation tasks were examined. The effect of varying the number of hidden layer neurons was also evaluated.
The use of discrete event simulation for designing robustness into ground combat vehicles
Authors: Tommy E. White
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Robust parameter design methodology will lead to products and process that are insensitive to the effects of noise variables. Finding the optimal setting for design factors depends on noise variables used in the simulation process and whether these noise variables represent a real world operating environment. This paper will show how basic robust parameter design and simulation can help influence the design of a Ground Combat Vehicle. 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
Exploiting Local and Global Invariants for the Management of Large Scale Information Systems
Authors: Haifeng Chen, Haibin Cheng, Guofei Jiang, Kenji Yoshihira
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. If the discovered correlations can continually hold under different user scenarios and workloads, they are regarded as invariants of the information system. In our previous work, we have developed an algorithm to automatically search the invariants between any pair of system attributes, which we call local invariants. However that method is unable to deal with the high order dependency models due to the combinatorial explosion of search space. In this paper we use Bayesian regression technique to discover those high order correlation models, called global invariants. We treat each attribute as a response variable in turn and express its dependency with the other attributes in a regression model. By adding the prior constraint of Laplacian distribution to the regression coefficients, we can find the solution in which only the correlated attributes with respect to the response have nonzero regression coefficients. After that we further consider the temporal dependencies of those extracted attributes by incorporating their past observations. We also provide a confidence metric and a validation procedure to measure the reliability of learned models. If the model does not break down in the validation, it is regarded as a true invariant of the system. Experimental results on a real wireless networking system show that the discovered invariants can be used to effectively detect system failures as well as provide valuable information about the failure source.