ppxscal/embedding_network huggingface dataset:
Connector colouring I: Synchronisation and context dependency
Authors: Dave Clarke, David Costa, Farhad Arbab
Venue: Science of Computer Programming (2007)

Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and context-dependent behaviour. This paper proposes a scheme based on connector colouring for determining the behaviour of a Reo connector by resolving its context dependent synchronisation and mutual exclusion constraints. Colouring a Reo connector in a specific state with given boundary conditions (I/O requests) provides a means to determine the routing alternatives for data flow. Our scheme has the advantage over previous models in that it is simpler to implement and that it models Reo connectors more closely in terms of their envisaged semantics than existing formal models.
Performance comparison between statistical-based and direct data domain STAPs
Authors: Santana Burintramart, Tapan K. Sarkar, Yu Zhang, Michael C. Wicks
Venue: Digital Signal Processing (2007)

In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training data is preferred in this situation. In this paper, four versions of statistical-based and direct data domain STAPs are discussed and compared their performance when the number of training data is varied. The four statistical-based methods are the full-rank statistical method, the relative importance of the eigenbeam (RIE) method, the principle component generalized sidelobe canceller (GSC) method, and the cross-spectral GSC method. We will compare the performance of these four methods with that of the direct data domain least squares (D3LS) approach, which utilizes only one snapshot of data in its processing. The channel mismatch will be also introduced to all methods to evaluate their performance. It is found that to make the statistical-based methods work; we need to know the rank of the interference covariance matrix. And the D3LS performs better when the number of training data available for the statistical-based methods is less than the rank of the interference covariance matrix.
Analysis of the Medical Imaging Services at Three Hospitals of the Mexican National Health System
Authors: Joaquín Azpiroz-Leehan, Miguel Cadena Méndez, Fabiola Martínez Licona
Venue: Journal of Medical Systems (2007)

We present a study on the quality of operation and the characteristics of the medical imaging equipment in three specialty hospitals of the Mexican Health System. Six month residencies were carried out in order to better understand the problems and internal functioning of the three imaging departments. The kinds of equipment, the types of equipment failures and the internal operation of these services were analyzed. The results allow us to identify four factors that are linked to faults in the quality of the health care delivered to patients. The first factor is equipment obsolescence; the second is related to deficient preventive maintenance procedures and problems associated the supervising of external service providers. The third factor is derived from the equipment's (over) workload, which is indirectly tied to the age of the imaging modalities and the fourth factor is misuse of the equipment. The solutions to these problems include the modernization of the equipment and a better supervision by the clinical engineering department of all the processes involving the medical imaging services in each hospital. In addition to this, a special effort of the continuing education of personnel associated with medical imaging at all levels should be carried out.
Overcast: reliable multicasting with on overlay network
Authors: John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, James W. O'Toole,  Jr.
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's implementation as an overlay network. An overlay network consists of a collection of nodes placed at strategic locations in an existing network fabric. These nodes implement a network abstraction on top of the network provided by the underlying substrate network. Overcast provides scalable and reliable single-source multicast using a simple protocol for building efficient data distribution trees that adapt to changing network conditions. To support fast joins, Overcast implements a new protocol for efficiently tracking the global status of a changing distribution tree. Results based on simulations confirm that Overcast provides its added functionality while performing competitively with IP Multicast. Simulations indicate that Overcast quickly builds bandwidth-efficient distribution trees that, compared to IP Multicast, provide 70%-100% of the total bandwidth possible, at a cost of somewhat less than twice the network load. In addition, Overcast adapts quickly to changes caused by the addition of new nodes or the failure of existing nodes without causing undue load on the multicast source.
Abstractions for Real Real-time Systems
Authors: Mathai Joseph
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

From the earliest days, designers of real-time systems have had to decide how to manage the hardware-level mechanisms (such as interrupts and multi-level priorities) that have been provided to share the computing resources between competing demands. One approach is to ignore these mechanisms and use software techniques to schedule program segments; another is to align the software architecture with the hardware features, e.g. by dividing a program into tasks or processes that are scheduled dynamically according to hardware priorities. These are two of many possible engineering solutions to the problem of meeting the timing constraints of real-time programs. Looked at more formally, the problem is to prove that the implementation of the program, by whatever method is chosen, can be shown to satisfy its timing specifications. This is altogether harder to accomplish. Proofs at the program level require guarantees of timing properties at lower levels.
A 3-dimensional FEM Based Resistance Extraction
Authors: Subramanian Rajagopalan, Shabbir Batterywala
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Accurate extraction of parasitics is an important pre-cursor to timing and signal integrity analysis. In deep sub-miron technologies, the interconnect cross-section areas of metal at various points in a layer are no longer the same - the metal can be etched differently with varying width and spacings and/or the top-surface of the interconnect layer may be non-planar due to Chemical Mechanical Polishing(CMP). Morever, the cross-sections are also becoming increasingly trapezoidal in nature. In such a scenario, computing resistances using counting squares technique and other two-dimensional methods may no longer be accurate. At the same time, using highly accurate techinques such as a fine-grained Finite Element Method (FEM) may not be feasible due to the large computation time. In this work, a three-dimensional FEM based resistance extractor that is fast and accurate has been implemented and compared with two other extractors, a counting squares based extractor and a meshing based extractor. The key behind this is an efficient domain discretization which is a Conformal decomposition of the original geometry.
Routing with Minimized Slot Misordering for Delay Mitigation in TDMA based Sensor Networks
Authors: Fan Yu, Tao Wu, Subir Biswas
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper presents a Minimized Slot Misordered Routing (MSMR) technique for end-to-end delay mitigation in sensor networks with TDMA medium access control. MSMR targets delay sensitive and event based sensor network applications such as tactical surveillance, intrusion detection, and industrial process monitoring. Delay reduction in MSMR is accomplished by computing least cost routes with a link cost formulation based on the degree of misordering of the TDMA slots of nodes across a link. It is shown that in large sensor networks with low to moderate event generation rates, the proposed MSMR technique can significantly reduce the end-to-end event reporting delay compared to naïve minimum-hop routing. The paper also analyzes the energy-delay tradeoff for MSMR. It is demonstrated that due to its larger hop counts, at higher event rates, MSMR may give rise to undesirable queuing effects. To mitigate this, a Balanced MSMR protocol that can balance queuing delay and slot misordering delay is also proposed. Results demonstrate that for applications with higher event rates, the Balanced MSMR can achieve better delay performance than MSMR.
Interactive cross-detector analysis of vortical flow data
Authors: Raphael Burger, Philipp Muigg, Helmut Doleisch, Helwig Hauser
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

In this paper we discuss the application of multiple linked views for advanced vortex investigation in flow data. Local feature detectors and additional measures integrate into an interactive flow feature detection system based on multiple linked views. We discuss how linking and brushing of derived feature information can lead to increased performance in interactive feature analysis. In a case study we demonstrate how the possibility to integrate the information of multiple detectors leads to sound understanding of vortex type features. Enhanced credibility and combined advantages of several detectors can be achieved by uniting the results of multiple feature detectors in multiple coordinated views.
Extended abstract: towards verifying semistructured data
Authors: Gillian Dobbie, Jing Sun, Yuan Fang Li, Scott UK-Jin Lee
Venue: Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67 (2007)

Semistructured data is now widely used in both web applications and database systems. There are many research challenges in this area, such as data integration, change management, view definition, and data normalization. Traditionally in these areas a formalism is defined for the database model, and properties of the algorithms can be reasoned about, such as the dependency preserving property of the normalization algorithm in the relational data model. Because research into semistructured data is still in its infancy, many algorithms have been defined in this area and a number of formalisms have been proposed but there is no widely accepted formalism that is generally accepted to reason about the properties of the algorithms. Such a formalism must capture all the necessary semantics required to model the algorithms, should not be too complex, and should be easy to use.
Partial reflections: interactive virtual instruments controlled by sound
Authors: Andrew J. Johnston, Benjamin Marks
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this paper we describe two interactive virtual musical instruments that are controlled by sound. These instruments are based on virtual physical models that can be pushed and prodded by making sounds into a microphone. These models provide a mapping between acoustic sounds and computer-generated sounds and visuals.
A graphical user interface builder for Tk
Authors: Stephen A. Uhler
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

I will demonstrate a prototype graphical user interface builder for Tk that provides a direct manipulation interface for building, editing and testing Tk applications. A novel dynamic "smart-grid" combines the familiarity of a spreadsheet-like WYSIWYG interface, with the powerful constraint based geometry management capabilities of Tk to provide automatic widget alignment, distribution, and resize management capabilities.
Syncing Croquet with the Real World
Authors: Grit Schuster, Christine Strothotte, Carola Zwick
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

3D virtual environments like Croquet need to be attractive in order to be visited and used. Their attractiveness depends on the level of vitality that the user is able to experience. Vitality can only be recognized by constant changes, similiar to phenomena we know from nature like breathing. We introduce two sorts of vitality by which a virtual environment can be judged: active and passive vitality. By passive vitality we summarize all constant changes happening within the environment, while active vitality includes all personal expressions the user can perform. For creating both types of vitality within a virtual environment this virtual environment has to be synced with reality. With syncing we definitely do not mean to mimic the visual appearance of reality, but to create properties and behaviours corresponding to phenomena of the real world. By means of sensors and microcontrollers we build a technological bridge to dynamically sync data of the real world with their abstract representations within Croquet. Two example applications demonstrate the potential of this syncing method. The degree and extent of syncing reality affects the degree of attractivness because the user recognizes the virtual environment as vital and lively. This syncing method provides authentic information beyond simulation.
Object based image retrieval based on multi-level segmentation
Authors: Y. Xu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Currently, image retrieval systems are based on low-level features of color, texture and shape, not on the semantic descriptions that are common to humans, such as objects, people, and place. In order to narrow down the gap between the low level and semantic level, object-based content analysis, which segments the semantically meaningful objects of images, is an essential step. In this study, we propose a learning process in order to perform effective automatic off-line analysis on a multi-level segmented image stack. Meaningful objects are extracted given certain user search patterns and interest profiles. Color and/or shape information of the objects is stored in the hierarchical content representations of the images. This information is utilized by a hierarchical matching scheme to improve the retrieval speed in the subsequent searches.
Analysis of mammographic microcalcifications using a computationally efficient filter bank
Authors: T. O. Gulsrud
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a new method for classification of malignant and benign clusters of microcalcifications in digital mammograms. A computationally efficient infinite impulse response (IIR) quadrature mirror filter (QMF) bank is used as a tool for extracting texture and shape features. The filter bank splits the input image into four subbands: low-low band, low-high band, high-low band and high-high band. Texture and shape features based on cooccurrence matrices are computed from the subsampled subbands. The low-low band extracts the information of spatial dependence and the higher frequency bands extract the shape information. The results of an experimental study demonstrate that our approach drastically improves the overall performance compared to a manual system.
Fault-tolerant discrete-time linear time-invariant filters
Authors: C. N. Hadjicostis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Modular redundancy, the traditional approach to fault tolerance, is prohibitively expensive because of the overhead in replicating the hardware. In this paper we discuss alternative methods for obtaining fault-tolerant architectures for discrete-time (DT) linear time-invariant (LTI) filters. We view such filters as dynamic systems and provide fault tolerance to them by embedding their state into redundant state-spaces of higher dimensions. The embedding for a given filter is achieved systematically in a way that preserves the functionality of the filter, perhaps in some encoded form. The resulting redundant filtering architecture allows us to detect, identify and correct hardware failures by performing simple (linear) checks. As we show through examples, our approach generalizes previous schemes and leads to new, fault-tolerant architectures for DT LTI filtering.
Reasoning about safety properties in a JVM-like environment
Authors: Philip W. L. Fong
Venue: Science of Computer Programming (2007)

Type-based protection mechanisms in a JVM-like environment must be administrated by the code consumer at the bytecode level. Unfortunately, formulating a sound static type system for the full JVM bytecode language can be a daunting task. It is therefore counter-productive for the designer of a bytecode-level type system to address the full complexity of the VM environment in the early stage of design. In this work, a lightweight modelling tool, Featherweight JVM, is proposed to facilitate the early evaluation of bytecode-level, type-based protection mechanisms and, specifically, their ability to enforce security-motivated stack invariants and confinement properties. Rather than modelling the execution of a specific bytecode stream, Featherweight JVM is a nondeterministic event model that captures all the possible access event sequences that may be generated by a JVM-like environment when well-typed bytecode programs are executed. The effect of deploying a type-based protection mechanism can be modelled by a safety policy that constrains the event sequences produced by the VM model. To evaluate the effectiveness of the protection mechanism, security theorems in the form of state invariants can then be proved in the policy-guarded VM model. To demonstrate the utility of the proposed approach, Vitek et al.'s Confined Types has been formulated as a safety policy for the Featherweight JVM, and a corresponding confinement theorem has been established. To reduce class loading overhead, a capability-based reformulation of Confined Types is then studied, and is shown to preserve the confinement theorem. This paper thus provides first evidence on the utility of Featherweight JVM in providing early feedback to the designer of type-based protection mechanisms for JVM-like environments.
Reconceptualizing Generate thinkLets: the Role of the Modifier
Authors: Gwendolyn L. Kolfschoten, Eric L. Santanen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

For the past fifty years, the idea generation literature has been plagued by inconsistent findings concerning how best to achieve certain group outcomes. It is proposed that these findings are the result of specific and minute influences on the behavior of the group members or the resulting outcomes that have previously been overlooked. This paper reconceptualizes the idea generation process, breaking it down into a specific set of Generate thinkLets and associated Modifiers that can impact both group processes and their resulting outcomes. It is anticipated that this new reconceptualization will serve as a research springboard to help researchers exercise greater precision and potentially even resolve many of the conflicting findings that exist in the field of idea generation.
Application-controlled file caching policies
Authors: Pei Cao, Edward W. Felten, Kai Li
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

We consider how to improve the performance of file caching by allowing user-level control over file cache replacement decisions. We use two-level cache management: the kernel allocates physical pages to individual applications (allocation), and each application is responsible for deciding how to use its physical pages (replacement). Previous work on two-level memory management has focused on replacement, largely ignoring allocation. The main contribution of this paper is our solution to the allocation problem. Our solution allows processes to manage their own cache blocks, while at the same time maintains the dynamic allocation of cache blocks among processes. Our solution makes sure that good user-level policies can improve the file cache hit ratios of the entire system over the existing replacement approach. We evaluate our scheme by trace-based simulation, demonstrating that it leads to significant improvements in hit ratios for a variety of applications.
We teach that, don't we? Planning assessment and responding to the results
Authors: J. L. Newcomer
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes the initiation of an outcome based assessment process in the Engineering Technology Department at Western Washington University. It describes some of the standard difficulties of instituting outcome based assessment and how we have addressed them. In addition, it describes our process to this point, and our plan for the future. Finally, the paper elucidates how assessment has effected our programs, concentrating on changes to our Manufacturing Engineering Technology program. Overall, assessment has proceeded slowly, but it has brought positive changes to the Engineering Technology Department. 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
Multiplicative multi-lag high order ambiguity function
Authors: S. Barbarossa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The paper examines the performance analysis of a method for estimating the parameters of multicomponent polynomial-phase signals (PPS) embedded in white Gaussian noise. It initially describes the ambiguity problem arising with similar transforms when dealing with multicomponent PPS having the same highest order phase coefficients. This situation arises in a number of practical applications and is then worth of a careful analysis. A solution of the ambiguity problem is proposed based on a transformation called multiplicative multi-lag high order ambiguity function (MML-HAF). The theoretical performance of the method are evaluated and verified by simulation results.
A neural clustering and classification system for sales forecasting of new apparel items
Authors: Sébastien Thomassey, Michel Happiette
Venue: Applied Soft Computing (2007)

The Textile-Apparel-Distribution network actors require a very accurate production and sourcing management to minimize their costs and satisfy their customers. For a such strategy, distributors rely on sales forecasting system to respond to the versatile textile market. However, the specific constraints of the textile sales (numerous and new items, short lifetime) complicate the forecasting procedure and distributors prefer to use intuitive estimation methods of the sales rather than the existing forecasting models. We propose a decision aid system, based on neural networks, which automatically performs item sales forecasting. Performances of our model are evaluated using real data from an important French textile distributor.