ppxscal/embedding_network huggingface dataset:
A fully Bayesian approach to inference for Coxian phase-type distributions with covariate dependent mean
Authors: C. A. McGrory, A. N. Pettitt, M. J. Faddy
Venue: Computational Statistics Data Analysis (2009)

Phase-type distributions represent the time to absorption for a finite state Markov chain in continuous time, generalising the exponential distribution and providing a flexible and useful modelling tool. We present a new reversible jump Markov chain Monte Carlo scheme for performing a fully Bayesian analysis of the popular Coxian subclass of phase-type models; the convenient Coxian representation involves fewer parameters than a more general phase-type model. The key novelty of our approach is that we model covariate dependence in the mean whilst using the Coxian phase-type model as a very general residual distribution. Such incorporation of covariates into the model has not previously been attempted in the Bayesian literature. A further novelty is that we also propose a reversible jump scheme for investigating structural changes to the model brought about by the introduction of Erlang phases. Our approach addresses more questions of inference than previous Bayesian treatments of this model and is automatic in nature. We analyse an example dataset comprising lengths of hospital stays of a sample of patients collected from two Australian hospitals to produce a model for a patient's expected length of stay which incorporates the effects of several covariates. This leads to interesting conclusions about what contributes to length of hospital stay with implications for hospital planning. We compare our results with an alternative classical analysis of these data.
Aspects of Auditory Perception and Cognition for Usable Display Resolution in Data Sonification
Authors: Johan Kildal
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Sonification of data via the mapping of values to frequency of sound is an auditory data analysis technique commonly used to display graph information. The goal for any form of graph is to display numerical information with accuracy and neutrality while exploiting perceptual and cognitive processes. Conveying information in frequency of sound is subject to aspects of pitch perception, largely overlooked to date, that can influence these properties of auditory graphing. This paper identifies some of these aspects and describes potential design limitations and opportunities derived from the musical nature of auditory data representations.
A Survey Study of Chinese Drivers' Inconsistent Risk Perception
Authors: Pei Wang, Pei-Luen Patrick Rau, Gavriel Salvendy
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

It is important to identify factors contributing to drivers' risk taking behaviors in order to reduce traffic accidents and fatalities. This study conducted a survey to investigate drivers' risk perception towards different risks encountered in daily life. Totally 438 subjects responded to the survey and indicated their likelihood of engaging in risk activities in different domains. The mean of likelihood to lend friend money is the highest and to shoplift is the lowest. It was found that respondents were most likely to engage in financial risks. Then it was social risks, safety risks, recreational risks and ethical risks. Respondents were least likely to engage in health risks. Male drivers were more likely to engage in the risks than female drivers in some factors.
Sequence-Based Trust for Document Recommendation
Authors: Hsuan Chiu, Duen-Ren Liu, Chin-Hui Lai
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

Collaborative Filtering (CF) recommender systems have emerged in various applications to support item recommendation, which solve the information-overload problem by suggesting items of interests to users. Recently, trust-based recommender systems have incorporated the trustworthiness of users into the CF techniques to improve the quality of recommendation. They propose trust computation models to derive the trust value based on users' past ratings on items. A user is more trustworthy if he has contributed more accurate predictions than other users. Nevertheless, none of them derive the trust value based on a sequence of user's ratings on items. We propose a sequence-based trust model to derive the trust value based on users' sequences of ratings on documents. In knowledge-intensive environments, users normally have various information needs to access required documents over time, which forms a sequence of documents ordered according to their access time. The model considers two factors - time factor and document similarity in computing the trustworthiness of users. The proposed model is incorporated into standard collaborative filtering method to discover trustworthy neighbors for making predictions. The experiment result shows that the proposed model can improve the prediction accuracy of CF method comparing to other trust-based recommender systems.
A Model Based on Possibilistic Certainty Levels for Incomplete Databases
Authors: Patrick Bosc, Olivier Pivert, Henri Prade
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

This paper deals with the modeling and querying of a database containing uncertain attribute values, in the situation where some knowledge is available about the more or less certain value (or disjunction of values) that a given attribute in a given tuple can take. This is represented in the setting of possibility theory. A relational database model suited to this context is introduced, and selection, join and union operators of relational algebra are extended so as to handle such relations. It is shown that i) the model in question is a strong representation system for the algebraic operators considered, and that ii) the data complexity associated with the extended operators in this context is the same as in the classical database case, which makes the approach highly scalable. A possibilistic logic encoding of the model is also outlined.
Going Bunkers: The Joint Route Selection and Refueling Problem
Authors: Omar Besbes, Sergei Savin
Venue: Manufacturing Service Operations Management (2009)

Managing shipping vessel profitability is a central problem in marine transportation. We consider two commonly used types of vessels---“liners” (ships whose routes are fixed in advance) and “trampers” (ships for which future route components are selected based on available shipping jobs)---and formulate a vessel profit maximization problem as a stochastic dynamic program. For liner vessels, the profit maximization reduces to the problem of minimizing refueling costs over a given route subject to random fuel prices and limited vessel fuel capacity. Under mild assumptions about the stochastic dynamics of fuel prices at different ports, we provide a characterization of the structural properties of the optimal liner refueling policies. For trampers, the vessel profit maximization combines refueling decisions and route selection, which adds a combinatorial aspect to the problem. We characterize the optimal policy in special cases where prices are constant through time and do not differ across ports and prices are constant through time and differ across ports. The structure of the optimal policy in such special cases yields insights on the complexity of the problem and also guides the construction of heuristics for the general problem setting.
A Critical Look at Software Capability Evaluations: An Update
Authors: Terry Bollinger, Clement McGowan
Venue: IEEE Software (2009)

Terry Bollinger and Clement McGowan provide differing viewpoints on the CMM's progress since their 1991 article, "A Critical Look at Software Capability Evaluations."
Robust Stability for a Class of Nonlinear Neutral System with Norm-Bounded Uncertainties
Authors: Diankun Wang, Li Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

This note considers the problem of robust stability for a class of nonlinear neutral system with norm-bounded uncertainties. The uncertainties are assumed to be norm-bounded. By using the theory of Lyapunov-Krasovskii and Newton-Leibnitz formula, the criteria of delay-dependent stability are derived. The proposed stability criteria are formulated in the form of linear matrix inequalities (LMI). The results are considerably efficient, since they include the information of delays.
Parameterizable floating-point library for arithmetic operations in FPGAs
Authors: Diego F. Sánchez, Daniel M. Muñoz, Carlos H. Llanos, Mauricio Ayala-Rincón
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

Floating-point operations are an essential requisite in a wide range of computational and engineering applications that need good performance and high precision. Current advances in VLSI technology raised the density integration fast enough, allowing the designers to develop directly in hardware several floating-point operations commonly implemented in software. Until now, most of the research has not focused on the tradeoff among the need of high performance and the cost of the size of logic area, associated with the level of precision, parameters that are very important in a wide variety of applications such as robotics, image and digital signal processing. This paper describes an FPGA implementation of a parameterizable floating-point library for addition/subtraction, multiplication, division and square root operations. Architectures based on Goldschmidt algorithm were implemented for computing floating-point division and square root. The library is parameterizable by bit-width and number of iterations. An analysis of the mean square error and the cost in area consumption is done in order to find, for general purpose applications, the feasible bit-width representation, number of iterations and number of addressable words for storing initial seeds of the Goldschmidt algorithm.
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem
Authors: Wei Gu, Xin Wang, Liqiang Geng
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation facilities to serve an objective area with minimum costs. The problem is challenging because two types of facilities are involved and locations of transportation facilities are dependent on locations of static facilities and demand objects. This paper proposes a new stand-alone GIS platform, GIS-FLSolution, to solve the problem. Combined with a customized algorithm called STFLS, the platform is built on MapObjects and can successfully provide results with a friendly graphical user interface. Preliminary experiments have been conducted to demonstrate the efficiency and practicality of the platform.
Serializable isolation for snapshot databases
Authors: Michael J. Cahill, Uwe Röhm, Alan D. Fekete
Venue: ACM Transactions on Database Systems (TODS) (2009)

Many popular database management systems implement a multiversion concurrency control algorithm called snapshot isolation rather than providing full serializability based on locking. There are well-known anomalies permitted by snapshot isolation that can lead to violations of data consistency by interleaving transactions that would maintain consistency if run serially. Until now, the only way to prevent these anomalies was to modify the applications by introducing explicit locking or artificial update conflicts, following careful analysis of conflicts between all pairs of transactions. This article describes a modification to the concurrency control algorithm of a database management system that automatically detects and prevents snapshot isolation anomalies at runtime for arbitrary applications, thus providing serializable isolation. The new algorithm preserves the properties that make snapshot isolation attractive, including that readers do not block writers and vice versa. An implementation of the algorithm in a relational DBMS is described, along with a benchmark and performance study, showing that the throughput approaches that of snapshot isolation in most cases.
Formally Certifying the Security of Digital Signature Schemes
Authors: Santiago Zanella-Beguelin, Gilles Barthe, Benjamin Gregoire, Federico Olmedo
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

We present two machine-checked proofs of the existentialunforgeability under adaptive chosen-message attacks of the FullDomain Hash signature scheme. These proofs formalize the originalargument of Bellare and Rogaway, and an optimal reduction by Coronthat provides a tighter bound on the probability of a forgery. Bothproofs are developed using CertiCrypt, a general framework toformalize exact security proofs of cryptographic systems in thecomputational model. Since CertiCrypt is implemented on top of theCoq proof assistant, the proofs are highly trustworthy and can beverified independently and fully automatically.
Exploiting the addressee's inferential capabilities in presenting mathematical proofs
Authors: Detlef Fehrer, Helmut Horacek
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Proof presentation systems and, in some more general context, many natural language generation systems suffer from a crucial problem: they present too much information explicitly which the intended audience could more naturally infer from a less detailed text. Moreover, proofs in mathematical textbooks make extensive use of building chains of inferences in specialized notations, which is not sufficiently taken into account by proof presentation systems. Encouraged by these observations, we present a model for presenting mathematical proofs that (1) features the implicit conveyance of information through concise texts, (2) organizes major lines in the proof presentation around focused chains of inferences in a specialized notation, (3) can adapt its output to some of the capabilities of its audience. The methods described in this paper allow us to present proofs of moderately complex size in a quality approaching that of proofs found in mathematical textbooks.
Examining computers & society 1970--2008
Authors: Joseph D. Oldham
Venue: ACM SIGCAS Computers and Society (2009)

This paper is a review of 39 years of SIGCAS publications in Computers and Society, the newsletter of ACM SIGCAS. The publication is archived in the ACM Digital Library [12]. I set out to examine SIGCAS through its publications.
Classification of Paper Images to Predict Substrate Parameters Prior to Print
Authors: Matthias Scheller Lichtenauer, Safer Mourad, Peter Zolliker, Klaus Simon
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

An accurate characterization of the substrate is a prerequisite of color management in print. The use of standard ICC profiles in prepress leaves it to the printer to match the fixed substrate characteristics contained in these profiles. This triggers the interest in methods to predict, if a given ink, press and paper combination complies with a given characterization. We present an approach to compare physical and optical characteristics of papers in order to achieve such a prediction of compliance by classification methods. For economical and ecological reasons it is preferable to test paper without printing it. We therefore propose non-destructive methods.
Time-Driven Access and Forwarding in IEEE 802.11 Mesh Networks
Authors: Mario Baldi, Riccardo Giacomelli
Venue: Proceedings of the 2009 Second International Conference on Advances in Mesh Networks (2009)

Various solutions based on both prioritization and resource allocation have been proposed in the literature and standard bodies to support end-to-end Quality of Service (QoS) in wireless multihop scenarios. However, their performance is not satisfactory in terms of achievable overall network throughput and tradeoff between end-to-end delay and network utilization. This paper proposes Time-driven Access and Forwarding (TAF), a novel multilevel solution to guarantee deterministic end-to-end QoS for real-time traffic and improve overall network throughput and utilization in 802.11 mesh networks.
Study on Making Algorithm of Microlens Based on Surface-molding
Authors: Chen Min, Xiao Ju
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

A series of making algorithm of rapid prototyping technology is designed for surface-molding used in forming microlens.The making algorithm are made up of the optimization design of microlens, making phase turned actual thickness, STL file outputted from CAD, loading and displaying STL file in VC, slicing algorithm based on the STL model and filling algorithm of the cross-section after slicing. Based on the making algorithm, the errors of the surface-curing molding method is TanalysedT that was produced by using the Digital Micromirror Device (DMD) as a dynamic mask and compared with the traditional point-curing molding method’s.The result shows that the surface-molding method can reduce errors and increase the speed of molding. It is a kind of effective rapid prototyping method.
QoS management for real-time DataBases in embedded systems
Authors: Yáskara Y. M. P. Fernandes, Francisco Milton Mendes Neto, Pedro Fernandes Ribeiro Neto, Maria Ligia B. Perkusich, Gabriel Antoine Louis Paillard, Angelo Perkusich
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

Real-time database management systems (RT-DBMS) have the necessary characteristics for providing efficient support to develop applications in which both, data and transactions have temporal constraints. However, in the last decade, new applications were identified and are characterized by a large geographic distribution, high heterogeneity, lack of global control, partial failures and lack of safety. Besides, they need to manage large data volumes with real-time constraints. Scheduling algorithms should consider transactions with soft deadlines and the concurrency control protocols should allow conflicting transactions to execute in parallel. The last ones should be based in their requirements, which are specified through both quality of services functions and performance metrics. In this work, a method to model and develop applications that execute in open and unpredictable environments is proposed. Based on this model, it is possible to perform analysis and simulations of systems, to guide the decision making process and to identify solutions for improving it. For validating the model, a case study considering the application domain of sensors network is discussed.
Efficient Physical Design Methodology for Reducing Test Power Dissipation of Scan-Based Designs
Authors: Jun Xu, Xiangku Li
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Scan-based test methodology is used to resolve the sequential-test problem but suffers from high power dissipation. In this paper, we propose a scheme to prevent transitions of scan chain from reflecting into the circuit line. It not only can save 23% power consumption without performance loss, but also can be easily implemented with popular industrial design tools.
Event Extraction and Visualization for Obtaining Personal Experiences from Blogs
Authors: Yoko Nishihara, Keita Sato, Wataru Sunayama
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Internet users write blogs related to their personal experience, daily news, and so on. Though we can obtain blogs about personal experience using search engines on the Web, the search engines also output blogs about other topics unrelated to personal experiences. Therefore, we need to take too much time to read all blogs for obtaining those about personal experiences. This paper proposes a support system for obtaining blogs about personal experience efficiently. The system extracts three keywords that denote place, object, and action from a blog. The three keywords describe an event that leads a person to write a blog about personal experience. The system expresses the event with three pictures related to the extracted keywords. The pictures help users to judge whether personal experiences are written in the blog or not. We experimented with the system, and verified that it supports users to obtain personal experiences efficiently.
On the solution of trivalent decision problems by quantum state identification
Authors: Karl Svozil, Josef Tkadlec
Venue: Natural Computing: an international journal (2009)

The trivalent functions of a trit can be grouped into equipartitions of three elements. We discuss the separation of the corresponding functional classes by quantum state identifications.
Uncertainty in preference elicitation and aggregation
Authors: Toby Walsh
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational complexity in determining which candidate or candidates can or must win the election. In this paper, we survey recent work in this area and give some new results. We argue, for example, that the set of possible winners can be computationally harder to compute than the necessary winner. As a second example, we show that, even if the unknown votes are assumed to be single-peaked, it remains computationally hard to compute the possible and necessary winners, or to manipulate the election.
UBC-ZAS: a k-NN based multiclassifier system to perform WSD in a reduced dimensional vector space
Authors: Ana Zelaia, Olatz Arregi, Basilio Sierra
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this article a multiclassifier approach for word sense disambiguation (WSD) problems is presented, where a set of k-NN classifiers is used to predict the category (sense) of each word. In order to combine the predictions generated by the multiclassifier, Bayesian voting is applied. Through all the classification process, a reduced dimensional vector representation obtained by Singular Value Decomposition (SVD) is used. Each word is considered an independent classification problem, and so different parameter setting, selected after a tuning phase, is applied to each word. The approach has been applied to the lexical sample WSD subtask of SemEval 2007 (task 17).
An Algorithm Based on Energy Conservation in Wireless Sensor Network
Authors: Gang Liu, Yinghua-Ji
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

An improved medium access control algorithm based on energy conservation is proposed in this paper because the energy is constrained in wireless sensor network. In this algorithm, each code can adjust its sleeping probability by its remaining energy, balance energy consumption of net codes, so the life time of whole network is enlarging. The simulating result shows that comparing with traditional algorithm, the max life time can be increased from 1.48×104 time-slot to 3.6×104 time-slot. At the same time, the transmitted data groups also can be improved more in life time with the same energy of each code.