ppxscal/embedding_network huggingface dataset:
Simulation of Free Surface by Surface Capturing Method
Authors: W. Y. Chang, L. C. Lee, H. C. Lien, R. J. Shih, W. F. Tsai, J. S. Lai, C. L. Yen
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

In the present study, a vertical, two-dimensional, two-phase flow model is developed, which is capable of simulating the fluid and air flow fields simultaneously to capture the positions of the free surface. To deal with the discontinuity properties in density field near the free surface, the TVD-MUSCL scheme is employed to overcome the numerical oscillation problem. The numerical algorithm is developed using a conservative, explicit, finite volume discretization of the motion equation. The dam-breaking problem is employed to validate the proposed model. The good agreements between the computed and measured results demonstrate the applicability of the model.
Incorporating Language Processing into Java Applications: A JavaCC Tutorial
Authors: Viswanathan Kodaganallur
Venue: IEEE Software (2004)

Application programs sometimes need to deal with input whose structure and meaning are dictated by complex formal rules. Although compilers, command processors, and database-query-language processors are prime examples of these applications, the need for such functionality often crops up in the context of other applications as well. Developing this functionality from scratch is complex and error-prone, and programmers rely on tools such as Lex and YACC. A good tool for such tasks in Java is the freely available Java Compiler Compiler. Extended Backus Naur Form is a universal notation for specifying the syntactic rules of formal languages and is a prerequisite to using such tools. This article introduces EBNF and illustrates how to use JavaCC.
Data-Aware Multicast
Authors: Sebastien Baehni, Patrick Th. Eugster, Rachid Guerraoui
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper presents a multicast algorithm for peer-to-peerdissemination of events in a distributed topic-basedpublish-subscribe system, where processes publish events ofcertain topics, organized in a hierarchy, and expect eventsof topics they subscribed to. Our algorithm is "data-aware"in the sense that it exploits information about process subscriptionsand topic inclusion relationships to build dynamicgroups of processes and efficiently manage the flow ofinformation within and between these process groups. This"data-awareness" helps limit the membership informationthat each process needs to maintain and preserves processesfrom receiving messages related to topics they have not subscribedto. It also provides the application with means tocontrol, for each topic in a hierarchy, the trade-off betweenthe message complexity and the reliability of event dissemination.We convey this trade-off through both analysis andsimulation.
Hardware/Software Co-testing of Embedded Memories in Complex SOCs
Authors: Bai Hong Fang, Qiang Xu, Nicola Nicolici
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

A novel approach for testing embedded memories in complexsystems-on-a-chip (SOCs) is presented. The proposedsolution aims to balance the usage of the existing on-chipresources and dedicated design for test (DFT) hardwaresuch that the functional power constraints are not exceededduring test while trading-off the testing time againstDFT area and performance overhead. The suitability ofsoftware-centric and hardware-centric approaches for embeddedmemory testing is examined and to combine the advantagesof both directions, a new built-in self-test (BIST)-basedmethod, called hardware/software co-testing, is introduced.The proposed solution is programmable, scalableand guarantees low routing overhead.
Hard vs. Soft: The Central Question of Pre-Fabricated Silicon
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

It is possible to foresee the day when prefabricated,programmable devices such as Field-ProgrammableGate Arrays (FPGAs) are used as the dominantsilicon implementation medium. This paper willexplore the forces that already drive in that directionand the architecture, CAD and circuit enhancementopportunities that may also help to make it happen.We will focus on the central question in FPGAarchitecture: what hard, dedicated circuit structuresshould be included on the FPGA? These structuresare contrasted with the regular soft fabric, which canalways be used to implement logic functions, butwith less efficiency and performance. We willdiscuss the trade-offs involved, and the requirementsfor CAD tools and algorithms needed to supportthese hard structures. An interesting specific casethat will be addressed is whether processors shouldbe implemented in hard or soft form. Finally we willlook an alternative: enhancing the capability of thesoft fabric itself.
A numerical study of non-linear dynamics in a tank for aerospace applications
Authors: Edoardo Bucchignani
Venue: Applied Numerical Mathematics (2004)

A two-dimensional rectangular open tank, filled with an inviscid incompressible fluid, is forced to oscillate harmonically along the horizontal direction. The fluid movement has been simulated by means of a numerical code based on the Laplace equation, coupled with non-linear boundary conditions. The governing equation has been discretized using a finite volume technique on a grid updated at each time step. High accuracy is ensured. The hydrodynamic forces acting on the walls of the tank have also been evaluated. Numerical results are presented for different values of the external excitation frequency.
Expertise community detection
Authors: Raymond D'Amore
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Providing knowledge workers with access to experts and communities-of-practice is central to sharing expertise and crucial to organizational performance, adaptation, and even survival. This paper covers ongoing research to develop an Expert Locator prototype, a model-based system for detecting experts and broader communities-of-practice. The underlying expertise model is extensible and supports aggregation of evidence across diverse sources. The prototype is being used to locate critical expertise in key project areas, and current evaluation indicates its potential effectiveness.
An intelligent multi-display terminal system towards: a better programming environment
Authors: Yoshihisa Mano, Kazuhito Omaki, Koji Torii
Venue: ACM SIGSOFT Software Engineering Notes (1981)

A good programming environment should be designed after sufficient and careful considerations inclusively of the current progress of the hardware and the software. Intelligent terminals controlled by micro-processors have been developed as a certain step in this sense. But most of them are with a "single" display. It is, however, desired to compare and examine various informations during the programming process. We, therefore, have developed an intelligent terminal with "multi-displays" and implemented a system named MDPS (Multi-Display Programming System) in order to realize a high-level programming environment, where humans' activities of programming efforts are faithfully simulated.
Consequences and Limits of Nonlocal Strategies
Authors: Richard Cleve, Peter Hoyer, Benjamin Toner, John Watrous
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

This paper investigates various aspects of the nonlocal effectsthat can arise when entangled quantum information isshared between two parties. A natural framework for studyingnonlocality is that of cooperative games with incompleteinformation, where two cooperating players may share entanglement.Here nonlocality can be quantified in terms ofthe values of such games. We review some examples of non-localityand show that it can profoundly affect the soundnessof two-prover interactive proof systems. We then establishlimits on nonlocal behavior by upper-bounding thevalues of several of these games. These upper bounds canbe regarded as generalizations of the so-called Tsirelson inequality.We also investigate the amount of entanglement requiredby optimal and nearly optimal quantum strategies.
Mediating the expression of emotion in educational collaborative virtual environments: an experimental study
Authors: Marc Fabri, David Moore, Dave Hobbs
Venue: Virtual Reality (2004)

The use of avatars with emotionally expressive faces is potentially highly beneficial to communication in collaborative virtual environments (CVEs), especially when used in a distance learning context. However, little is known about how, or indeed whether, emotions can effectively be transmitted through the medium of a CVE. Given this, an avatar head model with limited but human-like expressive abilities was built, designed to enrich CVE communication. Based on the facial action coding system (FACS), the head was designed to express, in a readily recognisable manner, the six universal emotions. An experiment was conducted to investigate the efficacy of the model. Results indicate that the approach of applying the FACS model to virtual face representations is not guaranteed to work for all expressions of a particular emotion category. However, given appropriate use of the model, emotions can effectively be visualised with a limited number of facial features. A set of exemplar facial expressions is presented.
Designing Data Warehouses for Supply Chain Management
Authors: Timon C. Du, Jacqueline Wong, Mandy Lee
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Data warehouses are used to support subject-oriented decision-making in a company. When a company joins a supply chain partnership to increase competitiveness, its data warehouse has to be re-designed. The design of data warehouses for supply chain partners has to take into account issues such as data schemas, duplication of data, data security, and homogeneity of data warehouses. This study proposes five approaches to designing data warehouses for supply chain partners: (1) a centralized data warehouse, (2) a coordinated data warehouse, (3) a distributed data warehouse, (4) a federated data warehouse, and (5) a heterogeneous data warehouse. Each approach has different features and provides a high level of data security.
Computing irredundant irreducible decompositions of large scale monomial ideals
Authors: R. Alexander Milowski
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

This paper outlines two methods of computing irredundant irreducible decompositions of large scale monomial ideals with tens of thousands of minimal generators. Accomplishing this task is infeasible in current available software given the algorithms they use. In contrast, an implementation was built using the methods in this paper. This implementation was able to compute large decompositions as well as other currently infeasible computations.
Letter to the editor: a note on the upper bound of the spectral radius for SOR iteration matrix
Authors: Da-Wei Chang
Venue: Journal of Computational and Applied Mathematics (2004)

Recently, Wang and Huang (J. Comput. Appl. Math. 135 (2001) 325, Corollary 4.7) established the following estimation on the upper bound of the spectral radius for successive overrelaxation (SOR) iteration matrix: ρSOR ≤ 1 - ω + ωρGS under the condition that the coefficient matrix A is a nonsingular M-matrix and ω ≥ 1, where ρSOR and ρGS are the spectral radius of SOR iteration matrix and Gauss-Seidel iteration matrix, respectively. In this note, we would like to point out that the above estimation is not valid in general.
Adaptive channel queue routing on k-ary n-cubes
Authors: Arjun Singh, William J. Dally, Amit K. Gupta, Brian Towles
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in the network from its channel queues while relying on the implicit network backpressure to transfer congestion information to these queues. It uses this estimate to decide the directions to route in each dimension. It further load balances the network by routing in the selected directions adaptively. The only other algorithm that uses global congestion in its routing decision is the Globally Adaptive Load-Balance (GAL) algorithm introduced in [13]. GAL performs better than any other known routing algorithm on a wide variety of throughput and latency metrics. However, there are four serious issues with GAL. First, it has very high latency once it starts routing traffic non-minimally. Second, it is slow to adapt to changes in traffic. Third, it requires a complex method to achieve stability. Finally, it is complex to implement. These issues are all related to GAL's use of injection queue length to infer global congestion. CQR uses channel queues rather than injection queues to estimate global congestion. In doing so, it overcomes the limitations of GAL described above while matching its high performance on all the performance metrics described in [13]. CQR gives much lower latency than GAL at loads where non-minimal routing is required. It adapts rapidly to changes in traffic, is unconditionally stable, and is simple to implement.
Back-end assignment schemes for clustered multithreaded processors
Authors: Fernando Latorre, José González, Antonio González
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Power consumption and wire delays are two important limiting factors for current and forthcoming processors. Monolithic designs that keep reasonable power consumption and operate at high clock frequencies are ever harder to implement. In this paper we propose a novel multithreaded clustered microarchitecture that consists of a clustered front-end capable of fetching instructions from multiple hreads and a clustered back-end where instructions are executed. This microarchitecture combines the concepts of multithreading and clustering to a tack both problems: power consumption and wire delays. A key aspect of this microarchitecture is the assignment of resources to the simultaneously running threads. We propose two back-end assignment schemes; in the Static Back-end Assignment (SBA)the back-ends are statically assigned to the front-ends, while in the Dynamic Back-end Assignment (DBA) the back-ends are dynamically assigned according to the demands of each front-end. A limit study of the potential performance of DBA shows a minor benefit compared to SBA. The causes why the DBA scheme does not perform as initially expected are investigated and the main limiting factors of this architecture are evaluated. Finally,we point out he advantages of DBA versus SBA.
Online and Offline Algorithms for the Time-Dependent TSP with Time Zones
Authors: Bj&#x00f6;rn Brod&#x00e9;n, Mikael Hammar, Brengt J. Nilsson
Venue: Algorithmica (2004)

The time-dependent traveling salesman problem (TDTSP) is a variant of TSP with time-dependent edge costs. We study some restrictions of TDTSP where the number of edge cost changes are limited. We find competitive ratios for online versions of TDTSP. From these we derive polynomial time approximation algorithms for graphs with edge costs one and two. In addition, we present an approximation algorithm for the orienteering problem with edge costs one and two.
A Service Management Framework for Service-Oriented Enterprises
Authors: Ying Huang, Santhosh Kumaran, Jen-Yao Chung
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

With a steady pace of adoption of service-oriented architecture, companies have made significant progresses in implementing various kinds of Web services and converting existing applications to service-oriented architecture. As significant number of services have been implemented and put into actual use, many service-oriented enterprises are faced with the problem of how to manage these services in an efficient manner. In this paper, we propose a framework for a more efficient management of these services. In this framework, the creation and maintenance of enterprise solutions are modeled by flows, finite state machines (FSMs) among other formal models. For instance, each enterprise solution would be modeled as composite services that can be described by respective flow and FSM models. These solution models can then be stored, and later retrieved for the execution of these composite services. Furthermore, formal models are also used to maintain and update these service-oriented solutions to improve the efficiency and quality of service management by taking advantage of the underlying service-oriented architecture. In this paper, we will first provide a normalized categorization of enterprise services. We will then describe the framework for managing services in service-oriented enterprises. We will also discuss how this framework can help manage enterprise services more efficiently. Finally, we will give a real-world example to illustrate how this framework can be used in practice.
A Novel VLSI Architecture to Implement Region Merging Algorithm for Image Segmentation
Authors: J. D. Kranthi Kumar, S. Srinivasan
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper describes a novel VLSI architecture for the region-merging algorithm for image segmentation applications. This algorithm uses the region adjacency graph (RAG), which represents regions and their edges. The final segmentation provided by the RAG represents localized contours or surfaces. The architecture is proposed by making use of the concepts of parallelism and pipelining in order to improve the performance in terms of speed. The architecture has been coded in Verilog and synthesized using Synplify tools for FPGA implementation.
Distributed Admission Control for Anycast Flows
Authors: Weijia Jia, Dong Xuan, Wanqing Tu Lidong Lin Wei Zhao
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Anycasting has recently become an important research topic, especially for replicated servers. With anycasting, applications can request the "nearest¿ server for provision of desired (multimedia) service. In this paper, we study efficient Distributed Admission Control (DAC) for anycast flows. We focus on algorithms that perform destination selection and efficient path establishment. Taking advantage of anycasting, our distributed algorithms differ from each other in their dependence on system status information. Performance data obtained through mathematical analysis and simulations show that, in terms of admission probabilities, DAC systems that are based on local status information have performance levels close to those that utilize global and dynamic status information. This renders our DAC algorithms useful not only for the network layer, but also for the application layer admission control for anycast flows.
Memory Requirement Optimization with Loop Fusion and Loop Shifting
Authors: Qubo Hu, Martin Palkovic, Per Gunnar Kjeldsberg
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Loop fusion and loop shifting are well recognized loop transformations for memory requirement reduction. State-of-the-art optimizations with loopfusion and shifting are based on heuristics without any evaluation of the resulting effects during each optimization step. Thus we cannot guarantee that each step results in a reduced overall memory requirement. On the other hand, most memory requirement estimations at system level are inefficient and slow. Also the estimation is not started until the optimization is done. Having to iterate between optimization and estimation is very time consuming. In this paper, we present a storage requirement optimization method which combines the optimization and estimation processes with the goal to have continuous estimates during the optimization and hence to achieve lower memory requirements.
Using the synergies between the object-oriented paradigm and mathematics in joint mathematics/computer science programs
Authors: Marc Conrad, Tim French
Venue: ACM SIGCSE Bulletin (2004)

Whilst the object oriented paradigm and its instantiation within programming languages such as Java has become a ubiquitous part of both the commercial and educational landscapes, its usage as a visualisation technique within Mathematics undergraduate programmes of study has not been widely recognised. By regarding the object oriented paradigm as a medium for conceptual exploration (rather than merely as a tool) the aim is to show how the close conceptual links between object orientation and certain mathematical structures such as rings and groups can be more fully realised, using the ready-made Java package com.perisic.ring [2]. The package provides classes for abstract rings and can in addition be used as a reference model for other mathematical objects such as groups or vector spaces [3].The intention behind the approach offered here is to build upon these enabling foundations so as to reveal the fundamental synergies that exist between the various entities that are central to the OO paradigm (such as Abstract Data Types) and abstract mathematical structures (such as Rings and Groups). By inviting students to revisit certain fundamental OO constructs and techniques (such as classes, polymorphism, encapsulation and inheritance) within the context of pure mathematics, students may perhaps gain a deeper insight into mathematical abstractions and related algebraic structures. The idea is to generally reinforce students' learning and to generally enhance their mathematical maturity through a process of "live engagement" with a familiar and indeed ubiquitous OO paradigm.It is clear that for some authors at least, the use of Java in Mathematics is seen to be purely pragmatic: i.e. merely as a convenient tool used to engineer a graphical user interface or to explore distributed programming [1]. However there has been a heated on-going debate that has sought to identify whether the "correct" use of a computer and other automated devices such as calculators, genuinely aids students' learning and analytical abilities, or whether such usage may actually be detrimental to the development of mathematical maturity [1]. We prefer to believe that Java may have a deeper role to play. However, rather than directly seeking to contribute to this pedagogic debate between "reformers" and "traditionalists" our aim here is to show how (conceptually) the two discipline areas are mutually synergistic. In particular we show how gaining a deeper insight into, and understanding of, object oriented techniques can in fact provide an ideal pedagogic opportunity for our undergraduate target audience to better visualise, hence understand, certain abstract mathematical concepts and entities.