ppxscal/embedding_network huggingface dataset:
Environment analysis via ΔCFA
Authors: Matthew Might, Olin Shivers
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We describe a new program-analysis framework, based on CPS and procedure-string abstractions, that can handle critical analyses which the k-CFA framework cannot. We present the main theorems concerning correctness, show an application analysis, and describe a running implementation.
Toward improved traceability of non-functional requirements
Authors: Jane Cleland-Huang
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

This position paper examines current practices and challenges for tracing non-functional requirements (NFRs). Anecdotal evidence suggests that many organizations do not effectively trace NFRs and that functional changes are often implemented with very little understanding as to how system qualities such as safety, security, and performance will be impacted. The tendency for NFRs to have broad ranging impact upon a software system, and the strong interdependencies and tradeoffs that exist between NFRs and the software architecture leave typical existing traceability methods insufficient for tracing NFRs. This paper focuses on post-requirements traceability of NFRs. It first identifies three critical areas in which NFRs require traceability support, it then evaluates existing traceability methods, and finally proposes a more holistic traceability environment named Goal Centric Traceability that supports impact analysis of NFRs within the context of the software architecture in which they are deployed.
A model transformation approach to automatic model construction and evolution
Authors: Yuehua Lin, Jeff Gray
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

As models are elevated to first-class artifacts within the software development lifecycle, the task of construction and evolution of large-scale system models becomes a manually intensive effort that can be very time consuming and error prone. To address these problems, this dissertation abstract presents a model transformation approach. There are three main features of this research. First, tasks of model construction and evolution are specified in a model transformation language (called the Embedded Constraint Language). Second, a core transformation engine (called C-SAW) is used to perform model transformation in an automated manner by executing the ECL transformation specification. Finally, testing and debugging tools at the modeling level are provided to assist in detecting errors in the model transformation.
A Study on How to Reduce Time and Space by Redefining New Bytecode for Java Card
Authors: Min-Sik Jin, Min-Soo Jung
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

One of the most serious problems of Smart Card System such as Java Card, is about an amount of insufficient memory. Moreover, most of the embedded devices with Java VM support the post-issuance of new applications. These applications are usually stored in the memory, which is usually EEPROM. The key idea of our approach is to reduce the size of CAP file by grouping byte-codes. With our approach, the size of CAP file is reduced over 10% than that of typical CAP file. The size reduction of CAP file means that more available space of EEPROM in Java Card. It also enables an application to be downloaded more quickly in the case of an application sent to a mobile phone via the GSM network.
GOD Queuing: A Novel Grid-based Resource Co-allocation Scheme in Distributed Multimedia System
Authors: Zhihui Lv, Yiping Zhong, Weiming Fu, Shiyong Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we firstly analyze all kinds of resource allocation schemes in distributed multimedia system, including QoS Manager, SRT, GARA, and propose a novel distributed multimedia service grid architecture - Multimedia Service Grid. Based on grid architecture, this paper introduces a novel resource allocation scheme - Grid-based On-demand Queuing, GOD Queuing. We propose the function architecture of the scheme, and describe the main function of each component. Furthermore, this paper emphasizes on the resource usage monitoring and adapting mechanism of VOD Multimedia Service Grid based on GOD Queuing scheme, illustrating the characteristic of GOD Queuing scheme in resource allocation. At last, we illustrate the prospective research direction on the combination of distributed multimedia system and grid technology.
Cluster computing environment supporting single system image
Authors: Min Choi, DaeWoo Lee, SeungRyoul Maeng
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

Single system image (SSl) systems have been the mainstay of high-performance computing for many years. SSI requires the integration and aggregation of all types of resources in a cluster to present a single interface to users. We describe a cluster computing environment supporting SSI, constructed through three components: single process space (SPS), process migration, and dynamic load balancing. These components attempt to share all available resources in the cluster among all executing processes, so that the cluster operates like a single node with much more computing power. The most important goal is to combine these constructs in innovative ways for building cluster computing environment for SSI, as well as individually take an approach to improve performance or functionality. Our implementation of process migration has the capability of resolving broken pipe problems and bind errors on server socket reconstruction. We realize SPS based on block PID allocation. We also designed and implemented a dynamic load balancing scheme which resolves the limitations of our previous work by continuously tracing the job resource usage at runtime. The experimental results show that these three constructs for SSI clusters realized scalability, functionality and performance improvement. The cluster computing environment allows these constructs to cooperate implicitly so that they create a synergy effect at the SSI cluster system level and successfully provide a single system image to users and administrators.
A UML Profile for Goal-Oriented and Use Case-Driven Representation of NFRs and FRs
Authors: Sam Supakkul, Lawrence Chung
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In order for a software system to be of value, it should meet both functional requirements (FRs) and non-functional requirements (NFRs). Concerning FRs, UML has been used as the de facto object-oriented analysis and design notation. Concerning NFRs, the NFR Framework extends, and complements, UML, by treating NFRs as potentially conflicting or synergistic softgoals to be achieved, thereby allowing for the consideration of alternatives and analysis of trade-offs among the alternatives. Albeit the complementary nature of the two, UML and the NFR Framework offer two different notations - syntactically, semantically and visually, which makes it difficult to produce requirements models that integrate both FRs and NFRs. In this paper, we propose an integrated modeling language by extending UML with the NFR framework using the standard extension mechanism called UML profile where we define a metamodel to represent the concepts in the NFR Framework and identify the extension points for integrating the two notations. We also show how CASE tools may use this profile in building an integrated requirements model based on a model of the well known London ambulance case study.
User-Centred Design of Flexible Hypermedia for a Mobile Guide: Reflections on the HyperAudio Experience
Authors: Daniela Petrelli, Elena Not
Venue: User Modeling and User-Adapted Interaction (2005)

A user-centred design approach involves end-users from the very beginning. Considering users at the early stages compels designers to think in terms of utility and usability and helps develop a system based on what is actually needed. This paper discusses the case of HyperAudio, a context-sensitive adaptive and mobile museum guide developed in the late 1990s. User requirements were collected via a survey to understand visitors' profiles and visit styles in natural science museums. The knowledge acquired supported the specification of system requirements, helping define the user model, data structure and adaptive behaviour of the system. User requirements guided the design decisions on what could be implemented by using simple adaptable triggers, and what instead needed more sophisticated adaptive techniques. This is a fundamental choice when all the computation must be done on a PDA. Graphical and interactive environments for developing and testing complex adaptive systems are discussed as a further step in an iterative design process that considers the user interaction to be the central point. This paper discusses how such an environment allows designers and developers to experiment with different system behaviours and to widely test it under realistic conditions by simulating the actual context evolving over time. The understanding gained in HyperAudio is then considered from the perspective of later developments: our findings still appers to be valid despite the time that had passed.
Mesh Parameterization by Minimizing the Synthesized Distortion Metric with the Coefficient-Optimizing Algorithm
Authors: Jingqi Yan Xin Yang Pengfei Shi, David Zhang
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

The parameterization of a 3D mesh into a planar domain requires a distortion metric and a minimizing process. Most previous work has sought to minimize the average area distortion, the average angle distortion, or a combination of these. Typical distortion metrics can reflect the overall performance of parameterizations but discount high local deformations. This affects the performance of postprocessing operations such as uniform remeshing and texture mapping. This paper introduces a new metric that synthesizes the average distortions and the variances of both the area deformations and the angle deformations over an entire mesh. Experiments show that, when compared with previous work, the use of synthesized distortion metric performs satisfactorily in terms of both the average area deformation and the average angle deformation; furthermore, the area and angle deformations are distributed more uniformly. This paper also develops a new iterative process for minimizing the synthesized distortion, the coefficient-optimizing algorithm. At each iteration, rather than updating the positions immediately after the local optimization, the coefficient-optimizing algorithm first update the coefficients for the linear convex combination and then globally updates the positions by solving the Laplace system. The high performance of the coefficient-optimizing algorithm has been demonstrated in many experiments.
Remote Data Service Installation on a Grid-enabled Java Platform
Authors: Eduardo Blanco, Yudith Cardinale, Carlos Figueira, Emilio Hernandez, Robinson Rivas, Marta Rukoz
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

We define a framework for remote service installation, called SIMG (Service Installation Metaservice on Grids). Its main goal is to allow grid users to define and safely install their own data filters on remote data servers. Once installed, these filters may be used like the predefined services and may be available for a broader community of users. SIMG is implemented in SUMA/G, a Globus-enabled platform for remote execution of Java bytecode. We also present our experiences using SIMG for defining and remotely installing two complementary services in a Content- Based Image Retrieval system.
Simulation of error detection in computer programs
Authors: Norman F. Schneidewind, Thomas F. Green
Venue: ACM SIGSIM Simulation Digest (1976)

The relationship between computer program complexity and error detection capability is investigated by representing a program as a directed graph and simulating the detection and correction of errors. Variables of interest are test coverage, number of inputs, residual errors, execution time, correction time and node-arc-loop relationships. One application is in software design where the information provided by the model would be used to select program structures which are easy to test. A second application is in software testing where test strategies and allocation of test effort would be based on error detection and complexity considerations.
Checking Nested Properties Using Bounded Model Checking and Sequential ATPG
Authors: Qiang Qiang, Daniel G. Saab, Jacob A. Abraham
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

This paper develops a novel approach to formally verify nested VLSI circuit properties, using bounded model checking and gate-level sequential ATPG tools. This approach improves the verification quality by devising an algorithm that checks nested realistic properties. This makes ATPG verification based tools applicable to realistic properties. We also show that the performance of our approach is superior when compared to SAT-based techniques in both efficiency and capacity, especially for large bounds and for complex properties.
A Field-Programmable Analog Array Using Translinear Elements
Authors: David N. Abramson, Jordan D. Gray, Shyam Subramanian, Paul Hasler
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

A field programmable analog array that uses translinear elements for computation is introduced. The system uses floating-gate transistors to implement switch networks and MITEs to create reconfigurable translinear networks. The system architecture includes 3 MITE CABs, 1 specialized CAB for implementing four quadrant and dynamic functions, and a global switch matrix used to connect them. A squaring circuit, a square root circuit, a 2nd-order translinear loop, a vector magnitude circuit, and a 1st-order log-domain filter are programmed onto the device and results are presented in order to demonstrate the reconfigurability of the system.
Dissecting server-discovery traffic patterns generated by multiplayer first person shooter games
Authors: Sebastian Zander, David Kennedy, Grenville Armitage
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

We study the 'background traffic' resulting from tens of thousands of networked first person shooter (FPS) clients searching for servers on which to play. Networked, multiplayer games utilise the network in two distinct ways. Game play is typically built around a client-server communication model, and the resulting traffic patterns have been well studied to date. However, the discovery of available game servers is itself a client-server process. Operational game servers register themselves with well-known 'master servers', which are then queried by game clients looking for available servers. Game clients then probe the servers and retrieve information such as game type, number of other players, currently active map, and latency (ping time). We instrumented two active and public "Wolfenstein: Enemy Territory" servers over 20 weeks, developed a simple method to differentiate client probes from game-play traffic, and then characterized and contrasted the time-of-day, geographical distributions and traffic characteristics of both traffic types. We find that a significant amount of a server's traffic is probe traffic and the geographical origins are very different for both types of traffic. We propose techniques to improve server location and to decrease the amount of probe traffic.
Fully Automated Facial Symmetry Axis Detection in Frontal Color Images
Authors: Xin Chen, Patrick J. Flynn, Kevin W. Bowyer
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In this paper, we consider the problem of automatically detecting a facial symmetry axis in what we will call a standard human face image (acquired when the subject is looking directly into the camera, in front of a clean gray background under controlled illumination). Images of this kind are encountered in face recognition scenarios; this detection should facilitate more sophisticated facial image processing. The proposed method is based on GLDH (gray level difference histogram) analysis and consists of three components: (1) the face region detection stage crops an approximate face region out of the background, (2) symmetry detection discovers a vertical axis to optimally bisect the region of interest, assuming it is bilaterally symmetric, and (3) orientation adjustment aligns the angle of the symmetry axis with the orientation of the face. An implementation of the method is described, and results are presented. This detector's robust performance is evidenced by its success finding symmetry axes in more than 7,500 images collected from 600 distinct subjects. One of our method's most noteworthy contributions is that, according to our experimental results, many of the automatically detected axes are more accurate than the reference axes. Our automated detector is a powerful tool because it is not as susceptible to human error as its manual counterpart and, as the first application of its kind, it could potentially serve as a new biometric.
Commodity-based projection VR
Authors: Dave Pape, Josephine Anstey, Bill Sherman
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course teaches the details of building a moderate-cost, single-screen projection-based virtual reality system. It will cover the basics of virtual reality - stereoscopy, tracking, audio - and the options for implementing them with commodity hardware. Open source software to drive the system will also be discussed.
Business Intelligence - A Case Study in Life Insurance Industry
Authors: Zhenming Xu, Mia Zhang, Xiaodan Jiang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Business Intelligence by today is never a new technology instead of an integrated solution for businesses, within which the business requirement is definitely the key factor that drives technology innovation. A case study in life insurance industry is introduced in the paper, to demonstrates how innovative BI infrastructure and application could effectively address major business challenges in China life insurance industry and achieve operation excellence and business impact.
Effective Channel Time Analysis for Mobile Broadband Wireless Networks
Authors: Dennis Pong, Tim Moors
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper describes an algorithm designed to estimate the future cell throughput of a multi-rate wireless network based on measurements. The achievable throughput of a cell depends on the transmission rate used by the mobile nodes. We propose to use a measurement window to gauge the aggregate channel usage by multiple nodes over a period of time instead of predicting the movement and the rate of each node. It is found that the statistics of the average channel occupation time per frame follow the normal distribution. This offers a high degree of confidence in the prediction of cell throughput.
Ranking-Based Evaluation of Regression Models
Authors: Saharon Rosset, Claudia Perlich, Bianca Zadrozny
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We suggest the use of ranking-based evaluation measures for regression models, as a complement to the commonly used residual-based evaluation. We argue that in some cases, such as the case study we present, ranking can be the main underlying goal in building a regression model, and ranking performance is the correct evaluation metric. However, even when ranking is not the contextually correct performance metric, the measures we explore still have significant advantages: They are robust against extreme outliers in the evaluation set; and they are interpretable. The two measures we consider correspond closely to non-parametric correlation coefficients commonly used in data analysis (Spearman's ρ and Kendall's τ); and they both have interesting graphical representations, which, similarly to ROC curves, offer useful "partial" model performance views, in addition to a one-number summary in the area under the curve. We illustrate our methods on a case study of evaluating IT Wallet size estimation models for IBM's customers.
A Hybrid Parallel Loop Scheduling Scheme on Heterogeneous PC Clusters
Authors: Wen-Chung Shih, Chao-Tung Yang, Ping-I Chen, Shian-Shyong Tseng
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

Traditional loop-scheduling schemes are designed for homogeneous computing environments, and are probably not suitable for emerging heterogeneous PC clusters. This paper applies a two-phased method, named HPLS (Hybrid Parallel Loop Scheduling), to heterogeneous PC-cluster environments. The key idea is to distribute most of the workload to each node according to its performance, which is modeled and estimated in advance. Experiments on our testbed PCcluster showed that, in most cases, our method could reduce the execution time of application programs more than previous schemes could.
Source transformation, analysis and generation in TXL
Authors: James R. Cordy
Venue: Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (2006)

The TXL transformation framework has been widely used in practical source transformation tasks in industry and academia for many years. At the core of the framework is the TXL language, a functional programming language specifically designed for expressing source transformation tasks. TXL programs are self-contained, specifying and implementing all aspects of parsing, pattern matching, transformation rules, application strategies and unparsing in a single uniform notation with no dependence on other tools or technologies. Programs are directly interpreted by the TXL processor without any compile or build step, making it particularly well suited to rapid turnaround, test-driven development. In this paper we provide a practical introduction to using TXL in rapidly developing source transformations from concrete examples, and review experience in applying TXL to a number of practical large scale applications in source code analysis, renovation and migration.
Description Logics for Shape Analysis
Authors: Lilia Georgieva, Patrick Maier
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such programs involves reasoning about unbounded sets of graphs. Three-valued shape analysis (Sagiv et. al.) is an approach based on explicit manipulation of 3-valued shape graphs, which abstract sets of pointer graphs. Other approaches use symbolic representations, e. g., by describing (sets of) graphs as logical formulas. Unfortunately, many resulting logics are either undecidable or cannot express crucial properties like reachability and separation. In this paper, we investigate an alternative approach. We study well-known description logics as a framework for symbolic shape analysis. We propose a predicate abstraction based shape analysis, parameterized by description logics to represent the abstraction predicates. Depending on the particular logic chosen sharing, reachability and separation in pointer data structures are expressible.