ppxscal/embedding_network huggingface dataset:
Combining Metrics Data and the Structure of UML Models using GIS Visualization Approaches
Authors: Christian Lange, Michel Chaudron
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

UML models describe the structure and behavior of existing or future software systems. In addition to the UML model, developers consult metrics and other attribute data for evaluation and analysis purposes. In hitherto techniques attribute data and structural data in the diagrams of the UML model is split in different representations. For the process of evaluation of a system the attribute data must be combined with the structural data. Geographical information systems (GIS) deploy visualization techniques to combine these different types of data. We propose a set of visualization techniques adopted from GIS to enrich UML models with attribute data. Advantages and examples of the visualizations are disussed, as well as limitations to the applicability. Especially the technique where colors represent attribute values of elements seems promising.
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
Authors: George Karypis
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We present a novel approach for decomposing contact/impact computations in which the mesh elements come in contact with each other during the course of the simulation. Effective decomposition of these computations poses a number of challenges as it needs to both balance the computations and minimize the amount of communication that is performed during the finite element and the contact search phase. Our approach achieves the first goal by partitioning the underlying mesh such that it simultaneously balances both the work that is performed during the finite element phase and that performed during contact search phase, while producing subdomains whose boundaries consist of piecewise axes-parallel lines or planes. The second goal is achieved by using a decision tree to decompose the space into rectangular or box-shaped regions that contain contact points from a single partition. Our experimental evaluation on a sequence of 100 meshes, shows that this new approach can reduce the overall communication overhead over existing algorithms.
Is ROI an effective approach for persuading decision-makers of the value of user-centered design?
Authors: Susan Dray, Clare-Marie Karat, Daniel Rosenberg, David Siegel, Dennis Wixon
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This panel examines the utility and effectiveness of various ways of making the business case for user-centered design (UCD). Most of the discussion in our field has assumed that measuring and demonstrating ROI for usability is the key to this effort. However, experience shows that the most brilliant ROI analysis may not win the day in the real world of business. Our panelists range from people who claim that ROI is an important persuasive tool as long as the communication about ROI is happening within a healthy business relationship, to people who claim that a focus on ROI can actually be destructive. We also explore the idea that there are important business contexts where ROI simply does not fit. Through the presentations by the panelists and through discussion of a business case scenario, we explore some alternatives to ROI in making the business case for user-centered design.
IEEE 802.11e&#x002F;802.11k wireless LAN: spectrum awareness for distributed resource sharing: Research Articles
Authors: Stefan Mangold, Zhun Zhong, Guido R. Hiertz, Bernhard Walke
Venue: Wireless Communications Mobile Computing (2004)

Coordinating priorities in wireless medium access is difficult when radio networks operate with contention-based medium access. Contention-based medium access protocols such as listen-before-talk are widely employed today, and for example used in the popular IEEE 802.11 protocol. Contention-based protocols are used for wireless communication in unreliable radio environments such as the unlicensed frequency bands with their typically irregular and unpredictable interferences. However, to support time-bounded traffic with a certain quality of service (QoS) support is extremely difficult, because it requires the knowledge of how aggressive other radio stations, which also contend for radio resources, access the medium. In this contribution, we discuss a new measurement in the IEEE 802.11k draft standard, together with the IEEE 802.11e draft standard for coordinating priorities. By combining the two extensions of IEEE 802.11, we develop an algorithm that allows radio stations to estimate the achievable throughput per radio station (the saturation throughput) in the presence of other radio stations. Our algorithm further allows predicting the saturation throughput per radio station in the presence of other non-802.11 radio networks, because it only relies on the information about how the medium is used by other stations, i.e. for what duration other stations have to sense the medium as idle before initiating transmissions. The algorithm does not require knowledge about the contention-parameters (like, e.g. minimum contention window sizes) used by other radio stations, and only relies on medium sensing information. For this reason, we refer to spectrum awareness in this work. We modify an existing model that was originally developed for calculating the saturation throughput in IEEE 802.11, to calculate the saturation throughput for IEEE 802.11e with one single priority. We then describe a new measurement, which is part of the IEEE 802.11k draft standard. The measurement provides information about medium access probabilities of other radio stations per contention window slots. These probabilities provide the information about how aggressive the medium is utilized by other stations. The probabilities are used in our model for approximating the saturation throughput per station and priority in the presence of other radio stations. As a result, with the help of the new model, a radio station is able to estimate its own expected saturation throughput. The comparison of the model with stochastic simulation stations indicates that our model approximates the saturation throughput per station and priority sufficiently in many scenarios, and hence allows to predict expected saturation throughputs per radio station. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The generic information extraction system
Authors: Jerry R. Hobbs
Venue: Proceedings of the 5th conference on Message understanding (1993)

An information extraction system is a cascade of transducers or modules that at each step add structure and often lose information, hopefully irrelevant, by applying rules that are acquired manually and/or automatically.
Byteprints: A Tool to Gather Digital Evidence
Authors: Sriranjani Sitaraman, Srinivasan Krishnamurthy, S. Venkatesan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we present techniques to recover useful information from disk drives that are used to store user data. The main idea is to use a logging mechanism to record the modifications to each disk block, and then employ fast algorithms to reconstruct the contents of a file (or a directory) as it existed sometime in the past. Such a consistent snapshot of a file may be used to determine whether a given file ever existed on disk, to undelete a file that was deleted long ago, or to obtain a timeline of activities on a file. This can also be used to validate that a file with given contents existed at some time in the past or to refute a claim that a file existed in a time interval. Information gathered using these consistent snapshots can be used as valuable digital evidence.
Simplified engineering analysis via medial mesh reduction
Authors: Murari Sinha, Krishnan Suresh
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Numerous simplification methods have been proposed for speeding up engineering analysis/ simulation. A recently proposed medial axis reduction is one such method, that is particularly well suited for analyzing thin solids, wherein a governing equation is reduced to the medial axis, leading to significantly smaller stiffness matrices. However, this method involves the non-trivial computation of a piece-wise C1 continuous medial axis that must closely approximate the exact medial axis.In this paper, we propose a new medial mesh reduction that is computationally more efficient than medial axis reduction in that it only requires a C0 continuous tessellation of the medial axis. However, the proposed method retains all the advantages of the explicit medial axis reduction including automation and guaranteed numerical convergence. Furthermore, as the medial mesh converges to the exact medial axis, the computed solution also converges to the exact dimensionally reduced solution. These claims are substantiated through numerical experiments in 2-D and 3-D.
Multiattribute decision making models and methods using intuitionistic fuzzy sets
Authors: Deng-Feng Li
Venue: Journal of Computer and System Sciences (2005)

The concept of intuitionistic fuzzy sets is the generalization of the concept of fuzzy sets. The theory of intuitionistic fuzzy sets is well suited to dealing with vagueness. Recently, intuitionistic fuzzy sets have been used to build soft decision making models that can accommodate imprecise information, and two solution concepts about the intuitionistic fuzzy core and the consensus winner for group decision-making have also been developed by other researchers using intuitionistic fuzzy sets. However, it seems that there is little investigation on multicriteria and/or group decision making using intuitionistic fuzzy sets with multiple criteria being explicitly taken into account. In this paper, multiattribute decision making using intuitionistic fuzzy sets is investigated, in which multiple criteria are explicitly considered, several linear programming models are constructed to generate optimal weights for attributes, and the corresponding decision-making methods have also been proposed. Feasibility and effectiveness of the proposed method are illustrated using a numerical example.
Productivity Metrics and Models for High Performance Computing
Authors: Thomas Sterling
Venue: International Journal of High Performance Computing Applications (2004)

Historically, high performance computing has been measured in terms of peak or delivered performance, and to a lesser extent to performance to cost. Such metrics fail to capture the impact on the usefulness and ease of use of such systems. Productivity has been identified as a new parameter for high end computing systems that include both delivered system performance and the programmability of the system. System productivity is directly affected by many factors contributing to the achieved performance, the speed with which users construct application programs, and the availability of the system to perform user applications. This paper explores the concept of productivity as a quantifiable; parameter through a series of analytical models and considers the factors that contribute to it.
HCI EDUCATION NEWS: HCI EDUCATION SURVEY NOW AVAILABLE
Authors: Jean B. Gasen, Gary Perlman
Venue: ACM SIGCHI Bulletin (1993)

The HCI Survey of Educational Programs is now available to colleges, faculty, and students. The survey, developed jointly by Gary Perlman and Jean Gasen, contains information about degree and non-degree programs, faculty, and courses on Human-Computer Interaction. The primary goal of the survey is to provide prospective students (particularly graduate students) information about educational opportunities, and secondarily to provide HCI educators information about other HCI educators. Unlike some of the other surveys, we wanted the HCI Education Survey to be easily updated and accessed primarily in electronic form. The cost of printing and mailing the survey and the widespread availability of electronic mail and personal computers made the collection and dissemination of an electronic report preferred over print media.
A Closed Form Solution to Direct Motion Segmentation
Authors: Rene Vidal, Dheeraj Singaraju
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a closed form solution to the problem of segmenting multiple 2-D motion models of the same type directly from the partial derivatives of an image sequence. We introduce the multibody brightness constancy constraint (MBCC), a polynomial equation relating motion models, image derivatives and pixel coordinates that is independent of the segmentation of the image measurements. We first show that the optical flow at a pixel can be obtained analytically as the derivative of the MBCC at the corresponding image measurement, without knowing the motion model associated with that pixel. We then show that the parameters of the multiple motion models can be obtained from the cross products of the derivatives of the MBCC at a set of image measurements that minimize a suitable distance function. Our approach requires no feature tracking, point correspondences or optical flow, and provides a global non-iterative solution that can be used to initialize more expensive iterative approaches to motion segmentation. Experiments on real and synthetic sequences are also presented.
Hallucinating Faces: TensorPatch Super-Resolution and Coupled Residue Compensation
Authors: Wei Liu, Dahua Lin, Xiaoou Tang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we propose a new face hallucination framework based on image patches, which integrates two novel statistical super-resolution models. Considering that image patches reflect the combined effect of personal characteristics and patch-location, we first formulate a TensorPatch model based on multilinear analysis to explicitly model the interaction between multiple constituent factors. Motivated by Locally Linear Embedding, we develop an enhanced multilinear patch hallucination algorithm, whichefficiently exploits the local distribution structure in the sample space. To better preserve face subtle details, we derive the Coupled PCA algorithm to learn the relation between high-resolution residue and low-resolution residue, which is utilized for compensate the error residue in hallucinated images. Experiments demonstrate that our framework on one hand well maintains the global facial structures, on the other hand recovers the detailed facial traits in high quality.
Analysis of Hardware Acceleration in Reconfigurable Embedded Systems
Authors: Matthew Ouellette, Dan Connors
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Embedded designers now have the capability of offloading software routines into custom application specific hardware blocks. This paper evaluates a domain-specific design system for configurable computing platforms that combine processors and configurable fabrics. Although the proposed work uses floating-point and communication primitives as the specific domain tasks evaluated, the reconfigurable computing platform and the design challenges addressed will become increasingly common in a number of embedded system environments. This paper explores the added cost of hardware resources, area, and power of moving software library routines into hardware blocks in a configurable embedded system based on the MicroBlaze soft processor.
Learning how to learn with web contents
Authors: Akihiro Kashihara, Shinobu Hasegawa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Learning Web contents requires learners not only to navigate the Web pages to construct their own knowledge from the contents learned at and between the pages, but also to control their own navigation and knowledge construction processes. However, it is not so easy to control the learning processes. The main issue addressed is how to help learners learn how to learn with Web contents. This paper discusses how to design a meta-learning tool.
A System Architecture for Real-Time Imaging of Nano-Scale Viruses using Remote AFM
Authors: Azam Ghafoor, Samir M. Iqbal, Rashid Bashir
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

Recent advances in telepathology, telemicroscopy, and telemedicine have opened new avenues for collaboration in medical care and scientific research. Such technology allows remote scientists and physicians to visualize and investigate biological samples in real-time. Imaging of biological specimens requires micro and even nano-scale resolution for which Atomic Force Microscope (AFM) provides unprecedented capabilities. However, AFM has some limitations in particular, the probing hardware of AFM can introduce noise in the captured images. Robust image processing techniques are needed for accurate nano-scale representation and visualization of images generated by AFM. In this paper, we present a real-time architecture for an integrated remote AFM-based imaging system. The proposed architecture allows real-time control of a remotely located AFM and enables capturing, processing and communication of AFM images over the network. The architecture consists of four major components including, a remote AFM and real-time controller module, an image processing module for real-time image correction, a client system for visualization of scanned biological images, and a distributed image database system for information retrieval, classification, and archiving of biological specimen images received from remote AFM.
A Tableau-Based Decision Procedure for a Fragment of Set Theory with Iterated Membership
Authors: Domenico Cantone, Calogero G. Zarba, Rosa Ruggeri Cannata
Venue: Journal of Automated Reasoning (2005)

MLSS is a decidable fragment of set theory involving the predicates membership and set equality and the operators union, intersection, set difference, and singleton. In this paper we extend MLSS with the iterated membership predicate, that is, with a predicate denoting the transitive closure of the membership relation. We call the resulting language MLSS+. We prove that MLSS+ is decidable by providing a decision procedure for it based on Smullyan semantic tableaux. As an application of our results, we show how our decision procedure can be used as a black box in order to allow an interactive theorem prover to verify some basic properties of the ordinal numbers.
Web-based remote manipulation in advanced manufacturing system
Authors: Dan Zhang, Lihui Wang
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

In this paper, a Web-based collaborative framework is proposed. With appropriate open architecture for effective collaboration among a dispersed engineering team, the Web-based digital Shop Floor can serve real-time data from bottom up and can function as a constituent component of e-manufacturing for remote monitoring and control. This paper presents the basis of the framework for building web-based collaborative systems that can be used for distributed manufacturing. A proof-of-concept prototype system is developed on top of the framework to demonstrate one of its potential applications on shop floor monitoring and control.
Capturing human motion using body-fixed sensors: outdoor measurement and clinical applications: Research Articles
Authors: Kamiar Aminian, Bijan Najafi
Venue: Computer Animation and Virtual Worlds (2004)

Motion capture is mainly based on standard systems using optic, magnetic or sonic technologies. In this paper, the possibility to detect useful human motion based on new techniques using different types of body-fixed sensors is shown. In particular, a combination of accelerometers and angular rate sensors (gyroscopes) showed a promising design for a hybrid kinematic sensor measuring the 2D kinematics of a body segment. These sensors together with a portable datalogger, and using simple biomechanical models, allow capture of outdoor and long-term movements and overcome some limitations of the standard motion capture systems. Significant parameters of body motion, such as nature of motion (postural transitions, trunk rotation, sitting, standing, lying, walking, jumping) and its spatio-temporal features (velocity, displacement, angular rotation, cadence and duration) have been evaluated and compared to the camera-based system. Based on these parameters, the paper outlines the possibility to monitor physical activity and to perform gait analysis in the daily environment, and reviews several clinical investigations related to fall risk in the elderly, quality of life, orthopaedic outcome and sport performance. Taking advantage of all the potential of these body-fixed sensors should be promising for motion capture and particularly in environments not suitable for standard technology such as in any field activity. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Towards aspect weaving applications
Authors: Carine Courbis, Anthony Finkelstein
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software must be adapted to accommodate new features in the context of changing requirements. In this paper, we illustrate how applications with aspect weaving capabilities can be easily and dynamically adapted with unforseen features. Aspects were used at three levels: in the context of semantic analysers, within a BPEL engine that orchestrates Web Services, and finally within BPEL processes themselves. Each level uses its own tailored domain-specific aspect language that is easier to manipulate than a general-purpose one (close to the programming language) and the pointcuts are independent from the implementation.
Dynamic Critical Path Scheduling Parallel Programs onto Multiprocessors
Authors: Mourad Hakem, Franck Butelle
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamic Critical Path Scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time complexity of O(e + v log v), as opposed to DSC algorithm O((e + v) log v) which is the best known algorithm.
Java event broadcasting in CSCW environment
Authors: Chien-Min Wang, Shun-Te Wang, Shyh-Fong Hong, Hsi-Min Chen
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

A collaborative computing environment supports groups of people as they cooperate to achieve their goals. In this paper we investigate the issues on event broadcasting in Java collaborative computing environments. We address how these issues happen and propose solutions for them.
Singularities of Monotone Vector Fields and an Extragradient-type Algorithm
Authors: O. P. Ferreira, L. R. Pérez, S. Z. Néth
Venue: Journal of Global Optimization (2005)

Bearing in mind the notion of monotone vector field on Riemannian manifolds, see [12--16], we study the set of their singularities and for a particularclass of manifolds develop an extragradient-type algorithm convergent to singularities of such vector fields. In particular, our method can be used forsolving nonlinear constrained optimization problems in Euclidean space, with a convex objective function and the constraint set a constant curvature Hadamard manifold. Our paper shows how tools of convex analysis on Riemannian manifolds can be used to solve some nonconvex constrained problem in a Euclidean space.