ppxscal/embedding_network huggingface dataset:
Runtime Checking of UML Association-Related Constraints
Authors: Kun Wang, Wuwei Shen
Venue: Proceedings of the 5th International Workshop on Dynamic Analysis (2007)

UML class models are important design artifacts used as blueprints of software systems to be built. Yet, implementations are often inconsistent with their models. Although many techniques have been proposed to tackle this problem, some dynamic aspects of a class model are still hard to be verified using existing techniques. In this paper, we present an approach to checking the UML association-related constraints during a program's execution. Our approach instruments event notification mechanism into Java bytecode and verifies the constraints imposed by design-level associations (including compositions), when certain events occur. The empirical studies show that our approach can help efficiently detect inconsistencies between a UML class model and its implementation.
Coordinated thread scheduling for workstation clusters under windows NT
Authors: Matt Buchanan, Andrew A. Chien
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

Coordinated thread scheduling is a critical factor in achieving good performance for tightly-coupled parallel jobs on workstation clusters. We are building a coordinated scheduling system that coexists with the Windows NT scheduler which both provides coordinated scheduling and can generalize to provide a wide range of resource abstractions. We describe the basic approach, called "demand-based coscheduling", and implementation in the context of Windows NT. We report preliminary performance data characterizing the effectiveness of our approach and describe benefits and limitations of our approach.
e-Government in Transition Countries: Prospects and Challenges
Authors: Mysore Ramaswamy, Audrey N. Selian
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The implementation of e-government is a challenging task in any developed political context, but all the more uniquely so in the post-communist transitioning countries. These countries are struggling with the transformation of their legacy bureaucratic and administrative processes. In spite of the considerable literature on e-government, we still do not have a comprehensive, holistic framework in place that assesses the potential of e-government by taking into consideration all the critical dimensions. The complexity of government-to-constituent interactions needs to be analyzed comprehensively. In this paper, we analyze e-government interactions from two different perspectives. First, we de-construct the critical dimensions of a typical e-government interaction. Next, we conduct a step-by-step task decomposition to make realistic recommendations for opportunity areas that can be optimized through the inclusion of automated solutions. We aim to develop a framework for the evaluation of e-governance potential of transitioning countries and analyze the challenges from several perspectives.
Authentication in Transient Storage Device Attachments
Authors: Donald Rich
Venue: Computer (2007)

In addition to providing a platform for the authentication of transient storage devices, IEEE 1667 soles the problem of identifying a device's functionality and opening it to new uses.
Guest Editors' Introduction: Stochastic Modeling of Complex Systems
Authors: Daniel M. Tartakovsky, Dongbin Xiu
Venue: Computing in Science and Engineering (2007)

The guest editors for this special issue on stochastic modeling introduce the field and its current state of the art, along with the articles they've chosen to demonstrate the next steps forward.
Composable Language Extensions for Computational Geometry: A Case Study
Authors: Eric Van Wyk, Eric Johnson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions incorporate analyses and transformations that simplify the process of writing efficient and robust computational geometry programs and can be automatically added to a host language and used simultaneously. This is not possible in domain-specific language and library-based implementations of these features. One extension relies on characteristics of geometric algorithms to implement efficient exact-precision integers; the other employs a technique that symbolically perturbs geometric coordinates to safely and automatically handle degeneracies in the input data. These language extensions are implemented in an extensible language framework based on higher-order attribute grammars and forwarding. Attribute evaluation on the new language extension constructs is used to implement the static analysis and code transformations that enable the generation of efficient code.
Estimation of the Average Time of Computations of Probabilistic Algorithms with Continuous Time Parameter
Authors: Joanna Karbowska-Chilinska
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper computations of iterative probabilistic programs with continuous time parameter are investigated. The main goal is to propose a new method of determining the average time of probabilistic programs computations. Programs with continuous time parameter are considered as finite Markov processes. Therefore in the first method we use the popular solution based on Markov Process Theory. This method gives the precise results however its computational complexity is high. The second method is our original solution. We restrict number of a program states using the corresponding probabilistic program with discrete time parameter. Therefore we can use the estimation of the average computations time applied in discrete time case based on a transformation of a probabilistic program to the form with only one loop (a normal form).
Security issues in IPv6
Authors: R Radhakrishnan, Majid Jamil, Shabana Mehfuz, Moinuddin Moinuddin
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The current generation of IP, version 4 (IPv4), has been in use for more than 20 years, since its inception in 1980 and has supported the Internet's rapid growth during that time. IPv4 has proven to be robust, easily implemented and interoperable. This is a tribute to its initial design. However, the current Internet has grown much bigger than was anticipated. There are several problems such as impending exhaustion of the IPv4 address space, configuration complexities, and poor security at the IP level and inadequate QoS support for real-time delivery of data. To address these and other concerns, the Internet Engineering Task Force (IETF) has developed a suite of protocols and standards known as IP version 6 (IPv6). The new features introduced such as Auto-address configuration, End to End connectivity, mandatory support for security and mobility pose a great challenge on security for future networks based on IPv6. This paper identifies and examines security threats relating to the new features introduced in IPv6.
Weighted ordinal means
Authors: Anna Kolesárová, Gaspar Mayor, Radko Mesiar
Venue: Information Sciences: an International Journal (2007)

The concept of weighted ordinal arithmetic means and other related weighted ordinal means is studied. Based on the relevant results on the scale [0,1], new types of weighted ordinal means are proposed. In some cases these ordinal means coincide with those proposed by Godo and Torra, but not in the case when ordinal means introduced by them are not idempotent. Based on divisible ordinal t-conorms and modifying the approach of Godo and Torra, we show how the previously introduced weighted ordinal means can be obtained without exploiting the formal similarity of the structure of continuous t-conorms on [0,1] and divisible ordinal t-conorms.
Numerical solution of the acoustic wave equation using Raviart-Thomas elements
Authors: Eleanor W. Jenkins
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper we discuss the numerical approximation of the displacement form of the acoustic wave equation using mixed finite elements. The mixed formulation allows for approximation of both displacement and pressure at each time step, without the need for post-processing. Lowest-order and next-to-lowest-order Raviart-Thomas elements are used for the spatial discretization, and centered finite differences are used to advance in time. Use of these Raviart-Thomas elements results in a diagonal mass matrix for resolution of pressure, and a mass matrix for the displacement variable that is sparse with a simple structure. Convergence results for a model problem are provided, as are numerical results for a two-dimensional problem with a point source.
MOF-EMF Alignment
Authors: Maddeh Mohamed, Mohamed Romdhani, Khaled Ghedira
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

This paper explains the relationship between the MOF and EMF meta-models and describes the ATL transformation tool. Based on this specific mapping, general principles for transformation between these modelling frameworks are discussed and used to reflect on our current standardization work on MOF Query/View/Transformations (QVT) within the OMG's Model Driven Architecture initiative.
Predicting the distance between antibody&#x2019;s interface residue and antigen to recognize antigen types by support vector machine
Authors: Yong Shi, Xinyang Zhang, Jia Wan, Yong Wang, Wei Yin, Zhiwei Cao, Yajun Guo
Venue: Neural Computing and Applications (2007)

In this paper, a machine learning approach, known as support vector machine (SVM) is employed to predict the distance between antibody&#x2019;s interface residue and antigen in antigen&#x2013;antibody complex. The heavy chains, light chains and the corresponding antigens of 37 antibodies are extracted from the antibody&#x2013;antigen complexes in protein data bank. According to different distance ranges, sequence patch sizes and antigen classes, a number of computational experiments are conducted to describe the distance between antibody&#x2019;s interface residue and antigen with antibody sequence information. The high prediction accuracy of both self-consistent and cross-validation tests indicates that the sequential discovered information from antibody structure characterizes much in predicting the distance between antibody&#x2019;s interface residue and antigen. Furthermore, the antigen class is predicted from residue composition information that belongs to different distance range by SVM, which shows some potential significance.
The predictive embedded zerotree wavelet (PEZW) coder: low complexity image coding with versatile functionality
Authors: Jie Liang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We introduce the predictive embedded zerotree wavelet (PEZW) codec, an image coder that achieves good coding efficiency and versatile functionality with limited complexity requirement. Our complexity analysis showed that the memory requirement of this coder is less than 15 k bytes regardless of image sizes. Our simulation results also showed that the coding efficiency of this low complexity coder is competitive with the state of the art of wavelet coders that use whole image buffers. The PEZW coder described has been adopted in MPEG4 as its still texture coding tool and is currently a proposal to the evolving JPEG2000 standard.
Elementary Analysis of Energy Options for Resource Adequacy
Authors: Robert Entriken
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We examine a few elementary cases of forward contracting and a process by which capacity contracts with energy strike prices can lead to incentives for enhanced competition. To motivate and to better enhance the reader's understanding of the experiments in the body of this report, we provide an elementary analysis of markets for electricity capacity and energy. It is structured as a sequence of problems and potential solutions for a cast of characters: a Regulator, a Single Buyer, and either a monopoly supply or a duopoly of identical suppliers in a market. This paper lays out sufficient conditions for a competitive equilibrium in the face of inelastic demand using use of two types of contracts, with a monopoly supplier and a symmetric duopoly.
Teaching collaborative writing and peer review techniques to engineering and technology undergraduates
Authors: S. Nelson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

A recent survey of engineering professionals found that they spent 44% of their time writing, and almost all sometimes wrote as members of a team. Yet E&T students, who typically struggle with writing tasks, generally write as individuals and are evaluated only by their professors. This paper discusses a rationale and methods to provide students with experience in writing collaboratively and critiquing one another's writing. I argue that collaborative writing promotes active learning and provides students with experience working as part of a team. Peer review gives students experience in critical thinking and promotes editorial skills. These classroom techniques raise students' comfort level at having their work evaluated by others in a professional setting. Course evaluation feedback and follow-up surveying confirm that students who complete the course are more likely to write collaboratively in future courses, and students report that they will seek collaborative writing opportunities in the workplace. 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
Development and evaluation of value-based review (vbr) methods
Authors: Barry B. Boehm
Venue:  (2006)

Reviewing is a key activity that can find defects at an early stage of system and software development. Since it is often cheaper to fix defects at an early stage, reviewing is a good technique for improving both product quality and project cost effectiveness. Currently, there are many review techniques proposed and many experiments have been performed to compare the review techniques. However, to data there have been no review techniques or experiments that have focused explicitly on the relative business value or mission value of the artifacts being reviewed. In this dissertation, I provide Value-based review techniques adding cost effectiveness and value of each issue into review processes, and report on an experiment on Value-based review. I developed a set of VBR checklists with issues ranked by success-criticality, and a set of VBR processes prioritized by issue criticality and stakeholder-negotiated product capability priorities. The experiment involved 28 independent verification and validation (IV V) subjects (full-time working professionals taking a distance learning course) reviewing specifications produced by 18 real-client, full-time student e-services projects. The IV V subjects were randomly assigned to use either the VBR approach or the previous value-neutral checklist-based reading (CBR) approach that had been used in the course. The difference between groups was not statistically significant for number of issues reported, but was statistically significant for number of issues per review hour, total issue impact in terms of criticality and priority, and cost effectiveness in terms of total issue impact per review hour. For the latter, the VBRs were roughly twice as cost-effective as the CBRs. The dissertation also covers threats to validity and limitations of the experiment. Threats to validity were present but appear to have been adequately addresses. The main limitation of the experiment was its coverage of reviews by individuals as compared to groups. For reviewers by groups, it is likely that combinations of VBR and risk-driven forms of perspective-based review (PBR) approaches would be most cost-effective. This and other topics are attractive candidates for further research.
Dummynet and forward error correction
Authors: Luigi Rizzo
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

In this paper we present a couple of tools developed by the author on FreeBSD, and available from the author's Web page in source format. The first one, called dummynet, is a tool designed for the performance evaluation of network protocols and applications. Despite its original design goal, there has been a lot of interest on using dummynet as a bandwidth manager in network servers. dummynet simulates the effect of finite queues, bandwidth limitations, and queueing delays, and is embedded in the protocol stack of the host, allowing even complex experiments to be run on a single machine, using existing applications and protocol implementations. The second tool is a software implementation of an erasure code especially suited for use in network protocols. Erasure codes are used in Forward Error Correction (FEC) techniques to reduce or remove the need for retransmissions in presence of communiction errors. FEC has been rarely used in network protocols, because of the encoding/decoding overhead, and also because the underlying theory of error correcting codes is generally not well known to network researchers. In this paper we discuss the theory behind a simple erasure code, and provide performance data to show that the encoding/decoding overhead is acceptable for many applications even on low-end machines.
Some Unmixing Problems and Algorithms in Spectroscopy and Hyperspectral Imaging
Authors: Mark Berman
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

The automated identification and mapping of the constituent materials in a hyperspectral image is a problem of considerable interest. A significant issue is that the spectra at many pixels in such an image are actually mixtures of the spectra of the pure constituents. I review methods of "unmixing" spectra into their pure constituents, both when a "spectral library" of the pure constituents is available, and where no such library is available. Our own algorithms in both these areas are exemplified with a mineral and a biological example.
Reconstructing spatio-temporal activities of neural sources from magnetoencephalographic data using a vector beamformer
Authors: K. Sekihara
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We have developed a method suitable for reconstructing spatio-temporal activities of neural sources using MEG data. Our method is based on an adaptive beamformer technique. It extends a beamformer originally proposed by Borgiotti and Kaplan (1979) to a vector beamformer formulation in which three sets of weight vectors are used to detect the source activity in three orthogonal directions. The weight vectors of this vector-extension of the Borgiotti-Kaplan beamformer are then projected onto the signal subspace of the measurement covariance matrix to obtain a final form of the proposed beamformer's weight vectors. Our numerical experiments demonstrated the effectiveness of the proposed beamformer.
DSN 2007 Tutorials
Authors: Luis Rodrigues
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Tutorials are an important part of the DSN program. They provide an opportunity for attendees to acquire a basic understanding of, and familiarity with, several state of the art topics related to the dependability, security and resilience of systems and networks. Tutorial proposals providing guidance on how technology can be applied successfully in practical systems were particularly encouraged.
Comprehensive Check Image Reader
Authors: M. Shridhar, G. F. Houle, F. Kimura
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

A check contains more than just an amount. The fields of interests are courtesy and legal amounts, date, check number, MICR line, payer, payee, memo, signature, signature instruction, fractional validation numbers, endorsement, security features, etc. In fact a bank can literally construct a very meaningful profile of the account holder from an analysis of the checks written and received by an account holder. Since October 2005 the "Check 21" law defines an image of a check as being as valid as the original document. The agreement between banks is that a binary image 200-240 dpi is the most practical format to use. Since most banks are now creating images and must be able to handle incoming images it creates a need for new image tools to validate the quality and readability of each field. This paper describes the challenges in finding and recognizing the fields of interest on the broad document types. These fields contain machine printed and handwritten words. The remaining of the paper will focus on handwritten legal line recognition which remains the most challenging field.
Resource-Oriented Computing: Towards a Univeral Virtual Workspace
Authors: Jing-Ying Chen
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Emerging popular Web applications such as blogs and Wikipedia are transforming the Internet into a global collaborative environment where most people can participate and contribute. When resources created by and shared among people are not just content but also software artifacts, a much more accommodating, universal, and virtual workspace is foreseeable that can support people with diverse background and needs. To realize the goal, it requires not only necessary infrastructure support for resource deployment and composition, but also strategies and mechanisms to handle the implied complexity. We propose a service-oriented architecture in which arbitrary resources are associated with syntactical descriptors, called metaphors, based on which runtime services can be instantiated and managed. Furthermore, service composition can be achieved through syntactic metaphor composition. We demonstrate our approach via an e-Science workbench that allows user to access and combine distributed computing and storage resources in a flexible manner.
The solution of large problems in distributed computational media
Authors: V. V. Voevodin
Venue: Automation and Remote Control (2007)

Methods are investigated for the construction of computational media for the solution of large problems on accessible distributed inhomogeneous computer resources. The developed approaches form the basis of the X-Com system intended to perform large-scale metacomputer calculations. Principles of the system development are briefly described and results of the actual computations are given.