ppxscal/embedding_network huggingface dataset:
Using Markov Models to Assess the Performance of a Health and Community Care System
Authors: Sally McClean, Malcolm Faddy, Peter Millard
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Markov chain modelling, in particular phase type modelling, has been previously used for hospital and community care systems, where we describe hospital care as a series of phases, such as acute, rehabilitation, or long-stay and likewise social care in the community may be modelled using phases such as dependent, convalescent, or nursing home. Such an approach allows us to adopt a holistic systems approach to health and community care modelling and management rather than focusing on the improvement of part of the system to the possible detriment of other components. We here extend this approach by showing how the general Markov framework can be exploited to extract various metrics of interest. In particular, we derive formulae for the mean and variance of the number of spells spent by a patient in hospital and in the community, and the expected total length of time in hospital and in community care, subsequent to first admission. Results are obtained for geriatric patients who have been admitted to hospital care. Finally we discuss how covariates, particularly time dependent covariates such as age, can be incorporated into the analysis.
Real-time Hand Pose Recognition Using Low-Resolution Depth Images
Authors: Zhenyao Mo, Ulrich Neumann
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Gesture recognition methods based on intensity or color images often suffer from low efficiency and lack of robustness. In this paper, we employ a new laser-based camera that produces reliable low-resolution depth images at video rates. By decomposing and recognizing hand poses as finger states (finger poses and finger inter-relations), we achieve robust hand pose recognition in real-time (30 frames/second).
Newsvendor problem with pricing: properties, algorithms, and simulation
Authors: Roger L. Zhan, Zuo-Jun Max Shen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

When a newsvendor faces stochastic price-sensitive demands, he/she has to make the pricing and inventory decisions before the demand is realized. In the literature, this problem is typically solved by reducing it to an optimization problem over a single variable. In contrast, we treat this problem as a nonlinear system of two variables and provide some solution properties (e.g. existence, uniqueness) of the system. We also develop an iterative algorithm and a simulation based algorithm for this problem.
PROTERAN: animated terrain evolution for visual analysis of patterns in protein folding trajectory
Authors: Ruhong Zhou, Laxmi Parida, Kush Kapila, Sudhir Mudur
Venue: Bioinformatics (2007)

Summary: The mechanism of protein folding remains largely a mystery in molecular biology, despite the enormous effort from many groups in the past decades. Currently, the protein folding mechanism is often characterized by calculating the free energy landscape versus various reaction coordinates such as the fraction of native contacts, the radius of gyration and so on. In this paper, we present an integrated approach towards understanding the folding process via visual analysis of patterns of these reaction coordinates. The three disparate processes (1) protein folding simulation, (2) pattern elicitation and (3) visualization of patterns, work in tandem. Thus as the protein folds, the changing landscape in the pattern space can be viewed via the visualization tool, PROTERAN, a program we developed for this purpose. We first present an incremental (on-line) trie-based pattern discovery algorithm to elicit the patterns and then describe the terrain metaphor based visualization tool. Using two example small proteins, a β-hairpin and a designed protein Trp-cage, we next demonstrate that this combined pattern discovery and visualization approach extracts crucial information about protein folding intermediates and mechanism. Contact: ruhongz@us.ibm.com Supplementary information: http://www.research.ibm.com/people/r/ruhong/SI.htm
Assurance Technologies for Signal Control System by Optical LAN
Authors: Hiroyuki Sugahara, Takashi Kunifuji, Tetsunori Hattori, Yoshiyuki Hirano, Yamato Fukuta, Masayuki Matsumoto
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

When an interlocking device is improved, a large number of signal cables have to be re-laid and wiring connections must be confirmed. There are possibilities of wiring errors in the improvement of the interlocking device. A signal control system using an optical LAN is developed for the purpose of reduction of signal cables and wiring work. This system controls signal devices by transmitting digital information through an optical network, and it has a method of system configuration to make the system more flexible and secure. To introduce this system effectively, an application of assurance technologies is necessary because this system coexists with the existent interlocking device over the period of construction and operation. In this paper, we introduce this system and describe assurance technologies used for this system.
A relaxed cutting plane method for semi-infinite semi-definite programming
Authors: S. J. Li, S. Y. Wu, X. Q. Yang, K. L. Teo
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, we develop two discretization algorithms with a cutting plane scheme for solving combined semi-infinite and semi-definite programming problems, i.e., a general algorithm when the parameter set is a compact set and a typical algorithm when the parameter set is a box set in the m-dimensional space. We prove that the accumulation point of the sequence points generated by the two algorithms is an optimal solution of the combined semi-infinite and semi-definite programming problem under suitable assumption conditions. Two examples are given to illustrate the effectiveness of the typical algorithm.
Comparative study of 802.11 DCF and its modification in the presence of noise
Authors: Andrey Lyakhov, Vladimir Vishnevsky
Venue: Wireless Networks (2005)

IEEE 802.11 specifies a technology for wireless local area networks (LANs) and mobile networking. In this paper, we present an analytical method of estimating the saturation throughput of a 802.11 wireless LAN in the presence of noise, which distorts transmitted frames. With the Distributed Coordination Function (DCF) being the fundamental access mechanism in the IEEE 802.11 MAC protocol, sequential attempts to transfer by every station are separated by backoff intervals. Besides the standard backoff rule of the DCF, according to which the mean backoff interval is doubled after each failure in order to avoid collisions, we propose and study a modification of the backoff rule. This modification relies on the optional 802.11 tools to recognize a reason of a failure (collision or noise-induced distortion) and does not increase the mean backoff interval if a failure happens due to distortion by noise. In addition to the throughput, our method allows estimating a probability of a packet rejection occurring when the number of packet transmission retries attains its limit. The obtained numerical results of investigating 802.11 LANs by the developed method are validated by simulation and show high estimation accuracy for any values of protocol parameters and bit error rates. We adopt this method to tune the protocol parameters and to compare the proposed modification with the standard backoff rule.
Scalable Pixel-based Visual Interfaces: Challenges and Solutions
Authors: Mike Sips, Jorn Schneidewind, Daniel A. Keim, Heidrun Schumann
Venue: Proceedings of the conference on Information Visualization (2006)

The information revolution is creating and publishing vast data sets, such as records of business transactions, environmental statistics and census demographics. In many application domains, this data is collected and indexed by geo-spatial location. The discovery of interesting patterns in such databases through visual analytics is a key to turn this data into valuable information. Challenges arise because newly available geo-spatial data sets often have millions of records, or even far more, they are from multiple and heterogeneous data sources, and the output devices have significantly changed, e.g. high-resolution pixilated displays are increasingly available in both wall-sized and desktop units . New techniques are needed to cope with this scale. In this paper we focus on ways to increase the scalability of pixel-based visual interfaces by adding task on hands scenarios that tightly integrate the data analyst into the exploration of geo-spatial data sets.
Convergence of IPsec in presence of resets
Authors: Chin-Tser Huang, Mohamed G. Gouda, E. N. Elnozahy
Venue: Journal of High Speed Networks (2006)

IPsec is the current security standard for the Internet Protocol IP. According to this standard, a selected computer pair (p, q) in the Internet can be designated a "security association". This designation guarantees that all sent IP messages whose original source is computer p and whose ultimate destination is computer q cannot be replayed in the future (by an adversary between p and q) and still be received by computer q as fresh messages from p. This guarantee is provided by adding increasing sequence numbers to all IP messages sent from p to q. Thus, p needs to always remember the sequence number of the last sent message, and q needs to always remember the sequence number of the last received message. Unfortunately, when computer p or q is reset these sequence numbers can be forgotten, and this leads to two bad possibilities: unbounded number of fresh messages from p can be discarded by q, and unbounded number of replayed messages can be accepted by q. In this paper, we propose two operations, "SAVE" and "FETCH", to prevent these possibilities. The SAVE operation can be used to store the last sent sequence number in persistent memory of p once every Kp sent messages, and can be used to store the last received sequence number in persistent memory of q once every Kq received messages. The FETCH operation can be used to fetch the last stored sequence number for a computer when that computer wakes up after a reset. We show that the following three conditions hold when SAVE and FETCH are adopted in both p and q. First, when p is reset, at most 2Kp sequence numbers will be lost but no fresh message sent from p to q will be discarded if no message reorder occurs. Second, when q is reset, the number of discarded fresh messages is bounded by 2Kq. In either case, no replayed message will be accepted by q.
Minimum implicational basis for ∧-semidistributive lattices
Authors: Philippe Janssen, Lhouari Nourine
Venue: Information Processing Letters (2006)

For a ∧-semidistributive lattice L, we study some particular implicational systems and show that the cardinality of a minimum implicational basis is polynomial in the size of join-irreducible elements of the lattice L. We also provide a polynomial time algorithm to compute a minimum implicational basis for L.
WCET-Centric Software-controlled Instruction Caches for Hard Real-Time Systems
Authors: Isabelle Puaut
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems because of their dynamic and adaptive behavior, and thus need special attention to be used in hard real-time systems. A lot of progress has been achieved in the last ten years to statically predict worst-case execution times (WCETs) of tasks on architectures with caches. However, cache-aware WCET analysis techniques are not always applicable due to the lack of documentation of hardware manuals concerning the cache replacement policies. Moreover, they tend to be pessimistic with some cache replacement policies (e.g. random replacement policies) [6]. Lastly, caches are sources of timing anomalies in dynamically scheduled processors [13] (a cache miss may in some cases result in a shorter execution time than a hit). To reconciliate performance and predictability of caches, we propose in this paper algorithms for software control of instruction caches. The proposed algorithms statically divide the code of tasks into regions, for which the cache contents is statically selected. At run-time, at every transition between regions, the cache contents computed off-line is loaded into the cache and the cache replacement policy is disabled (the cache is locked). Experimental results provided in the paper show that with an appropriate selection of regions and cache contents, the worst-case performance of applications with locked instruction caches is competitive with the worst-case performance of unlocked caches.
Creative codings: investigating cultural, personal, and epistemological connections in media arts programming
Authors: Kylie A. Peppler, Yasmin B. Kafai
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The focus of this poster is to turn our attention to the arts as an understudied area in the learning sciences and examine how studying the learning of arts and programming can open new avenues of research. Results from a case study analysis suggest that appropriation builds on multiple connections: cultural connections such as referencing popular iconography, personal connections such as including family pictures, and larger epistemological connections to larger bodies of knowledge.
Inter-granular magneto-resistance of a Fe3O4/CrO2 system with inversely polarized conduction electrons
Authors: Y. Kimishima, T. Sasaki, M. Uehara, Y. Satoh, M. Matsuo
Venue: Microelectronic Engineering (2005)

Magneto-resistance ratios (MRR) were measured for (Fe"3O"4)"1"-"x(CrO"2)"x granular junctions between 77K and 300K, where x is the volume ratio of CrO"2 in the measured samples. Since the spin polarization coefficient P of conduction electrons is -1 in Fe"3O"4 and 1 in CrO"2, these junctions are expected to show inverse tunneling magneto-resistance (TMR) effects. In 0.4=
An ontology based approach to the integration of entity-relationship schemas
Authors: Qi He, Tok Wang Ling
Venue: Data Knowledge Engineering (2006)

In schema integration, schematic discrepancies occur when data in one database correspond to metadata in another. We explicitly declare the context that is the meta information relating to the source, classification, property etc. of entities, relationships or attribute values in entity-relationship (ER) schemas. We present algorithms to resolve schematic discrepancies by transforming metadata into the attribute values of entity types, keeping the information and constraints of original schemas. Although focusing on the resolution of schematic discrepancies, our technique works seamlessly with the existing techniques resolving other semantic heterogeneities in schema integration.
Strong normalization proofs by CPS-translations
Authors: Satoshi Ikeda, Koji Nakazawa
Venue: Information Processing Letters (2006)

This paper proposes a new proof method for strong normalization of classical natural deduction and calculi with control operators. For this purpose, we introduce a new CPS-translation, continuation and garbage passing style (CGPS) translation. We show that this CGPS-translation method gives simple proofs of strong normalization of λµ→∧∨⊥, which is introduced in [P. de Groote, Strong normalization of classical natural deduction with disjunction, in: S. Abramsky (Ed.), Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, in: Lecture Notes in Comput. Sci., vol. 2044, Springer, Berlin, 2001, pp. 182-196] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions.
A Framework for Feature Selection for Background Subtraction
Authors: Toufiq Parag, Ahmed Elgammal, Anurag Mittal
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Background subtraction is a widely used paradigm to detect moving objects in video taken from a static camera and is used for various important applications such as video surveillance, human motion analysis, etc. Various statistical approaches have been proposed for modeling a given scene background. However, there is no theoretical framework for choosing which features to use to model different regions of the scene background. In this paper we introduce a novel framework for feature selection for background modeling and subtraction. A boosting algorithm, namely RealBoost, is used to choose the best combination of features at each pixel. Given the probability estimates from a pool of features calculated by Kernel Density Estimate (KDE) over a certain time period, the algorithm selects the most useful ones to discriminate foreground objects from the scene background. The results show that the proposed framework successfully selects appropriate features for different parts of the image.
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis
Authors: Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Computing aggregates such as average, minimum, maximum and sum is fundamental to various primitive functions of a sensor network, such as system monitoring, data querying, and collaborative information processing. In this paper, we present and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates. Our Distributed Random Grouping (DRG) algorithm is simple and natural and uses probabilistic grouping to progressively converge to the aggregate value. DRG is local and randomized and is naturally robust against dynamic topology changes from link/node failures. Although our algorithm is natural and simple, it is nontrivial to show that it converges to the correct aggregate value and to bound the time needed for convergence. Our analysis uses the eigenstructure of the underlying graph in a novel way to show convergence and to bound the running time of our algorithms. We also present simulation results of our algorithm and compare its performance to various other known distributed algorithms. Simulations show that DRG needs far fewer transmissions than other distributed localized schemes.
Customer on the Move: Strategic Implications of Mobile Banking for Banks and Financial Enterprises
Authors: Rajnish Tiwari, Stephan Buse, Cornelius Herstatt
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The increased need/wish for mobility amongst various sections of the society, particularly amongst professionally active groups, is confronting credit institutions and other enterprises offering financial services, with challenges to adjust their service portfolio in a way to best suit the needs of their customers. On the other hand it also opens up a new arena of opportunities by making it possible to offer innovative, value-added services by actively inducing demand for new, mobility-centric services. This paper examines strategic implications of changes in customer behavior as perceived by the banks. It introduces the findings of a bank survey conducted by the authors in Germany. The survey discovered that banks expect Mobile Banking to gain greater strategic relevance in near future and are positioning themselves not to be left behind.
A hybrid routing approach for opportunistic networks
Authors: Ling-Jyh Chen, Chen-Hung Yu, Tony Sun, Yung-Chih Chen, Hao-hua Chu
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

With wireless networking technologies extending into the fabrics of our working and operating environments, proper handling of intermittent wireless connectivity and network disruptions is of significance. As the sheer number of potential opportunistic application continues to surge (i.e. wireless sensor networks, underwater sensor networks, pocket switched networks, transportation networks, and etc.), the design for an effective routing scheme that considers and accommodates the various intricate behaviors observed in an opportunistic network is of interest and remained desirable. While previous solutions use either replication or coding techniques to address the challenges in opportunistic networks, the tradeoff of these two techniques only make them ideal under certain network scenarios. In this paper, we propose a hybrid scheme, named H-EC, to deal with a wide variety of opportunistic network cases. H-EC is designed to fully combine the robustness of erasure coding based routing techniques, while preserving the performance advantages of replication techniques. We evaluate H-EC against other similar strategies in terms of delivery ratio and latency, and find that H-EC offers robustness in worst-case delay performance cases while achieving good performance in small delay performance cases. We also discuss the traffic overhead issues associated with H-EC as compared to other schemes, and present several strategies that can potentially alleviate the traffic overhead of H-EC schemes.
Protein Structural Domain Assignment with a Delaunay Tessellation Derived Lattice
Authors: Todd J. Taylor, Iosif I. Vaisman
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

We describe a fully automated method of protein structural domain assignment using a Potts model which we call DePot (an abbreviation for Delaunay- Potts). It is a heavily modified version of a method described previously by WR Taylor. Each amino acid residue is represented as a site in an irregular lattice derived from the Delaunay tessellation of the protein structure. Domain membership is represented by a spin value and each site has a spin which can change under the influence of its neighbors. Spins are allowed to interact subject to an Ising ferromagnetic-like energy function until clusters of like spins emerge and these clusters define domains. DePot is simple and easy to implement and the assignments agree well with previously published methods.
Intelligent Neighborhood Exploration in Local Search Heuristics
Authors: Isabelle Devarenne, Hakim Mabed, Alexandre Caminada
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming evaluation, the total exploration of the neighborhood is impractical. In this paper, we present an adaptive exploration of neighborhood using extension and restriction mechanisms represented by a loop detection mechanism and a tabu list structure. This approach is applied to the K-coloring problem and evaluated on standard benchmarks like DIMACS in comparison with more powerful recently published algorithms.
NCAC: A Novel Chinese Address Clustering Algorithm
Authors: Jian-Xun Liu, Yi-Ping Wen, Jie Liu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

This paper proposes a novel Chinese customer address clustering algorithm by considering both the customers' postal code and the text clustering technique. Based on thousands of student hometown addresses in a university, an experiment is done and analyzed. The results show that the algorithm presents in this paper has the advantages of high effectiveness of computation and good clustering ability when comparing with the Standard K-means algorithm.