ppxscal/embedding_network huggingface dataset:
Reliability Estimators for Classification by Decomposition Method: Experiments in the Medical Domain
Authors: Paolo Soda, Giulio Iannello
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

The performance of a classification system is sometimes unsatisfactory for the needs of real applications. In these cases, the measure of classification reliability should be useful since it takes into account the many issues that influence the achievement of satisfactory results. The most common choice for confidence evaluation consists in using the confusion matrix estimated during the learning phase. As a consequence, the same reliability value is associated with every decision attributing a sample to the same class. In this respect, this paper proposes and compares three different reliability estimators of each classification act of classification systems that belong to the one-per-class framework. They are based on the reliabilities provided by each dichotomizer and are independent of the binary module design. Theirperformance have been assessed and ranked on private and public medical datasets, showing that one of the estimators outperforms the others.
Catching the Brass Ring
Authors: Donald J. Reifer
Venue: IEEE Software (2004)

Have you ever noticed that most engineering organizations aren't led by software people? Instead, most senior executives in the larger software firms I have investigated boast engineering, marketing, legal, and business school backgrounds. This department takes a look at what factors govern such selections and what software engineering professionals can do about it.
Evaluating Sparse Data Storage Techniques for MPI Groups and Communicators
Authors: Mohamad Chaarawi, Edgar Gabriel
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

In this paper we explore various sparse data storage techniques in order to reduce the amount of memory required for MPI groups and communicators. The idea behind the approach is to exploit similarities between the objects and thus store only the difference between the original process group and the resulting one. For each technique, we detail the memory saved compared to the currently used implementations, and present a runtime decision routine capable of choosing dynamically the most efficient technique for each scenario. Furthermore, we evaluate the performance impact of the new structures using point-to-point benchmarks as well as an application scenario over InfiniBand, Myrinet and Gigabit Ethernet networks.
Predicting Missing Markers to Drive Real-Time Centre of Rotation Estimation
Authors: Andreas Aristidou, Jonathan Cameron, Joan Lasenby
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper addresses the problem of real-time location of the joints or centres of rotation (CoR) of human skeletons in the presence of missing data. The data is assumed to be 3d marker positions from a motion capture system. We present an integrated framework which predicts the occluded marker positions using a Kalman filter in combination with inferred information from neighbouring markers and thereby maintains a continuous data-flow. The CoR positions can be calculated with high accuracy even in cases where markers are occluded for a long period of time.
Distributed multiagent resource allocation in diminishing marginal return domains
Authors: Yoram Bachrach, Jeffrey S. Rosenschein
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sharable resources in the domain. We present a distributed and random allocation procedure, and demonstrate that the allocation converges to the optimal in terms of utilitarian social welfare. The procedure is based on direct interaction among the agents and resource owners (without the use of a central authority). We then consider potential strategic behavior of the self-interested agents and resource owners, and show that when both act rationally and the domain is highly competitive for the resource owners, the convergence result still holds. The optimal allocation is arrived at quickly; given a setting with k resources and n agents, we demonstrate that the expected number of timesteps to convergence is O(k ln n), even in the worst case, where the optimal allocation is extremely unbalanced. Our allocation procedure has advantages over a mechanism design approach based on Vickrey-Clarke-Groves (VCG) mechanisms: it does not require the existence of a central trusted authority, and it fully distributes the utility obtained by the agents and resource owners (i.e., it is strongly budget balanced).
Item-Based Filtering and Semantic Networks for Personalized Web Content Adaptation in E-Commerce
Authors: Panayiotis Koutsabasis, John Darzentas
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

Personalised web content adaptation systems are critical constituents of successful e-commerce applications. These systems aim at the automatic identification, composition and presentation of content to users based on a model about their preferences and the context of interaction. The paper critically reviews related work in the field and presents an integrated approach for the design of personalization and web content adaptation in e-commerce that places emphasis on item-based collaborative filtering and on short-term, dynamic user models represented as semantic networks. The proposed approach for personalised web content adaptation can provide different types of interesting recommendations taking into account the current user interaction context in a computationally inexpensive way. It is also respectful of user personal information and unobtrusive with respect to user feedback.
Prototyping and Composing Aspect Languages
Authors: Wilke Havinga, Lodewijk Bergmans, Mehmet Aksit
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Domain specific aspect languages (DSALs) are becoming more popular because they can be designed to represent recurring concerns in a way that is optimized for a specific domain. However, the design and implementation of even a limited domain-specific aspect language can be a tedious job. To address this, we propose a framework that offers a fast way to prototype implementations of domain specific aspect languages. A particular goal of the framework is to be general enough to support a wide range of aspect language concepts, such that existing language concepts can be easily used, and new language concepts can be quickly created.We briefly introduce the framework and its underlying model, as well as the workflow used when implementing DSALs. Subsequently, we show mappings of several domain specific aspect languages to demonstrate the framework. Since in our approach the DSALs are mapped to a common model, the framework provides an integrating platform allowing us to compose programs that use aspects written in multiple DSALs. The framework also provides explicit mechanisms to specify composition of advices written in multiple DSALs.
Benchmark Study of a 3d Parallel Code for the Propagation of Large Subduction Earthquakes
Authors: Mario Chavez, Eduardo Cabrera, Raúl Madariaga, Narciso Perea, Charles Moulinec, David Emerson, Mike Ashworth, Alejandro Salazar
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Benchmark studies were carried out on a recently optimized parallel 3D seismic wave propagation code that uses finite differences on a staggered grid with 2 nd order operators in time and 4 th order in space. Three dual-core supercomputer platforms were used to run the parallel program using MPI. Efficiencies of 0.91 and 0.48 with 1024 cores were obtained on HECToR (UK) and KanBalam (Mexico), and 0.66 with 8192 cores on HECToR. The 3D velocity field pattern from a simulation of the 1985 Mexico earthquake (that caused the loss of up to 30000 people and about 7 billion US dollars) which has reasonable agreement with the available observations, shows coherent, well developed surface waves propagating towards Mexico City.
How Many Figure Sets Are Codes?
Authors: Małgorzata Moczurad, Włodzimierz Moczurad
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

Defect theorem, which provides a kind of dimension property for words, does not hold for two-dimensional figures (labelled polyominoes), except for some small sets. We thus turn to the analysis of asymptotic density of figure codes. Interestingly, it can often be proved to be 1, even in those cases where the defect theorem fails. Hence it reveals another weak dimension property which does hold for figures, i.e., non-codes are rare.We show that the asymptotic densities of codes among the following sets are all equal to 1: (ordinary) words, square figures and small sets of dominoes, where small refers to cardinality ≤ 3. The latter is a borderline case for the defect theorem and additionally exhibits interesting properties at different alphabet sizes.
Web Service Contracting: Specification and Reasoning with SCIFF
Authors: Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali, Paolo Torroni
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

The semantic web vision will facilitate automation of many tasks, including the location and dynamic reconfiguration of web services. In this article, we are concerned with a specific stage of web service location, called, by some authors, contracting. We address contracting both at the operational level and at the semantic level. We present a framework encompassing communication and reasoning, in which web services exchange and evaluate goals and policies. Policies represent behavioural interfaces. The reasoning procedure at the core of the framework is based on the abductive logic programming SCIFF proof-procedure. We describe the framework, show by examples how to formalise policies in the declarative language of SCIFF, and give the framework a model-theoretic and a sound proof-theoretic semantics.
The GAME Algorithm Applied to Complex Fractionated Atrial Electrograms Data Set
Authors: Pavel Kordík, Václav Křemen, Lenka Lhotská
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Complex fractionated atrial electrograms (CFAEs) represent the electrophysiologic substrate for atrial fibrillation (AF). Individual signal complexes in CFAEs reflect electrical activity of electrophysiologic substrate at given time. To identify CFAEs sites, we developed algorithm based on wavelet transform allowing automated feature extraction from source signals. Signals were ranked by three experts into four classes. We compiled a representative data set of 113 instances with extracted features as inputs and average of expert ranking as the output. In this paper, we present results of our GAME data mining algorithm, that was used to (a) predict average ranking of experts, (b) classify into three classes. The performance of the GAME algorithm was compared to well known data mining techniques using robust ten times tenfold cross validation. Results indicate that wavelet signal decomposition could carry high level of predictive information about the state of electrophysiologic substrate and that the GAME algorithm outperforms other data mining techniques (such as decision trees, linear regression, neural networks, Support Vector Machines, etc.) in both prediction and classification accuracy.
A Hybrid Multi-objective Algorithm for Dynamic Vehicle Routing Problems
Authors: Qin Jun, Jiangqing Wang, Bo-Jin Zheng
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

This paper analyzes firstly the limitation of traditional methods when used to solve Dynamic Vehicle Routing Problem (DVRP), and then constructs an adapted DVRP model named DVRPTW based on Multi-objective Optimization. In this model, we consider two sub-objectives such as vehicle number and time cost as an independent objective respectively and simultaneously to coordinate the inherent conflicts between them. Also, a hybrid Multi-objective ant colony algorithm named MOEvo-Ant is proposed and some crucial techniques used by MOEvo-Ant algorithm are discussed too. In our ant colony algorithm, an EA is introduced into our ant colony algorithm to increase pheromone update. The main reason of the introduction is that we try to take advantage of the outstanding global searching capability of EA to speed up the convergence of our algorithm. Simulating experiments demonstrate that no matter when compared with the known best solutions developed by previous papers or when use it to solve dynamic vehicle routing problems generated randomly, our algorithm illustrates pretty good performance.
Towards a specification of the ToonTalk language
Authors: Leonel Morgado, Ken Kahn
Venue: Journal of Visual Languages and Computing (2008)

ToonTalk is a child-oriented programming language whose environment is an animated virtual world, with objects that children can pick up and use as in a game, such as birds, trucks, and robots, providing direct child-oriented metaphors for programming constructs. Actions performed by a programmer's avatar with these objects are both code and coding. ToonTalk is a powerful system, not just a ''toy'' system: it is based upon concurrent constraint programming languages, and programs written in languages such as Flat Guarded Horn Clauses and Flat Concurrent Prolog can be straight-forwardly constructed in ToonTalk. However, there is not a specification of ToonTalk, for ready implementation in other environments. We propose that the ToonTalk language lies not in the animations displayed by the current environment, but on the actions performed by the programmer with virtual world objects; we present a description and analysis of the methods the ToonTalk language provides to programmers for expressing programs.
Keynote lecture: distributed estimation using wireless sensor networks
Authors: Georgios B. Giannakis
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

Envisioned applications of wireless sensor networks (WSNs) include surveillance, monitoring and tracking tasks. These motivate well decentralized estimation and smoothing of deterministic and (non)stationary random signals using (possibly correlated) observations collected across distributed sensors. In this talk we present state-of-the-art algorithms for consensus-based distributed estimation using ad hoc WSNs where sensors communicate over single-hop noisy links. The novel framework reformulates basic estimation criteria such as least-squares, maximum-likelihood, maximum a posteriori, and linear mean-square error, as decomposable, constrained, convex optimization problems that are amenable to distributed solutions. The resultant distributed estimators are provably convergent to their centralized counterparts and robust to communication noise. Besides stationary, the framework encompasses adaptive filtering and smoothing of non-stationary signals through distributed LMS and Kalman filtering.
A revised automated proximity and conformity analysis method to compare predicted and observed spatial boundaries of geologic phenomena
Authors: Yingkui Li, Jacob Napieralski, Jon Harbor
Venue: Computers Geosciences (2008)

Quantitative assessment of the level of agreement between model-predicted and field-observed geologic data is crucial to calibrate and validate numerical landscape models. Application of Geographic Information Systems (GIS) provides an opportunity to integrate model and field data and quantify their levels of correspondence. Napieralski et al. [Comparing predicted and observed spatial boundaries of geologic phenomena: Automated Proximity and Conformity Analysis (APCA) applied to ice sheet reconstructions. Computers and Geosciences 32, 124-134] introduced an Automated Proximity and Conformity Analysis (APCA) method to compare model-predicted and field-observed spatial boundaries and used it to quantify the level of correspondence between predicted ice margins from ice sheet models and field observations from end moraines. However, as originally formulated, APCA involves a relatively large amount of user intervention during the analysis and results in an index to quantify the level of correspondence that lacks direct statistical meaning. Here, we propose a revised APCA approach and a more automated and statistically robust way to quantify the level of correspondence between model predictions and field observations. Specifically, the mean and standard deviation of distances between model and field boundaries are used to quantify proximity and conformity, respectively. An illustration of the revised method comparing modeled ice margins of the Fennoscandian Ice Sheet with observed end moraines of the Last Glacial Maximum shows that this approach provides a more automated and statistically robust means to quantify correspondence than the original APCA. The revised approach can be adopted for a wide range of geoscience issues where comparisons of model-predicted and field-observed spatial boundaries are useful, including mass movement and flood extents.
A Stochastic Local Search Approach to Vertex Cover
Authors: Silvia Richter, Malte Helmert, Charles Gretton
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance on a suite of problems drawn from the field of biology. We also evaluate our performance on the commonly used DIMACS benchmarks for the related clique problem, finding that our approach is competitive with the current best stochastic local search algorithm for finding cliques. On three very large problem instances, our algorithm establishes new records in solution quality.
An Experimental Evaluation of Logiocando, an Intelligent Tutoring Hypermedia System
Authors: Rosa Lanzilotti, Teresa Roselli
Venue: International Journal of Artificial Intelligence in Education (2007)

Several hypermedia learning environments have been developed in the last years, with the objective of helping students to acquire specific concepts in a given domain, as well as problem-solving abilities. However, there are still many different and sometimes conflicting claims about learning effectiveness using such environments. We present an empirical evaluation of a learning hypermedia with a tutorial component that exploits Artificial Intelligence techniques. This hypermedia, called Logiocando, has been designed for use by a special category of user, namely children of the fourth level of primary school (9-10 years old), to help them to learn basic concepts of logic. This category of user demands special attention to usability of the hypermedia. For this reason, design and development of the hypermedia have been carried out following a learner-centred methodology, in order to build a system that satisfies clear usability objectives. The aim of the study herein reported was to evaluate the learning effectiveness of Logiocando and to estimate the difference between two approaches: computer-based using a hypermedia system, and traditional, namely a typical lesson in the classroom. The results have shown that the hypermedia can be considered a valid support in the process of learning and deepening a topic.
Nonlinear resistors in logical switching circuits
Authors: F. A. Schwertz, R. T. Steinback
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

Nonlinear resistors may be used to replace whole arrays of crystal rectifiers in certain logical switching circuits. Where such replacement is possible, considerable savings in fabrication and component costs may be effected, because both the nonlinear resistors and the associated connecting busses are fabricated by applying printed circuit techniques to standard plastic- or ceramic-bonded sheets of semiconductors such as granular silicon carbide. The manner in which groups of nonlinear resistors may be used in logical switching circuits is described here in terms of simple circuits which employ both "matrix logic" and "grid logic." The technique is experimentally illustrated with the aid of a pair of simple matrix-type function switches, <u>encoded</u> as binary-to-octal converters. The first employs individual nonlinear resistors as the switching elements; the second is fabricated from a rubber-bonded sheet of granular silicon carbide. Two similarly-constructed decoding matrices are used to transform the converters into three-binary-digit adders. The output voltage-patterns for these devices are compared photographically.
On Center Regions and Balls Containing Many Points
Authors: Shakhar Smorodinsky, Marek Sulovský, Uli Wagner
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We study the disk containment problem introduced by Neumann-Lara and Urrutia and its generalization to higher dimensions. We relate the problem to centerpoints and lower centerpoints of point sets. Moreover, we show that for any set of n points in , there is a subset A ¿ S of size $\lfloor \frac{d+3}{2}\rfloor$ such that any ball containing A contains at least roughly $\frac{4}{5ed^3}n$ points of S. This improves previous bounds for which the constant was exponentially small in d. We also consider a generalization of the planar disk containment problem to families of pseudodisks.