ppxscal/embedding_network huggingface dataset:
Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications
Authors: John Gustafson, Srinivas Aluru
Venue: Scientific Programming (1996)

A number of "tricks" are known that trade multiplications for additions. The term "tricks" reflects the way these methods seem not to proceed from any general theory, but instead jump into existence as recipes that work. The Strassen method for 2 &times; 2 matrix product with seven multiplications is a well-known example, as is the method for finding a complex number product in three multiplications. We have created a practical computer program for finding such tricks automatically, where massive parallelism makes the combinatorially explosive search tolerable for small problems. One result of this program is a method for cross products of three-vectors that requires only five multiplications.
Randomization Techniques for Data Mining Methods
Authors: Heikki Mannila
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

Data mining research has concentrated on inventing novel methods for finding interesting information from large masses of data. This has indeed led to many new computational tasks and some interesting algorithmic developments. However, there has been less emphasis on issues of significance testing of the discovered patterns or models. We discuss the issues in testing the results of data mining methods, and review some of the recent work in the development of scalable algorithmic techniques for randomization tests for data mining methods. We consider suitable null models and generation algorithms for randomization of 0-1 -matrices, arbitrary real valued matrices, and segmentations. We also discuss randomization for database queries.
Developing Multimedia-Game Software to Improve Space and Depth Perception
Authors: Cecília Sik Lányi, László Galyas
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Space perception is not a congenital faculty of human beings, but it evolves during the first few years of life. Experts are of the opinion that depth perception can be improved during the first 15-16 years of life. It is very important to help our up coming generation acquire good space perception as this is essential to be able to perform in a high number of occupations. We have developed a multimedia program with animations that were used by nursery school children to examine space perception. We developed test multimedia games with anaglyph technique to investigate the little children. If the kindergarten teacher realizes the child is not able to solve the task in the multimedia games she/he can send the child to the ophthalmologist just in time for complete examination. In this case eventually other problems will come to light in time.
Using ARTMAP-Based Ensemble Systems Designed by Three Variants of Boosting
Authors: Araken Medeiros Santos, Anne Magaly Paula Canuto
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

This paper analyzes the use of ARTMAP-based in structures of ensembles designed by three variants of boosting (Aggressive, Conservative and Inverse). In this investigation, it is aimed to analyze the influence of the RePART (Reward and Punishment ARTmap) neural network in ARTMAP-based ensembles, intending to define whether the use of this model is positive for ARTMAP-based ensembles. In addition, it aims to define which boosting strategy is the most suitable to be used in ARTMAP-based ensembles.
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Authors: Rene Beier, Heiko Röglin, Berthold Vöcking
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which can be exponential in the worst case.In this paper, we prove an almost tight bound on the expected number of Pareto optimal solutions for general bicriteria integer optimization problems in the framework of smoothed analysis. Our analysis is based on a semi-random input model in which an adversary can specify an input which is subsequently slightly perturbed at random, e. g., using a Gaussian or uniform distribution.Our results directly imply tight polynomial bounds on the expected running time of the Nemhauser/Ullmann heuristic for the 0/1 knapsack problem. Furthermore, we can significantly improve the known results on the running time of heuristics for the bounded knapsack problem and for the bicriteria shortest path problem. Finally, our results also enable us to improve and simplify the previously known analysis of the smoothed complexity of integer programming.
Progressive Compression of Geometry Information with Smooth Intermediate Meshes
Authors: Taejung Park, Haeyoung Lee, Chang-Hun Kim
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

We present a new geometry compression algorithm for manifold 3D meshes based on octree coding. For a given mesh, regular volume grids are built with an adaptive octree. For each grid point, a binary sign, which indicates inside or outside of the mesh, is generated based on the distance to the mesh. In each leaf cell having a vertex, a least square fitting plane is created for a localized geometry range with signs. Finally, quantized geometry information is locally encoded. We demonstrate that the octree with signs can be used to predict the vertex positions. As a result, the proposed method generates competitive bitrates compared to the current state-of-art progressive geometry coder. Our method also shows better rate-distortion performance during decompression or transmission with improved smoothness.
Methods to Observe the Clustering of Agents Within a Multi-Agent System
Authors: Raymond J. Staron, Pavel Tichý, Radek Šindelář, Francisco P. Maturana
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Cohesion and coupling are standard concepts in computer science. As in classic software, multi-agent systems (MASs) strive for high cohesion and low coupling. But MASs, by definition, do have some coupling, i.e., the agents seek out and discover other agents, and negotiate and cooperate with them, to accomplish some overall goal. Moreover, as different events occur, and different agents and different agent behaviors are called upon, the coupling values for the system change. This paper proposes a methodology for viewing these changing coupling relationships and clustering behaviors. In addition, the methodology is described as implemented as part of a standard agent monitoring tool.
A new concept in analog computers
Authors: Lee Cahn
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

Analog computers can solve a wide variety of engineering problems. Why, then, doesn't every engineer use one? This paper will discuss the pattern of use of analog computers in the recent past and as the author thinks it will be in the future.
Cognitive and Affective Antecedents of Mobile Data Services Usage Intention
Authors: Dimitrios C. Karaiskos, Dimitrios Drosos, Alexandros S. Tsiaousis, George M. Giaglis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Technology acceptance theories predict user intentions to use services tailored for organizational needs. However, in this paper we postulate that the aforementioned theories do not apply when investigating intentions towards the use of mobile data services (MDS), as the latter encompass supplementary characteristics, such as fun and enjoyment, which are not taken into account under available models of user acceptance. The incorporation of the affective dimension is proposed by re-introducing the Triandis theory of human behavior to the MDS domain. A large-scale (N=219) web-based survey was conducted to investigate our research hypotheses and validate our model of MDS usage intention. Results showed that the MDS usage intention can be predicted by cognitive and affective factors under the lens of social influences.
Integration of Ab Initio Nuclear Physics Calculations with Optimization Techniques
Authors: Masha Sosonkina, Anurag Sharda, Alina Negoita, James P. Vary
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Optimization techniques are finding their inroads into the field of nuclear physics calculations where the objective functions are very complex and computationally intensive. A vast space of parameters needs searching to obtain a good match between theoretical (computed) and experimental observables, such as energy levels and spectra. In this paper, we propose a design integrating the ab initio nuclear physics code MFDn and the VTDIRECT95 code for derivative-free optimization. We experiment with the initial implementation of the design showing good matches for several single-nucleus cases. For the parallel MFDn code, we determine appropriate processor numbers to execute efficiently a multiple-nuclei parameter search.
Comparing an On-Screen Agent with a Robotic Agent in Non-Face-to-Face Interactions
Authors: Takanori Komatsu, Yukari Abe
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

We investigated the effects of an on-screen agent and a robotic agent on users' behaviors in a non-face-to-face interaction, which is a much more realistic style than the face-to-face interaction on which most studies have focused. The results showed that the participants had more positive attitudes or behaviors toward the robotic agents than the on-screen agent. We discuss the results of this investigation and focus in particular on how to create comfortable interactions between users and various interactive agents appearing in different media.
Chaos Synchronization Between Unified Chaotic System and Genesio System
Authors: Xianyong Wu, Zhi-Hong Guan, Tao Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

This work presents chaos synchronization between two different chaotic systems via active control and adaptive control. Synchronization between unified chaotic system and Genesio system are investigated, different controllers are designed to synchronize the drive and response systems, Numerical simulations show the effectiveness of the proposed schemes.
Implementation of the Parallel Superposition in Bulk-Synchronous Parallel ML
Authors: Frédéric Gava
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Bulk-Synchronous Parallel ML (BSML) is a functional data-parallel language to code Bulk-Synchronous Parallel (BSP) algorithms. It allows an estimation of execution time, avoids deadlocks and nondeterminism. This paper presents the implementation of a new primitive for BSML which can express divide-and-conquer algorithms.
Comparison of Multiple View Strategies to Reduce False Positives in Breast Imaging
Authors: Joerg Teubl, Horst Bischof
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Although state-of-the-art CAD systems for breast imaging have a high sensitivity, their practical applicability is limited by the large number of false positive detections. Recently different multiple view strategies were proposed to increase the specificity. So far it was not possible to compare the performance of these methods, because different validation procedures were used. In this paper we validate all multiple view strategies using the same database and CAD system to make a performance comparison possible. Our results show that the performance difference between different multiple view strategies is small. Asymmetry (difference between left and right breast) and the corresponding view (e.g. if we examine the CC view we use additional information from the MLO view) yields equal performance. The performance is slightly worse using a breast atlas. Multiple view features are weaker than single view features (e.g. CAD score), but it is advantageous that multiple view features provide complementary information.
Olive Fly Infestation Prediction Using Machine Learning Techniques
Authors: José Sagrado, Isabel María Águila
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

This article reports on a study on olive-fly infestation prediction using machine learning techniques. . The purpose of the work was, on the one hand, to make accurate predictions and, on the other, to verify whether the Bayesian network techniques are competitive with respect to classification trees. We have applied the techniques to a dataset and, in addition, performed a previous phase of variables selection to simplify the complexity of the classifiers. The results of the experiments show that Bayesians networks produce valid predictors, although improved definition of dependencies and refinement of the variables selection methods are required.
Toward a Probabilistic Model of Trust in Agent Societies
Authors: Federico Bergenti
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

The literature about trust in societies of agents collects a huge number of works that analyse almost any facets of this concept from nearly every point of view. Nevertheless, an accepted and stable formal model of trust in agent societies is lacking. In this paper, we address this remarkable flaw of the current research by introducing a probabilistic model of trust capable of capturing two-party interactions, either direct of mediated by a Guarantor. Some interesting properties of this model are demonstrated and the final result of this work is an estimation (upper-bound) of the improvements that we expect from the inclusion of a Guarantor in a two-party interaction. In details, after an introductory section, Section 2 provides the foundations of our model and quantifies the increment of the utility that agents perceive because of the mediation of a Guarantor. Then, Section 3 deals with the decision-making strategies of rational agents and it shows a worst-case specialization of our model that justifies why agents are more likely choosing Guarantor-mediated interactions. Section 4 describes the overall results of this work in terms of bounds and evaluation of performances of the effects of mediation in interactions. Finally, Section 5 summarizes the main outcome of this work and outline some future lines of development.
Reasoning About Sequences of Memory States
Authors: Rémi Brochenin, Stéphane Demri, Etienne Lozes
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

In order to verify programs with pointer variables, we introduce a temporal logic LTL mem whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTL mem , considering various fragments of separation logic (including pointer arithmetic), various classes of models (with or without constant heap), and the influence of fixing the initial memory state. We provide a complete picture based on these criteria. Our main decidability result is -completeness of the satisfiability problems on the record fragment and on a classical fragment allowing pointer arithmetic. ${\Sigma^{0}_{1}}$-completeness or $\Sigma^{1}_{1}$-completeness results are established for various problems by reducing standard problems for Minsky machines, and underline the tightness of our decidability results.
Theory of Saplings Growing Up Algorithm
Authors: Ali Karci
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The saplings sowing and growing up algorithm (SGA) was inspired by a natural events --- evolution of growing up of trees. This algorithm contains two phases: Sowing Phase and Growing up Phase. In this paper, the theoretical foundations of SGA were determined. SGA is defined as a computational model, and it was depicted that there are a collection of Turing Machines for simulating SGA.
Checklist Inspections and Modifications: Applying Bloom's Taxonomy to Categorise Developer Comprehension
Authors: David Andrew McMeekin, Brian R. von Konsky, Elizabeth Chang, David J. A. Cooper
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Software maintenance can consume up to 70% of the effort spent on a software project, with more than half of this devoted to understanding the system. Performing a software inspection is expected to contribute to comprehension of the software. The question is: at what cognition levels do novice developers operate during a Checklist-Based code inspection followed by a code modification? This paper reports on a pilot study of Bloom's taxonomy levels observed during a Checklist-Based inspection and while adding new functionality unrelated to the defects detected. Bloom's taxonomy was used to categorise think-aloud data recorded while performing these activities. Results show the Checklist-Based Reading technique facilitates inspectors to function at the highest cognitive level within the taxonomy and indicates that using inspections with novice developers to improve cognition and understanding may assist integrating developers into existing project teams.
Automated Vertical Migration to Dynamic Microcode: An Overview and Example
Authors: R. I. Winner
Venue: IEEE Software (1986)

We can achieve more optimal function assignments between microcode and software levels by applying techniques described herein to statically or dynamically microprogrammed processor design.
Mobile Social Software: Facilitating Serendipity or Encouraging Homogeneity?
Authors: Jennifer Thom-Santelli
Venue: IEEE Pervasive Computing (2007)

Mobile social software is currently designed and conceived to afford serendipitous social interactions in densely populated urban environments. These systems create a homogeneous representation of the city by encouraging users to socialize more exclusively with those they already know and by privileging a type of urban experience based on consumption and entertainment. Several design strategies drawn from the arts might help these systems offer a more heterogeneous view of the city. This article is part of a special issue on Urban Computing.
Computer Scientist, Software Engineer, or IT Professional: Which Do You Think You Are?
Authors: Keith W. Miller, Jeffrey Voas
Venue: IT Professional (2008)

Job titles and functions shift quickly in the IT world, but some broad classifications can be useful for identifying what people do and how they view themselves. In some ways, the category of "IT professional" is the most broadly encompassing, but many people identify more closely with subspecialties such as "software engineer" or "computer scientist."
A Cognitive Study on the Effectiveness of an Augmented Virtuality-Based Collaborative Design Space
Authors: Xiangyu Wang, Rui Chen, Rui Wang
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

This paper presents one empirical study on an Augmented Virtuality (AV)-based virtual environment dedicated for remote collaboration. This AV-based system enables a remote designer to explore a virtual counterpart of a remote built environment that needs to be re-designed. Results of the study demonstrate that the AV system is effective and achieves good overall satisfaction, but involves some issues. Results also reveals that the participants all gain a similar sense in the AV environment as experienced in the real space.
Applying Role-Based Access Control in Combining the Chinese and Western Medicine Systems
Authors: Mei-Yu Wu, Yao-Bao Fong
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Developing the technological support for combining Chinese and Western medicine would be for the advancement of healthcare in general. Patients would be able to receive treatment from both the Chinese and Western medicine systems at the same time. Patients would not only have to obtain medical information, but also enhance their confidence in the treatment itself. However, in combining Chinese and Western medical treatments some issues that are raised are the ownership of patient records and the correlation of Chinese and Western medicines. Besides, transmitting a patient's electronic record requires an adaptive access control model to monitor access permission on a secure network platform. Therefore, a role-based access control model is proposed to combine Chinese and Western medicine systems. The model authorizes hospital staff to solve problems in a patient's record. Moreover, this model could reduce incompatibilities when Chinese and Western medicines are combined by using a correlation platform of Chinese and Western medicine, context and rules.
AWSum --- Data Mining for Insight
Authors: Anthony Quinn, Andrew Stranieri, John Yearwood, Gaudenz Hafen
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Many classifiers achieve high levels of accuracy but have limited use in real world problems because they provide little insight into data sets, are difficult to interpret and require expertise to use. In areas such as health informatics not only do analysts require accurate classifications but they also want some insight into the influences on the classification. This can then be used to direct research and formulate interventions. This research investigates the practical applications of Automated Weighted Sum, (AWSum), a classifier that gives accuracy comparable to other techniques whist providing insight into the data. AWSum achieves this by calculating a weight for each feature value that represents its influence on the class value. The merits of AWSum in classification and insight are tested on a Cystic Fibrosis dataset with positive results.
Reranking Methods for Visual Search
Authors: Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
Venue: IEEE MultiMedia (2007)

Most semantic video search methods use text-keyword queries or example video clips and images. But such methods have limitations. Here the authors introduce two reranking processes for image and video search that automatically reorder results from initial text-only searches based on visual features and content similarity.