ppxscal/embedding_network huggingface dataset:
Probabilistic cost-effectiveness comparison of screening strategies for colorectal cancer
Authors: Ali Tafazzoli, Stephen Roberts, Robert Klein, Reid Ness, Robert Dittus
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2009)

A stochastic discrete-event simulation model of the natural history of Colorectal Cancer (CRC) is augmented with screening technology representations to create a base for simulating various screening strategies for CRC. The CRC screening strategies recommended by the American Gastroenterological Association (AGA) and the newest screening strategies for which clinical efficacy has been established are simulated. In addition to verification steps, validation of screening is pursued by comparison with the Minnesota Colon Cancer Control Study. The model accumulates discounted costs and quality-adjusted life-years. The natural variability in the modeled random variables for natural history is conditioned using a probabilistic sensitivity analysis through a two-stage sampling process that adds other random variables representing parametric uncertainty. The analysis of the screening alternatives in a low-risk population explores both deterministic and stochastic dominance to eliminate some screening alternatives. Net benefit analysis, based on willingness to pay for quality-adjusted life-years, is used to compare the most cost-effective strategies through acceptability curves and to make a screening recommendation. Methodologically, this work demonstrates how variability from the natural variation in the development, screening, and treatment of a disease can be combined with the variation in parameter uncertainty. Furthermore, a net benefit analysis that characterizes cost-effectiveness alternatives can explicitly depend on variation from all sources producing a probabilistic cost-effectiveness analysis of decision alternatives.
Pub/sub content sharing for mobile networks format
Authors: Francesco Malandrino, Claudio Casetti, Carla Chiasserini
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

We present Figaro, a content discovery solution for mobile environments. Our main focus is on urban networks, in which high densities of users coexist in relatively narrow, circumscribed areas reached by an infrastructure (e.g., bus stops integrating an AP). Figaro networks are overlay networks that operate according to the publish/subscribe (pub/sub) paradigm, featuring two main types of nodes: Agents and Brokers. Agents produce and consume the content, while it is the Brokers' task to let demands and offers meet. Agents are mobile (possibly handheld) devices, while Brokers are middle-end devices, integrated in the infrastructure and interconnected via a reliable (typically wired) backbone. When they discover a Broker, Agents can register with it declaring the services or contents (files, items of information...) they are willing to share with other Agents. Once the registration is complete, Agents can ask the Broker for the services they need. The Broker maintains a content-based routing table and queries it to answer such requests. The set of Agents exchanging services through a Broker is called colony. In a pure overlay fashion, colonies do not necessarily correspond to a set of nearby Agents. Although many works have dealt pub/sub in mobile networks, only few of them take into account the presence of an infrastructure and the opportunities it implies. With respect to them, our work includes novel protocol entities and addresses additional security and reputation issues. In particular, we describe our reference scenario and the behavior of Figaro in such conditions. Then, we show how this behavior can be improved, increasing the hit ratio and providing resiliency to misbehaving nodes.
Data Deletion with Provable Security
Authors: Marek Klonowski, Michał Przykucki, Tomasz Strumiński
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

In many systems one of the most important and essential functionalities necessary for secure data processing is the permanent and irreversible deletion of stored bits. According to recent results, it is possible to retrieve data from numerous (especially magnetic) data storage devices, even if some erasing techniques like wiping have been applied. In fact, in many cases a powerful adversary is able to read information that has been many times overwritten.In our paper we present a new approach to data storage for which a provably secure data deletion seems to be possible. The core idea is based on a particular way of data coding and is generally independent on physical features of the data storage device, so this approach is not limited to magnetic drives. Furthermore, it does not require any special-purpose "secure" device. The usage of a software drivers or installation of modified firmware is sufficient.We provide rigid mathematical analysis of security of the proposed scheme for some scenarios even in the presence of an extremely powerful adversary. Our approach offers all of this for the price of speed and storage overhead. However, even under pessimistic assumptions this scheme remains fairly practical.
Letters: Soft ranking in clustering
Authors: Stefano Rovetta, Francesco Masulli, Maurizio Filippone
Venue: Neurocomputing (2009)

Due to the diffusion of large-dimensional data sets (e.g., in DNA microarray or document organization and retrieval applications), there is a growing interest in clustering methods based on a proximity matrix. These have the advantage of being based on a data structure whose size only depends on cardinality, not dimensionality. In this paper, we propose a clustering technique based on fuzzy ranks. The use of ranks helps to overcome several issues of large-dimensional data sets, whereas the fuzzy formulation is useful in encoding the information contained in the smallest entries of the proximity matrix. Comparative experiments are presented, using several standard hierarchical clustering techniques as a reference.
Computer-based intelligent educational program for teaching chemistry
Authors: Róbert Pántya, László Zsakó
Venue: Acta Cybernetica (2008)

Improving problem-solving skills is a basic requirement in present education. Logic programming languages, often used in the area of artificial intelligence and expert systems, are very much suitable for developing problem-solving skills. This paper presents a computer-based tool for solving different chemical problems (calculation of quantum numbers, description of electron configurations of atoms, determination of oxidation numbers and electronegativity), which uses the logic programming language Prolog. The authors argue that this intelligent educational material does not only improve chemistry education but it also inspires students to create rule-based systems when they face various problems of everyday life.
Multimodal Human Machine Interactions in Virtual and Augmented Reality
Authors: Gérard Chollet, Anna Esposito, Annie Gentes, Patrick Horain, Walid Karam, Zhenbo Li, Catherine Pelachaud, Patrick Perrot, Dijana Petrovska-Delacrétaz, Dianle Zhou, Leila Zouari
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

Virtual worlds are developing rapidly over the Internet. They are visited by avatars and staffed with Embodied Conversational Agents (ECAs). An avatar is a representation of a physical person. Each person controls one or several avatars and usually receives feedback from the virtual world on an audio-visual display. Ideally, all senses should be used to feel fully embedded in a virtual world. Sound, vision and sometimes touch are the available modalities. This paper reviews the technological developments which enable audio-visual interactions in virtual and augmented reality worlds. Emphasis is placed on speech and gesture interfaces, including talking face analysis and synthesis.
Dual-rail transition logic: A logic style for counteracting power analysis attacks
Authors: Amir Moradi, Mohammad Taghi Manzuri Shalmani, Mahmoud Salmasizadeh
Venue: Computers and Electrical Engineering (2009)

In this paper, a new logic style is proposed to be used in the implementation of cryptographic algorithms. The aim of this approach is to counteract power analysis attacks. The proposed technique is based on the transition signaling. In dual-rail transition logic, one-bit value is transmitted by a transition on the proper signal of a couple of wires. According to this concept, converter units and logic gates are defined; it is proposed to use flip-flops to build DTL alternative parts. Although the usage of flip-flops leads to increase the required area, experimental results show that the power consumption of DTL circuits depends on unpredictable initial state of T-flip-flops. In other words, DTL randomizes the power consumption without using random number/mask generators while its delay time is reasonable in comparison with other logic styles. The difference of mean traces and the simulated attacks show that the power consumption of DTL gates does not correlate with the input/output values.
A particle swarm optimization-aided fuzzy cloud classifier applied for plant numerical taxonomy based on attribute similarity
Authors: Hongfei Lu, Erxu Pi, Qiufa Peng, Lanlan Wang, Changjiang Zhang
Venue: Expert Systems with Applications: An International Journal (2009)

Data mining techniques are widely used in many fields. One application of data mining in the field of the botany is numerical taxonomy. In the present work, a particle swarm optimization-aided fuzzy cloud classifier based on attribute similarity (PSOCCAS) is used for plant taxonomy by two datasets. Firstly, the proposed classifier is been tested by employing it for the benchmark classification data sets, Fisher's iris data. The testing accuracy is found very encouraging. The performance of our proposed system is only bettered by some genetic algorithm (GA) or evolutionary algorithm (EA)-based fuzzy systems which showed fantastic results. Then for further validation and broadening application, the PSOCCAS has been presented for quantitative features evaluation, 'expected species' selection and successful classification of three sections in genus Camellia (belongs to the family Theaceae). The selected quantitative features are almost those selected in previous works. The method is able to produce 100% accurate classification results in genus Camellia. It is a very simple and robust method to divergences in plant taxonomy. No extensive preprocessing is required. The classification is performed with comparatively comprehensive features than those used in our previous work. The method utilizes the inherent nature of the data in performing various tasks. Consequently, the method can be used for plant numerical taxonomy.
Combined use of modeling techniques for the development of the conceptual model in simulation projects
Authors: José Arnaldo Barra Montevechi, Rafael Florêncio da Silva Costa, Fabiano Leal, Alexandre Ferreira de Pinho, Fernando Augusto Silva Marins, Fábio Ferreira Marins, José Tadeu de Jesus
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The objective of this paper is to utilize the SIPOC, flowchart and IDEF0 modeling techniques combined to elaborate the conceptual model of a simulation project. It is intended to identify the contribution of these techniques in the elaboration of the computational model. To illustrate such application, a practical case of a high-end technology enterprise is presented. The paper concludes that the proposed approach eases the elaboration of the computational model.
How to Guard a Graph?
Authors: Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matúš Mihalák, Elias Vicari, Peter Widmayer
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We initiate the study of the algorithmic foundations of games in which a set of cops has to guard a region in a graph (or digraph) against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to find the minimum number of cops needed to prevent the robber from entering the guarded region. The problem is highly non-trivial even if the robber's or the cops' regions are restricted to very simple graphs. The computational complexity of the problem depends heavily on the chosen restriction. In particular, if the robber's region is only a path, then the problem can be solved in polynomial time. When the robber moves in a tree, then the decision version of the problem is NP-complete. Furthermore, if the robber is moving in a DAG, the problem becomes PSPACE-complete.
Enhancing the patient empowerment due to ICT and ethical aspects involved
Authors: Marilena Ianculescu, Monica Parvan, Bogdan Iordache
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Health education informatics systems (HEIS) can provide structured and quality-controlled access to a wide variety of health knowledge, information and services. The potential benefits of using ICT for disseminating health information are numerous. However, there are ethical implications inherent in using ICT for health education which must be taken into consideration during the implementation of HEIS. Aging well in the modern society is a social necessity and ICT responds positively to the demographic challenge. "Multidisciplinary Complex System for the Efficient Management of the Anti-Aging Information" is a complex system that demonstrates that the information technologies have a deep integrator character, both at the level of the information management and at the one of the development of the modern health systems. "Informational Centre of Dermatology" has as target to achieve a modern informatics tool able to centralize in a single point a variety of web services and information addressed to the average citizens or to the dermatologists. This paper describes the enhancing of the patient empowerment due to ICT and the ethical aspects involved through the two health informatics systems; namely, Aging Nice and CID, developed at the Romanian National Institute for R&D in Informatics.
Succeeding at SaaS: Computing in the Cloud
Authors: Amy Wohl
Venue:  (2008)

Succeeding at SaaS: Computing in the Cloud is both an overview of the SaaS market and a series of recommendations for ISVs, platform vendors, and customers who want to participate in it. The centerpiece of the book is 22 interviews Wohl conducted with these market participants, illustrating the state of the SaaS market and its direction. Author Amy Wohl has been following the SaaS market since its inception (as the earlier ASP market) in the late 90's and she has filled the book with advice based on her consulting practice and her observations of the industry. The book includes both a brief history of the market and its precedents, a definition of cloud computing and its relationship to SaaS, and a discussion of their likely futures.
Economic analysis of an n-unit parallel redundant system based on a Stackelberg game formulation
Authors: Takeshi Koide, Hiroaki Sandoh
Venue: Computers and Industrial Engineering (2009)

A parallel redundancy has been researched in a great amount of literature on reliability theory. In the real circumstances, however, it is seldom observed except some systems that require much higher reliability. This is because most of the literature only look at the manufacturer's point of view. The present study carries out an economic analysis of an n-unit parallel redundant system against a single unit system based on a Stackelberg game formulation considering both the consumer's viewpoint and the manufacturer's one. It clarifies quantitatively in what situation the manufacturer can increase his profit by dealing in the parallel redundant system.
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Authors: Evmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

The metro-line crossing minimization (MLCM) problem was recently introduced as a response to the problem of drawing metro maps or public transportation networks, in general. According to this problem, we are given a planar, embedded graph G = (V,E) and a set L of simple paths on G, called lines. The main task is to place the lines on G, so that the number of crossings among pairs of lines is minimized.Our main contribution is two polynomial time algorithms. The first solves the general case of the MLCM problem, where the lines that traverse a particular vertex of G are allowed to use any side of it to either "enter" or "exit", assuming that the endpoints of the lines are located at vertices of degree one. The second one solves more efficiently the restricted case, where only the left and the right side of each vertex can be used.To the best of our knowledge, this is the first time where the general case of the MLCM problem is solved. Previous work was devoted to the restricted case of the MLCM problem under the additional assumption that the endpoints of the lines are either the topmost or the bottommost in their corresponding vertices, i.e., they are either on top or below the lines that pass through the vertex. Even for this case, we improve a known result of Asquith et al. from O(|E|5/2|L|3) to O(|V|(|E| + |L|)).
Region-Fault Tolerant Geometric Spanners
Authors: M. A. Abam, M. de Berg, M. Farshi, J. Gudmundsson
Venue: Discrete Computational Geometry (2009)

We introduce the concept of region-fault tolerant spanners for planar point sets and prove the existence of region-fault tolerant spanners of small size. For a geometric graph $\mathcal{G}$on a point set P and a region&#x00a0;F, we define $\mathcal{G}\ominus F$to be what remains of $\mathcal{G}$after the vertices and edges of $\mathcal{G}$intersecting&#x00a0;F have been removed. A&#x00a0; $\mathcal{C}$-fault tolerant t-spanner is a geometric graph&#x00a0; $\mathcal{G}$on&#x00a0;P such that for any convex region&#x00a0;F, the graph $\mathcal{G}\ominus F$is a t-spanner for $\mathcal{G}_{c}(P)\ominus F$, where $\mathcal{G}_{c}(P)$is the complete geometric graph on P. We prove that any set&#x00a0;P of n points admits a $\mathcal{C}$-fault tolerant (1+&#x03b5;)-spanner of size $\mathcal{O}(n\log n)$for any constant &#x03b5;>0; if adding Steiner points is allowed, then the size of the spanner reduces to&#x00a0; $\mathcal{O}(n)$, and for several special cases, we show how to obtain region-fault tolerant spanners of $\mathcal{O}(n)$size without using Steiner points. We also consider fault-tolerant geodesic t -spanners: this is a variant where, for any disk&#x00a0;D, the distance in $\mathcal{G}\ominus D$between any two points u,v&#x2208;P&#x2216;D is at most&#x00a0;t times the geodesic distance between u and v in &#x211d;2&#x2216;D. We prove that for any&#x00a0;P, we can add $\mathcal{O}(n)$Steiner points to obtain a fault-tolerant geodesic (1+&#x03b5;)-spanner of size&#x00a0; $\mathcal{O}(n)$.
On types of growth for graph-different permutations
Authors: János Körner, Gábor Simonyi, Blerina Sinaimeri
Venue: Journal of Combinatorial Theory Series A (2009)

We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ somewhere in a pair of adjacent vertices of G and determine it completely in an interesting special case. We give estimates for other cases and compare the results in case of complementary graphs. We also explore the close relationship between our problem and the concept of Shannon capacity ''within a given type.''
A LP-based neighborhood search for general integer programs
Authors: Qun Gu, Xinhui Zhang, S. Narayanan
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper presents a methodology to generate diverse solutions for linear programming relaxation and its application to solve integer programs using a neighborhood search. The algorithm generates multiple linear programming solutions of maximal difference and uses them as targets for a neighborhood search to locate high-quality integer solutions. The multiple diverse solutions provide a good coverage of the solution landscape and the neighborhood search reduces the computational effort in searching for good integer solutions. The algorithm is seeded into a genetic algorithm on benchmark knapsack problem and the results have shown that the algorithm is computationally effective, providing high-quality solutions at faster convergence rates than state-of-the-art commercial integer program solvers.
Uniform fuzzy relations and fuzzy functions
Authors: Miroslav Ćirić, Jelena Ignjatović, Stojan Bogdanović
Venue: Fuzzy Sets and Systems (2009)

In this paper we introduce and study the concepts of a uniform fuzzy relation and a (partially) uniform F-function. We give various characterizations and constructions of uniform fuzzy relations and uniform F-functions, we show that the usual composition of fuzzy relations is not convenient for F-functions, so we introduce another kind of composition, and we establish a mutual correspondence between uniform F-functions and fuzzy equivalences. We also give some applications of uniform fuzzy relations in approximate reasoning, especially in fuzzy control, and we show that uniform fuzzy relations are closely related to the defuzzification problem.
Power Optimization of Parallel Multipliers in Systems with Variable Word-Length
Authors: Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Lars Lundheim, Asghar Havashki
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)

Parallel multipliers can be optimized using the intrinsic arithmetic equivalencies in their reduction-tree. In this paper, we propose a method to reduce the dynamic power consumption in parallel multipliers, operating within systems with effective word-length variation. Word-length variation induces a certain pattern of spatiotemporal correlations. The proposed method is capable to take such correlations into account resulting better solutions. The experimental results show about 16-21% reduction in the average number of transitions compared to random parallel multipliers.
Reference governor for constrained systems with time-varying references
Authors: Kiminao Kogiso, Kenji Hirata
Venue: Robotics and Autonomous Systems (2009)

This paper proposes constructing a reference governor for constrained linear systems with time-varying references. The main feature of the constructed reference governor is to simultaneously consider fulfillment of state and control constraints, as well as tracking performance by appropriately managing the reference to be inputted. To achieve constraint fulfillment and to evaluate tracking performance, the reference management is reduced into a convex quadratic programming problem using the concept of a maximal output admissible set. The reference governor is finally obtained in the form of a piecewise affine function of state and reference variables by means of a multi-parametric programming technique. In addition, the effectiveness of the reference governor is demonstrated by numerical and experimental examples of a practical DC position servomechanism with the control constraint.