ppxscal/embedding_network huggingface dataset:
Matrix-Stripe-Cache-Based Contiguity Transform for Fragmented Writes in RAID-5
Authors: Sung Hoon Baek, Kyu Ho Park
Venue: IEEE Transactions on Computers (2007)

Given that contiguous reads and writes between a cache and a disk outperform fragmented reads and writes, fragmented reads and writes are forcefully transformed into contiguous reads and writes via a proposed matrix-stripe-cache-based contiguity transform (MSC-CT) method which employs a rule of consistency for data integrity at the block level and a rule of performance that ensures no performance degradation. MSC-CT performs for reads and writes, both of which are produced by write requests from a host as a write request from a host employs reads for parity update and writes to disks in a redundant array of independent disks (RAID)-5. MSC-CT is compatible with existing disk technologies. The proposed implementation in a Linux kernel delivers a peak throughput that is 3.2 times higher than a case without MSC-CT on representative workloads. The results demonstrate that MSC-CT is extremely simple to implement, has low overhead, and is ideally suited for RAID controllers not only for random writes but also for sequential writes in various realistic scenarios.
A high-throughput modular architecture for three-step search block matching motion estimation
Authors: Hangu Yeo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The three-step hierarchical search block matching motion estimation algorithm has played an important role in low bit rate video coding because of its low computation complexity compared to the full search block matching motion estimation algorithm (FBMA). A modular architecture for the three-step hierarchical search BMA is presented, which features a throughput rate, as high as 1/N block per clock cycle, and a low memory bandwidth with random access on-chip local memory. Furthermore, 100% processor utilization has been achieved by using a method called pipeline interleaving. As such, this architecture offers a feasible solution for the Grand Alliance HDTV picture format with a large search range.
Experimental Risk Assessment and Comparison Using Software Fault Injection
Authors: R. Moraes, J. Duraes, R. Barbosa, E. Martins, H. Madeira
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

One important question in component-based software development is how to estimate the risk of using COTS components, as the components may have hidden faults and no source code available. This question is particularly relevant in scenarios where it is necessary to choose the most reliable COTS when several alternative components of equivalent functionality are available. This paper proposes a practical approach to assess the risk of using a given software component (COTS or non-COTS). Although we focus on comparing components, the methodology can be useful to assess the risk in individual modules. The proposed approach uses the injection of realistic software faults to assess the impact of possible component failures and uses software complexity metrics to estimate the probability of residual defects in software components. The proposed approach is demonstrated and evaluated in a comparison scenario using two real off-the-shelf components (the RTEMS and the RTLinux real-time operating system) in a realistic application of a satellite data handling application used by the European Space Agency.
Identification and Recognition of Objects in Color Stereo Images Using a Hierachial SOM
Authors: Giovanni Bertolini, Stefano Ramat
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Identification and recognition of objects in digital images is a fundamental task in robotic vision. Here we propose an approach based on clustering of feature extracted from HSV color space and depth, using a hierarchical self organizing map (HSOM). Binocular images are first preprocessed using a watershed algorithm; adjacent regions are then merged based on HSV similarities. For each region we compute a six element features vector: median depth (computed as disparity), median H, S, V values, and the X and Y coordinates of its centroid. These are the input to the HSOM network which is allowed to learn on the first image of a sequence. The trained network is then used to segment other images of the same scene. If, on the new image, the same neuron responds to regions that belong to the same object, the object is considered as recognized. The technique achieves good results, recognizing up to 82% of the objects.
Architecture-Level Soft Error Analysis: Examining the Limits of Common Assumptions
Authors: Xiaodong Li, Sarita V. Adve, Pradip Bose, Jude A. Rivers
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This paper concerns the validity of a widely used method for estimating the architecture-level mean time to failure (MTTF) due to soft errors. The method first calculates the failure rate for an architecture-level component as the product of its raw error rate and an architecture vulnerability factor (AVF). Next, the method calculates the system failure rate as the sum of the failure rates (SOFR) of all components, and the system MTTF as the reciprocal of this failure rate. Both steps make significant assumptions. We investigate the validity of the AVF+SOFR method across a large design space, using both mathematical and experimental techniques with real program traces from SPEC 2000 benchmarks and synthesized traces to simulate longer real-world workloads. We show that AVF+SOFR is valid for most of the realistic cases under current raw error rates. However, for some realistic combinations of large systems, long-running workloads with large phases, and/or large raw error rates, the MTTF calculated using AVF+SOFR shows significant-discrepancies from that using first principles. We also show that SoftArch, a previously proposed alternative method that does not make the AVF+SOFR assumptions, does not exhibit the above discrepancies.
Upper bounds for the infinity norm of the inverse of SDD and S-SDD matrices
Authors: Nenad Morača
Venue: Journal of Computational and Applied Mathematics (2007)

An easily calculable upper bound for the infinity norm of the inverse of S-strictly diagonally dominant (S-SDD) matrices, introduced by Gao and Wang in 1992, is obtained in this paper. Applying that bound to SDD matrices, we improve the Varah bound. We also introduce an iterative procedure for obtaining sharper bounds, accompanied with some open questions.
Performance analysis of PIC-CDMA systems
Authors: Y. D. Li, T. T. Tjhung
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

We present a closed-form bit error rate (BER) expression for multistage parallel interference cancellation (PIC) schemes implemented in asynchronous direct-sequence code division multiple access (DS-CDMA) systems over Nakagami multipath fading channels. Instead of the conventional standard Gaussian approximation (SGA) approach, we adopt an improved Gaussian approximation (IGA) method, which takes into account the second order effects of the multiple access interference (MAI), to derive the BER expression. We show by Monte Carlo (MC) simulation that the derived expression indeed gives an accurate prediction of the error performance of PIC-DS-CDMA systems. The BER formula presented can be used to alleviate extensive computer simulation usually required for performance evaluation of PIC-DS-CDMA systems.
Energy efficient hardware-software co-synthesis using reconfigurable hardware
Authors: Viktor K. Prasanna
Venue:  (2006)

With reconfigurable hardware widely adopted by many complicated embedded systems, energy efficient application development using reconfigurable hardware has become very challenging. This thesis makes the following four major contributions. First of all, a high-level hardware-software co-development framework is proposed. Rapid hardware-software development and co-simulation can be performed within the high-level framework. An energy performance modeling technique is proposed which can capture the energy dissipation behavior and energy management techniques of the various hardware components available on modern reconfigurable hardware. Then, based on these high-level energy performance models, a dynamic programming based optimization algorithm is proposed to minimize the energy dissipation of the system. By utilizing the simulation results obtained from the high-level co-development framework, a two-step high-level energy estimation is proposed. On the one hand, we employ an instruction-level energy estimation technique to estimate the energy dissipation of the software programs running on processors. On the other hand, a domain-specific modeling technique is used to estimate the energy dissipation of the customized hardware peripherals attached to the processor. A Cooperative MAnagement (COMA) technique is proposed for energy efficient implementation of real-time OS using reconfigurable hardware. A hardware peripheral for power management is attached to the processor and manages the operating states of the various hardware components (including the processor) based on the execution status of the operating system.
A new 3D segmentation method for region-based video coding
Authors: Hang-Bong Kang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A 3D segmentation is important for finding correspondences in region-based video coding. One approach is to extract 3D connected volume from an image sequence. However, this approach often generates undesirable 3D volume because of object's fast movement, noise, side effects from pre-processing result and newly appeared objects. In order to avoid these undesirable results, we propose a new 3D segmentation method for extracting virtual 3D connected volume instead of real 3D connected volume. Our approach consists of intraframe mode and interframe mode segmentation. For intraframe mode, we use a modified 2D watershed algorithm on a simplified image. For interframe mode, we detect frame difference from two images. Then, previous segmented results are projected into the area where no frame difference is occurred. For the other area, we extract markers and find correspondences. To reduce search area for finding correspondences, we use three constraints like spatial, temporal and smoothness constraint. 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
Local \beta-Crusts for Simple Curves Reconstruction
Authors: Sebastien Bougleux, Mahmoud Melkemi, Abderrahim Elmoataz
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In this paper, we consider the problem of curve reconstruction from a finite planar set of points. To solve this problem, we propose to use a family of neighborhood graphs included in the Gabriel graph. The neighborhood that we use is the â-neighborhood, initially defined in the context of circle-based â-skeletons, but applied to edges of the Voronoi diagram. This family of graphs includes the local crust. This formulation enables us to design effective algorithms to reconstruct curves, by using as a prior knowledge that the curves to be reconstructed are without intersections. We show, through several examples, that the proposed algorithms improve the results obtained with the local crust, when the set of points is of low density.
An efficient demand-driven and density-controlled publish/subscribe protocol for mobile environments
Authors: Doug Lundquist, Aris Ouksel
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

A protocol for high-density Mobile Ad Hoc Networks (MANETs) is presented. Subscription-Based Permission (SP) routing extends Self-Balancing Supply/Demand (SBSD) protocols, which combine the Publish/Subscribe paradigm and demand-controlled flooding. The goal of SP is to reduce redundant broadcasting without sacrificing coverage, by exploiting high density. SP defines &eta; sets of brokers, each set refusing to accept replicas of a fraction (1/&eta;) of all subscription types. The value of &eta; is determined such that each set is expected to comprise a connected dominating set. Given a theoretical mobile device population N0 sufficient to achieve one connected dominating graph and an actual network population N > N0, we show that SBSD-SP increases subscription propagation areas by a factor of (N/N0) without materially sacrificing reachability. This improves network throughput by a factor of (N/N0), as publications are delivered to (N/N0) times as many brokers.
Sinhala grapheme-to-phoneme conversion and rules for schwa epenthesis
Authors: Asanka Wasala, Ruvan Weerasinghe, Kumudu Gamage
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper describes an architecture to convert Sinhala Unicode text into phonemic specification of pronunciation. The study was mainly focused on disambiguating /schwa/ and /a/ vowel epenthesis for consonants, which is one of the significant problems found in Sinhala. This problem has been addressed by formulating a set of rules. The proposed set of rules was tested using 30,000 distinct words obtained from a corpus and compared with the same words manually transcribed to phonemes by an expert. The Grapheme-to-Phoneme (G2P) conversion model achieves 98% accuracy.
Integrating the humanities with engineering through a course in the rise of modern science
Authors: S. S. Scott, J. Riddle
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The goal of integrating the humanities with engineering education is implied by the ABET requirement that "the humanities and social sciences must be planned to reflect a rationale or fulfil an objective appropriate to the engineering profession and course work in the humanities and social sciences must be an integral part of the engineering program." One way to integrate the humanities into engineering curricula is by creating humanities courses which are integrated with science and engineering courses taken in the freshman year. We modified an existing history course on the rise of modern science so that it was integrated with the first physics course (mechanics) taken by engineers. Integration with the physics course was accomplished in two ways. The course material for both courses deals with the same material-Newton's laws, the discoveries of Galileo, Hooke, Keppler, etc. The physics course concentrates on the mathematics of these discoveries and their physical applications, while the history course focuses on the cultural environment and consequences of these discoveries. Secondly, there is chronological integration-students study the times of Newton and other discoverers at the same time they are studying about their laws. This paper contains a description of this course, a post-mortem of what worked and what did not, the results of an assessment, and recommendations for the design of such courses in the future.
A first look at modern enterprise traffic
Authors: Ruoming Pang, Mark Allman, Mike Bennett, Jason Lee, Vern Paxson, Brian Tierney
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

While wide-area Internet traffic has been heavily studied for many years, the characteristics of traffic inside Internet enterprises remain almost wholly unexplored. Nearly all of the studies of enterprise traffic available in the literature are well over a decade old and focus on individual LANs rather than whole sites. In this paper we present a broad overview of internal enterprise traffic recorded at a medium-sized site. The packet traces span more than 100 hours, over which activity from a total of several thousand internal hosts appears. This wealth of data--which we are publicly releasing in anonymized form--spans a wide range of dimensions. While we cannot form general conclusions using data from a single site, and clearly this sort of data merits additional in-depth study in a number of ways, in this work we endeavor to characterize a number of the most salient aspects of the traffic. Our goal is to provide a first sense of ways in which modern enterprise traffic is similar to wide-area Internet traffic, and ways in which it is quite different.
Eisenberg-Gale markets: algorithms and structural properties
Authors: Kamal Jain, Vijay V. Vazirani
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We define a new class of markets, the Eisenberg-Gale markets. This class contains Fisher's linear market, markets from the resource allocation framework of Kelly kelly, as well as numerous interesting new markets.We obtain combinatorial, strongly polynomial algorithms for severalmarkets in this class. Our algorithms have a simple description as ascending price auctions. Our algorithms lead to insights into the efficiency, fairness, rationality of solutions, and competition monotonicity of these markets. A classification of Eisenberg-Gale markets w.r.t. these properties reveals a surprisingly rich set of possibilities.
IT for Corporate Crisis Management: Findings from a Survey in 6 different Industries on Management Attention, Intention and Actual Use
Authors: Koen Milis, Bartel Van de Walle
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper reports the findings of a survey on the use of Information Technology (IT) in crisis management in six different industrial sectors in Belgium, Luxembourg and the Netherlands. The survey was sent to 1245 Belgian and 1450 Dutch companies with 50 employees or more, resulting in a response rate of 9 %. Statistical analysis of the result demonstrate that although the development of crisis management plans leads to a higher awareness of the company risks, it is especially the creation of a crisis management team that leads to a higher degree of actions taken, for instance training or simulations. Moreover, this study demonstrates that the level of IT use in crisis management is predominantly related to the presence of a member in the crisis management team with an IT background.
Preface
Authors: E. Al-Shaer, A. Pras, P. Owezarski
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.
An Agent Approach for Intelligent Traffic-Light Control
Authors: Visit Hirankitti, Jaturapith Krohkaew
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

In this paper we have adopted an agent approach for traffic light control. According to this approach, our system consists of agents and their world. In the traffic context, the world consists of cars, road networks, traffic lights, etc. Each of these agents controls all traffic lights at a road junction by an observe-think-act cycle. That is, the agent repeatedly observes the current traffic condition at the junction, it then uses this information to reason with condition-action rules to determine how the agent should act in what traffic condition, and finally it performs those actions in order to efficiently manage the traffic flows. We have also developed a NetLogo-based traffic simulator to serve as the agents' world. Our approach is experimented with traffic control of a few connected junctions and the result obtained is promising; it can reduce the average delayed time of each car at each traffic-light near a junction rather substantially when compared with other approaches.
On the strong non-rigidity of certain tight Euclidean designs
Authors: Eiichi Bannai, Etsuko Bannai, Djoko Suprijanto
Venue: European Journal of Combinatorics (2007)

We study the non-rigidity of Euclidean t-designs, namely we study when Euclidean designs (in particular certain tight Euclidean designs) can be deformed keeping the property of being Euclidean t-designs. We show that certain tight Euclidean t-designs are non-rigid, and in fact satisfy a stronger form of non-rigidity which we call strong non-rigidity. This shows that there are plenty of non-isomorphic tight Euclidean t-designs for certain parameters, which seems to have been unnoticed before. We also include the complete classification of tight Euclidean 2-designs.
Vulnerabilities of passive internet threat monitors
Authors: Yoichi Shinoda, Ko Ikai, Motomu Itoh
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

Passive Internet monitoring is a powerful tool for measuring and characterizing interesting network activity like worms or distributed denial of service attacks. By employing statistical analysis on the captured network traffic, Internet threat monitors gain valuable insight into the nature of Internet threats. In the past, these monitors have been successfully used not only to detect DoS attacks or worm outbreaks but also to monitor worm propagation trends and other malicious activities on the Internet. Today, passive Internet threat monitors are widely recognized as an important technology for detecting and understanding anomalies on the Internet in a macroscopic way. Unfortunately, monitors that publish their results on the Internet provide a feedback loop that can be used by adversaries to deduce a monitor's sensor locations. Knowledge of a monitor's sensor location can severely reduce its functionality as the captured data may have been tampered with and can no longer be trusted. This paper describes algorithms for detecting which address spaces an Internet threat monitor listens to and presents empirical evidences that they are successful in locating the sensor positions of monitors deployed on the Internet. We also present solutions to make passive Internet threat monitors "harder to detect".