ppxscal/embedding_network huggingface dataset:
Mining infrequent and interesting rules from transaction records
Authors: Alex Tze Hiang Sim, Maria Indrawan, Bala Srinivasan
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In association rule mining, apriori based techniques require users to define a minimum support threshold before rules are mined. These techniques suffer from two disadvantages. First, it requires a very low pre-set minimum support threshold to cover all rules that may be interesting if measured using other measures. Second, the number of rules reported is simply too large. We augment the measure of proportional error reduction, and describe a technique to mine interesting association rules directly. Our approach is unique from apriori based techniques, and do not require a minimum support threshold. Hence it is immune from its drawbacks. We also present two pruning opportunities that can be applied to the algorithm to reduce the computational cost of the mining process. Our experiments show that our approach can find proportional error reduction rules directly from databases.
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Authors: Linda Buisman, Rajeev Goré
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent "cut-free" sequent calculus for BiInt has recently been shown by Uustalu to fail cut-elimination. We present a new cut-free sequent calculus for BiInt, and prove it sound and complete with respect to its Kripke semantics. Ensuring completeness is complicated by the interaction between implication and its dual, similarly to future and past modalities in tense logic. Our calculus handles this interaction using extended sequents which pass information from premises to conclusions using variables instantiated at the leaves of failed derivation trees. Our simple termination argument allows our calculus to be used for automated deduction, although this is not its main purpose.
The transistor as a digital computer component
Authors: J. H. Felker
Venue: Papers and discussions presented at the Dec. 10-12, 1951, joint AIEE-IRE computer conference: Review of electronic digital computers (1951)

Digital computers have been defined as machines that use a language explicitly and one may think of them as carrying on interior dialogues. This concept helps to illustrate one difference between the modern computer and other electronic machinery. The principal function of most electronic apparatus is to take low level signals and raise them to a power level sufficient to drive some device such as a loud speaker, servo motor, relay, or perhaps a cathode-ray tube. In a digital computer, however, there may be a thousand active elements that merely converse with one another. There may be a million alterations of state before an output device has to be energized. These internal operations need not be carried out at any particular power level. It is only necessary for one device to talk loud enough for the next device to recognize what was said. Devices are needed which have stable states that can be changed by very low input signal power. As the computer art advances, one hopes it will move towards the use of devices that listen intently rather than speak loudly. It is in this direction that the transistor can make its earliest contribution to the digital computer field.
On-the-Fly Motion-Compensated Cone-Beam CT Using an a Priori Motion Model
Authors: Simon Rit, Jochem Wolthaus, Marcel Herk, Jan-Jakob Sonke
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Respiratory motion causes artifacts in slow-rotating cone-beam (CB) computed tomography (CT) images acquired for example for image guidance of radiotherapy. Respiration-correlated CBCT has been proposed to correct for the respiratory motion, but the use of a subset of the CB projections to reconstruct each frame of the 4D CBCT image limits their quality, thus requiring a longer acquisition time. Another solution is motion-compensated CBCT which consists of reconstructing a single 3D CBCT image at a reference position from all the CB projections by using an estimate of the respiratory motion in the reconstruction algorithm. In this paper, we propose a method for motion-compensated CBCT which allows to reconstruct the image on-the-fly, i.e. concurrent with acquisition. Before the CB acquisition, a model of the patient motion over the respiratory cycle is estimated from the planning 4D CT. The respiratory motion is then computed on-the-fly from this model using a respiratory signal extracted from the CB projections and incorporated into the motion-compensated CBCT reconstruction algorithm. The proposed method is evaluated on 26 CBCT scans of 3 patients acquired with two protocols used for static and respiration-correlated CBCT respectively. Our results show that this method provides CBCT images within a few seconds after the end of the acquisition where most of the motion artifacts have been removed.
An Evolutionary Approach to Task Graph Scheduling
Authors: Saeed Parsa, Shahriar Lotfi, Naser Lotfi
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the completion time of task graphs. The completion time of a task graph is directly affected by the length of its critical path. Hence, the trend of an evolutionary approach for task graph scheduling can be biased towards reduction of the critical path. In this paper, a new genetic scheduling algorithm is presented. The algorithm, in the first priority, minimizes the critical path length of the parallel program task graph and in the second priority minimizes the inter-processor communication time. Thereby, it achieves a better scheduling in comparison with the existing approaches.
Microcontroller and sensors based gesture vocalizer
Authors: Ata-Ur-Rehman Ata-Ur-Rehman, Salman Afghani, Muhammad Akmal, Raheel Yousaf
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Gesture Vocalizer is a large scale multi-microcontroller based system being designed to facilitate the communication among the dumb, deaf and blind communities and their communication with the normal people. This system can be dynamically reconfigured to work as a "smart device". In this paper, microcontroller and sensors based gesture vocalizer is presented. Gesture vocalizer discussed is basically a data glove and a microcontroller based system. Data glove can detect almost all the movements of a hand and microcontroller based system converts some specified movements into human recognizable voice. The data glove is equipped with two types of sensors: The bend sensors and accelerometers as tilt sensors. This system is beneficial for dumb people and their hands will speak having worn the gesture vocalizer data glove.
A Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation
Authors: Piotr Jędrzejowicz, Aleksander Skakovski
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

The problem of scheduling nonpreemtable tasks on parallel identical machines under constraint on discrete resource and requiring, additionally, renewable continuous resource to minimize the schedule length is considered in the paper. A continuous resource is divisible continuously and is allocated to tasks from given intervals in amounts unknown in advance. Task processing rate depends on the allocated amount of the continuous resource. The considered problem can be solved in two steps. The first step involves generating all possible task schedules and second - finding an optimal schedule among all schedules with optimal continuous resource allocation. To eliminate time consuming optimal continuous resource allocation, a problem (¿ Z with continuous resource discretisation is introduced. Because (¿ Z is NP-hard a population-learning algorithm (PLA2) is proposed to tackle the problem. PLA2 belongs to the class of the population-based methods. Experiment results proved that PLA2 excels known algorithms for solving the considered problem.
A Middleware for Seamless Use of Multiple Displays
Authors: Satoshi Sakurai, Yuichi Itoh, Yoshifumi Kitamura, Miguel A. Nacenta, Tokuo Yamaguchi, Sriram Subramanian, Fumio Kishino
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

Current multi-display environments (MDEs) can be composed of displays with different characteristics (e.g. resolution, size) located in any position and at different angles. These heterogeneous arrangements present specific interface problems: it is difficult to provide meaningful transitions of cursors between displays; it is difficult for users to visualize information that is presented on oblique surfaces; and it is difficult to spread visual information over multiple displays. In this paper we present a middleware architecture designed to support a new kind of perspective-aware GUI that solves the aforementioned problems. Our interaction architecture combines distributed input and position tracking data to generate perspective-corrected output in each of the displays, allowing groups of users to manipulate existing applications from current operating systems across a large number of displays. To test our design we implemented a complex MDE prototype and measured different aspects of its performance.
Improving the Round Complexity of VSS in Point-to-Point Networks
Authors: Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted parties t satisfies t < n/3, with n being the total number of parties. Work of Gennaro et al. (STOC 2001) and Fitzi et al. (TCC 2006) shows that, assuming a broadcast channel, 3 rounds are necessary and sufficient for efficient VSS. The efficient 3-round protocol of Fitzi et al., however, treats the broadcast channel as being available "for free" and does not attempt to minimize its usage. This approach leads to relatively poor round complexity when protocols are compiled for a point-to-point network.We show here a VSS protocol that is simultaneously optimal in terms of both the number of rounds and the number of invocations of broadcast. Our protocol also has a certain "2-level sharing" property that makes it useful for constructing protocols for general secure computation.
Strict Generalization in Multilayered Perceptron Networks
Authors: Debrup Chakraborty, Nikhil R. Pal
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

Typically the response of a multilayered perceptron (MLP) network on points which are far away from the boundary of its training data is not very reliable. When test data points are far away from the boundary of its training data, the network should not make any decision on these points. We propose a training scheme for MLPs which tries to achieve this. Our methodology trains a composite network consisting of two subnetworks : a mapping network and a vigilance network. The mapping network learns the usual input-output relation present in the data and the vigilance network learns a decision boundary and decides on which points the mapping network should respond. Though here we propose the methodology for multilayered perceptrons, the philosophy is quite general and can be used with other learning machines also.
Constructing MPI Input-output Datatypes for Efficient Transpacking
Authors: Faisal Ghias Mir, Jesper Larsson Träff
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Communication and file I/O buffers in MPI can contain contiguous as well as non-contiguous, structured data. To describe non-consecutive data layouts compactly, MPI provides a powerful concept of derived or user-defined datatypes. Especially for MPI-IO, where data are transferred between file and memory buffers, the need for copying between differently typed MPI buffers arise. A straightforward solution to this typed copy problem consists in packing and unpacking the differently structured data via an intermediate buffer. For a maximally efficient MPI(-IO) implementation, means of copying directly (without intermediate buffers) between differently typed MPI buffers are needed.We present a new approach to the typed copy problem. For any two given MPI datatypes describing the layout of input and output buffer, respectively, we show how to efficiently construct an input-output type that subsumes both. This type is used to copy directly from input to output buffer by means of a special transpack function. By completely eliminating the need for intermediate buffering, the typed copy performance can in theory be improved by up to a factor of two, with only a modest overhead for constructing the input-output type. An experimental evaluation shows that even more significant improvements can be achieved in practice.
A Multiechelon Repairable Item Inventory System with Lateral Transshipment and a General Repair Time Distribution
Authors: Jong Soo Kim, Sun Hur, Tai Young Kim
Venue: Informatica (2006)

This paper discusses the determination of the spare inventory level for a multiechelon repairable item inventory system, which has several bases and a central depot with emergency lateral transshipment capability. Previous research is extended by removing a restrictive assumption on the repair time distribution. A mathematical model that allows a general repair time distribution, as well as an algorithm to find a solution of the model, is developed. Thus, the main focus of this study is to improve the accuracy of previous models and to estimate the gain in accuracy from use of the current methodology. Computational experiments are performed to estimate the accuracy improvement and to determine the managerial implications of the results.
Mammographic Segmentation Based on Texture Modelling of Tabár Mammographic Building Blocks
Authors: Wenda He, Izzati Muhimmah, Erika R. Denton, Reyer Zwiggelaar
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We present an approach to automate texton selection to achieve optimized mammogram segmentation results with respect to mammographic building blocks (i.e. nodular, linear, homogeneous, and radiolucent) as described by Tabár's tissue model. Such segmentation results are expected to lead to improvements in automatic mammographic risk assessment modelling. The texton selection process has three distinct components, covering a) texton ranking, b) outlier detection, and c) visual assessment. The initial results, on tissue specific regions and full mammographic images are promising, but at the same time indicate shortcomings, which are discussed.
A Study on How to Classify the Security Rating of Medical Information Neural Network
Authors: Jaegu Song, Seoksoo Kim
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Provide these intelligent medical services, it is necessary to understand the situation information generated in a hospital. There should be infra technologies that can classify and control the information for processing situation data, not mere collection of conceptual information, with clear standards. This paper, as a study to seize the information generated from medical situation more clearly, understood the property of data using neural network and applied the security ratings of information so that the system to provide the user appropriate to designated rating with analyzed medical information is established. It will be an effective measure to enhance the effectiveness of medical devices and backup data already introduced and understand the various medical data that will be generated from medical devices to be introduced.
Learning Bayesian Networks Based on a Mutual Information Scoring Function and EMI Method
Authors: Fengzhan Tian, Haisheng Li, Zhihai Wang, Jian Yu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

At present, most of the algorithms for learning Bayesian Networks (BNs) use EM algorithm to deal with incomplete data. They are of low efficiency because EM algorithm has to perform iterative process of probability reasoning to complete the incomplete data. In this paper we present an efficient BN learning algorithm, which use the combination of EMI method and a scoring function based on mutual information theory. The algorithm first uses EMI method to estimate, from incomplete data, probability distributions over local structures of BNs, then evaluates BN structures with the scoring function and searches for the best one. The detailed procedure of the algorithm is depicted in the paper. The experimental results on Asia and Alarm networks show that when achieving high accuracy, the algorithm is much more efficient than two EM based algorithms, SEM and EM-EA algorithms.
An export architecture for a multimedia authoring environment
Authors: Jan Mikác, Cécile Roisin, Bao Le Duc
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

In this paper, we propose an export architecture that provides a clear separation of multimedia authoring services from publicaction services. We illustrate this architecture with the LimSee3 authoring tool and several standard publication formats: Timesheets, SMIL, and XHTML.
Tendency curves for visual clustering assessment
Authors: Yingkang Hu, Richard J. Hathaway
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

We improve the visual assessment of tendency (VAT) technique, which, developed by J.C. Bezdek, R.J. Hathaway and J.M. Huband, uses a visual approach to find the number of clusters in data. Instead of using square gray level images of dissimilarity matrices as in VAT, we further process the matrices and produce the tendency curves. Possible cluster structure will be shown as peak-valley patterns on the curves, which can be caught not only by human eyes but also by the computer. Our numerical experiments showed that the computer can catch cluster structures from the tendency curves even in cases where the visual outputs of VAT are virtually useless.
Design and fabrication of delta wing shape MAV
Authors: Aghil Yousefi Koma, Sepideh Afshar, Hesam Maleki, Donya Mohammadshahi, Hossein Shahi
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Design and fabrication of a body less MAV is presented in this paper. Body less MAVs take advantage of more lift and less drag. A triangular wing is chosen to this end and two models are fabricated to investigate winglet effect in aerodynamic properties, especially roll and yaw stability. The results show that this wing form can provide the requirements of a conventional model. Besides, the model proves good maneuverability characteristics. On the other hand, lake of winglets lead to a decrease in stability characters in designed MAV.
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs Under Interval, p-Box, and Fuzzy Uncertainty
Authors: Martine Ceberio, Vladik Kreinovich, Andrzej Pownuk, Barnabás Bede
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In interval computations, at each intermediate stage of the computation, we have intervals of possible values of the corresponding quantities. In our previous papers, we proposed an extension of this technique to set computations, where on each stage, in addition to intervals of possible values of the quantities, we also keep sets of possible values of pairs (triples, etc.). In this paper, we show that in several practical problems, such as estimating statistics (variance, correlation, etc.) and solutions to ordinary differential equations (ODEs) with given accuracy, this new formalism enables us to find estimates in feasible (polynomial) time.
Numerical Visualization by Rapid Isosurface Extractions Using 3D Span Spaces
Authors: M. Hirano, T. Itoh, S. Shirayama
Venue: Journal of Visualization (2008)

In this paper, we focus on visualization of a 3D scalar field composed of volume data by means of semi-transparent multiple isosurface extraction. A new method for displaying semi-transparent multiple isosurfaces will be proposed to fulfill real-time rendering of scalar fields. The proposed method is considered to be an extension of ISSUE, which is a known algorithm to quickly generate isosurfaces. ISSUE uses a 2D span space, where minimum values of computational cells are assigned to the horizontal axis, and maximum values of cells are assigned to the vertical axis. In the proposed algorithm, computational cells are placed onto a 3D span space. The third axis is the distance from the viewpoint. The proposed algorithm can quickly search for the cells intersecting with isosurfaces using the span space in back-to-front order and can realize representation of semi-transparent multiple isosurfaces.
Towards Industrial Strength Business Performance Management
Authors: Vadim Ermolayev, Wolf-Ekkehard Matzke
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Business performance management today does not possess a rigorous and grounded engineering methodology capable of delivering reliably measured values to backing up decision making. Much more it is the art of executive gurus who listen to their backbone experience and take their decisions using intuitive and heuristic approaches. This vagueness appears to be one of the main reasons for current dissatisfaction in industry. In this paper we express our vision of how a rigorous engineering methodology for business performance management in engineering design may look like. Our research work in PSI and PRODUKTIV+ projects strongly suggests that the underlying modeling framework has to be holonic. We consider that the solution has to: (i) be based on a sound Domain ontology of performance; (ii) use dynamic distributed planning technique and simulations to predict the performance of a design system; (iii) use the methodology which is sensitive to the specificities of a particular design system.
The AIT 2D Face Detection and Tracking System for CLEAR 2007
Authors: Andreas Stergiou, Ghassan Karame, Aristodemos Pnevmatikakis, Lazaros Polymenakos
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper describes the AIT system for 2D face tracking and the results obtained in the CLEAR 2007 evaluations. The system is based on the complementary operation of a set of face detectors and a deterministic tracker based on color. To minimize false positives, the system is applied on the body regions provided by a stochastic body tracker, and utilizes a detection validation scheme based on color and texture modeling of the faces.