ppxscal/embedding_network huggingface dataset:
An Efficient TDMA Start-Up and Restart Synchronization Approach for Distributed Embedded Systems
Authors: Vilgot Claesson, Henrik Lonn, Neeraj Suri
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

A desired attribute in safety-critical embedded real-time systems is a system time and event synchronization capability on which predictable communication can be established. Focusing on bus-based communication protocols, we present a novel, efficient, and low-cost start-up and restart synchronization approach for TDMA environments. This approach utilizes information about a node's message length that forms a unique sequence to achieve synchronization such that communication overhead can be avoided. We present a fault-tolerant initial synchronization protocol with a bounded start-up time. The protocol avoids start-up collisions by deterministically postponing retries after a collision. We also present a resynchronization strategy that incorporates recovering nodes into synchronization.
A Comparison of Noise Removal Techniques in Songket Motif Images
Authors: Nursuriati Jamil, Zainab Abu Bakar, Tengku Mohd Tengku Sembok
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Noise removal or noise suppression is important as the results of the noise removal task have a strong influence on the quality of the following image processing techniques. In this paper, three popular filter that is mean, median and adaptive filters are tested on 25 images of songket motifs. Different sizes of the filter kernels are also used as it plays a factor in producing the desired results. Prior to noise removal, the images are subjected to preprocessing operations such as histogram stretching and image cleaning. To determine the performance of the noise removal, visual evaluation is performed.
Parallel Coordinates for Exploring Properties of Subsets
Authors: Gennady Andrienko, Natalia Andrienko
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

We describe our modifications of the technique of parallel coordinate plot for supporting visual exploration of object classes, in particular, resulting from cluster analysis. We strived at creating a tool that would be suitable for analysis of large datasets. The basic parallel coordinate plot technique with the traditional method for representing classes, multi-coloured brushing, fails to properly convey class-relevant information due to tremendous overlapping of lines. We have applied two general approaches to handling large amounts of data: aggregation and filtering. Thus, information concerning the distribution of characteristics in classes and the entire dataset is shown on parallel coordinates in an aggregated form. This is combined with displaying individual characteristics only for user-selected object subsets.
Bridging router performance and queuing theory
Authors: N. Hohn, D. Veitch, K. Papagiannaki, C. Diot
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

This paper provides an authoritative knowledge of through-router packet delays and therefore a better understanding of data network performance. Thanks to a unique experimental setup, we capture all packets crossing a router for 13 hours and present detailed statistics of their delays. These measurements allow us to build the following physical model for router performance: each packet experiences a minimum router processing time before entering a fluid output queue. Although simple, this model reproduces the router behaviour with excellent accuracy and avoids two common pitfalls. First we show that in-router packet processing time accounts for a significant portion of the overall packet delay and should not be neglected. Second we point out that one should fully understand both link and physical layer characteristics to use the appropriate bandwidth value.Focusing directly on router performance, we provide insights into system busy periods and show precisely how queues build up inside a router. We explain why current practices for inferring delays based on average utilization have fundamental problems, and propose an alternative solution to directly report router delay information based on busy period statistics.
Digital citizenship: parameters of the digital divide
Authors: Mack Shelley, Lisa Thrane, Stuart Shulman, Evette Lang, Sally Beisser, Teresa Larson, James Mutiti
Venue: Social Science Computer Review (2004)

This study presents results from a 2002 Midwest urban random sample survey (N = 167 adults). It is proposed that attitudes toward technology have a direct impact on digital citizenry and are colored by racial and educational differences. A path model showed several key results. Desire for computer skills increased among respondents with lower levels of educational attainment. Respondents with higher levels of education were more likely to use computers at home and work. Non-Whites were more likely than Whites to agree that technological information is key to citizen empowerment and that computers should be accessible to all citizens, as well as reporting increased interest in learning computer skills. Interest in developing computer skills was positively associated with digital citizenship. Viewing technology as a source of informational power was positively related to support for digital government and to support for computer access equity.
Increasing the Lookahead of Multilevel Branch Prediction
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Many techniques have been proposed for tolerating memory latency in future systems, including prefetching and Decoupled-Access DRAM (DA-DRAM) architectures. In order for these techniques to be effective they need to have a sufficient lookahead, i.e. to be far enough ahead of processor execution in requesting data. Branch prediction has been utilized before to achieve this but only small degrees of lookahead have been studied. This is not enough for latencies of tens to hundreds of clock cycles. In particular, DA-DRAM systems need a higher degree of decoupling because the access processor is placed in memory. This paper investigates the potential of multilevel prediction for increased lookahead, beyond the 2-3 level predictors that have been reported. A new multilevel predictor is defined and up to 8 levels of lookahead are studied. We find that the predictor has a high degree of accuracy, over 80%, even for integer benchmarks such as gcc and Oracle. Branch outcome as well as the address of the next instruction after the branch are predicted. A comparison of single and multiple lookup prediction is presented. In general, accuracy decreases with lookahead. However, given sufficient predictor size it can be made quite high. With the DA-DRAM predictor located in DRAM, a purely software predictor with storage in the DRAM can be implemented. A similar predictor can be used for instruction and L2 cache prefetching or trace scheduling. 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
Customizing Dependability Attributes for Mobile Service Platforms
Authors: Jun He, Matti A. Hiltunen, Richard D. Schlichting
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Mobile service platforms are used to facilitate access toenterprise services such as email, product inventory, or designdrawing databases by a wide range of mobile devicesusing a variety of access protocols. This paper presents aQuality of Service (QoS) architecture that allows flexiblecombinations of dependability attributes such as reliability,timeliness, and security to be enforced on a per servicerequest basis. In addition to components that implementthe underlying dependability techniques, the architectureincludes policy components that evaluate a request'srequirements and dynamically determine an appropriate executionstrategy. The architecture has been integrated intoan experimental version of iMobile, a mobile service platformbeing developed at AT&T. This paper describes the designand implementation of the architecture, and gives initialexperimental results for the iMobile prototype.
Detection of Microspheres in Venules for Automated Particle Image
Authors: Gang Dong, Edward Damiano, Michael L. Smith, Scott T. Acton, Klaus Ley
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this paper, we propose an automatic approach for detecting particle tracers (microspheres) in microscopic imagery obtained from mouse cremaster venules in vivo.Measurements of the translational speed and radial position of individual microspheresprovide the input data needed to extract velocity profiles from steady blood flow in venules.These profiles provide information about local hemodynamics that is critical to a broadrange of fields in microvascular physiology, including endothelial-cell mechanotransduction,inflammation, and microvascular resistance. In the preprocessing stage, an active contourmethod based on dynamic programming is used for vessel region extraction. Eachmicrosphere is then identified using a process of coarse segmentation followed byverification. Segmentation is achieved using a morphological method for microspheredetection while verification is achieved using an analytical model tailored to the microsphere.Experimental results are obtained using the proposed scheme and compared with previouslypublished manually acquired data.
Using history to enhance computing courses
Authors: John Impagliazzo, John A. N. Lee
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

In this poster, we describe how instructors can use history to enhance student learning in computer-related courses. The use of history relates events to people, places, and things.
Rapid application development with python and glade
Authors: David Reed
Venue: Linux Journal (2004)

When you're writing complicated business apps, spend more time on your business logic and let GladeGen do the rest. 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
Real-Time Matching of Angiographies with In Situ Heart Image Sequences
Authors: I. Nagy, A. Knoll, R. Bauernschmitt, E. U. Schirmbeck, H. Mayer
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Coronary angiography has become an important tool in modern medicine by providingan additional modality for heart disease diagnostics. Even though the recorded images (orimage sequences) are digitally available, their analysis is very elementary in nature in mostcases: the surgeon studies the angiograms before the operation, and operates without havingthem available in the operation room. It is up to the surgeon's memory to accurately rememberthe relevant details like locations of stenosis or occlusion. To improve both the analysisand the on-site availability of angiograms, but also to drastically increase the usefulness ofthe angiogram as a diagnostical modality, we present a novel approach which combines several advanced techniques into a single tool allowing real-time augmentation of in situ beating heart image sequences with the corresponding angiogram. The software toolset we developed so far contains the removal of specularities from the glossy heart surface and the reconstruction of the original image colors, color based coronary artery segmentation in beating heart image sequences, angiogram segmentation and symbolic representation, OpenGL based augmentation and visualization, Mass-Spring-NURBS-based soft tissue simulation. Future work will focus on developing robust matching techniques and on integrating the software tools into an operation room suitable hardware setup.
Cell Complexities in Hyperplane Arrangements
Authors: Boris Aronov, Micha Sharir
Venue: Discrete Computational Geometry (2004)

We derive improved bounds on the complexity, i.e., the total number of faces of all dimensions, of many cells in arrangements of hyperplanes in higher dimensions, and use these bounds to obtain a very simple proof of an earlier bound, due to Aronov, Matousek, and Sharir, on the sum of squares of cell complexities in such an arrangement.
The life of mammals
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

"The Life of Mammals" presents a fascinating and complete insight into this incredible group of animals. 422 Ltd. produced the content graphics for this vast project, allowing the viewer to witness amazing scenes, impossible to film. The aim was to produce subtle, realistic visuals that were unobtrusive yet have a definite stylistic quality. The Dinohyus sequence is a 3D reconstruction of a mammal now extinct. The interior of the Blue Whale shows the sheer enormity of the mammal's inner workings. Copyright held by creator.
Enhanced LIC Pencil Filter
Authors: Shigefumi Yamamoto, Xiaoyang Mao, Atsumi Imamiya
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper proposes an extension to the existing automatic pencil drawing generation technique based on Line Integral Convolution (LIC). The original LIC pencil filter utilizes image segmentation and texture direction detection techniques for defining outlines and stroke directions, and the quality of a resulting image depends largely on the result of image segmentation. It may fail to generate a reasonable result when the segmentation result is not consistent with the structure of the input image. To solve this problem, we propose in this paper to avoid the explicit region subdivision. Instead, we divide a source image into layers of successive intensity ranges, generate a stroke image for each layer, and add them together to obtain the final pencil drawing.
Shape Recovery Using Functionally Represented Constructive Models
Venue: Proceedings of the Shape Modeling International 2004 (2004)

We propose a method which helps to fit existing parameterizedfunction representation (FRep) models to a givendataset of 3D surface points. Best fitted parameters of themodel are obtained by using a hybrid algorithm combiningsimulated annealing and Levenberg-Marquardt methods.The efficiency of the approach is shown for recovery oftwo test items. We show through the CAD model processingan application of the proposed approach to the shape recoveryfollowed by finite element mesh generation and adaptation.
Policy-Based Autonomic Control Service
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Recently, there has been a considerable interest inpolicy-based, goal-oriented service management andautonomic computing. Much work is still required toinvestigate designs and policy models and associatemeta-reasoning systems for policy-based autonomicsystems. In this paper we outline a proposed autonomicmiddleware control service used to orchestrate self-healingof distributed applications. Policies are used toadjust the systems autonomy and define self-healingstrategies to stabilize/correct a given system in the eventof failures.
Compressing SOAP Messages by using Differential Encoding
Authors: Christian Werner, Carsten Buschmann, Stefan Fischer
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

A major drawback of using SOAP for applicationintegration is its enormous demand for network bandwidth.Compared to classical approaches like Java-RMI and Corba,SOAP messages typically cause more than three times morenetwork traffic. In this paper we will give a detailed surveyof state of the art binary encoding strategies for SOAP andintroduce a new experimental concept for SOAP compression,which makes use of the commonly available WSDL descriptionof a SOAP web service.
Cognitive and usability engineering methods for the evaluation of clinical information systems
Authors: Andre W. Kushniruk, Vimla L. Patel
Venue: Journal of Biomedical Informatics (2004)

Increasingly healthcare policy and decision makers are demanding evidence to justify investments in health information systems. This demand requires an adequate evaluation of these systems. A wide variety of approaches and methodologies have been applied in assessing the impact of information systems in health care, ranging from controlled clinical trials to use of questionnaires and interviews with users. In this paper we describe methodological approaches which we have applied and refined for the past 10 years for the evaluation of health information systems. The approaches are strongly rooted in theories and methods from cognitive science and the emerging field of usability engineering. The focus is on assessing human computer interaction and in particular, the usability of computer systems in both laboratory and naturalistic settings. The methods described can be a part of the formative evaluation of systems during their iterative development, and can also complement more traditional assessment methods used in summative system evaluation of completed systems. The paper provides a review of the general area of systems evaluation with the motivation and rationale for methodological approaches underlying usability engineering and cognitive task analysis as applied to health information systems. This is followed by a detailed description of the methods we have applied in a variety of settings in conducting usability testing and usability inspection of systems such as computer-based patient records. Emerging trends in the evaluation of complex information systems are discussed.
A Hybrid LOD Based Rendering Approach for Dynamic Scenes
Authors: Karsten Hilbert, Guido Brunnett
Venue: Proceedings of the Computer Graphics International (2004)

In this paper we present a novel LOD basedrendering approach that integrates geometry basedand image based LOD mechanisms in one system. Weassume that every LOD object in the scene isrepresented by a textured polygonal mesh. In apreprocess we generate a continuous multiresolutionmodel for all LOD objects. During runtime we firstcheck for every LOD object if an appropriate cachedapproximation generated for former frames isavailable. If not, we extract a new suitableapproximation out of the objects continuousmultiresolution model depending on view-dependentcriteria. After that, we replace this adaptive geometry-basedapproximation by an image-based impostor ifthis is reasonable and efficient. The selectedapproximations of LOD objects are used for renderingthe next frame.
Bounded Nonwandering Sets for Polynomial Mappings
Authors: M.-C. Li, M. Malkin
Venue: Journal of Dynamical and Control Systems (2004)

In this paper, we consider a class of polynomial mappings on Rm or Cm which is defined by the assumption that the delay equations induced by the mappings have leading monomials in a single variable. We show that for any mapping from this class, the nonwandering set is bounded while for all unbounded orbits, some kind of monotonicity takes place. The class under consideration is proved to contain, in particular, the generalized H&eacute;non mappings and the Arneodo&ndash;Coullet&ndash;Tresser mappings.
Homogeneity Induced Inertial Snake with Application to Medical Image Segmentation
Authors: Bipul Das, Swapna Banerjee
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Snakes or active contour model is used extensively for image segmentation in varied fields.However, some of its limitations restrict its use in many fields. This paper proposes a newhomogeneity controlled inertial force driven energy minimizing spline for tracking objectcontours. An inertial force apart from the first and second order continuity forces controls theproposed spline. The inertial force is in turn guided by a homogeneity criteria, defined basedon the initial location of the spline. This new force field pushes the snake through theconcavities and also against weak edge forces. A greedy snake has been used for computation of the energy minimizing spline. The algorithm has been tested on phantoms and ultrasound images as well. This algorithm can even be extended for textured image segmentation and many other areas, where the application of snake is restricted by its inability to conform to true edges or converge to concavities.
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
Authors: Vishnu Swaminathan, Krishnendu Chakrabarty
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Energy consumption is an important performance parameter forportable and wireless embedded systems. However, energy consumptionmust be carefully balanced with real-time responsivenessin hard real-time systems. We present an optimal offline dynamicvoltage scaling (DVS) scheme for dynamic power management insuch systems. A generalized network flow model for the uniprocessorDVS problem is developed and solved optimally using an efficientnetwork flow algorithm. The proposed method outperformsexisting DVS schemes for several popular embedded processorswhere the number of processor speeds is limited to a few values.The GNF model provides theoretical lower bounds on energy consumptionusing DVS in hard real-time systems.
CCMPerf: A Benchmarking Tool for CORBA Component Model Implementations
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Commercial off-the-shelf (COTS) middleware is nowwidely used to develop distributed real-time and embedded(DRE) systems. DRE systems are themselves increasinglycombined to form "systems of systems" thathave diverse quality of service (QoS) requirements. Earliergenerations of COTS middleware, such as Object RequestBrokers (ORBs) based on the CORBA 2.x standard,do not facilitate the separation of QoS policies from applicationfunctionality, which makes it hard to configureand validate complex DRE applications. The new generationof component middleware, such as the CORBAComponent Model (CCM) based on the CORBA 3.0 standard,addresses the limitations of earlier generation middlewareby establishing standards for implementing,packaging, assembling, and deploying component implementations.There has been little systematic empirical study of theperformance characteristics of component middleware implementationsin the context of DRE systems. This papertherefore provides three contributions to the studyof CCM for DRE systems. First, we describe the challengesinvolved in benchmarking different CORBA ComponentModel (CCM) implementations. Second, we describekey criteria for comparing different CCM implementationsusing key black-box and white-box metrics. Third,we describe the design of our CCMPerf benchmarkingsuite to illustrate test categories that evaluate aspectsof CCM implementation to determine their suitabilityfor the DRE domain. We demonstrate CCMPerf byusing it to collect metrics from a CCM implementation designedfor DRE applications.