ppxscal/embedding_network huggingface dataset:
The heart as a self-regulating system: integration of homeodynamic mechanisms
Authors: J. Yasha Kresh, J. Andrew Armour
Venue: Technology and Health Care (1997)

In the past the study of mechanical and electrical properties of the heart has been disjointed with minimal overlap and unification. The fact remains that these features are tightly coupled and central to the functioning heart. The maintenance of adequate cardiac output relies upon the highly integrated autoregulatory mechanisms and modulation of cardiac myocyte function. Regional ventricular mechanics and energetics are dependent upon muscle fiber stress-strain rate, the passive properties of myocardial collagen matrix, adequate vascular perfusion, transcapillary transport and electrical activation pattern. Intramural hydraulic &ldquo;loading&rdquo; is regulated by coronary arterial and venous dynamics. All of these components are under the constant influence of intrinsic cardiac and extracardiac autonomic neurons, as well as circulating hormones. A brief overview of the putative regulation of these various components is presented in this paper.
Raisin: Redundancy Analysis Algorithm Simulation
Authors: Rei-Fu Huang, Jin-Fu Li, Jen-Chieh Yeh, Cheng-Wen Wu
Venue: IEEE Design Test (2007)

Embedded memories are among the most widely used cores in current SoC designs. Memory cores usually dominate the area and yield of the system chip, requiring repair methodologies to make a profitable product. To increase the efficiency of redundancy repair, and thus final yield, the authors propose Raisin (Redundancy Analysis Algorithm Simulation). The Raisin tool calculates the repair rate and yield (after repair) of the given redundancy analysis (RA) algorithm and the associated memory configuration and redundancy structure. With Raisin, users can easily assess and plan redundant (spare) elements, and subsequently develop the built-in redundancy analysis (BIRA) algorithms and circuits that are essential to built-in self-repair of embedded memories. To make the verification of the BISR design easier, Raisin also generates its testbench. Another important feature is that given a RAM test algorithm, Raisin simulates the real sequence of the faults detected, improving the accuracy of the analysis results. Experimental results show that Raisin can improve repair rates in redundancy structures by as much as 10% without increasing area overhead. Raisin has been used in industry cases, including embedded SRAM and flash memory circuits.
A Loosely Coupled Distributed System for Reliably Storing Data
Authors: A. J. Bernstein
Venue: IEEE Transactions on Software Engineering (1985)

An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure.
Foreword
Authors: V. D. Gligor
Venue: IEEE Transactions on Software Engineering (1985)

THE concepts of system reliability-generally defined as the ability of a system to meet its interface specifications-and of system availability-generally defined as the ability of a system to meet its interface specifications within a specified time limit-predate not only that of distributed computing but also that of the electronic computer itself. With the advent of the electronic computer and its ever increasing penetration of technological, social, and political developments, reliability and availability gained additional recognition as disciplines of serious intellectual challenge. Much of the development of new reliability techniques can be linked directly to the computer hardware developments of the last three decades. However, until relatively recently, the concept of software reliability did not receive significant attention and, when it did, it was rather narrowly focused on approaches to prevent failures; i.e., on software development and verification methodologies, and on languages and tools.
Ptgas---genetic algorithms evolving noncoding segments by means of promoter/terminator sequences
Authors: Helmut A. Mayer
Venue: Evolutionary Computation (1998)

In this article we present work on chromosome structures for genetic algorithms (GAs) based on biological principles. Mainly, the influence of noncoding segments on GA behavior and performance is investigated. We compare representations with noncoding sequences at predefined, fixed locations with “junk” code induced by the use of promoter/terminator sequences (ptGAs) that define start and end of a coding sequence, respectively. AS one of the advantages of noncoding segments a few researchers have identified the reduction of the disruptive effects of crossover, and we solidify this argument by a formal analysis of crossover disruption probabilities for noncoding segments at fixed locations. The additional use of promoter/terminator sequences not only enables evolution of parameter values, but also allows for adaptation of number, size, and location of genes (problem parameters) on an artificial chromosome. Randomly generated chromosomes of fixed length carry different numbers of promoter/terminator sequences resulting in genes of varying size and location. Evolution of these ptGA chromosomes drives the number of parameters and their values to (sub)optimal solutions. Moreover, the formation of tightly linked building blocks is enhanced by self-organization of gene locations. We also introduce a new, nondisruptive crossover operator emerging from the ptGA gene structure with adaptive crossover rate, location, and number of crossover sites. For experimental comparisons of this genetic operator to conventional crossover in GAs, as well as properties of different ptGA chromosome structures, an artificial problem from the literature is utilized. Finally, the potential of ptGA is demonstrated on an NP-complete combinatorial optimization problem.
Weighted skeletons and fixed-share decomposition
Authors: Franz Aurenhammer
Venue: Computational Geometry: Theory and Applications (2008)

We introduce the concept of weighted skeleton of a polygon and present various decomposition and optimality results for this skeletal structure when the underlying polygon is convex.
Quantifying process equivalence based on observed behavior
Authors: A. K. Alves de Medeiros, W. M. P. van der Aalst, A. J. M. M. Weijters
Venue: Data Knowledge Engineering (2008)

In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matching some desired service description, or to compare some normative process model with a process model discovered using process mining techniques. Although many researchers have worked on different notions of equivalence (e.g., trace equivalence, bisimulation, branching bisimulation, etc.), most of the existing notions are not very useful in this context. First of all, most equivalence notions result in a binary answer (i.e., two processes are equivalent or not). This is not very helpful because, in real-life applications, one needs to differentiate between slightly different models and completely different models. Second, not all parts of a process model are equally important. There may be parts of the process model that are rarely activated (i.e., ''process veins'') while other parts are executed for most process instances (i.e., the ''process arteries''). Clearly, differences in some veins of a process are less important than differences in the main arteries of a process. To address the problem, this paper proposes a completely new way of comparing process models. Rather than directly comparing two models, the process models are compared with respect to some typical behavior. This way, we are able to avoid the two problems just mentioned. The approach has been implemented and has been used in the context of genetic process mining. Although the results are presented in the context of Petri nets, the approach can be applied to any process modeling language with executable semantics.
Principles of Device-Independent Computer Graphics Software
Authors: J. R. Warner
Venue: IEEE Computer Graphics and Applications (1981)

A single graphics application program can generate similar images on different display devices by using device-independent software tools.
Realization of the algorithm for constructing solutions for a class of hierarchical Stackelberg games
Authors: S. I. Osipov
Venue: Automation and Remote Control (2007)

The algorithm for constructing solutions for a class of hierarchical dynamic two-person games in the Stackelberg formulation is stated. The algorithm performance is illustrated by the example of software implementation fulfilled for the nonlinear dynamic Stackelberg game that admits, however, the solution by the indicated algorithm with a little modification. The obtained results are compared with the analytic solution.
Design Methodology for 2.4GHz Dual-Core Microprocessor
Authors: Noriyuki Ito, Hiroaki Komatsu, Akira Kanuma, Akihiro Yoshitake, Yoshiyasu Tanamura, Hiroyuki Sugiyama, Ryoichi Yamashita, Ken-ichi Nabeya, Hironobu Yoshino, Hitoshi Yamanaka, Masahiro Yanagida, Yoshitomo Ozeki, Kinya Ishizaka, Takeshi Kono, Yutaka Isoda
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper presents a design methodology that was applied to the design of a 2.4GHz dual-core SPARC64¿ microprocessor with 90nm CMOS technology. It focuses on the newly adopted techniques, such as efficient data management in dual-core design, fast delay calculation of the noise-immune clock distribution circuit, enhanced signal integrity analysis of a large-scale custom macro design, and enhanced diagnosis capability using a logic BIST circuit.
P*TIME: highly scalable OLTP DBMS for managing update-intensive stream workload
Authors: Sang K. Cha, Changbin Song
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Over the past thirty years since the system R and Ingres projects started to lay the foundation for today's RDBMS implementations, the underlying hardware and software platforms have changed dramatically. However, the fundamental RDBMS architecture, especially, the storage engine architecture, largely remains unchanged. While this conventional architecture may suffices for satisfying most of today's applications, its deliverable performance range is far from meeting the so-called growing "real-time enterprise" demand of acquiring and querying high-volume update data streams cost-effectively. P*TIME is a new, memory-centric light-weight OLTP RDBMS designed and built from scratch to deliver orders of magnitude higher scalability on commodity SMP hardware than existing RDBMS implementations, not only in search but also in update performance. Its storage engine layer incorporates our previous innovations for exploiting engine-level microparallelism such as differential logging and optimistic latch-free index traversal concurrency control protocol. This paper presents the architecture and performance of P*TIME and reports our experience of deploying P*TIME as the stock market database server at one of the largest on-line brokerage firms.
Evaluation of the File Redundancy in Distributed Database Systems
Authors: S. Muro
Venue: IEEE Transactions on Software Engineering (1985)

This paper treats the file redundancy issue in distributed database systems, asking what is the optimal number of file copies, given the ratio r of the frequency of update requests to the frequency of all file access requests (i.e., queries and updates). Formulations of this type of problem, including optimal file allocation, have been attempted by a number of authors, and some algorithms have been proposed. Although such algorithms can be used to solve particular problems, it seems difficult to draw general conclusions applicable to a wide variety of practical distributed database systems. To probe into this hard to formulate but interesting problem, our paper constructs simplified network models of distributed database systems, and computes the optimal number of file copies, as well as their locations, to minimize the communication cost. For several network types, we plot the optimal number of file copies as a function of the ratio r.
Factors influencing impulse buying during an online purchase
Authors: Scott A. Jeffrey, Rebecca Hodge
Venue: Electronic Commerce Research (2007)

Using actual purchasing behavior by visitors to a High School Reunion web store, this study examines the factors that lead to an increased willingness by on-line consumers to purchase impulse items. Consistent with mental accounting and the psychophysics of prices, we find that people's purchase of the impulse item increases with the total amount spent on other items. We also find that linking a US $1 donation to the impulse item, thereby providing a reason to purchase, increases the frequency of the impulse purchase.
Standard Model Establishment of TCM Syndrome Differentiation of Type 2 Diabetes Based on Data-Mining
Authors: Jiansheng Li, Jianjing Shen, Caiqing Yue, Jinliang Hu
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper explores a method for establishing diagnostic criterion of TCM (traditional Chinese medicine) syndrome differentiation by studying the set-up of diagnostic standard model of syndrome differentiation of Type 2 diabetes. We present, based on dynamic Kohonen network, the artificial neural net (ANN), fuzzy system (FS) that were used to build up adaptive fuzzy inference system model. The system was tested for its reliability via fisher-iris determination. Then with the help of this model the clinical data was studied, simultaneously, according to TCM basic theories. We obtained the diagnostic criterion of commonly-seen syndrome of Type 2 diabetes, whose rationality was verified by data check-up.
An Improved Adaptive Genetic Algorithm for Job-Shop Scheduling Problem
Authors: Yingjie Xing, Zhentong Chen, Jing Sun, Long Hu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

An adaptive genetic algorithm with some improvement is proposed to solve the job-shop scheduling problem (JSSP) better. The improved adaptive genetic algorithm (IAGA) obtained by applying the improved sigmoid function to adaptive genetic algorithm. And in IAGA for JSSP, the fitness of algorithm is represented by completion time of jobs. Therefore, this algorithm making the crossover and mutation probability adjusted adaptively and nonlinearly with the completion time, can avoid such disadvantages as premature convergence, low convergence speed and low stability. Experimental results demonstrate that the proposed genetic algorithm does not get stuck at a local optimum easily, and it is fast in convergence, simple to be implemented. Several examples testify the effectiveness of the proposed genetic algorithm for JSSP.
Human-to-Human authorization for resource sharing in SHAD: Roles and protocols
Authors: Enrique Soriano, Francisco J. Ballesteros, Gorka Guardiola
Venue: Pervasive and Mobile Computing (2007)

One aim of pervasive computing is to allow users to share their resources so that they seem to be part of a single pervasive computer. This is just an illusion, the result of the synergy between different systems and resources. SHAD, introduced in PerCom 2007, is the first architecture that offers actual Single Sign-On to avoid authentication obtrusiveness and maintain the illusion of a single, pervasive computer. This paper describes how SHAD allows users to securely share their resources in a easy, natural, and intuitive way. It also describes its role-based Human-to-Human architecture, the threat model, and the protocols involved. Last but not the least, it presents results of further evaluation for our working implementation.
An online PPM prediction model for web prefetching
Authors: Zhijie Ban, Zhimin Gu, Yu Jin
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

Web prefetching is a primary means to reduce user access latency. An important amount of work can be found by the use of PPM (Prediction by Partial Match) for modeling and predicting user request patterns in the open literature. However, in general, existing PPM models are constructed off-line. It is highly desirable to perform the online update of the PPM model incrementally because user request patterns may change over time. We present an online PPM model to capture the changing patterns and fit the memory. This model is implemented based on a noncompact suffix tree. Our model only keeps the most recent W requests using a sliding window. To further improve the prefetching performance, we make use of maximum entropy principle to model for the outgoing probability distributions of nodes. Our prediction model combines entropy, prediction accuracy rate and the longest match rule. A performance evaluation is presented using real web logs. Trace-driven simulation results show our PPM prediction model can provide significant improvements over previously proposed models.
Hacker Curriculum: How Hackers Learn Networking
Authors: Sergey Bratus
Venue: IEEE Distributed Systems Online (2007)

This two-part article discusses the factors distinguishing the hacker culture from the IT industry and traditional academia, using networking examples. This first part describes the starting points of the hackers' approach to layered computer systems.
"Brands that Touch" and anthropology of consumption: towards an understanding of how to design pleasurable products
Authors: Vera Damazio, Júlia Lima, Bianca Dal Bianco, Cristiane de Menezes, Guilherme Meyer
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This article focuses on "Brands that touch", or people's relationship with brands that incorporate meaningful experiences and evoke positive feelings. It views brands as synonymous with their products. It views, also, the act of choosing and using a product as a process of symbolic exchange and intends to bridge the fields of "Design & Emotion" and Anthropology of Consumption. Therefore, it presents some reflections based on personal stories about "brands that touch" gathered from interviews and conversations with people from different walks of life and on classic writings on theory of Anthropology of Consumption and some of the pioneering authors in the field such as Mary Douglas, L&eacute;vi-Strauss, among others. This article's central idea is that if we are to design pleasurable products, we must listen to users and understand the essence and content of a brand that touches them.
Privacy in Location-Aware Computing Environments
Authors: Denise Anthony, Tristan Henderson, David Kotz
Venue: IEEE Pervasive Computing (2007)

As location-aware and pervasive computing technologies become more prevalent, privacy concerns are becoming increasingly more important. User preferences about location privacy may depend on place, not only in terms of their physical location but also in terms of their social context: how they define where they are, what they are doing, and whom they are with at the time. Using the experience sampling method, the authors explored the privacy preferences of 25 users during one week. They found that participants were more willing to share location information when at home or alone than when at other locations or with friends. Most participants were consistent in their location privacy preferences across requester categories and regardless of place. Some participants, however, varied in their willingness to share location information depending on where they were, who they were with, and who was requesting the information. Those participants tended to be more concerned about privacy in general. These findings are useful for designing future privacy policies and user interfaces for pervasive computing. This article is part of a special issue on security and privacy.
An Out-of-Core Scheme for Simplification of Point-Sampled Models
Authors: Baocai Yin, Xiaohui Du, Dehui Kong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Most of the exiting point-based simplification methods can't cope with models that are too large to fit in main memory. We present an out-of-core scheme for simplifying large point-sampled models. Firstly, we obtain an initial simplified model using uniform clustering. Then we decimate the redundant details in the flat regions in the condition of keeping the maximum error less than the upper error limit. Finally the same number of details are used to refine the uneven regions. In order to preserve the boundaries of point-sampled models, we design an efficient scheme without using connectivity information. Experiment results show that our simplification method can simplify large models with high quality and low memory usage.
Generalized exponential distribution: Bayesian estimations
Authors: Debasis Kundu, Rameshwar D. Gupta
Venue: Computational Statistics Data Analysis (2008)

Recently two-parameter generalized exponential distribution has been introduced by the authors. In this paper we consider the Bayes estimators of the unknown parameters under the assumptions of gamma priors on both the shape and scale parameters. The Bayes estimators cannot be obtained in explicit forms. Approximate Bayes estimators are computed using the idea of Lindley. We also propose Gibbs sampling procedure to generate samples from the posterior distributions and in turn computing the Bayes estimators. The approximate Bayes estimators obtained under the assumptions of non-informative priors, are compared with the maximum likelihood estimators using Monte Carlo simulations. One real data set has been analyzed for illustrative purposes.
Calibration Accuracy Evaluation with Stereo Reconstruction
Authors: Songxiang Gu, Joseph E. McNamara, Karen Johnson, Michael A. Gennert, Michael A. King
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

During SPECT imaging, a patient must remain motionless for 20 minutes or more. Without compensation, patient motion can compromise diagnostic accuracy. As the first step in compensation, we propose stereo-optical tracking of retro-reflective spheres attached to stretchy bands wrapped about the patients to estimate patient motion. Camera calibration is a crucial step in stereo-imaging, which ultimately determines the accuracy of tracking. The two leading methods of camera calibration are: 1) phantom-based calibration, and 2) grid board-based calibration. They both use the Tsai camera model, but use different input data and methods of calculation. Thus, the two methods will show different sensitivities to system modeling and input data inaccuracies. We evaluated the relationship between inaccuracies using two error measures. The first was the Residual error or the difference between the input center location of spheres in the 2D optical images and the centers estimated using the calibration parameters. The second was stereo error or the difference between the input 3D location of the center of spheres in the calibration phantom and the centers estimated by stereo imaging. We observed that the grid board-based calibration is more stable, and that for both methods the stereo error increases with distance away from the center of the measurement volume.