ppxscal/embedding_network huggingface dataset:
Logic of subtyping
Authors: Pavel Naumov
Venue: Theoretical Computer Science (2006)

We introduce new modal logical calculi that describe subtyping properties of Cartesian product and disjoint union type constructors as well as mutually recursive types defined using those type constructors.Basic logic of subtyping S extends classical propositional logic by two new binary modalities ⊗ and ⊕. An interpretation of S is a function that maps standard connectives into set-theoretical operations (intersection, union, and complement) and modalities into Cartesian product and disjoint union type constructors. This allows S to capture many subtyping properties of the above type constructors. We also consider logics Sρ and Sρω that incorporate into S mutually recursive types over arbitrary and well-founded universes correspondingly.The main results are completeness of the above three logics with respect to appropriate type universes. In addition, we prove Cut elimination theorem for S and establish decidability of S and Sρω.
A New Fault Diagnosis Model Based on AIR Scheme
Authors: Gui-hong Zhou, Chun-cheng Zuo, Jia-zhong Wang, Shu-xia Liu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A new model for fault diagnosis of mechanical facilities is proposed in this paper. The model synthesizes the structure of the neural network and the scheme of the artificial immune regulation (AIR). The training samples are clustered first by the immune algorithm based on AIR scheme. The centers of the clustering (memory B-cells) are saved as the nodes of the hidden layer in the model, therefore, the amount and positions of nodes in the hidden layer can be determined automatically. The weight matrix is determined by least squares (LS) algorithm. Finally the numerical experiments in fault diagnosis of a tapered roller bearing are performed. The results show that the method is simple and effective through comparing with NN.
Enabling Enterprise Resources Reusability and Interoperability through Web Services
Authors: Hongwei Wang, Heming Zhang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Enterprise resources are the combination of entities concerned with engineering, management, system integration, etc. Reusability and interoperability of resources are the inherent requirement of enterprise operation. Engineering design is such a case which involves various resources such as tools, models and teams. To construct an environment for collaborative design, we employ web services as the infrastructure for resource wrapping and communication. At the same time, HLA is introduced towards simulation management in design analysis. Thus, simulation is leveraged through remote access of its components and web services are controlled in such a simulation oriented solution. The collaborative simulation of tilting locomotive is studied to verify the feasibility of employing web services. The results confirm that web services and SOA are promising for a new computing paradigm in modern enterprises.
Monopolizing markets by exploiting trust
Authors: Sandip Sen, Dipyaman Banerjee
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We investigate trust-based relationships in electronic supply chains where trust is a measure of consistency in meeting negotiated contract deadlines. We consider scenarios where contractors assign contracts to contractees who are significantly more successful in meeting deadlines. The task deadlines are drawn from a known distribution. We present a probabilistic analysis that enables contractees to strategically bid on only certain tasks to earn the trust of their contractors. Once a contractee achieves a high level of trust, it can then exploit that trust to increasingly corner a larger portion of the market share of all tasks. We present a trust exploitation scheme that monopolizes the market against greedy contractees who bid on all announced tasks. We also show that such market monopolization is not possible in the presence of a trusted, but non-exploiting, contractee. The exploiter can, however, effectively "starve" the non-exploiting trusted agent.
Fuzzy-controlled battery charger state-of-charge controller
Authors: N. A. Rahim, S. Mekhilef, E. L. Chan, H. W. Ping
Venue: International Journal of Modelling and Simulation (2006)

This paper presents a fuzzy-controlled state-of-charge controller for battery charger application. The proposed battery charger is constructed based on a boost-buck converter and equipped with a fuzzy logic controller to improve the efficiency of charging process and to deliver maximum output power to the battery. A digital signal processor (DSP)-based system is designed to implement the pulse width modulation (PWM) waveforms generator and to perform fuzzy control feedback algorithm. The PWM generator supplies gating signals for the converters, and the fuzzy controller provides control over the PWM pattern. The fuzzy controller continuously monitors the state-of-charge of the battery, after which the fuzzy inference determines the duty cycle of the PWM to change the charging current accordingly.
Berta's tower: developing conceptual physics understanding one exploratoid at a time
Authors: Gina Navoa Svarovsky, David Williamson Shaffer
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

In this paper we describe a study that investigates whether---and how---authentic recreations of engineering practices can help students develop conceptual understanding of physics. We focus on the design-build-test cycle used by professional engineers in simulation-based rapid modeling. In this experiment, middle school students worked for 10 hours to solve engineering design challenges using SodaConstructor---a Java-based microworld---as a simulation environment. As a result of the experiment, students learned about center of mass. Our data further suggest that in the process of simulation-based modeling, rapid iterations of the design-build-test cycle progressively linked students' interest in the design activities and understanding of the concept of center of mass. We suggest that these rapid iterations of the design-build-test cycle functioned as exploratoids: short fragments of exploratory action in a microworld that cumulatively develop interest in and understanding of important scientific concepts.
Anteater: A Service-Oriented Architecture for High-Performance Data Mining
Authors: Dorgival Guedes, Wagner Meira Jr., Renato Ferreira
Venue: IEEE Internet Computing (2006)

Data mining focuses on extracting useful information from large volumes of data, and thus has been the center of much attention in recent years. Building scalable, extensible,and easy-to-use data mining systems,however,has proved to be difficult. In response, the authors developed Anteater, a service-oriented architecture for data mining that relies on Web services to achieve extensibility and interoperability, offers simple abstractions for users, and supports computationally intensive processing on large amounts of data through massive parallelism.
Relevance Assignment and Fusion of Multiple Learning Methods Applied to Remote Sensing Image Analysis
Authors: Peter Bajcsy, Wei-Wen Feng, Praveen Kumar
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

With the advances in remote sensing, various machine learning techniques could be applied to study variable relationships. Although prediction models obtained using machine learning techniques has proven to be suitable for predictions, they do not explicitly provide means for determining input-output variable relevance. We investigated the issue of relevance assignment for multiple machine learning models applied to remote sensing variables in the context of terrestrial hydrology. The relevance is defined as the influence of an input variable with respect to predicting the output result. We introduce a methodology for assigning relevance using various machine learning methods. The learning methods we use include Regression Tree, Support Vector Machine, and K-Nearest Neighbor. We derive the relevance computation scheme for each learning method and propose a method for fusing relevance assignment results from multiple learning techniques by averaging and voting mechanism. All methods are evaluated in terms of relevance accuracy estimation with synthetic and measured data.
Using Replication to Build Highly Available .NET Applications
Authors: Johannes Osrael, Lorenz Froihofer, Georg Stoifl, Lucas Weigl, Klemen Zagar, Igor Habjan, Karl M. Goeschka
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Replication is a well-known technique to achieve faulttolerance in distributed systems, thereby enhancing availability. However, so far, not much attention has been paid to object replication using Microsoft's .NET technologies. In this paper, we present the lessons we have learned during design and implementation of a .NET based replication framework that allows building dependable, distributed .NET applications. Our framework does not only support traditional replication protocols like primary-backup replication or voting but also a new protocol for explicit balancing between data integrity and availability. Based on our experiences, we recommend to use a state-of-the-art group communication toolkit (e.g., Spread) and .NET Remoting as basis for object replication in a .NET environment.
Efficient scheduling of heterogeneous continuous queries
Authors: Mohamed A. Sharaf, Panos K. Chrysanthis, Alexandros Labrinidis, Kirk Pruhs
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Data Stream Management Systems (DSMS) typically host multiple Continuous Queries (CQ) that process streams of data. In this paper, we examine the problem of how to schedule CQs in a DSMS to optimize for average QoS. We show that unlike standard on-line systems, scheduling policies in DSMSs that optimize for average response time will be different than policies that optimize for average slowdown which is more appropriate metric to use in the presence of a heterogeneous workload. We also propose a hybrid scheduling policy based on slowdown that strikes a fine balance between performance and fairness. We further discuss how our policies can be efficiently implemented and extended to exploit sharing in optimized multi-query plans and multi-stream CQs. Finally, we experimentally show using real data that our policies outperform currently used ones.
Acquiring arithmetic knowledge in a computer-based learning environment for long division
Authors: Kees van Putten, Karel Hurts
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This paper reports on the acquisition of arithmetic knowledge in successive stages of expertise, and on the types of instruction that are needed to make that learning possible. The domain is that of integer arithmetic and the target skills and concepts of the learning system relate to long division with remainder.We studied students' learning performance using a computer-based learning environment representing division as repeated subtraction from the dividend and facilitating the exploration and construction of multiples of the divisor to be subtracted. The learning environment also took over the subtasks of multiplication, addition and subtraction from the student. In particular, we studied the extent to which students were constrained in their freedom to construct solution paths and the effect of this factor on learning performance.Results showed that students profited from this learning environment, but the more optimal solutions reached under constrained problem solving could not be demonstrated in a pre-post test comparison using only paper-and-pencil type problems. It appears that this performance can only be reached if the learning environment assists the student with lower-level subtasks and that more advanced strategic knowledge is required in order to reach the same level of performance without this support.
A Simple Bayesian Framework for Content-Based Image Retrieval
Authors: Katherine A. Heller, Zoubin Ghahramani
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a Bayesian framework for content-based image retrieval which models the distribution of color and texture features within sets of related images. Given a userspecified text query (e.g. "penguins") the system first extracts a set of images, from a labelled corpus, corresponding to that query. The distribution over features of these images is used to compute a Bayesian score for each image in a large unlabelled corpus. Unlabelled images are then ranked using this score and the top images are returned. Although the Bayesian score is based on computing marginal likelihoods, which integrate over model parameters, in the case of sparse binary data the score reduces to a single matrix-vector multiplication and is therefore extremely efficient to compute. We show that our method works surprisingly well despite its simplicity and the fact that no relevance feedback is used. We compare different choices of features, and evaluate our results using human subjects.
How Does the Brain Discriminate Familiar and Unfamiliar Faces?: A PET Study of Face Categorical Perception
Authors: Bruno Rossion, Christine Schiltz, Laurence Robaye, David Pirenne, Marc Crommelinck
Venue: Journal of Cognitive Neuroscience (2001)

Where and how does the brain discriminate familiar and unfamiliar faces? This question has not been answered yet by neuroimaging studies partly because different tasks were performed on familiar and unfamiliar faces, or because familiar faces were associated with semantic and lexical information. Here eight subjects were trained during 3 days with a set of 30 faces. The familiarized faces were morphed with unfamiliar faces. Presented with continua of unfamiliar and familiar faces in a pilot experiment, a group of eight subjects presented a categorical perception of face familiarity: there was a sharp boundary in percentage of familiarity decisions between 40% and 60% faces. In the main experiment, subjects were scanned (PET) on the fourth day (after 3 days of training) in six conditions, all requiring a sex classification task. Completely novel faces (0%) were presented in Condition 1 and familiar faces (100%) in Condition 6, while faces of steps of 20% in the continuum of familiarity were presented in Conditions 2 to 5 (20% to 80%). A principal component analysis (PCA) indicated that most variations in neural responses were related to the dissociation between faces perceived as familiar (60% to 100%) and faces perceived as unfamiliar (0 to 40%). Subtraction analyses did not disclose any increase of activation for faces perceived as familiar while there were large relative increases for faces perceived as unfamiliar in several regions of the right occipito-temporal visual pathway. These changes were all categorical and were observed mainly in the right middle occipital gyrus, the right posterior fusiform gyrus, and the right inferotemporal cortex. These results show that (1) the discrimination between familiar and unfamiliar faces is related to relative increases in the right ventral pathway to unfamiliar/novel faces; (2) familiar and unfamiliar faces are discriminated in an all-or-none fashion rather than proportionally to their resemblance to stored representations; and (3) categorical perception of faces is associated with abrupt changes of brain activity in the regions that discriminate the two extremes of the multidimensional continuum.
Inquiry into mediated action: the implementation of an innovative online problem-based unit into K-12 classrooms
Authors: Donna Russell
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The purpose of this study was to understand how teachers implement an innovation cluster that included an online workspace and a framework for a problem-based learning environment. The researcher focused on three progressive research issues during data structuring: 1) What factors in a teacher's school environments influence the implementation of an innovation cluster? 2) How does a teacher's participation in collaborative professional development influence the implementation of an innovation cluster? 3) How does a teacher's belief about learning and technology influence the implementation of an innovation cluster? Using Activity Theory for apriori structuring of the data set and these three progressive issues for invivo analysis, the researcher found that the teachers implemented the innovation cluster in relation to their ability to identify and overcome contradictions in their work activity.
Capacity planning tools for web and grid environments
Authors: Sugato Bagchi, Eugene Hung, Arun Iyengar, Norbert Vogl, Noshir Wadia
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

A key aspect in managing resources for customer sites is to predict and assess the load associated with a site in order to figure out how best to allocate resources for the site over time and to efficiently schedule tasks. The cost associated with the site and return on investment are also key parameters. This paper describes work we have done in developing tools for answering these critical questions. The tools use both analytical models and discrete event simulations to predict performance and analyze costs needed for handling a customer workload while satisfying the service level objectives. These tools provide capacity and load planning, performance simulation, and cost and financial analyses. Our tools have been used successfully by several major customers, and those experiences have shaped how the tools have evolved over time.
Predictions with Uncertainty to Support Fair Outcomes in Online Legal Disputes
Authors: Nial Muecke
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Alternative Dispute Resolutions systems are not uncommon in Australian Family Law, however to date these systems are largely negotiation based and are not designed for producing judicially fair outcomes. This paper proposes an online dispute resolution approach that aims to support divorcees to resolve property issues in a manner that is consistent with orders a judge would make if the matter was heard in Court. The approach integrates a protocol for online dispute dialogue with an argument based model of judicial reasoning to structure the dispute. The likelihood of alternates outcomes is predicted with a series of Bayesian Belief Networks.
News 2.0
Authors: John Stanik
Venue: Queue (2006)

McAfee just published the inaugural issue of Sage, its semi-annual report on security threats. This first issue focuses on how malware developers use open source tools and methodologies. In one article, the authors describe how botnet developers share code to produce &ldquo;production-grade malware.&rdquo; The authors are careful not to indict the open source movement as a whole, but do state that open source is &ldquo;a critical enabler for malware.&rdquo;
Improving photo searching interfaces for small-screen mobile computers
Authors: Dynal Patel, Gary Marsden, Matt Jones, Steve Jones
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

In this paper, we conduct a thorough investigation of how people search their photo collections for events (a set of photographs relating to a particular well defined event), singles (individual photographs) and properties (a set of photographs with a common theme) on PDAs. We describe a prototype system that allows us to expose many issues that must be considered when designing photo searching interfaces. We discuss each of these issues and make recommendations where applicable. Our major observation is that several different methods are used to locate photographs. In light of this, we conclude by discussing how photo searching interfaces might embody or support such an approach.
A layer 3 movement detection algorithm driving handovers in mobile IP
Authors: N. Blefari-Melazzi, M. Femminella, F. Pugini
Venue: Wireless Networks (2005)

The evolution and the spreading of wireless access technology and the consequent increase of user mobility will make handover procedures critical for the provision of Quality of Service in the next generation wireless Internet. Often, layer 3 handovers are supposed to be driven by access layer procedures. In this way, the movement detection delay can be reduced, but at the expenses of making the Mobile IP protocol dependent of lower layer implementations. Furthermore, this approach may not be effective when users roam among heterogeneous networks. Nevertheless, movement detection algorithms, which operate at the Mobile IP layer, imply appreciable delays, usually intolerable for real time services.In this paper, we propose a Mobile IP handover scheme based on a novel movement detection algorithm at layer 3, able to timely manage migrations by exploiting advertisements losses, combined with a two-timers mechanism.We analyze the performance of our algorithm in terms of handover delay and throughput, and we show that our solution is able to decrease the movement detection delay as much as 47% with respect to other literature solutions that pursue similar approaches. In addition, this feature implies also higher values of the throughput seen by the TCP layer.
Comparison of rate allocation strategies for H.264 video transmission over wireless lossy correlated networks
Authors: S. Gnavi, M. Grangetto, E. Magli, G. Olmo
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper we study the problem of transmitting coded video over a UMTS network. We first discuss the statistical characteristics of packet losses in case of RTP/UDP/IP wireless video communication. Then, we propose a new rate allocation algorithm for H.264 video, based on a Gilbert-Elliot model of the packet losses. We compare the proposed algorithm with several other allocation strategies, showing that it achieves satisfactory performance in terms of PSNR. Moreover, we outline the limits of the employed distortion model and outline possible solutions to overcome them.
Kriging metamodeling in discrete-event simulation: an overview
Authors: Wim C. M. Van Beers
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Many simulation experiments require considerable computer time, so interpolation is needed for sensitivity analysis and optimization. The interpolating functions are 'metamodels' (or 'response surfaces') of the underlying simulation models. For sensitivity analysis and optimization, simulationists use different interpolation techniques (e.g. low-order polynomial regression or neural nets). This paper, however, focuses on Kriging interpolation. In the 1950's, D. G. Krige developed this technique for the mining industry. Currently, Kriging interpolation is frequently applied in Computer Aided Engineering. In discrete-event simulation, however, Kriging has just started. This paper discusses Kriging for sensitivity analysis in simulation, including methods to select an experimental design for Kriging interpolation.