ppxscal/embedding_network huggingface dataset:
Understanding metamodeling
Authors: Thomas Kühne
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Metamodeling not only directly underpins the specification of modeling languages such as the UML, but is also the foundation for making the OMG's MDA vision come true. This tutorial starts by motivating metamodeling as an advanced way of creating software and then goes on to explore its fundamental principles. In particular, important new metamodeling concepts such as the distinction between ontological and linguistic instance-of relationships, the unification of class and object facets and deep instantiation are introduced. A metamodeling framework suitable for MDA is constructed step-by-step and then used to explain and critique the OMG's various metamodeling technologies. This information furnishes modelers with the heuristics they need to more effectively utilize OMG metamodeling technology and to know when metamodeling concepts are suitable and when they are not. The tutorial ends with some methodological advice on how to model in the presence of more than two modeling levels (objects & classes).
Hamiltonian Cycles with Prescribed Edges in Hypercubes
Authors: Tomás Dvorák
Venue: SIAM Journal on Discrete Mathematics (2005)

Given a set ${\cal P}$ of at most 2n-3 prescribed edges ($n\ge2$), the n-dimensional hypercube Qn contains a Hamiltonian cycle passing through all edges of ${\cal P}$ iff the subgraph induced by ${\cal P}$ consists of pairwise vertex-disjoint paths. This answers a question of Caha and Koubek, who showed that for any $n\ge3$ there are 2n-2 edges of Qn not contained in any Hamiltonian cycle, but that still satisfy the above condition.
A model for parallel programming over CORBA
Authors: D. Janaki Ram, A. Vijay Srinivas, P. Manjula Rani
Venue: Journal of Parallel and Distributed Computing (2004)

Existing models for parallel programming over Common Object Request Broker Architecture (CORBA) do not address issues specific to parallel programming over a Network of Workstations (NOWs). This paper presents P-CORBA, a model for parallel programming over CORBA that addresses these issues. Transmission and distribution of computing power of a NOW is facilitated by P-CORBA. The main contribution of the work is to bring a notion of concurrency into CORBA. The model illustrates a method for balancing the load on a CORBA-based distributed system. It also provides a new idea for achieving object migration in CORBA. The paper presents detailed performance studies from a prototype of the model that has been implemented. A detailed performance comparison of the model is made with a widely used parallel programming tool, namely Message Passing Interface (MPI). This paper demonstrates that in spite of its overheads, CORBA can be used for parallel programming over a NOW and significant speedups can be obtained.
Generation of Speckle Fringe Patterns by Curved-Surface Window Correlation Method
Authors: Sihua Fu, Qifeng Yu, Xia Yang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Subtraction method is usually adopted to generate the speckle fringe patterns in Electronic Speckle Pattern of Interferometry (ESPI), but it would result in high-level speckle noise inevitably. Another method is the direct correlation technique with rectangular windows, which could suppress the high contrast speckle noise, but produces some new large size speckles with low contrast instead. This paper proposes a new method in which correlation is practiced in curved-surface window so as to reduce the affection of non-correlation elements, thus smoother speckle fringe patterns are generated. Finally, we extend the method to the phase shifting techniques and provide experimental results and conclusion.
A reliable approach to automatic assessment of short answer free responses
Authors: Lyle F Bachman, Nathan Carr, Greg Kamei, Mikyung Kim, Michael J Pan, Chris Salvador, Yasuyo Sawaki
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper discusses an innovative approach to the computer assisted scoring of student responses in WebLAS (web-based language assessment system)- a language assessment system delivered entirely over the web. Expected student responses are limited production free response questions.The portions of WebLAS with which we are concerned are the task creation and scoring modules. Within the task creation module, instructors and language experts do not only provide the task input and prompt. More importantly, they interactively inform the system how and how much to score student responses. This interaction consists of WebLAS' natural language processing (NLP) modules searching for alternatives of the provided "gold standard" (Hirschman et al, 2000) answer and asking for confirmation of score assignment. WebLAS processes and stores all this information within its database, to be used in the task delivery and scoring phases.
Specifying and animating facial signals for discourse in embodied conversational agents: Research Articles
Authors: Doug DeCarlo, Matthew Stone, Corey Revilla, Jennifer J. Venditti
Venue: Computer Animation and Virtual Worlds (2004)

People highlight the intended interpretation of their utterances within a larger discourse by a diverse set of non-verbal signals. These signals represent a key challenge for animated conversational agents because they are pervasive, variable, and need to be coordinated judiciously in an effective contribution to conversation. In this paper, we describe a freely available cross-platform real-time facial animation system, RUTH, that animates such high-level signals in synchrony with speech and lip movements. RUTH adopts an open, layered architecture in which fine-grained features of the animation can be derived by rule from inferred linguistic structure, allowing us to use RUTH, in conjunction with annotation of observed discourse, to investigate the meaningful high-level elements of conversational facial movement for American English speakers. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Using visual cues for extraction of tabular data from arbitrary HTML documents
Authors: Bernhard Krüpl, Marcus Herzog, Wolfgang Gatterbauer
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We describe a method to extract tabular data from web pages. Rather than just analyzing the DOM tree, we also exploit visual cues in the rendered version of the document to extract data from tables which are not explicitly marked with an HTML table element. To detect tables, we rely on a variant of the well-known X-Y cut algorithm as used in the OCR community. We implemented the system by directly accessing Mozilla's box model that contains the positional data for all HTML elements of a given web page.
Microscopic-Macroscopic Models Systems Integration: A Simulation Case Study for ATMIS
Authors: Abd-El-Kader Sahraoui, R. Jayakrishnan
Venue: Simulation (2005)

This article proposes the integration of both microscopic and macroscopic simulation and focuses on two main issues: a methodology for calibration/validation and the integration of path dynamics on large networks. These are considered the most significant two challenges in microscopic simulation for decision support and analysis in Advanced Traffic Management and Information Systems (ATMIS). Then a methodology is described that brings to microscopic simulation the kind of capabilities for path processing and storage normally found only with macroscopic models, often due to the network representation being less detailed for those. This is based on a hybrid simulation approach. The example of integrating the Paramics microscopic simulation with the routing and behavior response simulation schemes as in the DYNASMART macroscopic model is used to explain a candidate methodology to enhance microscopic models for the evaluation of information/routing schemes in ATMIS.
Change Tolerant Indexing for Constantly Evolving Data
Authors: Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Shah
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typically based upon the assumption that the rate of updates will be small compared to the rate of querying. This assumption is not valid in streaming data environments such as sensor and moving object databases, where updates are received incessantly. In fact, for many applications, the rate of updates may well exceed the rate of querying. In such environments, index structures suffer from poor performance due to the large overhead of keeping the index updated with the latest data. Recent efforts at indexing moving object data assume objects move in a restrictive manner (e.g. in straight lines with constant velocity). In this paper, we propose an index structure explicitly designed to perform well for both querying and updating. We assume a more relaxed model of object movement. In particular, we observe that objects often stay in a region (e.g., building) for an extended amount of time, and exploit this phenomenon to optimize an index for both updates and queries. The paper is developed with the example of R-trees, but the ideas can be extended to other index structures as well. We present the design of the Change Tolerant R-tree, and an experimental evaluation.
Modelling Reflections via Multiperspective Imaging
Authors: Jingyi Yu, Leonard McMillan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a novel method for analyzing reflections on arbitrary surfaces. We model reflections using a broader than usual class of imaging models, which include both perspective and multiperspective camera types. We provide an analytical framework to locally model reflections as specific multiperspective cameras around every ray based on a new theory of general linear cameras. Our framework better characterizes the complicated image distortions seen on irregular mirror surfaces as well as the conventional catadioptric mirrors. We show the connection between multiperspective camera models and caustic surfaces of reflections and demonstrate how they reveal important surface rulings of the caustics. Finally, we show how to use our analysis to assist mirror design and characterize distortions seen in catadioptric imaging systems.
A 3.84 gbits/s AES crypto coprocessor with modes of operation in a 0.18-μm CMOS technology
Authors: Alireza Hodjat, David D. Hwang, Bocheng Lai, Kris Tiri, Ingrid Verbauwhede
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper an AES crypto coprocessor that is fabricated using a 0.18-μm CMOS technology is presented. This crypto coprocessor performs the AES-128 encryption in both feedback and non-feedback modes of operation. A maximum throughput of 3.84 Gbits/s is achieved at a 330 MHz clock frequency for ECB, OFB, and CBC modes of operation. This crypto coprocessor can be programmed using the memory-mapped interface of an embedded CPU core and is tested using a LEON 32-bit (SPARC V8) processor in the ThumbPod secure system-on-chip.
An interactive system for semi-automatic artwork generation of printed circuit boards
Authors: A. Mura, M. Tomljanovich
Venue: ACM SIGDA Newsletter (1973)

An integrated interactive system for the P.C. boards production is described. The system comprises a minicomputer, a teletype, a paper tape puncher and reader and a package of analysis, control and post-processing programs.The input data to the system consist of circuit schematics, coded in terms of electrical components and connections, and manual layouts of the P.C.B.'s. Both inputs are internally and mutually checked.This operation is performed on-line with the digitizing phase, producing an intermediate punched paper tape and diagnostic printouts.Information recorded on the paper tape are then split in order to obtain control paper for N.C. artwork, drill and insertion machines.A core-resident components library supplies all the required supplementary data, i.e. pads size, holes diameter, drawing symbols, etc.Important features of the system are:- exhausive controls of the layout against the schematic and v.v.;- very easily made and completely system controlled updating and/or correcting of both schematics and layout;- no significant limitations.Results obtained during first months of system's operation are reported; a cost reduction of about 50% and a turnaround time reduction of about 60% with respect to the manual system have been achieved.
Performance Analysis of Optical Multistage Interconnection Networks with Limited Crosstalk
Authors: Ajay K. Katangur, Yi Pan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Analytical modeling techniques can be used to study the performance of optical multistage interconnection network (OMIN) effectively. MINs have assumed importance in recent times, because of their cost-effectiveness. An N × N MIN consists of a mapping from N processors to N memories, with log¿N stages of 2 × 2 switches with N/2 switches per stage. The interest is on the study of the performance of unbuffered optical multistage interconnection network using the Banyan network. The uniform reference model approach is assumed for the purpose of analysis. In this paper we apply the analytical modeling approach on an N × N OMIN with limited crosstalk (conflicts between messages) unto (log¿N-1). Messages with switch conflicts satisfying the constraint of (log¿N-1) are allowed to pass in the same group, but in case of a link conflict, than that message is routed in a different group. The analysis is performed by calculating the bandwidth of the network operating under a load l and allowing random traffic and using a greedy routing strategy. A number of equations are derived using the theory of probability and the performance curves are plotted. The results obtained show that the performance of the network improves by allowing limited crosstalk in the network.
Maintaining Implicated Statistics in Constrained Environments
Authors: Yannis Sismanis, Nick Roussopoulos
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Aggregated information regarding implicated entities is critical for online applications like network management, traffic characterization or identifying patters of resource consumption. Recently there has been a flurry of research for online aggregation on streams (like quantiles, hot items, hierarchical heavy hitters) but surprizingly the problem of summarizing implicated information in stream data has received no attention. As an example, consider an IP-network and the implication source ¿ destination. Flash crowds, ¿ such as those that follow recent sport events (like the olympics) or seek information regarding catastrophic events ¿ or denial of service attacks direct a large volume of traffic from a huge number of sources to a very small number of destinations. In this paper we present novel randomized algorithms for monitoring such implications with constraints in both memory and processing power for environments like network routers. Our experiments demonstrate several factors of improvements over straightforward approaches.
Array-index: a plug&search K nearest neighbors method for high-dimensional data
Authors: Zaher Al Aghbari
Venue: Data Knowledge Engineering (2005)

Previous algorithms of data partitioning methods (DPMs) to find the exact K-nearest neighbors (KNN) at high dimensions are outperformed by a linear scan method [J.M. Kleinberg, Two algorithms for nearest neighbor search in high dimensions, 29th ACM Symposium on Theory of computing, 1997; R. Weber, H.-J. Schek, S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: Proc. of the 24th VLDB, USA, 1998]. In this paper, we present a "plug& search" method to greatly speed up the exact KNN search of existing DPMs. The idea is to linearize the data partitions produced by a DPM, rather than the points themselves, into a one-dimensional array-index, that is simple, compact and fast. Unlike most DPMs that support KNN search, which require storage space linear, or exponential [J.M. Kleinberg, Two algorithms for nearest neighbor search in high dimensions, 29th ACM Symposium on Theory of computing, 1997; M. Hagedoom, Nearest neighbors can be found efficiently if the dimension is small relative to the input size, ICDT 2003], in dimensions, the array-index requires a storage space that is linear in the number of mapped partitions.
Optimal insensitive routing and bandwidth sharing in simple data networks
Authors: M. Jonckheere, J. Virtamo
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Many communication systems can be efficiently modelled using queueing networks with a stationary distribution that is insensitive to detailed traffic characteristics and depends on arrival rates and mean service requirements only. This robustness enables simple engineering rules and is thus of considerable practical interest. In this paper we extend previous results by relaxing the usual assumption of static routing and balanced service rates to account for both dynamic capacity allocation and dynamic load balancing. This relaxation is necessary to model systems like grid computing, for instance. Our results identify joint dynamic allocation and routing policies for single input reversible networks that are optimal for a wide range of performance metrics. A simple two-pass algorithm is presented for finding the optimal policy. The derived analytical results are applied in a number of simple numerical examples that illustrate their modelling potential.
Going wireless: the emergence of wireless networks in education
Authors: Leslie Moody, Gary Schmidt
Venue: Journal of Computing Sciences in Colleges (2004)

This paper focuses on the emerging technology of wireless networks, and their use in education. This paper discusses some advantages of wireless networks, as well as some concerns that need to be addressed before implementing a wireless network. Wireless networks are being implemented in both K-12 institutions and post-secondary institutions, though it has been found that they are being used in a different manner. In K-12 settings they are being used primarily to integrate technology and its use into the classroom setting, replacing the standard computer lab that is located outside the classroom. At the university level, the wireless network is utilized more as a means of convenience. The students and teachers are able to access resources for learning regardless of their location. They can use laptops and PDA's to expand their learning capabilities to any location, not just the classroom. The ideal wireless network needs to bring more technology into the classroom and in turn enhance the learning experience, as well as provide the opportunity for students to access resources outside the classroom, which would provide those who are interested a way to obtain knowledge any time they are willing and able.
A complete methodology for an accurate static noise analysis
Authors: Cristiano Forzan, Davide Pandini
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In signal integrity analysis, the joint effect of propagated noise through library cells, and of the noise injected on a quiet net by neighboring switching nets through coupling capacitances, must be considered in order to accurately estimate the overall noise impact on design functionality and performances.In this work a general macromodel that considers the impact of the cell non-linearity on the noise glitch waveform is proposed, and a new approach that allows to accurately and efficiently modeling the cell non-linear effects in Static Noise Analysis is presented. Experimental results confirm that existing noise analysis approaches based on linear superposition of the propagated and crosstalk-injected noise can be highly inaccurate, thus impairing the sign-off functional verification phase, and demonstrate the effectiveness of our method that can be seamlessly integrated into noise analysis tools.
Antarctic genomics: Features
Authors: Melody S. Clark, Andrew Clarke, Charles S. Cockell, Peter Convey, H. William Detrich,  III, Keiron P. P. Fraser, Ian A. Johnston, Barbara A. Methe, Alison E. Murray, Lloyd S. Peck, Karin Römisch, Alex D. Rogers
Venue: Comparative and Functional Genomics (2004)

With the development of genomic science and its battery of technologies, polar biology stands on the threshold of a revolution, one that will enable the investigation of important questions of unprecedented scope and with extraordinary depth and precision. The exotic organisms of polar ecosystems are ideal candidates for genomic analysis. Through such analyses, it will be possible to learn not only the novel features that enable polar organisms to survive, and indeed thrive, in their extreme environments, but also fundamental biological principles that are common to most, if not all, organisms. This article aims to review recent developments in Antarctic genomics and to demonstrate the global context of such studies. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Enhanced arithmetic for Fortran
Authors: Robert Paul Corbett
Venue: ACM SIGNUM Newsletter (1983)

The 1978 Fortran standard[1] permits mixed-mode expressions, that is, expressions with operands of differing data types. Expressions containing floating point operands of differing precisions pose special problems of interpretation. Consider the statement
Autonomic Cluster Management System (ACMS): A Demonstration of Autonomic Principles at Work
Authors: James D. Baldassari, Christopher L. Kopec, Eric S. Leshay, Walt Truszkowski, David Finkel
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Cluster computing, whereby a large number of simple processors or nodes are combined together to apparently function as a single powerful computer, has emerged as a research area in its own right. The approach offers a relatively inexpensive means of achieving significant computational capabilities for high-performance computing applications, while simultaneously affording the ability to increase that capability simply by adding more (inexpensive) processors. However, the task of manually managing and configuring a cluster quickly becomes impossible as the cluster grows in size. Autonomic computing is a relatively new approach to managing complex systems that can potentially solve many of the problems inherent in cluster management. We describe the development of a prototype Automatic Cluster Management System (ACMS) that exploits autonomic properties in automating cluster management.
Multi-Level Priority Queue Scheduling Algorithm for Critical Packet Loss Elimination during Handoff
Authors: Mahshid Madani, Janet Light
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Mobile IP provides node mobility by allowing change in point of attachment to the network. Handling the mobile network performance degradation due to critical packet loss during handoff is the main focus of this paper. Critical packets are defined according to application objectives. Combination of efficient scheduling algorithms, optimum window size and priority buffers have been proposed as a solution to decrease the critical packet loss and improve the quality of service. Simulation results substantiate the ideas presented in this paper.