ppxscal/embedding_network huggingface dataset:
Fourth-Order Runge---Kutta Schemes for Fluid Mechanics Applications
Authors: M. H. Carpenter, C. A. Kennedy, Hester Bijl, S. A. Viken, Veer N. Vatsa
Venue: Journal of Scientific Computing (2005)

Multiple high-order time-integration schemes are used to solve stiff test problems related to the Navier---Stokes (NS) equations. The primary objective is to determine whether high-order schemes can displace currently used second-order schemes on stiff NS and Reynolds averaged NS (RANS) problems, for a meaningful portion of the work-precision spectrum. Implicit---Explicit (IMEX) schemes are used on separable problems that naturally partition into stiff and nonstiff components. Non-separable problems are solved with fully implicit schemes, oftentimes the implicit portion of an IMEX scheme. The convection---diffusion-reaction (CDR) equations allow a term by term stiff/nonstiff partition that is often well suited for IMEX methods. Major variables in CDR converge at near design-order rates with all formulations, including the fourth-order IMEX additive Runge---Kutta (ARK2) schemes that are susceptible to order reduction. The semi-implicit backward differentiation formulae and IMEX ARK2 schemes are of comparable efficiency. Laminar and turbulent aerodynamic applications require fully implicit schemes, as they are not profitably partitioned. All schemes achieve design-order convergence rates on the laminar problem. The fourth-order explicit singly diagonally implicit Runge---Kutta (ESDIRK4) scheme is more efficient than the popular second-order backward differentiation formulae (BDF2) method. The BDF2 and fourth-order modified extended backward differentiation formulae (MEBDF4) schemes are of comparable efficiency on the turbulent problem. High precision requirements slightly favor the MEBDF4 scheme (greater than three significant digits). Significant order reduction plagues the ESDIRK4 scheme in the turbulent case. The magnitude of the order reduction varies with Reynolds number. Poor performance of the high-order methods can partially be attributed to poor solver performance. Huge time steps allowed by high-order formulations challenge the capabilities of algebraic solver technology.
Auditory bias of visual attention for perceptually-guided selective rendering of animations
Authors: Georgia Mastoropoulou, Kurt Debattista, Alan Chalmers, Tom Troscianko
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

The developers and users of real-time graphics, such as games and virtual reality, are demanding ever more realistic computer generated images. Despite the availability of modern graphics hardware, such real-time high fidelity graphics is still not feasible on a single PC. Research on visual perception has shown that the perceived quality of rendered graphics depends not only on the fidelity of the generated imagery but also on the characteristics of visual attention and the limitations of the human visual system. The findings of this research have been used to define perceptually driven criteria for rendering with the aim to reduce rendering times. Furthermore, in reality there are strong crossmodal interactions between auditory and visual stimuli, with a number of studies showing that stimuli reaching the various senses are not, in general, processed independently. In this paper we investigate whether auditory stimuli, and more specifically sound effects with abrupt onsets, affect a viewer's perceived quality of rendered images while watching computer generated animations. In fact, we show how we can potentially accelerate the rendering of animations by directing the viewer's attention towards the source of a sound and selectively render at high quality only the sound emitting object. For this purpose a renderer was implemented which selectively renders the sound emitting objects and the surrounding pixels to high quality while the rest of the scene is rendered at a significantly lower quality. A psychophysical experiment with 120 participants was run which revealed a significant effect of sound effects on the perceived rendering quality. Our results show that audio stimuli, and in particular sound effects, can be exploited when rendering animations, to significantly reduce rendering time without any loss in the user's perception of delivered quality.
TiGeR, the Transmeta Instruction GEneratoR: A Production Based, Pseudo Random Instruction x86 Test Generator
Authors: Anshuman S. Nadkarni, Tom Kenville
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

Real world software applications, in addition to carefully crafted test cases, are often used in microprocessor and system verification as they exercise the interaction of many different functional blocks in the processor. In the case of dynamic binary translation based microprocessors like Efficeon and Crusoe, they also exercise the Code Morphing Software (CMS), the firmware layer that provides x86 compatibility. However this approach has limitations in that it is exceedingly difficult to identify, isolate, reproduce and debug failures and no single application may exercise most of the architectural corner cases of the CPU. Hence we have developed an x86 random instruction generator that generates code that has the characteristics of typical 32 bit protected mode programs. The instruction generator is highly configurable and deterministic, and has been successfully used in the verification of the Efficeon line of processors through all its phases of development and productization. The instruction generator is production based, in the sense that it generates code based on a set of rules called productions.
Fast inference and learning in large-state-space HMMs
Authors: Sajid M. Siddiqi, Andrew W. Moore
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optimal state sequence for the observations, and learning the model parameters, all have quadratic time complexity in the number of states. We introduce a novel class of non-sparse Markov transition matrices called Dense-Mostly-Constant (DMC) transition matrices that allow us to derive new algorithms for solving the basic HMM problems in sub-quadratic time. We describe the DMC HMM model and algorithms and attempt to convey some intuition for their usage. Empirical results for these algorithms show dramatic speedups for all three problems. In terms of accuracy, the DMC model yields strong results and outperforms the baseline algorithms even in domains known to violate the DMC assumption.
Using Generalized Estimating Equation to Learn Decision Tree with Multivariate Responses
Authors: Seong Keon Lee, Hyun-Cheol Kang, Sang-Tae Han, Kwang-Hwan Kim
Venue: Data Mining and Knowledge Discovery (2005)

Previous decision tree algorithms have used Mahalanobis distance for multiple continuous longitudinal response or generalized entropy index for multiple binary responses. However, these methods are limited to either continuous or binary responses. In this paper, we suggest a new tree-based method that can analyze any type of multiple responses by using a statistical approach, called GEE (generalized estimating equations). The value of this new technique is demonstrated with reference to an application using web-usage survey.
Software implemented fault tolerance through data error recovery
Authors: Goutam Kumar Saha
Venue: Ubiquity (2005)

This paper examines how a new software-implemented data error recovery scheme can be so effective in comparison to conventional Error Correction Codes (ECC) during the execution time of an application. The proposed algorithm is three times faster than the conventional software-implemented ECC and application program designers can easily implement the proposed scheme because of its simplicity while designing their fault tolerant applications at no extra hardware cost. The proposed software-implemented scheme for execution-time data-error detection and correction relies on threefold replication of application data set as a basis for fault tolerance.
Modeling the ice-age climate
Authors: W. Lawrence Gates
Venue: ACM SIGSIM Simulation Digest (1976)

The last great (Wisconsin) ice age has long held the interest of climatologists, geologists, and geographers as the best documented of the several ice ages of the last million years. Although local glaciation maximums varied by several thousand years, the time 18,000 B.P. (years before present) is globally representative of this event. The changes of flora and fauna that accompanied this ice age are recorded in an extensive paleoclimatic literature, and are supplemented by widespread evidence of changes in the physical character of the earth's surface, such as changes in sea level, sea-ice extent, and local orography. From these and other evidence, estimates of the local nature of the ice-age climate itself have been derived at selected sites in terms of such variables as the local wind, temperature, or rainfall. Although they are insufficient to portray the overall global climatic regime, these estimates indicate that the ice-age climate was substantially different from today's in many regions of the world.
Generating Annotated Behavior Models from End-User Scenarios
Authors: Christophe Damas Bernard Lambeau Pierre Dupont Axel van Lamsweerde
Venue: IEEE Transactions on Software Engineering (2005)

Requirements-related scenarios capture typical examples of system behaviors through sequences of desired interactions between the software-to-be and its environment. Their concrete, narrative style of expression makes them very effective for eliciting software requirements and for validating behavior models. However, scenarios raise coverage problems as they only capture partial histories of interaction among system component instances. Moreover, they often leave the actual requirements implicit. Numerous efforts have therefore been made recently to synthesize requirements or behavior models inductively from scenarios. Two problems arise from those efforts. On the one hand, the scenarios must be complemented with additional input such as state assertions along episodes or flowcharts on such episodes. This makes such techniques difficult to use by the nonexpert end-users who provide the scenarios. On the other hand, the generated state machines may be hard to understand as their nodes generally convey no domain-specific properties. Their validation by analysts, complementary to model checking and animation by tools, may therefore be quite difficult. This paper describes tool-supported techniques that overcome those two problems. Our tool generates a labeled transition system (LTS) for each system component from simple forms of message sequence charts (MSC) taken as examples or counterexamples of desired behavior. No additional input is required. A global LTS for the entire system is synthesized first. This LTS covers all scenario examples and excludes all counterexamples. It is inductively generated through an interactive procedure that extends known learning techniques for grammar induction. The procedure is incremental on training examples. It interactively produces additional scenarios that the end-user has to classify as examples or counterexamples of desired behavior. The LTS synthesis procedure may thus also be used independently for requirements elicitation through scenario questions generated by the tool. The synthesized system LTS is then projected on local LTS for each system component. For model validation by analysts, the tool generates state invariants that decorate the nodes of the local LTS.
FreeRank: implementing independent ranking service for multiplayer online games
Authors: Li Tang, Jun Li, Jin Zhou, Zhizhi Zhou, Hao Wang, Kai Li
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

Ranking is necessary for multiplayer online games to provide players with self-complacence and reference for choosing game counterparts. Most existing ranking solutions are tightly coupled with game applications of client-server architectures. In this paper, a novel scheme named FreeRank is proposed as a ranking service independent to specific architecture and detailed implementation of each individual game application. Based on a certificate-based framework and a reputation-based score-computing algorithm. FreeRank resolves the challenge of cheating prevention. Preliminary analysis and simulation results show that FreeRank is feasible and effective.
Presence/Absence: The 2005 ACM Multimedia Interactive Art Exhibition
Authors: Andrew Senior, Alejandro Jaimes, Wolfgang Muench
Venue: IEEE MultiMedia (2006)

The authors present highlights from the Interactive Art Exhibition at ACM Multimedia's 2005 conference.
Secure Continuity for Sensor Networks
Authors: Arjan Durresi, Vijay Bulusu, Vamsi Paruchuri, Leonard Barolli
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Addition of new nodes to a Sensor Network is a fundamental requirement for their continuity operation over time. We analyze the weakening of security due to node capture when adding sensor nodes using key predistribution schemes with "fixed" key pools. We have also developed an approach, which provides a significant improvement in security after multiple deployments through the use of multiple key pools, strong nodes and actors. These strong nodes are used as bridges between nodes of various deployments. To achieve better connectivity we use nodes of varying capabilities with the connectivity being a function of the quality of nodes available. We also explore the role that can be played by actors in enhancing connectivity.
Review of "Mathematical Modeling of Biological Systems, by Harvey J. Gold", John Wiley & Sons
Venue: ACM SIGSIM Simulation Digest (1979)

This book describes the process by which biologists can capture the properties of biological systems within the framework of mathematical structures. Even though it is mathematical in nature, the author places no strong mathematical demands upon the reader. This volume should be of interest to those who are developing models and conducting simulations in the biomedical field as well as in basic biology. The author draws primarily from biology in the development of the mathematical models in the book. 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
Cluster Computing and Grid 2005 Works in Progress
Authors: Mark Baker, Aamir Shafi, Bryan Carpenter, Sylvia C. Wong, Victor Tan, Weijian Fang, Simon Miles, Luc Moreau
Venue: IEEE Distributed Systems Online (2005)

This is the second in a two-part series of works-in-progress articles taken from a special session, which was part of the Cluster Computing and Grid 2005 conference, held in Cardiff, UK. The session was organized by Mark Baker (University of Portsmouth, UK) and Daniel S. Katz (Jet Propulsion Laboratory, US). For more information, you can contact the session organizers or the authors of the articles.
Proving Graph Un-Colorability with a Consistency Check of CSP
Authors: Jean-Nicolas Bes, Philippe Jegou
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper, we approach a derivation of the fifth challenge presented on IJCAI 1997 [4], that is to detect inconsistency by means of incomplete methods. Whereas this problem is of considerable interest, no significant contribution have emerged since 1997. In order to treat this matter, we review [3] that showed how to detect unsatisfiableCSP instances by coloring a graph. We observe that this approach doesn't seem to offer the expected prospects. Anyway, we exploit a similar process that permits to prove graph uncolorability by a CSP consistency check.
An Intelligent Event Adaptation Mechanism for Business Performance Monitoring
Authors: Shiwa S. Fu, Trieu C. Chieu, Jih-Shyr Yih, Santhosh Kumaran
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Business performance monitoring is to observe, analyze, and possibly control the execution of business operations. Often in the information technology implementation environment, dynamic events are generated to indicate the states of the business processes. These isolated and heterogeneous low-level events create needs for adaptation and standardization, before the events can be handled by a central mediation engine, which filters, sorts and correlates events into key performance indicators relating to business goals. In this paper, we propose an intelligent event adaptation mechanism for capturing, analyzing, enriching and transforming applicationdependent IT-level events into a standard event format called the Common Base Event1. The resulting event adapter can capture and process low-level events and forward only business related events to the central mediation engine. We select the SAP system as a reference application, and illustrate the configuration issues between the application and its adapter. The architecture and functionality of the proposed event adaptation mechanism are explained with practical industry problems and scenarios.
Computer decision-support systems for public argumentation: assessing deliberative legitimacy
Authors: William Rehg, Peter McBurney, Simon Parsons
Venue: AI Society (2005)

Recent proposals for computer-assisted argumentation have drawn on dialectical models of argumentation. When used to assist public policy planning, such systems also raise questions of political legitimacy. Drawing on deliberative democratic theory, we elaborate normative criteria for deliberative legitimacy and illustrate their use for assessing two argumentation systems. Full assessment of such systems requires experiments in which system designers draw on expertise from the social sciences and enter into the policy deliberation itself at the level of participants.
An Agent-based Framework for Integrating Workflows and Web Services
Authors: Cecile Aberg, Patrick Lambrix, Nahid Shahmehri
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The Semantic Web will enable business-to-business in new ways. In this context, organizations will need to make use of the new opportunities that the Semantic Web technology provides. However, this should be done without major requirements on the organization. To this aim we propose an agent-based model for integrating the usage of the Semantic Web (represented as Web services) into an organization's work routines (represented by Workflows). Further, we describe a possible architecture for our approach, and briefly show its feasibility with an implemented prototype.
The situation is this ....
Authors: Robert S. Ellinger
Venue: ACM SIGSIM Simulation Digest (1980)

One normally accepted taxonomy classifies simulations into continuous, discrete, and hybrid. But this taxonomy fails to note a significant division of simulations, particularly for the purposes of instruction and personnel training. Most business and research simulations--and many instructional simulations--are of the <u>laboratory</u> type (see figure 1). The simulation operator sets up the operating conditions--i.e. the values of the independent variables and parameters that define the initial state--then allows the computer model to run. This model is usually a set of mathematical functions that are sequenced by an algorithm and may contain one or more stochastic variables. This is the type of simulation subdivided in the taxonomy.
Firms and inter-organizational collaborations to create internet demand in emerging markets: the case of mexico
Authors: Karen Marie Coppock
Venue:  (2005)

Firms are collaborating with a wide array of entities&mdash;other firms, non-profit organizations, governments, and universities&mdash;to create Internet demand in emerging markets. These collaborations have both commercial (i.e.&mdash;develop new technology) as well as societal (i.e.&mdash;improve education) objectives. This dissertation explores the factors that contribute to the success of these market creation inter-organizational collaborations (IOCs). It addresses three main problems: disconnect between IOC practice and theory, lack of academic guidance for firms attempting to create new markets via IOCs, and the high failure rates of IOCs. Resources are critical to sustaining and successfully implementing market creation IOCs. This thesis argues that four main factors determine the amount of resources devoted to an IOC. The first factor is partner choice, or the number of collaborators that participate in an IOC. Participation by two or more collaborators with the most critical resource&mdash;commonly funds&mdash;increases its overall resource pool and the likelihood of its sustainability. The second factor is organizational priorities. Alignment between an IOUs stated objectives and the organizational priorities of the collaborating parties is required for positive resource allocation decisions. The third factor is intra- and inter-organizational ties. Strong ties are required to ensure that an IOUs stated objectives are continually re-aligned with shifting organizational priorities and resources continually allocated. The final factor is IOC monitoring, control and evaluation. An IOC must be systematically monitored, controlled and evaluated to definitively ascertain its social and commercial impacts and justify continued resource allocations. The data supporting these conclusions were generated from in-depth interviews with over 70 public and private sector leaders in Mexico and from thousands of pages of archival documents. Two steps were taken in this inductive, theory building study. First, a taxonomy was developed, which classified the IOCs based on the number and type of barriers) to Internet usage they were designed to overcome. From this taxonomy, three case studies were selected and used to construct a conceptual model of IOC performance and a series of interrelated, testable research propositions.
Platform Relative Sensor Abstractions across Mobile Robots Using Computer Vision and Sensor Integration
Authors: Robert Smith, Glenn Smith, Aster Wardhani
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Uniform sensor management and abstraction across different robot platforms is a difficult task due to the sheer diversity of sensing devices. However, because these sensors can be grouped into categories that in essence provide the same information, we can capture their similarities and create abstractions. An example would be distance data measured by an assortment of range sensors, or alternatively extracted from a camera using image processing. This paper describes how using software components it is possible to uniformly construct high-level abstractions of sensor information across various robots in a way to support the portability of common code that uses these abstractions (e.g. obstacle avoidance, wall following). We demonstrate our abstractions on a number of robots using different configurations of range sensors and cameras.