ppxscal/embedding_network huggingface dataset:
Performance evaluation of UML software architectures with multiclass Queueing Network models
Authors: Simonetta Balsamo, Moreno Marzolla
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Software performance based on performance models can be applied at early phases of the software development cycle to characterize the quantitative behavior of software systems. We propose an approach based on queueing networks models for performance prediction of software systems at the software architecture level, specified by UML. Starting from annotated UML Use Case, Activity and Deployment diagrams we derive a performance models based on multichain and multiclass Queueing Networks (QN). The UML model is annotated according to the UML Profile for Schedulability, Performance and Time Specification. The proposed algorithm translates the annotated UML specification into QN performance models, which can then be analyzed using standard solution techniques. Performance results are reported back at the software architecture level in the UML diagrams. As our approach can be fully automated and uses standard UML annotations, it can be integrated with other performance modeling approaches. Specifically, we discuss how this QN-based approach can be integrated with an existing simulation-based performance modeling tool.
Creating a UX profession
Authors: Nigel Bevan
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Current aspirations to coordinate the UX community should be complemented by a coordinated series of professional initiatives to raise the status of the UX profession so that it can take its rightful role at the heart of the development process.
The Clique Problem in Intersection Graphs of Ellipses and Triangles
Authors: Christoph Ambühl, Uli Wagner
Venue: Theory of Computing Systems (2005)

Intersection graphs of disks and of line segments, respectively, have been well studied, because of both practical applications and theoretically interesting properties of these graphs. Despite partial results, the complexity status of the Clique problem for these two graph classes is still open. Here, we consider the Clique problem for intersection graphs of ellipses, which, in a sense, interpolate between disks and line segments, and show that the problem is APX-hard in that case. Moreover, this holds even if for all ellipses, the ratio of the larger over the smaller radius is some prescribed number. Furthermore, the reduction immediately carries over to intersection graphs of triangles. To our knowledge, this is the first hardness result for the Clique problem in intersection graphs of convex objects with finite description complexity. We also describe a simple approximation algorithm for the case of ellipses for which the ratio of radii is bounded.
Flexible authentication of XML documents
Authors: Premkumar Devanbu, Michael Gertz, April Kwong, Charles Martel, Glen Nuckolls, Stuart G. Stubblebine
Venue: Journal of Computer Security (2004)

XML is increasingly becoming the format of choice for information exchange on the Internet. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical areas such as healthcare, law and finance, integrity is essential. In such applications, clients must be assured that they are getting complete and correct answers to their queries. Existing methods for signing XML documents cannot be used to establish that an answer to a query is complete. A simple approach has a server processing queries and certifying answers by digitally signing them with an on-line private key; however, the server, and its on-line private key, would be vulnerable to external hacking and insider attacks. We propose a new approach to signing XML documents which allows untrusted servers to answer certain types of path queries and selection queries over XML documents without the need for trusted on-line signing keys. This approach enhances both the security and scalability of publishing information in XML format over the Internet. In addition, it provides greater flexibility in authenticating parts of XML documents, in response to commercial or security policy considerations.
Maximum entropy models for word sense disambiguation
Authors: Gerald Chao, Michael G. Dyer
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

A maximum entropy-based word sense disambiguation system is presented, consisting of individual word experts that are trained on both labeled and partially labeled corpora. The classification probabilities from the individual word experts are integrated using a new search algorithm, which balances time complexity and accuracy. The model is evaluated using established procedures on the English-all-words task from the SENSEVAL-2 workshop, a large test set consisting of words from all word groups to be disambiguated. Lastly, an ongoing project that integrates POS tagging, parsing, and sense disambiguation in one system is presented. Once in place, it will be boot-strapped with existing partially labeled corpora, to process and then train from them. The goal is to show that with each successive iteration, the accuracy of all three processes, POS tagging, parsing, and WSD, will improve as the system learns from more accurate, self-generated training data.
CMMI(R) Assessments: Motivating Positive Change (Sei Series in Software Engineering)
Authors: Marilyn Bush, Donna Dunaway
Venue:  (2005)

Use Assessments to Drive Process Improvements in Software, Systems, Human Resources, and BeyondPioneered by the world's leading innovators in software engineering, assessments have evolved into a remarkably powerful tool for process improvement in areas ranging from systems to services, hardware to human resources.Unlike audits, assessments are conducted from the inside. When handled correctly, assessments can help transform technical and managerial culture, dramatically improving both quality and profitability. In CMMI Assessments: Motivating Positive Change, two of the field's most respected leaders show exactly how to use them for maximum business advantage. Writing for executives, managers, technical professionals, and assessors themselves, Marilyn Bush and Donna Dunaway illuminate every phase of the assessment process-from planning through post-assessment follow-up.The authors begin with an expert overview of what assessments entail, when they make sense, how to set achievable goals for them, and how to lead them to success. Next, they "drill down" into each stage of the process, presenting step-by-step instructions and defining the roles and responsibilities of every participant. Coverage includes creating and training assessment teams; identifying assessment products; consolidating interview data and other onsite activities; presenting results; and using those results productively.Drawing on their unsurpassed experience leading assessments and mentoring assessors, they offer deep insights into the real-world challenges and obstacles you'll face-and proven solutions. They also present an extended case study showing how a real software development organization drove continuous improvement through four years of iterative assessments-moving from CMM Level 2 to elite Level 5 status, and driving dramatic business benefits along the way.© Copyright Pearson Education. All rights reserved.
Revamping the OSCAR Database: A Flexible Approach to Cluster Configuration Data Management
Authors: DongInn Kim, Jeffrey M. Squyres, Andrew Lumsdaine
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The OSCAR [17] cluster installation toolkit started life as the result of an ad-hoc working group attempting to bundle a set of "best practices" for building clusters into a single software solution. Although mainly developed as "skunk works" projects in each of the participating institutions, the OSCAR toolkit has gained a large following, boasting hundreds of thousands of downloads and active-mailing lists. The original OSCAR toolkit was aimed at one particular type of High Performance Computing (HPC) cluster. Since then, several sub-projects targeting other types of HPC clusters have been spun off the main working groupýs efforts. Each of these projects share core set of OSCAR code, including the OSCAR Database and its access API, "ODA" (OSCAR Database API). The ODA abstraction layer ¿ consisting of a database schema and corresponding API ¿ hides a commodity back-end database (e.g., MySQL). As OSCAR and its derivatives are targeted at new, innovative environments (to include non-HPC environments), the configuration management issues that OSCAR must handle have grown exponentially. As such, its current database schema for holding the clusterconfiguration is starting to show its age ¿ it is simply unable to represent the complex, ever-growing set of data required to accurately describe the clusters that it manages. ODAýs API is overly complex, requiring a steep learning curve for OSCAR developers. This paper proposes a simpler, highly flexible design and implementation that will allow ODA to not only handle all the data that ODA currently manages, but also allow expansion into new types of clusters, enable storage and retrieval of configuration information in a variety of different formats, and encourage data re-use between the main OSCAR project and its derivative packages.
THE DRUID USER INTERFACE MANAGEMENT SYSTEM
Authors: Eelco Vriezekolk
Venue: ACM SIGCHI Bulletin (1991)

Druid is a user interface management system (UIMS) for building complex, highly interactive graphical user interfaces (UIs). Druid is based on three fundamental principles. 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
Personal and service mobility in ubiquitous computing environments: Research Articles
Authors: K. El-Khatib, Zhen E. Zhang, N. Hadibi, G. V. Bochmann
Venue: Wireless Communications Mobile Computing (2004)

Ubiquitous computing environment is defined by the shift of computing technology from the desktop to the background. One of its most notable attributes is its potential to extend the scope of service and personal mobility. This paper describes an agent-based architecture that brings personal and service mobility to the ubiquitous computing environment. A software agent, running on a portable device carried by the user, leverages the existing service discovery protocols to learn about all services available in the vicinity of the user. Short-range wireless technology such as Bluetooth can be used to build a personal area network connecting only devices that are close enough to the user. Acting on behalf of the user and based on a number of aspects, the software agent runs a quality of service (QoS) negotiation and selection algorithm to select the most appropriate available service(s) to be used for a given communication session. The software agent selects as well the configuration parameters for each service. The proposed architecture supports also service hand-off to recompense for service volatility during user movement. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Including a web/database unit in CS0
Authors: Tom Whaley
Venue: Journal of Computing Sciences in Colleges (2005)

In this tutorial the participants will learn how to use ASP.NET to develop web pages that access data stored in database. This material will be presented in terms of four laboratory experiences that could be used in an introductory general education computer science course.
Finding the best shortcut in a geometric network
Authors: Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currently, the fastest algorithm for computing the stretch factor of a Euclidean graph runs in O(mn+n2 log n) time, resulting in a trivial O(mn3+n4 log n) time algorithm for computing the optimal shortcut. First, we show that a simple modification yields the optimal solution in O(n4) time using O(n2) space. To reduce the running times we consider several approximation algorithms. Our main result is a (2+ε)-approximation algorithm with running time O(nm+n2(log n+1/ε3d)) using O(n2) space.
Analyis of Path Profiling Information Generated with Performance Monitoring Hardware
Authors: Alex Shye, Matthew Iyer, Tipp Moseley, David Hodgdon, Dan Fay, Vijay Janapa Reddi, Daniel A. Connors
Venue: Proceedings of the 9th Annual Workshop on Interaction between Compilers and Computer Architectures (2005)

Even with the breakthroughs in semiconductor technology that will enable billion transistor designs, hardware-based architecture paradigms alone cannot substantially improve processor performance. The challenge in realizing the full potential of these future machines is to find ways to adapt program behavior to application needs and processor resources. As such, run-time optimization will have a distinct role in future high performance systems. However, as these systems are dependent on accurate, fine-grain profile information, traditional approaches to collecting profiles at run-time result in significant slowdowns during program execution. A novel approach to low-overhead profiling is to exploit hardware Performance Monitoring Units (PMUs) present in modern microprocessors. The Itanium-2 PMU can periodically sample the last few taken branches in an executing program and this information can be used to recreate partial paths of execution. With compiler-aided analysis, the partial paths can be correlated into full paths. As statistically hot paths are most likely to occur in PMU samples, even infrequent sampling can accurately identify these paths. While traditional path profiling techniques carry a high overhead, a PMU-based path profiler represents an effective lightweight profiling alternative. This paper characterizes the PMU-based path information and demonstrates the construction of such a PMU-based path profiler for a run-time system.
On strip packing With rotations
Authors: Klaus Jansen, Rob van Stee
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a rectangle (strip) of fixed width and minimum height, and these rectangles can be rotated by 90°. Additionally, we present a simple asymptotic polynomial time approximation scheme, and give an improved algorithm for two-dimensional bin packing with rotations.
A Simple OCR Method from Strong Perspective View
Authors: Mi-Ae Ko, Young-Mo Kim
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Among many practical factors that need to be considered for a reliable character recognition system in 3D space, the location of the visual angle of a camera might play a crucial role. Different viewpoints in 3D space produces distorted license plate images in a camera. For this reason, a method is developed to segment and to recognize characters of license plate objects undergoing variant perspective view. A method for segmenting license plate characters on a moving vehicle in actual outdoor environment is based upon object contours. And the proposed method for recognizing is constructed from a feature-based approach, parameterized by an affine invariant parameters and the affine invariant features. Experimental results show that the performance of the proposed method is simple and robust, particularly when objects are heavily distorted with strong perspective view.
A finite element method for surface diffusion: the parametric case
Authors: Eberhard Bänsch, Pedro Morin, Ricardo H. Nochetto
Venue: Journal of Computational Physics (2005)

Surface diffusion is a (fourth order highly nonlinear) geometric driven motion of a surface with normal velocity proportional to the surface Laplacian of mean curvature. We present a novel variational formulation for parametric surfaces with or without boundaries. The method is semi-implicit, requires no explicit parametrization, and yields a linear system of elliptic PDE to solve at each time step. We next develop a finite element method, propose a Schur complement approach to solve the resulting linear systems, and show several significant simulations, some with pinch-off in finite time. We introduce a mesh regularization algorithm, which helps prevent mesh distortion, and discuss the use of time and space adaptivity to increase accuracy while reducing complexity.
Telemedicine with Digital Video Transport System in Asia-Pacific Area
Authors: Naoki Nakashima, Koji Okamura, Joon-Soo Hahm, Young-Woo Kim, Hiroshi Mizushima, Haruyuki Tatsumi, Byung-In Moon, Ho-Seong Han, Yong-Jin Park, Jae-Hwa Lee, Sung-Kwan Youm, Chul-Hee Kang, Shuji Shimizu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

We have established a medical network in Asia-Pacific area with high-qualitymoving image on a super broad-banded internet line since February 2003. Broadcasting real-time surgery and teleconference with medical-quality videos with Digital Video Transport System (DVTS) were so useful to learn surgical techniques and other medical procedures beyond borders. We have conducted 20 events in categories of teleconference (8 times), live transmission of medical procedure (6 times), and remote attendance to scientific medical meetings (6 times) until September 2004. We had teleconferences among 3 countries in APAN-Hawaii in January 2004 (Japan, Korea and USA),and in APAN-Cairns in July 2004 (Japan, Korea and Australia). There have been no serious transmission/ethical problems so far. With these experiences and current achievements, we hope to extend this advanced network system to whole Asia-Pacific countries to share medical skills and knowledge.
Rethinking the design of real-coded evolutionary algorithms: Making discrete choices in continuous search domains
Authors: William E. Hart
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

Although real-coded evolutionary algorithms (EAs) have been applied to optimization problems for over thirty years, the convergence properties of these methods remain poorly understood. We discuss the use of discrete random variables to perform search in real-valued EAs. Although most real-valued EAs perform mutation with continuous random variables, we argue that EAs using discrete random variables for mutation can be much easier to analyze. In particular, we present and analyze two simple EAs that make discrete choices of mutation steps.
Low-distortion embeddings of general metrics into the line
Authors: Mihai Bǎdoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion embeddings have recently found numerous applications in computer science.Most of the known embedding results are "absolute",that is, of the form: any metric Y from a given class of metrics C can be embedded into a metric X with low distortion c. This is beneficial if one can guarantee low distortion for all metrics Y in C. However, in any situations, the worst-case distortion is too large to be meaningful. For example, if X is a line metric, then even very simple metrics (an n - point star or an n -point cycle) are embeddable into X only with distortion linear in n. Nevertheless, embeddings into the line (or into low-dimensional spaces) are important for many applications.A solution to this issue is to consider "relative" (or "approximation") embedding problems, where the goal is to design an (a-approxiation) algorithm which, given any metric X from C as an input, finds an embedding of X into Y which has distortion a *cY (X), where cY (X)is the best possible distortion of an embedding of X into Y.In this paper we show algorithms and hardness results for relative embedding problems.In particular we give: •an algorith that, given a general metric M, finds an embedding with distortion O (Δ3⁄4 poly(c line (M))), where Δ is the spread of M•an algorithm that,given a weighted tree etric M, finds an embedding with distortion poly(c line (M)) •a hardness result, showing that computing minimum line distortion is hard to approximate up to a factor polynomial in n,even for weighted tree metrics with spread Δ=n O (1).
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Authors: J. A. Makowsky
Venue: Discrete Applied Mathematics (2005)

Tutte polynomials are important graph invariants with rich applications in combinatorics, topology, knot theory, coding theory and even physics. The Tutte polynomial T(G, X, Y) is a polynomial in Z[X, Y] which depends on a graph G. Computing the coefficients of T(G, X, Y), and even evaluating T(G, X, Y) at specific points (x, y) is #P hard by a result of Jaeger et al. (Math. Proc. Cambridge Philos. Soc. 108 (1989) 35). On the other hand, Andrzejak (Discrete Math. 190 (1998) 39-54) and Noble (Combin. Probab. Comput. 7 (1998) 307-321) have shown independently, that, if G is a graph of bounded tree width, computing T(G, X, Y) can be done in polynomial time. We extend this result to the signed Tutte polynomials introduced in 1989 by Kauffman and the colored Tutte polynomials introduced in 1999 by Bollobas and Riordan. This allows us to prove similar results for the Jones polynomials and Kauffman brackets for knots and links which have a signed graph presentation of bounded tree width. Jones polynomials and Kauffman polynomials are the most prominent invariants of knot theory. For alternating links, they are easily computable from the Tutte polynomials of the signed graph representing the link by a result of Thistlethwaite (1988). For general links one has to use the colored Tutte polynomial instead. Knots and links can be presented as labeled planar graphs. The tree width of a link L is defined as the tree width of its graphical presentation D(L) as crossing diagrams. We show that for (not necessarily alternating) knots and links of tree width at most k, even the Kauffman square bracket [L] introduced by Bollobas and Riordan can be computed in polynomial time. Hence, the classical Kauffman bracket (L) and the Jones polynomial of links of tree width at most k are computable in polynomial time. Our proof is based on, but extends considerably previous work by B. Courcelle, U. Rotics and the author. It also gives a new proof of the result for Tutte polynomials and generalizes to a wide class of polynomials defined as generating functions definable in Monadic Second Order Logic with order, but invariant under it.
Performance issues and resolutions for the .NET runtime virtual machine
Authors: Vance Morrison
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

The .NET Runtime is an example of virtual machine technology "in action". It forms the foundation of every C#, and VB application written today, and is one of the most widely distributed pieces of virtual machine technology. Performance considerations have been a driving force in its design; however they may not be the ones you might have guessed. Scalability, working set, and startup time turn out to be more important considerations then the more traditional "instruction path" notion of performance. In this talk I will provide a brief background on the runtime, describe some of the performance problems we faced, and how we solved them. Finally I will talk a bit about the performance challenges we have still in front of us as ever more demanding customers use the runtime.