ppxscal/embedding_network huggingface dataset:
Cocktail approach to functional verification
Authors: Tim Cheng
Venue: IEEE Design Test (2007)

Functional verification remains a major bottleneck of the design process. One approach to combating this bottleneck is to combine multiple, complementary techniques. This issue examines recent progress in this direction. The issue also includes two Perspectives articles: an extended summary of a report on system-in-package technology by the FSA SiP subcommittee, and a discussion on challenges and new requirements for effective validation of future system chips. Finally, this issue includes an article on memory built-in self-repair (BISR) and a roundtable on the future of multiprocessor SoC.
The Folded Petersen Network: A New Communication-Efficient Multiprocessor Topology
Authors: Sabine Ohring, Sajal K. Das
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

We introduce and analyze a new interconnection topology, called the n-dimensional folded Petersen network (FP_n), which is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph itself. The FPn topology provides regularity, node- and edgesymmetry, optimal connectivity (maximal fault-tolerance), logarithmic diameter, and permits self-routing and broad casting algorithms even in the presence of faults. With the same node-degree and connectivity, FPn has smaller diam eter and more nodes than the 3ra-dimensional binary hy percube and several other networks. This paper also em beds rings, meshes, hypercubes, and a variety of tree-related structures efficiently into FP_n.
Reviews
Authors: Raul Rojas
Venue: IEEE Annals of the History of Computing (2007)

The Reviews department features book reviews of Mike Hally's Electronic Brains: Stories from the Dawn of the Computer Age; David Leavitt's The Man Who Knew Too Much: Alan Turing and the Invention of the Computer; and Jim Holt's New Yorker article "Code Breaker: The Life and Death of Alan Turing"; Darren Wershler-Henry's The Iron Whim: A Fragmented History of Typewriting; JoAnne Yates' Structuring the Information Age: Life Insurance and Technology in the Twentieth Century; T.F. Peterson's Nightwork: A History of Hacks and Pranks at MIT; and Irene K. Fischer's Geodesy? What's That?.
Real-time backward disparity-based rendering for dynamic scenes using programmable graphics hardware
Authors: Minglun Gong, Jason M. Selzer, Cheng Lei, Yee-Hong Yang
Venue: Proceedings of Graphics Interface 2007 (2007)

This paper presents a backward disparity-based rendering algorithm, which runs at real-time speed on programmable graphics hardware. The algorithm requires only a handful of image samples of the scene and estimated noisy disparity maps, whereas most existing techniques need either dense samples or accurate depth information. To color a given pixel in the novel view, a backward searching process is conducted to find the corresponding pixels from the closest four reference images. The use of backward searching process makes the algorithm more robust to errors in estimated disparity maps than existing forward warping-based approaches. In addition, since the computations for different pixels are independent, they can be performed in parallel on the Graphics Processing Units of modern graphics hardware. Experiment results demonstrate that our algorithm can synthesize accurate novel views for dynamic real scenes at a high frame rate.
Fault-Secure Interface Between Fault-Tolerant RAM and Transmission Channel Using Systematic Cyclic Codes
Authors: Fabrice Monteiro, Stanislaw J. Piestrak, Houssein Jaber, Abbas Dandache
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

The problem of designing a fault-secure interface between a fault-tolerant RAM memory system and a transmission channel, both protected against errors using cyclic linear error detecting and/or correcting codes is considered. The main idea relies on using the RAM check bits to control the correct operation of the parallel cyclic code encoder, so that the whole interface has no single point of failure.
Communication via Mobile Vesicles in Brane Calculi
Authors: Antonio Vitale, Giancarlo Mauri
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

P systems and Brane calculi are two (families of) computational models inspired by the structure and the functioning of living cells. Although they have different goals there is a recent growing of interests in results that bridge the two research areas. Here we consider an important kind of communication based on the natural budding of mobile membranes (e.g., Golgi apparatus) that is already defined for P systems and we show how to construct an analogous communication in the basic Phago/Exo/Pino Brane calculus.
Content based indexing of images and video using face detection and recognition methods
Authors: S. Eickeler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents an image and video indexing approach that combines face detection and face recognition methods. Images of a database or frames of a video sequence are scanned for faces by a neural network-based face detector. The extracted faces are then grouped into clusters by a combination of a face recognition method using pseudo two-dimensional hidden Markov models and a k-means clustering algorithm. Each resulting main cluster consists of the face images of one person. In a subsequent step, the detected faces are labeled as one of the different people in the video sequence or the image database and the occurrence of the people can be evaluated. The results of the proposed approach on a TV broadcast news sequence are presented. It is demonstrated that the system is able to discriminate between three different newscasters and an interviewed person.
An Empirical Study of the Workload Distribution under Static Scheduling
Authors: Zhiyuan Li, Trung N. Nguyen
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In the decision regarding static scheduling vs. dynamic scheduling, the only argument against the former is the potential imbalance of the workload. However, it has never been clear how the workload distributes in the iterations of Fortran parallel loops. This work examines a set of Perfect benchmarking programs [2] and report two striking results. First, when using operation counts as the measure, almost all the parallel loops identified by the Parafrase 2 compiler [11] in those programs have an equal workload among different iterations. Second, simulation shows that, although run time events on the memory system can lead to considerable variation in the execution time of different iterations which are scheduled statically, the finish time of the slowest processor normally does not exceed the average processor by the mean execution time of one loop iteration. Such workload distribution is as good as any known dynamic scheduling policy can guarantee.
Background model design for flexible and portable speaker verification systems
Authors: O. Siohan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Most state-of-the-art speaker verification systems need a user model built from samples of the customer speech, and a speaker independent (SI) background model with high acoustic resolution. These systems rely heavily on the availability of speaker independent databases along with a priori knowledge about acoustic rules of the utterance, and depend on the consistency of acoustic conditions under which the SI models were trained. These constraints may be a burden in practical and portable devices such as palm-top computers or wireless handsets which place a premium on computation and memory, and where the user is free to choose any password utterance in any language, under any acoustic condition. In this paper, we present a novel and reliable approach to background model design when only the enrollment data is available. Preliminary results are provided to demonstrate the effectiveness of such systems.
Virtual Cluster Scheduling Through the Scheduling Graph
Authors: Josep M. Codina, Jesus Sanchez, Antonio Gonzalez
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

This paper presents an instruction scheduling and cluster assignment approach for clustered processors. The proposed technique makes use of a novel representation named the scheduling graph which describes all possible schedules. A powerful deduction process is applied to this graph, reducing at each step the set of possible schedules. In contrast to traditional list scheduling techniques, the proposed scheme tries to establish relations among instructions rather than assigning each instruction to a particular cycle. The main advantage is that wrong or poor schedules can be anticipated and discarded earlier. In addition, cluster assignment of instructions is performed using another novel concept called virtual clusters, which define sets of instructions that must execute in the same cluster. These clusters are managed during the deduction process to identify incompatibilities among instructions. The mapping of virtual to physical clusters is postponed until the scheduling of the instructions has finalized. The advantages this novel approach features include: (1) accurate scheduling information when assigning, and, (2) accurate information of the cluster assignment constraints imposed by scheduling decisions. We have implemented and evaluated the proposed scheme with superblocks extracted from SpecInt95 and MediaBench. The results show that this approach produces better schedules than the previous state-ofthe- art. Speed-ups are up to 15%, with average speedups ranging from 2.5% (2-Clusters) to 9.5% (4- Clusters).
Chart Image Classification Using Multiple-Instance Learning
Authors: Weihua Huang, Siqi Zong, Chew Lim Tan
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

An important step in chart image understanding is to identify the type of the input image so that corresponding interpretation can be performed. In this paper, we model the chart image classification as a multiple-instance learning problem. A chart image is treated as a bag containing a set of instances that are graphical symbols. For both training and recognition, shape detection is performed and general shape descriptors are used to form feature vectors. For the training images, the correlation factor (CF) of each shape is calculated for each chart type. The learnt CFs are then used to estimate the type of a new input image. Comparing with traditional multiple-instance learning algorithms, we allow negative examples to be less restrictive and hence easier to provide. Using our method, both the type and the data components of the chart image can be obtained in one-pass. The experimental results show that our approach works reasonably well.
Teaching Databases Internationally, Teaching International Databases
Authors: Alastair Monger, Ralph Lano, Kenton Wheeler
Venue: Proceedings of the 24th British National Conference on Databases (2007)

Two international collaborative developments, involving the teaching of databases to international students, has provided a practical basis for this paper on internationalisation in databases. The conclusion drawn is that the curriculum, teaching and learning and online delivery are not likely to be significant issues in teaching databases internationally. An international distributed database has been implemented to enrich the learning experience. This raises further questions of the development of international content and learning resources on database courses.
Can the Surveillance System Run Pose Variant Face Recognition in Real Time?
Authors: Hung-Son Le, Haibo Li
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This paper presents an approach for face recognition across pose variations when only one sample image per person is available. From a near frontal face sample image, virtual views at different off-frontal angles were generated and used for the system training task. The manual work and computation burden, thus, are put on the offline training process, that makes it possible to build a real-time face recognition surveillance system. Our work exploited the inherent advantages of "Single" HMM scheme, which is based on an ID Discrete Hidden Markov Model (ID-DHMM) and is designed to avoid the need of retraining the system whenever it is provided new image(s). Experiment results on the CMU PIE face database demonstrate that the proposed scheme improves significantly the recognition performance.
Efficient Parallel Algorithms for Geometric Partitioning Problems through Parallel Range Searching
Authors: Amitava Datta
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We present efficient parallel algorithms for some geometric bipartitioning problems. Our algorithms are designed to run in the CREW PRAM model of parallel computation. These bipartition problems are the following. Given a planar point set S (\left| S \right| = n), a measure \mu acting on S and a pair of values f\mu_1 and \mu_2, does there exist a bipartition S = S_1 \cup S_2 such that \mu(S_{1}) \leqslant \mu_i for i = 1,2? We present efficient parallel algorithms for several measures like diameter under L_\infty and L_1 metric; area, perimeter or length of diagonal of the smallest enclosing axes-parallel rectangle and the side length of the smallest enclosing axes-parallel square. All our parallel algorithms run in O(logn) time using O{n) processors in the CREW PRAM. The work done (processor-time product) by our algorithms matches the time complexity of the best known sequential algorithms for most of these problems. As a by product of our algorithms, we can perform report mode orthogonal range queries in optimal O(logn) time using 0(1 + k/logn) processors, where k is the number of points inside the query range. The processor-time product for this range reporting algorithm is optimal. 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
Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you?
Authors: Bianca Schroeder, Garth A. Gibson
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we present and analyze field-gathered disk replacement data from a number of large production systems, including high-performance computing sites and internet services sites. About 100,000 disks are covered by this data, some for an entire lifetime of five years. The data include drives with SCSI and FC, as well as SATA interfaces. The mean time to failure (MTTF) of those drives, as specified in their datasheets, ranges from 1,000,000 to 1,500,000 hours, suggesting a nominal annual failure rate of at most 0.88%. We find that in the field, annual disk replacement rates typically exceed 1%, with 2-4% common and up to 13% observed on some systems. This suggests that field replacement is a fairly different process than one might predict based on datasheet MTTF. We also find evidence, based on records of disk replacements in the field, that failure rate is not constant with age, and that, rather than a significant infant mortality effect, we see a significant early onset of wearout degradation. That is, replacement rates in our data grew constantly with age, an effect often assumed not to set in until after a nominal lifetime of 5 years. Interestingly, we observe little difference in replacement rates between SCSI, FC and SATA drives, potentially an indication that disk-independent factors, such as operating conditions, affect replacement rates more than component specific factors. On the other hand, we see only one instance of a customer rejecting an entire population of disks as a bad batch, in this case because of media error rates, and this instance involved SATA disks. Time between replacement, a proxy for time between failure, is not well modeled by an exponential distribution and exhibits significant levels of correlation, including autocorrelation and long-range dependence.
Key management for long-lived sensor networks in hostile environments
Authors: Michael Chorzempa, Jung-Min Park, Mohamed Eltoweissy
Venue: Computer Communications (2007)

Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. These vulnerabilities are exacerbated when WSNs have to operate unattended in a hostile environment, such as battlefields. In such an environment, an adversary poses a physical threat to all the sensor nodes, that is, an adversary may capture any node compromising critical security data including keys used for confidentiality and authentication. Consequently, it is necessary to provide security services to these networks to ensure their survival. We propose a novel self-organizing key management scheme for large-scale, and long-lived WSNs, called Survivable and Efficient Clustered Keying (SECK) that provides administrative services that ensures the survivability of the network. SECK is suitable for managing keys in a hierarchical WSN consisting of low-end sensor nodes clustered around more capable gateway nodes. Using cluster-based administrative keys, SECK provides five efficient security administration mechanisms: (1) clustering and key setup, (2) node addition, (3) key renewal, (4) recovery from multiple node captures, and (5) re-clustering. All of these mechanisms have been shown to localize the impact of attacks and considerably improve the efficiency of maintaining fresh session keys. Using simulation and analysis, we show that SECK is highly robust against node capture and key compromise while incurring low communication and storage overhead.
A parametric approach to hot clutter cancellation
Authors: P. Parker
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Many reduced dimension STAP algorithms have been developed for airborne radar applications which rely on a stationary Doppler component of the interference in order to maintain acceptable performance. Two cases where this assumption is violated are when the ground clutter contains intrinsic clutter motion (ICM) and when hot clutter is present. In addition to the non-stationary Doppler component, hot clutter contains non-zero correlations in fast-time (across range bins) as well. This paper presents an algorithm designed to mitigate both ground clutter and hot clutter in the same step using a two dimensional vector autoregressive model to whiten the data in space, fast-time, and slow-time. This is an extension of the space-time autoregressive (STAR) filter that we have previously proposed. Using a simulated data set for circular array STAP augmented with synthetic hot clutter, we demonstrate that the extensions we present do result in a significant performance increase over the standard STAR filter. In addition we also show that the STAR filters have a narrower clutter notch than the optimized pre-Doppler filter when a finite sample support is used to train the filters.
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
Authors: Julien Gossa, Jean-Marc Pierson
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some services in a Grid environment. We demonstrate why the current monitoring tools are not sufficient in grid environments that lack high level tools to combine several sources of monitoring while taking into account particular constraints for some given applications. We show how this method has been embedded in a Grid service, namely the Network Distance Service (NDS). We illustrate the benefit of our approach in terms of accuracy, using an algorithm from graph theory on a grid planning scenario. We explain some implementation issues and discuss how the proposed NDS service can be useful to any grid service who needs some accurate evaluation for a decision making process involving such distances.
Identifying and addressing problems in object-oriented framework reuse
Authors: Douglas Kirk, Marc Roper, Murray Wood
Venue: Empirical Software Engineering (2007)

This paper describes the results of a long-term empirical investigation into object-oriented framework reuse. The aim is to identify the major problems that occur during framework reuse and the impact of current documentation techniques on these problems. Four major reuse problems are identified: understanding the functionality of framework components; understanding the interactions between framework components; understanding the mapping from the problem domain to the framework implementation; understanding the architectural assumptions in the framework design. Two forms of documentation are identified as having the potential to address these problems, namely pattern languages and micro-architecture descriptions. An in-depth, qualitative analysis suggests that, although pattern languages do provide useful support in terms of introducing framework concepts, this can be bypassed by developers using their previous knowledge, occasionally to the detriment of the final solution. Micro-architecture documentation appears to provide support for simple interaction and functionality queries, but it is not able to address large scale interaction problems involving multiple classes within the framework. The paper concludes that, although a combination of pattern language and micro-architecture documentation is useful for framework reuse, the forms of these documentation types used in this study require further enhancement to become effective. The paper also serves as an example to encourage others to perform evaluation of framework understanding and documentation.
A Pilot Study on Virtual Interactive Student-Oriented Learning Environment
Authors: Junjie Shang, Morris Siu Yung JONG, Fong Lok LEE, Jimmy Ho Man LEE
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

To make full use of the power of the Web, a new Game-based Situated Learning Paradigm--VISOLE (Virtual Interactive Student-Oriented Learning Environment) for Web-based teaching and learning was proposed, aiming to help students learn from near real-life experiences and social constructions of knowledge. To explore and validate its educational values, we conducted a pilot study in Hong Kong from March 2006 to May 2006. A combination of quantitative and qualitative research methods was employed for data collection and analysis. Findings showed that VISOLE could really arouse students' learning motivation, facilitate their knowledge acquisition, and improve their problem-solving skills and other high-order skills. In addition, students and teachers were quite positive towards the use of VISOLE although some helpful suggestions were raised.