ppxscal/embedding_network huggingface dataset:
Medical Domain Ontology Construction Approach: A Basis for Medical Decision Support
Authors: Rim Djedidi, Marie-Aude Aufaure
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In this paper, we present an approach for building medical domain ontology as a foundation for knowledge-centric decision support. The knowledge acquisition phase is based on heterogeneous data sources including textual corpora, practice guidelines, databases, terminological sources as well as existing ontologies and medical Standards. Beyond a knowledge modelization process, we propose a meta-conceptualization and a formalization phase constituting a Medical Core-Ontology established at a high-level of abstraction and guiding the operationalization and exploitation phase. The operationalization process instantiates a referential medical domain ontology and integrates it into a knowledge-based system allowing knowledge reasoning and inference and thus, preparing the basis for a medical decision support.
A summative assessment strategy for a multi-institutional, multi-task project: the case of the manufacturing engineering education partnership
Authors: L. M. De Ramirez
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

In 1994, a unique partnership of universities Penn State, University of Washington and University of Puerto Rico at Mayaguez-in collaboration with Sandia National Laboratories, received funding from the ARPA Technology Reinvestment Program (TRP) to develop a new, practice-based curriculum and physical facilities for product realization and manufacturing. This initiative is named the Manufacturing Engineering Education Partnership and its overall outcome is the development at each participating institution of what we call The Learning Factory. This paper describes the project's summative assessment strategy being implemented project-wide that will allow interested parties to evaluate the project's performance and achievement of goals and objectives. It describes the project's four major tasks and deliverables, the assessment plan and its principal elements. It also presents the assessment schedule and the tools used for qualitative evaluation. The assessment scheme depicted in this paper could be used as a model for similar multi-institutional, multi-task projects.
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
Authors: Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn). All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.
Identifying software project risks in the canadian financial services sector: an international comparative study
Authors: Apiwan Born
Venue:  (2006)

Frequent occurrence of software project failures has created two general streams of research. One theme analyzed the common causes of cost overruns, late schedules, and unmet scope. With the belief that project failures are avoidable through proactive means, another group of researchers investigated software project risks. With such intent, comparative studies were conducted in Finland, Hong Kong, and the United States. Subsequent research in Nigeria determined the impact of the socioeconomic context. To further extend the coverage of prior studies, the research in the current study focused specifically on the Canadian financial services sector. Project managers were solicited for input to discover, determine, and rank risk factors in software projects using the same research design that was used in previous comparative research studies---a three-phase Delphi survey that uses nonparametric statistical techniques. In sharp contrast to prior studies, however, this research aimed not for general applications of the results at the country level but for specific collective relevance to software projects in banks, trust companies, insurance companies, mutual fund companies, and similar organizations. The composite rankings of the studies in Hong Kong, Finland, and the United States listed lack of management commitment, inability to get user commitment, and misunderstanding of the requirements as the top three risk items in software projects. Given that only the misunderstanding of requirements made it into the top three risk items in Nigeria, it would be of value to scholars and practitioners to determine how the results would differ if the study was conducted in a specific sector in the industry. Except for one risk factor (lack of dedicated, full-time project resources), this study confirmed that the previous list of risk factors captured the top risk factors in the Canadian financial services sector.
AQUA: An Amphibious Autonomous Robot
Authors: Gregory Dudek, Philippe Giguere, Chris Prahacs, Shane Saunderson, Junaed Sattar, Luz-Abril Torres-Mendez, Michael Jenkin, Andrew German, Andrew Hogue, Arlene Ripsman, Jim Zacher, Evangelos Milios, Hui Liu, Pifu Zhang, Marti Buehler, Christina Georgiades
Venue: Computer (2007)

AQUA, an amphibious robot that swims via the motion of its legs rather than using thrusters and control surfaces for propulsion,can walk along the shore, swim along the surface in open water, or walk on the bottom of the ocean. The vehicle uses a variety of sensorsto estimate its position with respect to local visual features and provide a global frame of reference.
The Ability-Motivation-Opportunity Framework for Behavior Research in IS
Authors: Jerald Hughes
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Some theoretical models used in IS research may lack explanatory power and consistency because of their failure to provide an adequate means of accounting for contextual and situational factors which influence behavior. The Ability - Motivation - Opportunity (AMO) framework addresses these problems for important new areas of IS research by theorizing two of the most critical factors, Ability and Opportunity, as moderating influences on the link between Motivation and Behavior. The AMO framework also clarifies the function and meaning of Motivation in theoretical models. In this paper, the origins and prior uses of the AMO framework are presented, its components and structure are explained, its place and purpose in the constellation of IS theories is discussed, theoretical and practical justifications for its use in IS behavioral research are presented, open theoretical issues and limitations regarding the AMO framework are identified, and recommendations for its operationalization in specific IS studies are offered.
Translucent windows in X
Authors: Keith Packard
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

The X Window System allows multiple windows to occupy the same coordinates on the screen. The core protocol defines which portions of each window are visible and which are occluded by overlapping windows, but the overlapping windows are always completely opaque. Various techniques can be used to simulate nonopaque windows in controlled environments. The Shape Extension can be used to make areas of the window transparent. A background of "None" can be used to inherit the contents of the screen in the region occupied by the window when it is first mapped. Where available, hardware overlays can be used which expose a transparent pixel value. None of these techniques can be used for translucency in a general way; hardware overlays and the Shape Extension can only provide transparency and cannot blend the pixel colors together. A background of "None" cannot be used when the occluding windows are to be reconfigured or when the occluded region contents are expected to change. The X Translucent Window Extension is described which solves the general translucency problem by assigning alpha values for pixels in occluding windows. These values are used to blend the occluding window contents with the occluded region for display. The details of managing translucent window hierarchies, reparenting translucent windows and X visual differences between blended pixels are discussed.
Balanced overlay networks (bon): decentralized load balancing and analysis of large-scale systems
Authors: Vwani P. Roychowdhury
Venue:  (2006)

We present a self-organizing distributed computing architecture that encodes the information about each node's available computational resources in the structure of the links connecting the nodes in the network. Each node's degree is kept proportional to its free resources by adding or deleting edges when node resources are freed or consumed. The result of this local edge rewiring algorithm is that short, O(logN), random walks preferentially sample nodes with high degree and thus high node resources. Different variations of this algorithm produce Erd&ouml;s-Renyi random graphs, nearly d-regular random graphs and random power-law graphs. What each variation has in common is that each node bears a load that is proportional to its resources, which is a useful load-balancing metric for any resource distribution. There have been prior studies on using random walks to distribute jobs, but BON distinguishes itself by continually reshaping the network structure to permit efficient node sampling using short random walks. Some of the most recent distributed computing systems have been based on distributed hash tables (DHTs). We have developed a tool called the reachable component method (RCM) to evaluate the scalability and performance of these types of systems. RCM is a generally-applicable technique for predicting structured DHT routing performance in the presence of random failures. Here we apply this method to seven popular DHT architectures and find that some systems are scalable under random failures and some are not. DHT routing algorithms that continue to function under a non-zero rate of random failures as N &rarr; &infin; are scalable. Unscalable DHT algorithms are unable to route at all for any non-zero node failure rate as N &rarr; &infin;. These predictions enable the effective planning and use of DHT systems to ensure a desired quality of service.
Mobility as an ICT enabler
Authors: R. M. Dennis
Venue: BT Technology Journal (2007)

This paper aims to explore the link between mobility, authentication, identity, entitlement and trust. Research into these generic enablers is consistent with the existing trend for convergence in its widest context, building from the converged connectivity aspects found in the next generation network common capability strategy. Awareness of when (and how) to successfully manipulate these links is not simply the cornerstone for becoming a successful ICT service provider but, more significantly, the ultimate differentiation for any service provision.
Unsteady Naval Hydrodynamic Computations Using Lagrangian Vorticity Methods
Authors: Stephen A. Huyer
Venue: Proceedings of the HPCMP Users Group Conference (2006)

A novel method to compute the 3-D unsteady hydrodynamics with application to undersea vehicles is presented. This approach solves the vorticity equation, which is derived from the momentum equation of the Navier-Stokes equations. Most problems of Navy interest involve incompressible flow, that may be described in terms of the vorticity alone. Specific geometries are represented using surface source and vortex panels whose strength is prescribed to satisfy the no-slip and no-flux boundary conditions. Vorticity is diffused from the vortex sheets onto the body surface to maintain a vorticity balance. Vorticity in the flow is specified at points and the vorticity at any other point in the field is obtained via linear interpolation. Interpolation is performed by constructing tetrahedra using Delaunay triangularization. Tetrahedra provide the control volume to integrate over to obtain the velocity and the connectivity of the control points provides a basis to construct derivatives. A sub-grid scale eddy viscosity model was implemented into the solution algorithm to model turbulent flow effects. This method was then validated for a sphere at Reynolds numbers of 1.14 million and unsteady flow development past a cone. Quality of the computed flows was compared with data obtained with experimental data. Lastly, unsteady propeller turbulent inflow computations were performed for the purpose of establishing boundary conditions for unsteady blade force computations.
Face poser: interactive modeling of 3D facial expressions using model priors
Authors: Manfred Lau, Jinxiang Chai, Ying-Qing Xu, Heung-Yeung Shum
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

In this paper, we present an intuitive interface for interactively posing 3D facial expressions. The user can create and edit facial expressions by drawing freeform strokes, or by directly dragging facial points in 2D screen space. Designing such an interface for face modeling and editing is challenging because many unnatural facial expressions might be consistent with the ambiguous user input. The system automatically learns a model prior from a prerecorded facial expression database and uses it to remove the ambiguity. We formulate the problem in a maximum a posteriori (MAP) framework by combining the prior with user-defined constraints. Maximizing the posterior allows us to generate an optimal and natural facial expression that satisfies the user-defined constraints. Our system is interactive; it is also simple and easy to use. A first-time user can learn to use the system and start creating a variety of natural face models within minutes. We evaluate the performance of our approach with cross validation tests, and by comparing with alternative techniques.
Finding a needle in a haystack: pinpointing significant BGP routing changes in an IP network
Authors: Jian Wu, Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

The performance of a backbone network is vulnerable to interdomain routing changes that affect how traffic travels to destinations in other Autonomous Systems (ASes). Despite having poor visibility into these routing changes, operators often need to react quickly by tuning the network configuration to alleviate congestion or by notifying other ASes about serious reachability problems. Fortunately, operators can improve their visibility by monitoring the Border Gateway Protocol (BGP) decisions of the routers at the periphery of their AS. However, the volume of measurement data is very large and extracting the important information is challenging. In this paper, we present the design and evaluation of an online system that converts millions of BGP update messages a day into a few dozen actionable reports about significant routing disruptions. We apply our tool to two months of BGP and traffic data collected from a Tier-1 ISP backbone and discover several network problems previously unknown to the operators. Validation using other data sources confirms the accuracy of our algorithms and the tool's additional value in detecting routing disruptions.
Runtime Analysis of a Self-Adaptive Hard Real-Time Robotic Control System
Authors: Jens Steiner, Matthias Hagner
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

This paper describes a software architecture for parallel kinematic machines and its evolvement to a self-adaptive system striving to optimize, protect and heal itself. Self-* properties are provided by selfmanager components that observe and manipulate their associated system parts. A development approach for the self-managers is outlined, as is a first realization of a self-manager responsible for the control core. This self-manager distributes control components during runtime and makes feasibility decisions based on a runtime schedulability analysis.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks
Authors: Thanh Hai Trinh, Hee Yong Youn
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Energy efficiency is an important factor in the design of wireless sensor networks. The sensor nodes around the sink node in the network forward the data received from all other nodes to the sink, and thus deplete their energy very quickly. In this paper we propose a scheme which adopts a mobile sink for target tracking applications to maximize the network lifetime. Using the sensed information the sink moves toward the target for reducing the communication cost. Computer simulation shows that the proposed scheme can significantly prolong the network lifetime compared to the earlier schemes where the sink node is fixed or randomly moved.
Artistic Pattern Generation by a Model of Territory Competing
Authors: Kokichi Sugihara
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

This paper presents a method for generating artistic patterns using the Voronoi diagram. In this method, we start with a few of seed points, generate new sites at random, and assign them to one of the seed points based on the Voronoi diagram of the sites. The resulting territory patterns are colored by choosing paths in a color space. The patterns generated by this method have been adopted for calendars and magazine covers.
Experiments With Configurable Locks for Multiprocessors
Authors: Bodhisattwa Mukherjee, Karsten Schwan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Operating system kernels typically offer a fixed set of mechanisms and primitves. However, the attainment high of performance for a variety parallel application requires the availability of reconfigurable and extensible operattng system kernel primitives. In this paper, we present an implementation of multiprocessor locks that can be reconfigured dynamically.
Keynote address
Authors: D. Terzopoulos
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents a geometric wrinkle model based on facial muscles for realistically and efficiently simulating wrinkles generated in facial expressions. Our method simulates wrinkles on an anatomy-based face model that mimics the layered structure of skin, muscles, and skull for facial animation. Corresponding to three types of facial muscles, a geometric model is developed to govern how the wrinkle amplitude evolves locally upon skin deformation. By taking into account the properties of real wrinkles, it provides intuitive parameters for easy control over wrinkle characteristics. During facial animation, wrinkles are generated in the local regions influenced by muscle contraction, simulating resistance to compression of tissues. In the simulation, an adaptive refinement automatically adapts the local resolution at which potential inaccuracies arc detected depending on local deformation. Thanks to its geometric nature, our method simulates wrinkles that can be dynamically rendered at interactive rates. 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
Harnessing machine learning to improve the success rate of stimuli generation
Authors: S. Fine, A. Freund, I. Jaeger, Y. Naveh, A. Ziv
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

The initial state of a design under verification has a major impact on the ability of stimuli generators to successfully generate the requested stimuli. For complexity reasons, most stimuli generators use sequential solutions without planning ahead. Therefore, in many cases they fail to produce consistent stimuli due to an inadequate selection of the initial state. We propose a method, based on machine learning techniques, to improve generation success by learning the relationship between the initial state vector and generation success. We applied the proposed method in two different settings, with the objective of improving generation success and coverage in processor and system level generation. In both settings, the proposed method significantly reduced generation failures and enabled faster coverage.
Virtual hierarchies to support server consolidation
Authors: Michael R. Marty, Mark D. Hill
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Server consolidation is becoming an increasingly popular technique to manage and utilize systems. This paper develops CMP memory systems for server consolidation where most sharing occurs within Virtual Machines (VMs). Our memory systems maximize shared memory accesses serviced within a VM, minimize interference among separate VMs, facilitate dynamic reassignment of VMs to processors and memory, and support content-based page sharing among VMs. We begin with a tiled architecture where each of 64 tiles contains a processor, private L1 caches, and an L2 bank. First, we reveal why single-level directory designs fail to meet workload consolidation goals. Second, we develop the paper's central idea of imposing a two-level virtual (or logical) coherence hierarchy on a physically flat CMP that harmonizes with VM assignment. Third, we show that the best of our two virtual hierarchy (VH) variants performs 12-58% better than the best alternative flat directory protocol when consolidating Apache, OLTP, and Zeus commel workloads on our simulated 64-core CMP.
BerkMin: A fast and robust Sat-solver
Authors: Eugene Goldberg, Yakov Novikov
Venue: Discrete Applied Mathematics (2007)

We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause ''aging''. At the same time BerkMin introduces a new decision-making procedure and a new method of clause database management. We experimentally compare BerkMin with Chaff, the leader among resolution-based SAT-solvers. Experiments show that our program is more robust than Chaff being able to solve more instances than Chaff in a reasonable amount of time.