ppxscal/embedding_network huggingface dataset:
Assessing the Economic Attractiveness of Coronary Artery Revascularization in Chronic Kidney Disease Patients
Authors: Eric L. Eisenstein, Jie L. Sun, Kevin J. Anstrom, Elizabeth R. Delong, Lynda A. Szczech, Daniel B. Mark
Venue: Journal of Medical Systems (2009)

Chronic kidney disease (CKD) is associated with increased morbidity and mortality in coronary artery disease (CAD) patients. We compared the economic attractiveness of CAD revascularization procedures in patients with and without CKD. Our population included 6218 patients with significant CAD undergoing cardiac catheterization at Duke University between 1996 and 2001, with follow-up through 2002. We investigated the influence of CKD (creatinine clearance < 60 mL/min) upon 3-year survival and medical costs in our CAD population. Coronary artery bypass graft (CABG) surgery was an economically attractive alternative vs. percutaneous coronary intervention (PCI) or medical therapy for all patients with left main disease, three-vessel CAD patients without CKD, and two-vessel CAD patients with CKD. Medical therapy was an economically attractive strategy vs. CABG surgery or PCI for three-vessel CAD patients with CKD, two-vessel CAD patients without CKD, and all single-vessel CAD patients.
UniFAFF: a unified framework for implementing autonomic fault management and failure detection for self-managing networks
Authors: Ranganai Chaparadza
Venue: International Journal of Network Management (2009)

Today's network management, as known within the Fault, Configuration, Accounting, Performance, Security (FCAPS) management framework, is moving towards the definition and implementation of 'self-managing' network functions, with the aim of eliminating or drastically reducing human intervention in some of the complex aspects or daunting tasks of network management. The fault management plane of the FCAPS framework deals with the following functions: fault detection, fault diagnosis, localization or isolation, and fault removal. Task automation is at the very heart of self-managing (autonomic) nodes and networks, meaning that all functions and processes related to fault management must be automated as much as possible within the functionalities of self-managing (autonomic) nodes and networks, in order for us to talk about autonomic fault management. At this point in time there are projects calling for implementing new network architectures that are flexible to support on-demand functional composition for context- or situation-aware networking. A number of such projects have started, under the umbrella of the so-called clean-slate network designs. Therefore, this calls for open frameworks for implementing self-managing (autonomic) functions across each of the traditional FCAPS management planes. This paper presents a unified framework for implementing autonomic fault management and failure detection for self-managing networks, a framework we are calling UniFAFF.
Local Cardiac Wall Motion Estimation from Retrospectively Gated CT Images
Authors: Jochen Peters, Olivier Ecabert, Holger Schmitt, Michael Grass, Jürgen Weese
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

The heart is a dynamic organ and important characteristics about its function can be derived from 4D (3D + time) data. In this paper we present an approach for the automatic local tracking of the cardiac surfaces with sub-voxel accuracy in time series of computed tomography image volumes. First, a multi-compartment mesh is adapted to a single reconstructed image. This adapted mesh is then propagated through the whole time series. Chamber volumes and local surface motion can be estimated at arbitrary time points. Experiments on 15 time series indicate that the system is very precise and robust with respect to the selection of the start phase of the propagation. The results can be used, e.g., for dyssynchronity assessment or comparison with electromechanical models of the full heart.
Sycophant: a context based generalized user modeling framework for desktop applications
Authors: Sushil J. Louis
Venue:  (2008)

While current desktop applications provide input for an application's information processing by monitoring peripheral activity (keyboard, mouse, internal clock), these applications do not access external information from a user's environment to better adapt their behavior towards individual users. To address this lack of personalization, I design Sycophant , my context-aware user modeling framework. Sycophant leverages user-related information from a desktop's environment, user-context, to learn a user's preferences for different application actions. Results from four real-world user studies show that Sycophant can successfully predict a user-preferred action for a media player and a calendar. In the first pilot study, Sycophant establishes the feasibility of a context based approach to predict user-preferred calendar alarm types. The second study with Google Calendar further extends this alarm type personalization for multiple participants thereby validating my framework's generalizability across participants. Consistent with the second study's results, findings from the third study confirm that Sycophant successfully predicts a participant's preference for Winamp, a media player. Sycophant's Winamp personalization validates the generalizability of my framework across multiple applications. The fourth study examines and verifies Sycophant's user-preferred calendar alarm type prediction accuracy over long-term application use. In addition to highlighting Sycophant's generalizability across participants and applications, these user studies also show that removing user-context features significantly degrades the action prediction accuracy of various machine learning algorithms. This performance degradation emphasizes the need for context based approaches to personalize desktop applications and improve human-computer interaction.
Dual-Mode Execution Environment for active network
Authors: Tzu-Chi Huang, Ce-Kuen Shieh, Yu-Ben Miao
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

In active networks, the Execution Environment in an active node executes user codes to tailor the processing of packets to application needs. However, the existing implementation of a software-based active node has a dilemma of only using the user mode Execution Environment or, alternatively, only using the kernel mode Execution Environment because neither mode of the Execution Environments meets application needs. The dilemma stems from the choice between high overheads of a user mode Execution Environment and poor services of a kernel mode Execution Environment in executing user codes. In this paper, we propose the Dual-Mode Execution Environment to overcome this dilemma, i.e. arguing for the necessity of an Execution Environment that supports dual modes. Currently, we develop and make the Lifetime-Sensitive Quantity-based Policy the workload adjustment policy in the Dual-Mode Execution Environment. We implement the prototype in Windows 2000. We conduct experiments to compare the prototype with active nodes that uses either the user mode Execution Environment or the kernel mode Execution Environment. We prove that the prototype meets application needs and outperforms the compared active nodes.
Social network semantics for agent communication
Authors: Guido Boella, Joris Hulstijn, Leendert van der Torre
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper we introduce a semantics for agent communication languages based on social networks, providing us with a principled way to define and reason about their dynamics. As an instance we consider dependence networks, where the social relations represent that an agent depends on another agent to achieve its intentions. We suggest how FIPA semantics can be reconstructed in this social semantics. Our approach reveals that we need special semantics for relations like ownership, authority or fear: all kinds of interesting social relations, not previously studied by multiagent systems.
The systems analysis approach to mechanosensory coding
Authors: Andrew S. French
Venue: Biological Cybernetics (2009)

An important problem in neuroscience is to obtain quantitative knowledge of how information is represented, or encoded, in the signals that nerve cells process and transmit. Sensory receptors have provided important models for the study of neural coding because their inputs can often be relatively easily controlled and measured, while the resultant activity is recorded. A variety of engineering concepts have been successfully applied to physiological sciences, particularly those related to control of dynamic systems. Linear systems analysis was one of the earliest methods used to probe sensory coding, and measurements such as step responses and frequency responses have become standard tools for describing sensory functions. Modern systems analysis has evolved to provide accurate and efficient linear identification of encoding in sensory receptors that use either graded potentials or action potentials. It has also led to nonlinear systems analysis, the creation of parametric nonlinear models, and measures of information coding by sensory neurons. These methods promise to provide important new knowledge about sensory systems in the future, especially when complemented with parallel biophysical and molecular studies of sensory neurons. Mechanoreceptors provided some of the earliest preparations for the investigation of neural coding, and both the linear and nonlinear properties of wide variety of vertebrate and invertebrate mechanoreceptors continue to be explored.
Efficient memory management for hardware accelerated Java Virtual Machines
Authors: Peter Bertels, Wim Heirman, Erik D'Hollander, Dirk Stroobandt
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2009)

Application-specific hardware accelerators can significantly improve a system's performance. In a Java-based system, we then have to consider a hybrid architecture that consists of a Java Virtual Machine running on a general-purpose processor connected to the hardware accelerator. In such a hybrid architecture, data communication between the accelerator and the general-purpose processor can incur a significant cost, which may even annihilate the original performance improvement of adding the accelerator. A careful layout of the data in the memory structure is therefore of major importance to maintain the acceleration performance benefits. This article addresses the reduction of the communication cost in a distributed shared memory consisting of the main memory of the processor and the accelerator's local memory, which are unified in the Java heap. Since memory access times are highly nonuniform, a suitable allocation of objects in either main memory or the accelerator's local memory can significantly reduce the communication cost. We propose several techniques for finding the optimal location for each Java object's data, either statically through profiling or dynamically at runtime. We show how we can reduce communication cost by up to 86&percnt; for the SPECjvm and DaCapo benchmarks. We also show that the best strategy is application dependent and also depends on the relative cost of remote versus local accesses. For a relative cost higher than 10, a self-learning dynamic approach often results in the best performance.
Recovering haptic performance by relaxing passivity requirements
Authors: Paul G. Griffiths, R. Brent Gillespie
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Several causes of instabilities in the interaction of users with actively controlled haptic devices, notably sampling effects, sensor quantization, and hardware nonlinearities, have been identified and analyzed in prior work. However, certain instabilities may occur that cannot be attributed to these hardware limitations. The problem becomes acute when rendering passive virtual environments which require compensation of the intrinsic device dynamics. We show that passivity, the standard robust stability criteria for haptic interface systems, cannot be maintained in certain circumstances due to Bode gain-phase integral constraints. In an experimental study, we demonstrate that some performance can be recovered by relaxing passivity requirements while maintaining coupled stability. To test stability, we identify frequency domain models of the user interaction, and check the Nyquist stability criterion rather than passivity.
Integration of UML modeling and policy-driven management of Web service systems
Authors: Basem Suleiman, Vladimir Tosic
Venue: Proceedings of the 2009 ICSE Workshop on Principles of Engineering Service Oriented Systems (2009)

We address the problems that Web service management policies are not defined during Web service design and that management information collected during run-time is not directly annotated on designs to guide their improvements. We present novel mechanisms for: (1) generation of WS-Policy4MASC policies (for run-time Web service management) from the corresponding UML profiles, (2) feedback of information monitored during run-time by MASC middleware into another set of UML diagram annotations. The latter annotations show which design elements have not performed well in technical or financial metrics and service designers can use this information for design analysis and re-engineering decisions. We validated our mechanisms on prototypes using Eclipse UML tools and XSLT processing, applied to a stock trading Web service composition example.
WayTracer: A mobile assistant for real-time logging of events and related positions
Authors: Gregory Kuhnmünch, Gerhard Strube
Venue: Computers in Human Behavior (2009)

In addition to logging observation categories and their timestamps, researchers sometimes wish to record observation-related positions. Such data are relevant for research in human spatial cognition, market research and behavioral biology, to mention only a few. Another desideratum is to avoid time-consuming video transcriptions by logging in real-time, both inside and outside the lab. With frequent events, these requirements cannot be met in combination by a single experimenter using paper and pencil. Thus, we developed the logging software WayTracer. It allows for logging positions by hand where and when observations or events occur independently of external signals like GPS. GPS data is added automatically in case they are provided by a receiver. We report an extensive test that confirmed the feasibility of logging in real-time with WayTracer in field-use. Trained observers yielded high percentages of inter-observer agreement and temporal intervals of behaviors they had recorded in the field correlated above 0.99 with data extracted from the video recording of the test. Besides introducing a new software optimized and tested successfully for such performance, we report requirements and limitations of logging in real-time to be considered when configuring other software for that purpose.
Bounds for Maximin Latin Hypercube Designs
Authors: Edwin R. van Dam, Gijs Rennen, Bart Husslage
Venue: Operations Research (2009)

Latin hypercube designs (LHDs) play an important role when approximating computer simulation models. To obtain good space-filling properties, the maximin criterion is frequently used. Unfortunately, constructing maximin LHDs can be quite time consuming when the number of dimensions and design points increase. In these cases, we can use heuristical maximin LHDs. In this paper, we construct bounds for the separation distance of certain classes of maximin LHDs. These bounds are useful for assessing the quality of heuristical maximin LHDs. Until now only upper bounds are known for the separation distance of certain classes of unrestricted maximin designs, i.e., for maximin designs without a Latin hypercube structure. The separation distance of maximin LHDs also satisfies these “unrestricted” bounds. By using some of the special properties of LHDs, we are able to find new and tighter bounds for maximin LHDs. Within the different methods used to determine the upper bounds, a variety of combinatorial optimization techniques are employed. Mixed-integer programming, the traveling salesman problem, and the graph-covering problem are among the formulations used to obtain the bounds. Besides these bounds, also a construction method is described for generating LHDs that meet Baer's bound for the ℓ∞ distance measure for certain values of n.
QoS Is Still an Issue, Congestion Pricing Is not the Solution
Authors: Jim Roberts
Venue: Proceedings of the 6th International Workshop on Internet Charging and Qos Technologies: Network Economics for Next Generation Networks (2009)

A network clearly needs to be designed to meet user performance requirements for a wide variety of applications. In a commercial setting, Return on Investment (RoI) must be covered by the price users pay for the services provided by the network. It matters whether the investment is just in an amount of commodity infrastructure or also in complex value-added services justifying a higher profit margin. Quality-of-Service (QoS) is often seen as the basis for such added value. We discuss the issue of RoI and consider the complementary role of pricing as a QoS mechanism. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analysis of the Broadband Internet Penetration in South Korea: Drivers and Challenges
Authors: Joon Koh, Seonjin Shin, Kiyong Om, Inhak Kim
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

On broadband access to the Internet, Korea is a worldwide leading country in the OECD area. Recently, Korea has moved from DSL to Fiber-to-the home (FTTH) and Fiber-to-the-building (FTTB) subscriptions for the advanced high-speed internet connections. In this paper we provide a brief description of the Korean high-speed Internet market, then analyses key factors influencing the explosive growth in subscribers for the high-speed Internet service in terms of supportive government policy, competition between broadband suppliers, attractive applications and unique Korean culture, and finally try to touch future challenges for the effective use of the superb IT infrastructure. This analysis is expected to give valuable implications not only to Korean policy-makers but also to other countries making an effort to promote the deployment rate of the high-speed Internet service.
Development of an optimal trajectory model for spray painting on a free surface
Authors: X. D. Diao, S. X. Zeng, Vivian W. Y. Tam
Venue: Computers and Industrial Engineering (2009)

Generally, trajectory planning problems are often formulated as constrained variational problems. This paper develops an optimal trajectory model to optimize the trajectory planning on a free surface to achieve uniform deposition over painted surface and reduce wastage of coating materials. Numerical solution techniques consider geometric characteristics on a free surface, rate of film accumulation, and position and orientation of spray guns in uniformity coating and painting duration. Given a specified spatial path and functions of film accumulation rates for an infinite range model and a beta distribution model, some results are obtained by using nonlinear programming techniques based difference quasi-Newton method over cone surfaces. It provides objective functions that can be used to minimize the thickness variation of the paint spraying of a specified spatial path. These results also give an evaluation along the average velocity trajectory and the optimal trajectory to demonstrate the feasibility of the proposed methods. The formulated optimization methods can be applied to solve the same class of nonlinear planning problems.
Improving the resiliency of Ariadne
Authors: Kulasekaran A. Sivakumar, Mahalingam Ramkumar
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Ariadne is a popular secure ad hoc routing protocol based on the dynamic source routing (DSR) protocol. While Ariadne was designed to be capable of detecting attacks by non colluding attackers, it does not include measures to identify or narrow down perpetrators responsible for such attacks. We propose some modifications to Ariadne to improve its resiliency, by affording the ability to identify and route around malicious nodes.
Recent progress in moving cognitive radio and services to deployment
Authors: Preston F. Marshall
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Ongoing research and experimentation activities have rapidly created confidence in the ability to transition from conventional radios to those introducing initial functionality proposed for Dynamic Spectrum Access and Cognitive Radio. Additionally, work on networking concepts, such as Delay Tolerant Networking and Disruption Tolerant Networks provide service architectures appropriate to dynamic and self-reliant edge networks. These technologies make it possible to consider wireless networks that are much more robust, scalable, and self-reliant than was conceived of in the past. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Geometric constraint systems with applications in cad and biology
Authors: Ileana Streinu
Venue:  (2008)

Motivated by applications in Computer Aided Design (CAD) and biology, we investigate geometric constraint systems, composed of atomic elements with constraints between them. A well-studied model in rigidity theory is the bar-and-joint structure, where the atomic elements are universal joints connected by fixed-length bar constraints. We propose several new models involving constraints arising in CAD and biology and provide the theoretical foundation for each. In particular, we present a model addressing the pairwise constraints among points, lines and planes found in constraint-based CAD software, such as in the assembly environment of the widely-used SolidWorks CAD application.As a result, we identify and generalize combinatorial properties that appear as necessary conditions for generic rigidity of these new constraint systems; in some cases, the conditions are also sufficient, thus providing a complete characterization. We study sparsity for graphs, arising from known rigidity results and present extensions of this concept to graded, mixed and nested sparsity. For these sparsity properties, we present algorithms that solve the fundamental questions of Decision, Extraction and Components, based on the efficient and elegant pebble games first developed for planar bar-and-joint rigidity.
Information Systems Development in the Age of Multimedia Web Systems
Authors: Benkt Wangler, Alexander Backlund
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

This paper discusses the effects that the increasing use of Internet, web technology and multimedia in information systems, and the computer games industry will have on information systems work. The paper concludes that the look and feel aspect of information systems is becoming ever more important and that we will see an increasing involvement of people with artistic skills in information systems development. We should also be prepared to adjust our educational programs accordingly.