ppxscal/embedding_network huggingface dataset:
Stylized Rendering for Anatomic Visualization
Authors: Tong-Yee Lee, Chung-Ren Yan, Ming-Te Chi
Venue: Computing in Science and Engineering (2007)

A nonphotorealistic rendering (NPR) technique can help medical practitioners visualize anatomic models and illustrate them with different stylizations. This technique provides potentially useful rendering alternatives to conventional volume or surface rendering in medical visualization. Improved performance allows interactive visualization of anatomic models, and additional stroke texture synthesis enriches medical object illustrations.
Performance modeling and system management for multi-component online services
Authors: Christopher Stewart, Kai Shen
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Many dynamic-content online services are comprised of multiple interacting components and data partitions distributed across server clusters. Understanding the performance of these services is crucial for efficient system management. This paper presents a profile-driven performance model for cluster-based multi-component online services. Our offline constructed application profiles characterize component resource needs and inter-component communications. With a given component placement strategy, the application profile can be used to predict system throughput and average response time for the online service. Our model differentiates remote invocations from fast-path calls between co-located components and we measure the network delay caused by blocking inter-component communications. Validation with two J2EE-based online applications show that our model can predict application performance with small errors (less than 13% for throughput and less than 14% for the average response time). We also explore how this performance model can be used to assist system management functions for multi-component online services, with case examinations on optimized component placement, capacity planning, and cost-effectiveness analysis.
Developers Shift to Dynamic Programming Languages
Authors: Linda Dailey Paulson
Venue: Computer (2007)

Because dynamic programming languages are flexible and allow writing more to-the-point code, developers are increasingly using them as an alternative to the more widely used static languages such as C++ and Java.
Real-time eye blink detection with GPU-based SIFT tracking
Authors: Marc Lalonde, David Byrns, Langis Gagnon, Normand Teasdale, Denis Laurendeau
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper reports on the implementation of a GPUbased, real-time eye blink detector on very low contrast images acquired under near-infrared illumination. This detector is part of a multi-sensor data acquisition and analysis system for driver performance assessment and training. Eye blinks are detected inside regions of interest that are aligned with the subject's eyes at initialization. Alignment is maintained through time by tracking SIFT feature points that are used to estimate the affine transformation between the initial face pose and the pose in subsequent frames. The GPU implementation of the SIFT feature point extraction algorithm ensures real-time processing. An eye blink detection rate of 97% is obtained on a video dataset of 33,000 frames showing 237 blinks from 22 subjects.
Channel noise recovery of images through anti-Gray coding technique
Authors: C. H. Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In anti-Gray codes, binary indexes are assigned to code vectors in a way that maximizes the average quantization distortion introduced in the reproduced source vectors when a transmitted index is corrupted by channel noise. In this paper, anti-Gray coding is used for VQ encoded images. Since the average distortion at the receiver is maximized by the anti-Gray coding technique, errors can be easily detected. To detect channel errors, we first classify an image into uniform and edge regions. Then we propose a mask to detect channel errors based on the image classification (uniform and edge regions) and anti-Gray code characteristics. We also mathematically derive criteria for error detection based on image classification. Once error indexes are detected, the recovered indexes can be easily chosen from a candidate set by minimizing the gray-level transition across the block boundaries in a VQ encoded image. Simulation results show that the proposed technique provides the detection results with less than 0.1% probability of error and more than 86.3% probability of detection at random bit error rate 0.1%. For those undetected errors, they appear invisible. In addition, the proposed approach provides a better PSNR performance than other similar techniques and pseudo-Gray codes for images under noisy channels.
Characterization of critical network components of coupled oscillators
Authors: Avelino Gonzalez, Annie S. Wu
Venue:  (2006)

This dissertation analyzes the fundamental limits for the determination of the network structure of loosely coupled oscillators based on observing the behavior of the network, specifically, node synchronization. The determination of the requisite characteristics and underlying behaviors necessary for the application of a theoretical mechanism for determining the underlying network topology in a network of loosely coupled natural oscillators are the desired outcome. To that end, this effort defines an analytical framework where key components of networks of coupled oscillators are isolated in order to determine the relationships between the various components. The relationship between the number of nodes in a network, the number of connections in the network, the number of connections of a given node, the distribution of the phases of the network, and the resolution of measurement of the components of the network, and system noise is investigated.
AEGIS: A Proactive Methodology to Shield against Zero-Day Exploits
Authors: Madhusudhanan Chandrasekaran, Mukarram Baig, Shambhu Upadhyaya
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Given the large number of vulnerability instances disclosed in various bug-tracking communities, system administrators face an up-hill task of protecting their system/ network against zero-day exploits. In order to safeguard against such exploits, the present challenges come in two-fold: (i) there exists a compelling need to assimilate configuration specific vulnerability information from various bug-tracking diaspora; also (ii) there is a need to proactively generate policy specific signatures which act as a first line of defense. In this paper we propose an automated approach for determining vulnerabilities pertinent to the current network/ system configuration using the information aggregated from different bug tracking communities. Such vulnerability assessment and indication mechanisms significantly alleviate the system administrator's burden of manual content digging for vulnerabilities in his own configuration context. Furthermore, we propose an Extensible Defense Oriented Representation Schema (EDORS) for vulnerability representation, which is subsequently used by the policy engine to generate appropriate signatures. As a result, the generated signatures can be viewed as a preventive interim security measure against recently published threats until its patch is released. We have also evaluated our framework through a series of experiments.
Clock synchronization for packet networks using a weighted least-squares error filtering technique and enabling circuit emulation service: Research Articles
Authors: James Aweya, Delfin Y. Montuno, Michel Ouellette, Kent Felske
Venue: International Journal of Communication Systems (2007)

Circuit emulation service (CES) allows time-division multiplexing (TDM) services (T1&#x002F;E1 and T3&#x002F;E3 circuits) to be transparently extended across a packet network. With circuit emulation over IP, for instance, TDM data received from an external device at the edge of an IP network is converted to IP packets, sent through the IP network, passed out of the IP network to its destination, and reassembled into TDM bit stream. Clock synchronization is very important for CES. This paper presents a clock synchronization scheme based on a double exponential filtering technique and a linear process model. The linear process model is used to describe the behaviour of clock synchronization errors between a transmitter and a receiver. In the clock synchronization scheme, the transmitter periodically sends explicit time indications or timestamps to a receiver to enable the receiver to synchronize its local clock to the transmitter's clock. A phase-locked loop (PLL) at the receiver processes the transmitted timestamps to generate timing signal for the receiver. The PLL has a simple implementation and provides both fast responsiveness (i.e. fast acquisition of transmitter frequency at a receiver) and significant jitter reduction in the locked state. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Inherent Time Redundancy (ITR): Using Program Repetition for Low-Overhead Fault Tolerance
Authors: Vimal Reddy, Eric Rotenberg
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

A new approach is proposed that exploits repetition inherent in programs to provide low-overhead transient fault protection in a processor. Programs repeatedly execute the same instructions within close time periods. This can be viewed as a time redundant re-execution of a program, except that inputs to these inherent time redundant (ITR) instructions vary. Nevertheless, certain microarchitectural events in the processor are independent of the input and only depend on the program instructions. Such events can be recorded and confirmed when ITR instructions repeat. In this paper, we use ITR to detect transient faults in the fetch and decode units of a processor pipeline, avoiding costly approaches like structural duplication or explicit time redundant execution.
Computer use among older adults in a naturally occurring retirement community
Authors: Brian D. Carpenter, Sarah Buday
Venue: Computers in Human Behavior (2007)

Though computers and the Internet offer an opportunity to enhance the lives of older adults, rates of computer use among older adults are low relative to other age groups. This study examined patterns of computer use and barriers to use among 324 residents living in a suburban naturally occurring retirement community (NORC). One-third (36%) of the residents were actively using computers. Residents currently using computers were more likely to be younger, with more education, fewer functional impairments, and greater social resources. Results from a multidimensional scaling analysis suggested that common uses fell along two dimensions: a solitary-social dimension and an obligatory-discretionary dimension. Barriers to more frequent use included cost, complexity, ergonomic impediments, and a lack of interest. Results from this study could inform the development of services by taking into account how older adults prefer to use computers and their perceptions of the technology. We include practical recommendations for program developers.
Active Filter with Current Operational Amplifiers for High-Speed Data Communications
Authors: David Kubanek
Venue: Proceedings of the Second International Conference on Systems (2007)

A high-speed active filter derived from the passive ladder structure is presented. It is based on integrators employing current operational amplifiers. These building blocks provide high bandwidth, low supply voltage and good noise immunity, which are necessary in modern communication systems. The proper operation of the filter is proved by computer simulation.
A comparative analysis of VoIP support for HT transmission mechanisms in WLAN
Authors: Sean Lawrence, Ashim Biswas, Anees A. Sahib
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The High Throughput (HT) 802.11n architecture is mainly aimed at exchanging large chunks of data using bit rates of 216Mbps in 20MHz and 432Mbps (or even higher) in 40MHz bandwidth respectively [1][3]. However, for real-time data streams with small payloads like VoIP the performance of 802.11n is not very impressive and performs worse than 802.11a, as we show in this report. In order to overcome this and to accelerate QoS packet transmission to multiple users simultaneously, TGnSync proposed a mechanism for multiuser packet aggregation in the downlink with multiple uplinking responses known as Multi Response Multiple Receiver Aggregate (MR-MRA). With the closure of the TGnSync group and the emergence of the EWC, an Intel backed 802.11n group, a second mechanism known as Power Save Multiple Poll (PSMP) to describe the Down Link Transmission (DLT) and Up Link Transmission (ULT) was introduced [2]. This report presents an analysis on the support for VoIP by an alternative virtual MIMO uplink mechanism that we call Simultaneous Coordinated Channel Access (SCCA) and the use of SCCA as a complimentary mechanism in the uplink to the MR-MRA and PSMP schemes to improve the throughput for multiuser transmissions. We show that the combined mechanisms MRASCCA and PSMP-SCCA are attractive solutions to meet the demand for QoS capacity over WLANs.
Mobile Home Automation - Merging Mobile Value Added Services and Home Automation Technologies
Authors: Andreas Rosendahl, J. Felix Hampe, Goetz Botterweck
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

In this paper we study mobile home automation, a field that emerges from an integration of mobile application platforms and home automation technologies. In a conceptual introduction we first illustrate the need for such applications by introducing a two-dimensional conceptual model of mobility. Subsequently we suggest an architecture and discuss different options of how a user might access a mobile home automation service and the controlled devices. As another contribution we implemented a mobile home automation service, which we named REMOTILE. This prototype helps us to discuss typical components, such as modules that integrate various home automation devices.
Secure public internet access handler (SPINACH)
Authors: Elliot Poger, Mary G. Baker
Venue: Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems (1997)

This paper describes a system that controls access to computer networks through publicly accessible LANs, enabling network administrators to authorize users either on a permanent or occasional basis. The system has been designed with minimal assumptions about the software and hardware required of users, and requires very little specialized equipment within the network infrastructure. We enumerate the requirements for such a system, describe the design and implementation of the system, and note tradeoffs between security and efficiency.
The computer defense immune system: current and future research in intrusion detection
Authors: K. P. Anchor, P. D. Williams, G. H. Gunsch, G. B. Lamont
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The Computer Defense Immune System is an artificial immune system for detecting computer viruses and network intrusions. This paper discusses the system architecture, presents current research and results in enhancing the system, and discusses planned future research topics that will be used to improve the system's capabilities.
Soft syntactic constraints for word alignment through discriminative training
Authors: Colin Cherry, Dekang Lin
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Word alignment methods can gain valuable guidance by ensuring that their alignments maintain cohesion with respect to the phrases specified by a monolingual dependency tree. However, this hard constraint can also rule out correct alignments, and its utility decreases as alignment models become more complex. We use a publicly available structured output SVM to create a max-margin syntactic aligner with a soft cohesion constraint. The resulting aligner is the first, to our knowledge, to use a discriminative learning method to train an ITG bitext parser.
A differential feedback synchronous residual time stamp decoder
Authors: T.-D. Tomlin, A. Cantoni
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The synchronous residual time stamp (SRTS) method is an approved method in asynchronous transfer mode (ATM) networks for encoding and transporting the constant bit rate (CBR) service clock. The method enables the strict the jitter and wander requirements of ITU-T Recommendation G.823/G.824 to be met. The method is also applicable to non ATM networks and applications other than CBR. We review a number of existing service clock recovery techniques for the SRTS method and compare them with a new timing recovery method, known as the differential feedback (DFB) SRTS method. The DFB SRTS method utilises a feedback system to regenerate the service clock with minimal jitter.
Real-Time Process Algebra with Stochastic Delays
Authors: J. Markovski, E. P. de Vink
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

A real-time process algebra is presented that features stochastic delays governed by general distributions. In a setting of weak choice, dependent and independent alternative and parallel composition are distinguished. This enables an expansion law for the parallel operator, as well as modular process definitions. The interplay of real-time, stochastic delays and immediate actions is illustrated by a modeling of the G/G/1/\infty queue.
Pex--An Intelligent Assistant for Rigorous Developer Testing
Authors: Wolfram Schulte
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Pex takes test-driven development to the next level. Pex analyzes .NET applications. From a parameterized unit test, which serves as a specification, it automatically produces traditional unit tests cases with high code coverage. Moreover, when a generated test fails, Pex can often suggest a bug fix. To do so Pex performs a systematic program analysis (similar to path bounded model-checking). It records detailed execution traces of test cases. Pex learns the program behavior from the traces, and a constraint solver produces new test cases with different behavior. The result is a minimal test suite with maximal code coverage.
Server Allocation Algorithms for Tiered Systems
Authors: Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Tarjan, Yunhong Zhou
Venue: Algorithmica (2007)

Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS metrics for these applications is the expected response time for the user. Since the expected response time in any tier depends upon the number of servers allocated to this tier, and a request's total response time is the sum of the response times over all the tiers, many different configurations (number of servers allocated to each tier) can satisfy the expected response-time requirement. Naturally, one would like to find the configuration that minimizes the total system cost while satisfying the total response-time requirement. This is modeled as a non-linear optimization problem using an open-queuing network model of response time, which we call the server allocation problem for tiered systems (SAPTS). In this paper we study the computational complexity of SAPTS and design efficient algorithms to solve it. For a variable number of tiers, we show that the decision version of SAPTS is NP-complete. Then we design a simple two-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS). If the number of tiers is a constant, we show that SAPTS is polynomial-time solvable. Furthermore, we design a fast polynomial-time exact algorithm to solve the important two-tier case. Most of our results extend to the general case in which each tier has an arbitrary response-time function.
SSH port forwarding
Authors: Giles Orr, Jacob Wyatt
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

SSH Port Forwarding allows the use of the encrypted SSH tunnel between hosts to forward information on connections that would not normally be encrypted. Using this powerful tool is initially daunting, but is fairly straight-forward when it is understood.
GenLOT optimization techniques for seismic data compression
Authors: L. C. Duval
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

GenLOT coding has been shown an effective technique for seismic data compression, especially when compared to block-based algorithms (such as JPEG), or to wavelets. The transforms remove statistical redundancy and permit efficient compression, when used with advanced encoding techniques, such as the embedded zerotree coding framework. We derive a model for seismic data based on auto-regressive processes. This model is used to design GenLOT filter banks optimized for seismic data, using objective optimization criteria.
Clustering Workflow Requirements Using Compression Dissimilarity Measure
Authors: Li Wei, John Handley, Nathaniel Martin, Tong Sun, Eamonn Keogh
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Xerox offers a bewildering array of printers and software configurations to satisfy the needs of production print shops. A configuration tool in the hands of sales analysts elicits requirements from customers and recommends a list of product configurations. This tool generates special question and answer case logs that provide useful historical data. Given the unusual semi-structured question and answer format, this data is not amenable to any standard document clustering method. We discovered that a hierarchical agglomerative approach using a compression-based dissimilarity measure (CDM) provided readily interpretable clusters. We compare this method empirically to two reasonable alternatives, latent semantic analysis and probabilistic latent semantic analysis, and conclude that CDM offers an accurate and easily implemented approach to validate and augment our configuration tool.
Asymmetric Agglomerative Hierarchical Clustering Algorithms and Their Evaluations
Authors: Akinobu Takeuchi, Takayuki Saito, Hiroshi Yadohisa
Venue: Journal of Classification (2007)

This paper presents asymmetric agglomerative hierarchical clustering algorithms in an extensive view point. First, we develop a new updating formula for these algorithms, proposing a general framework to incorporate many algorithms. Next we propose measures to evaluate the fit of asymmetric clustering results to data. Then we demonstrate numerical examples with real data, using the new updating formula and the indices of fit. Discussing empirical findings, through the demonstrative examples, we show new insights into the asymmetric clustering.