ppxscal/embedding_network huggingface dataset:
Inference Analysis in Privacy-Preserving Data Re-publishing
Authors: Guan Wang, Zutao Zhu, Wenliang Du, Zhouxuan Teng
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Privacy-Preserving Data Re-publishing (PPDR) deals with publishing microdata in dynamic scenarios. Due to privacy concerns, data must be disguised before being published. Research in privacy-preserving data publishing (PPDP) has proposed many such methods on static data. In PPDR, multiple appeared records can be used to infer private information of other records. Therefore, inference channels exist among different releases. To understand the privacy property of data re-publishing, we need to analyze the impact of these inference channels. Previous studies show such analysis when data are updated or disguised in special ways, however, no general method has been proposed. Using the Maximum Entropy Modeling method, we have developed a general solution. Our method can conduct inference analysis when data are arbitrarily updated or arbitrarily disguised using either generalization or bucketization, two most common data disguise methods in PPDR. Through analysis and experiments, we demonstrate the advantage and the effectiveness of our method.
Maximizing the utilization of operating rooms with stochastic times using simulation
Authors: Jean-Paul M. Arnaout, Sevag Kulbashian
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper addresses a surgery rooms scheduling problem. The problem is modeled as a parallel machine scheduling problem with sequence dependent setup times and an objective of minimizing the makespan. This is a NP-hard problem and in this paper, a solution heuristic is developed and compared to existing ones using simulation. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm LEPST over the other algorithms presented.
Person-Independent 3D Sign Language Recognition
Authors: Jeroen F. Lichtenauer, Gineke A. Holt, Marcel J. Reinders, Emile A. Hendriks
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

In this paper, we present a person independent 3D system for judging the correctness of a sign. The system is camera-based, using computer vision techniques to track the hand and extract features. 3D co-ordinates of the hands and other features are calculated from stereo images. The features are then modeled statistically and automatic feature selection is used to build the classifiers. Each classifier is meant to judge the correctness of one sign. We tested our approach using a 120-sign vocabulary and 75 different signers. Overall, a true positive rate of 96.5% at a false positive rate of 3.5% is achieved. The system's performance in a real-world setting largely agreed with human expert judgement.
Decision assistance informational system: the bases of the organizational management
Authors: Mariana Luta, Daniel Hunyadi, Bogdan Constantin Milian
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The paper proposes to mark out the necessity to create an informational system in order to assist the decision making process in the current framework of the complex information to be instrumented and the speediness of the legislative changes. The on-line reports have an important contribution in the decision management, due to data processing in the very moment ti. Storing the data in data warehouses, the association between the priority levels, the utilisation of the new technologies and all the other solutions, put at the SIAD designer's disposal, allow the creation of a generalised system able to offer almost accurate reports to the users.
A resource allocation and planning system for the development and operation of health care delivery systems
Authors: Bernard W. Bise
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Hardly a week passes when one does not hear or read about the crisis in American health care. To the consumer and the health and medical care provider, there is a growing recognition of the inadequacies inherent in the distribution, delivery and financing of this Nation's health care. The majority of Americans today rely on the independent physician for medical care, consulting an array of specialists for specific problems and utilizing the hospital as the predominant facility in which to receive treatment. Medical care is purchased primarily on a fee-for-service basis when acquired by an individual. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Terminating Tableau Calculi for Hybrid Logics Extending K
Authors: Thomas Bolander, Patrick Blackburn
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This article builds on work by Bolander and Blackburn [Thomas Bolander and Patrick Blackburn. Termination for hybrid tableaus. Journal of Logic and Computation, 17(3):517-554, 2007] on terminating tableau systems for the minimal hybrid logic K. We provide (for the basic uni-modal hybrid language) terminating tableau systems for a number of non-transitive hybrid logics extending K, such as the logic of irreflexive frames, antisymmetric frames, and so on; these systems don't employ loop-checks. We also provide (for hybrid tense logic enriched with the universal modality) a terminating tableau calculus for the logic of transitive frames; this system makes use of loop-checks.
Comprehensive procedure for fast and accurate coupled oscillator network simulation
Authors: Prateek Bhansali, Shweta Srivastava, Xiaolue Lai, Jaijeet Roychowdhury
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Coupled oscillator networks occur in various domains such as biology, astrophysics and electronics. In this paper, we present a comprehensive procedure for rapid and accurate simulation of large coupled oscillator networks using widely accepted, fully-nonlinear Perturbation Projection Vector (PPV) phase macromodels. We validate our method against full simulation of 20x20 coupled network of Brusselator biochemical oscillator and obtain computational speedups of 170x over full simulation. Furthermore, we apply the method to study self-organization phenomenon of Brusselator under asymmetric coupling and time period variations.
A New Ensemble Learning Algorithm Based on Improved K-Means for Training Neural Network Ensembles
Authors: Zhi-Gang Gan, Nan-Feng Xiao
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The diversity of individual neural network will affect the forecast error of neural network ensemble. In this paper, a new training method for neural network ensemble which is based on the improved K-means algorithm is presented. The space diversity among the sample datasets can be realized by clustering the entire dataset using K-means algorithm. To avoiding the sample subset too simple, the sample subsets are interpolated some samples which are randomly chosen from the entire sample space. By contrast experiments with Boosting and Bagging, the presented learning algorithm is proved that can reduce the prediction error of neural network ensemble and enhance the prediction accuracy.
Automatic generation of explanation for expert systems implemented with different knowledge representations
Authors: Ahmed Fouad Said, Ahmed Rafea, Samhaa R. El-Beltagy, Hesham Hassan
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Humans seem to have a natural instinct for wanting to understand and make sense of their environment and things in it. In expert systems (ES), explanation can be used to clarify the reasoning process to users such that they can gain a better understanding of how the system functions. With the help of good explanation facilities, a user can know why an ES is asking a particular question, how the expert system will act if given a certain input, and how the ES reaches a particular conclusion. This is especially important when an ES application is used as a high level advisor to professionals who must retain responsibility for the decisions which are made. However, most ES explanation components require acquiring additional knowledge for explanation, thus increasing the effort of implementing an ES with explanation capabilities. The primary goal of this work is to present a methodology for automatically generating explanations during and at the end of the reasoning process. The developed explanation components can deal with different knowledge representation schemes that are used by problem solving methods namely, the "generate and confirm hypotheses" that is based on the CommonKADS methodology[1], and the routine design generic task[2]. As a proof of concept the explanation components were developed and integrated into the agricultural expert system generic tool (AESGT)[3]. The developed explanation components can be easily reused with expert systems developed by the tool to automatically generate explanation for the reasoning process.
Leak pruning
Authors: Michael D. Bond, Kathryn S. McKinley
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

Managed languages improve programmer productivity with type safety and garbage collection, which eliminate memory errors such as dangling pointers, double frees, and buffer overflows. However, because garbage collection uses reachability to over-approximate live objects, programs may still leak memory if programmers forget to eliminate the last reference to an object that will not be used again. Leaks slow programs by increasing collector workload and frequency. Growing leaks eventually crash programs. This paper introduces leak pruning, which keeps programs running by predicting and reclaiming leaked objects at run time. It predicts dead objects and reclaims them based on observing data structure usage patterns. Leak pruning preserves semantics because it waits for heap exhaustion before reclaiming objects and poisons references to objects it reclaims. If the program later tries to access a poisoned reference, the virtual machine (VM) throws an error. We show leak pruning has low overhead in a Java VM and evaluate it on 10 leaking programs. Leak pruning does not help two programs, executes five substantial programs 1.6-81X longer, and executes three programs, including a leak in Eclipse, for at least 24 hours. In the worst case, leak pruning defers fatal errors. In the best case, it keeps leaky programs running with preserved semantics and consistent throughput.
Computational method for segmentation and classification of ingestive sounds in sheep
Authors: D. H. Milone, H. L. Rufiner, J. R. Galli, E. A. Laca, C. A. Cangiano
Venue: Computers and Electronics in Agriculture (2009)

In this work we propose a novel method to analyze and recognize automatically sound signals of chewing and biting. For the automatic segmentation and classification of acoustical ingestive behaviour of sheep the method use an appropriate acoustic representation and statistical modelling based on hidden Markov models. We analyzed 1813s of chewing data from four sheep eating two different forages typically found in grazing production systems, orchardgrass and alfalfa, each at two sward heights. Because identification of species consumed when in mixed swards is a key issue in grazing science, we tested the possibility to discriminate species and sward height by using the proposed approach. Signals were correctly classified by forage and sward height in 67% of the cases, whereas forage was correctly identified 84% of the time. The results showed an overall performance of 82% for the recognition of chewing events.
A Virtual Environment for Construction Workers Instruction and Training
Authors: G. Arcangeli, J. Assfalg, E. Vicario, R. Tartaglia
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Despite technological and economical advancement, the practice of construction work is still affected by a high rate of serious and even deadly injuries. A wide set of normative rules faces the problem by constraining environmental condition and workers' practice so as to reduce risk exposure and impact. However, the effectiveness, and even the practical enforcement, of these rules basically depends on workers' capability to autonomously perceive risks and assume safe behaviors. Professional instruction and training play a central role in the achievement of this worker attitude.Several type of documents on the practice of safety are commonly employed to support both the scholar instruction of young workers within professional schools and the autonomous or decentralized training of active workers. These documents usually combine drawings and photographs, and sometimes video, but they do not include any medium allowing for an interactive approach to information analysis.The main objective of the VECWIT project (Virtual Environments for Construction Workers' Instruction and Training) is to experiment and evaluate the suitability of interactive 3D graphics as a new supporting tool for safety training and instruction in the operational context of construction workplaces. By allowing for an interactive approach, 3D graphics is expected to attract and stimulate the attention of young workers, by enabling a direct and autonomous exploration of information about safe environmental and behaviorial conditions in the workplace.
Long-range dependence and on-chip processor traffic
Authors: Antoine Scherrer, Antoine Fraboulet, Tanguy Risset
Venue: Microprocessors Microsystems (2009)

Long-range dependence is a property of stochastic processes that has an important impact on network performance, especially on the buffer usage in routers. We analyze the presence of long-range dependence in on-chip processor traffic and we study the impact of long-range dependence on networks-on-chip. long-range dependence in communication traces of processorips at the cycle-accurate level. We also study the impact of long-range dependence on a real network-on-chip using the SocLib simulation environment and traffic generators of our own. Our experiments show that long-range dependence is not an ubiquitous property of on-chip processor traffic and that its impact on the network-on-chip is highly correlated with the low level communication protocol used.
The uncertainties about the relationships risk---return---volatility in the Spanish stock market
Authors: Ricardo Cao, Alicia Heras, Angeles Saavedra
Venue: Computational Statistics (2009)

The relationships between the market risk premium, its conditional variance and the risk-free rate in the Spanish stock market are studied in this paper. Using daily data, the above mentioned relations are analyzed by quasi maximum likelihood for an EGARCH-M(1,1) model with normal innovations and by nonparametric maximum likelihood for a semiparametric EGARCH-M(1,1) model with arbitrarily distributed innovations. It is worth mentioning that the conclusions differ from one model to the other.
A self-tuning fuzzy PID-type controller design for unbalance compensation in an active magnetic bearing
Authors: Kuan-Yu Chen, Pi-Cheng Tung, Mong-Tao Tsai, Yi-Hua Fan
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a design for a fuzzy gain tuning mechanism dealing with the problem of unbalanced vibration problem in an active magnetic bearing (AMB) system. For the purpose of enhancing the performance of the AMB system, we replace the conventional proportional-integral-derivative (PID) controller with a self-tuning fuzzy PID-type controller (FPIDC). The shaft displacement and the unbalanced forces of the rotor are evaluated by model-based observation. If there are model uncertainties in the rotor system or nonlinearities in the magnetic bearing system, this observer may not work well at any operating speed. A fuzzy gain tuner is added to adjust the actuating signal of the self-tuning FPIDC in order to overcome the disturbances and suppress the unbalancing vibration. The experimental results show that the proposed scheme allows for a remarkable improvement in reducing vibration in an unbalanced AMB system as well as demonstrate an efficient reduction in the shaft displacement of the rotor.
Teaching requirements skills within the context of a physical engineering project
Authors: G. Auriol, C. Baron, J-Y. Fourniols
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

This paper presents two system engineering Master lectures related to requirement engineering dealing with a physical product. It first introduces the framework of these lectures then gives some details about the two lectures: (1) during the first one, "expert" students study tools and methodologies to manage requirements, (2) during the second one, "novice" students use requirement data to realize the product: a scale model sail ship. Finally, an example of benefits of use RE by novice students is given.
Security and User Guidelines for the Design of the Future Networked Systems
Authors: Seppo Heikkinen, Sari Kinnari, Kari Heikkinen
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Emergence of new networking technologies and paradigms provides users multitude of ways to communicate with each others and exchange information irrespective of time and place. Diversity of the available environments, however, sets requirements for the design processes so that the new architectures can offer a concise and secure usage experience. This cannot be answered in an off-hand fashion or as an add-on feature, but security and usability need to be taken into account right from the start. Seamless design cooperation of both is vital in achieving secure user experience. In this paper we discuss how security and user design guidelines within the ubiquitous future environment can be used to enhance both the security and user experience of the communication services. The paper brings forth network, service and user level aspects that need to be kept in mind when considering the technology oriented design processes of such networks.
On representable graphs
Authors: Sergey Kitaev, Artem Pyatkin
Venue: Journal of Automata, Languages and Combinatorics (2008)

A graph G = (V, E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. We prove that a graph is representable if and only if it is k-representable for some k. Examples of non-representable graphs are found in this paper. Some wide classes of graphs are proven to be 2- and 3-representable. Several open problems are stated.
Cooperative Multi-Robot Monocular-SLAM Using Salient Landmarks
Authors: Ming Wu, Feifei Huang, Long Wang, Jiyin Sun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In this paper we propose an algorithm to multi-robot cooperative Simultaneous Localization and Mapping (SLAM) with monocular camera mounted on each robot. The map consists of a sparse set of features, and the feature is prominent in the environment that robots explored, we call it salient landmark. The scene of exploration is typical office environment. Vertical lines and doorplates of environment are considered as visual landmarks to implement single-robot localization and multi-robot cooperation. An approach based on duplicate landmarks and rendezvous is also presented to improve the accuracy and reliability of SLAM. Our system was evaluated by an indoor two robot team, the results of this test showed that our approach is valid.
Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
Authors: Raghu Pasupathy, Bruce W. Schmeiser
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2009)

The stochastic root-finding problem (SRFP) is that of solving a nonlinear system of equations using only a simulation that provides estimates of the functions at requested points. Equivalently, SRFPs seek locations where an unknown vector function attains a given target using only a simulation capable of providing estimates of the function. SRFPs find application in a wide variety of physical settings. We develop a family of retrospective-approximation (RA) algorithms called Bounding RA that efficiently solves a certain class of multidimensional SRFPs. During each iteration, Bounding RA generates and solves a sample-path problem by identifying a polytope of stipulated diameter, with an image that bounds the given target to within stipulated tolerance. Across iterations, the stipulations become increasingly stringent, resulting in a sequence of shrinking polytopes that approach the correct solution. Efficiency results from: (i) the RA structure, (ii) the idea of using bounding polytopes to exploit problem structure, and (iii) careful step-size and direction choice during algorithm evolution. Bounding RA has good finite-time performance that is robust with respect to the location of the initial solution, and algorithm parameter values. Empirical tests suggest that Bounding RA outperforms Simultaneous Perturbation Stochastic Approximation (SPSA), which is arguably the best-known algorithm for solving SRFPs.
Experimental study on variations of WIPLOAD control in semiconductor wafer fabricaiton environment
Authors: Appa Iyer Sivakumar, Chao Qi, Andy Darwin Kasan Hidayat
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

WIPLOAD Control has been proposed and evaluated as an effective job release control methodology. This paper presents a further simulation experimental study on two variations of WIPLOAD Control in semiconductor wafer fab environment. The first variation mechanism is to control separate WIPLOAD for each part type at a specified level under the situation when the type of job going to be released next can be controlled. The second variation is a mechanism with additional release control points along the production line. The performance of the WIPLOAD variations are compared with that of the original WIPLOAD Control and other existing release methods including CONWIP and Constant release in semiconductor manufacturing environment. The experimental results indicate that by breaking down the control of overall fab WIPLOAD into controlling WIPLOAD level for each part type, cycle time performance can be improved especially with respect to the standard deviation of cycle time.
An Efficient Approach for Managing Power Consumption Hotspots Distribution on 3D FPGAs
Authors: Kostas Siozios, Dimitrios Soudris
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Using new silicon technologies, increasing logic densities and clock frequencies on FPGAs lead to rapid elevation in power density. Since the power consumption is a critical challenge for application implementation, a novel power-aware partitioning, placement and routing (P R) algorithm targeting to 3D FPGAs, is introduced. The proposed methodology achieves to redistribute the switched capacitance over the hardware resources in a rather "balanced" profile, reducing among others the maximal on-chip temperatures. Due to the relation between switched capacitance and power consumption, the proposed P R algorithm can be considered as a power management approach. This algorithm is realized as part of 3DPRO tool. Comparing to alternative P R solutions, we eliminate the area on hotspots about 68%, while we achieve savings in delay and energy consumption about 9% and 11% in average,respectively.