ppxscal/embedding_network huggingface dataset:
Geometric partitioning for parallelizing post-placement vlsi design processes
Authors: Marios C. Papaefthymiou
Venue:  (2006)

Partitioning can speed up overlong VLSI design processes by enabling process parallelization. To achieve high parallel processing efficiency, partitioning schemes should minimize imbalance or interactions among partitions by relying on the specific characteristics of the given processes.In this dissertation, we present two partitioning methodologies for parallelizing post-placement VLSI optimization processes. Unlike pre-placement VLSI design tasks, post-placement processes manipulate circuit elements that have been assigned to physical spaces on the chip die. Consequently, physically neighboring circuit components may interact even when they are independent in the circuit netlist. To achieve high parallelism, partitioning methods must therefore take into consideration both logic and geometric interactions of circuit components. First we present a linear-time bipartitioning algorithm for the 2-weight geometric load balancing problem. This algorithm uses an L-shaped separator to bipartition a 2-weighted graph in 2-dimensional space so that each partition is spatially connected and each of the two weights is distributed with asymptotically vanishing relative imbalance. We also give an efficient heuristic for 2p-way partitioning based on the recursive application of our bipartitioning algorithm. Our heuristic runs in O(pn + n &middot;2p) time, where n is the graph size. In experiments with geometric graphs obtained from placed circuits, our partitioning heuristic achieves good balancing, fast runtime, and netcut sizes comparable to other partitioners.The second contribution of this dissertation is a multi-session partitioning scheme. This partitioning technique divides problem tasks into multiple sessions of parallel processes, so that interprocessor communication is entirely removed during each session. The algorithm is especially useful for parallelizing processes whose tasks are heavily connected to each other and may result in high communication overhead in parallel processing. We have developed a C++ version of our multi-session partitioning scheme and applied it to two post-placement VLSI processes with heavily overlapping tasks: electrical violation correction and post-placement timing optimization. In the parallelization of electrical violation correction, our scheme achieves speedups of up to 2.3x, dynamically utilizing 1--6 processors. For the process of post-placement timing optimization, we have developed a path-based buffer insertion algorithm and software. Our partitioning scheme speeds up the software execution time by up to 4.9x over serial processing, while dynamically utilizing 1--8 processors.
Graceful anytime interruptibility for virtual agents
Authors: Klaus Brügmann, Helmut Prendinger, Marc Stamminger, Mitsuru Ishizuka
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

The demo will show two highly expressive virtual agents introducing the audience to a traditional Japanese room. The agent models and gestures have been created by a professional Japanese character designer. By adapting and extending an influential technique ("Verbs and Adverbs"), we added parameterized emotional expression and gesture interruptibility as new behaviors to increase agent believability, interactivity, and responsiveness. In the demo, users will be provided a simple interface to test the new features.
The development of an Online TV system's architecture
Authors: Diogo Barreira, Mario Rui Gomes, Mauro Figueiredo
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper describes the development of an online TV system's architecture. First similar platforms are analysed. A Human Machine Interface is proposed. The RTSP protocol, necessary to supply video broadcasting services in real time is also described.
Team teaching merged sections as a way of mentoring faculty
Authors: J. Carpenter
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Mentoring new faculty is an important activity in academic departments, especially with teaching techniques such as group learning emerging as effective new tools. However with tight resources it often seems hard to make time for mentoring or to free experienced faculty to mentor new colleagues. We describe our experience with an approach that addresses both issues. Mentor-mentee teams of faculty were assigned merged classes that reached at least as many students as the individual classes of the faculty members would have. The classes were then team taught by the mentor and the mentee. We describe the specific scenario in which this effort was set and we discuss its implementation as well as lessons learned in hindsight. This description should allow readers to decide if such an approach is viable at their institution.
Jonah: experience implementing PKIX reference freeware
Authors: Mary Ellen Zurko, John Wray, Ian Morrison, Mike Shanzer, Mike Crane, Pat Booth, Ellen McDermott, Warren Macek, Ann Graham, Jim Wade, Tom Sandlin
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

IBM made a business decision to promote an open, secure, interoperable and integrateable environment by embracing the IETF's Public Key Infrastructure (X.509) standards, developing a reference implementation of the core set, and giving it away as freeware. We discuss the architecture of this reference code, emphasizing lessons learned from implementing the standards in an integrated PKI system.
Using evolutionary algorithm for generation of dense families of circulant networks
Authors: O. Monakhov, E. Monakhova
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper we consider the combinatorial optimization problem of the search for dense families of circulant networks with a good ratio between the order and diameter for a given degree. In particular, we distinguish the optimal families having the minimum possible diameter for a given degree and order of a graph. This work describes a new way of generation of analytical parametric descriptions of dense families of circulant networks using evolutionary algorithms. We present the families of circulants of degree 4 and 6 obtained by means of evolutionary algorithms. Some of these families of degree 6 improve previously known results.
Parallel implementation of multifilters
Authors: N. Damera-Venkata
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A multifilter is a filter with matrix-valued coefficients, and is used in the processing of vector-valued signals, e.g. color images. Convolution becomes a vector sum of matrix-vector multiplication. In this paper, we efficiently implement a multifilter as a parallel combination of scalar filters. Each scalar filter works on one component of the input vector signal, which increases processing speed by the dimension of the vector-valued signal. This means that by using N processors, the throughput is increased by a factor of N while the total memory usage remains unchanged. We also present a frequency-domain analysis of the filtering.
The use case track at INEX 2006
Authors: Nils Pharo, Andrew Trotman
Venue: ACM SIGIR Forum (2007)

XML information retrieval in the INEX workshop series has, for a large part, focused on creating algorithms for testing against the test collections provided by the IEEE and Wikipedia. The use case track is a new track at INEX and represents an attempt at identifying examples of how XML IR systems can be exploited by end-users for various purposes. In the present article we present a summary of the discussions and findings of the track.
iPhones Target the Tech Elite
Authors: Michael Macedonia
Venue: Computer (2007)

Apple's iPhone will entice early adopters with the cachet of coolness.
Generalized partial distortion search algorithm for fast block motion estimation
Authors: Chun-Ho Cheung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Quality versus speed control for real-time video applications, such as speed-oriented videoconferencing or high quality video entertainment, usually is absent from many traditional fast block motion estimators. A novel block-matching algorithm for fast motion estimation named generalized partial distortion search algorithm (GPDS) is proposed. It uses a halfway-stop technique with progressive partial distortion (PPD) to increase the chance of early rejection of impossible candidate motion vectors at very early stages. Simulations on PPD show 28 to 38 times computational reduction with only 0.45-0.50 dB PSNR performance degradation as compared to the full search algorithm. In addition, a new normalized partial distortion comparison method is also proposed for enabling control of searching speed against prediction quality by a speedup factor k. This method also generalizes the conventional partial distortion search algorithm when k is equal to 1, and the normalized partial distortion search algorithm (NPDS) when k is equal to infinity. Experimental results show that GPDS with use of PPD could provide PSNR performance very close to the full search algorithm and NPDS with 7 to 17 times and 22 to 33 times speedup, respectively, as compared to the full search algorithm.
Time-series active search for quick retrieval of audio and video
Authors: K. Kashino
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper proposes a search method that can quickly detect and locate known sound (video) in a long audio (video) stream. The method is based on active search. Active search reduces the number of candidate matches between reference and input signals by approximately 10 to 100 times compared to exhaustive search, while guaranteeing the same retrieval accuracy. We proposed a quick search method in Smith et al. (1998), and here we focus on improvement of the accuracy. Thus the feature used has been extended to the audio power spectrum and temporal division of the histogram windows has been introduced to incorporate time information. Tests carried out under practical circumstances clearly show the accuracy improvement. The proposed method is still so fast that it can correctly retrieve a 15-s commercial in a 6-h recording of TV broadcasting within 2 s, once the features are calculated.
Barriers to Adoption of e-Government
Authors: Wm. Arthur Conklin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Technology adoption is well defined in e-business. The environment within which leaders must act in government is significantly different that that navigated by business leaders. The differences in these environments plays a significant role in the diffusion of technology in e-government settings. This paper explores modifications to technology adoption models to account for the changes in environment. Issues such as information security play a significant role in new technology adoptions such as egovernment. The inclusion of moderating variable to account for the environmental effects is done to extend adoption model applicability to the e-government sector.
Towards Collective Spatial Awareness Using Binary Relations
Authors: Clemens Holzmann, Alois Ferscha
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

In this paper, we present an architecture for recognizing spatial relationships between real-world objects with integrated computing capabilities. The aim is to develop mechanisms for providing collectives of such artifacts with an awareness about spatial relations to other artifacts of the same collective. Therefore, an approach for recognizing binary relationships by a pairwise comparison of the spatial contexts of artifacts, as well as a novel algorithm which takes advantage of the relation properties in order to make all artifacts of the collective spatially-aware, are presented. The scope is on orientation- and distance-relationships, which are represented in a qualitative way. A general focus of this work is on the efficiency of the solutions with regard to their application in embedded systems. We expect the presented approach to be valuable for the interaction among artifacts and humans, as well as for acquiring high-level context information about artifact collectives.
Energy-efficient real-time task scheduling with task rejection
Authors: Jian-Jia Chen, Tei-Wei Kuo, Chia-Lin Yang, Ku-Jei King
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In the past decade, energy-efficiency has been an important system design issue in both hardware and software managements. For mobile applications with critical missions, both energy consumption reduction and timing guarantee have to be provided by system engineers to extend operation duration and maintain system stability. This research explores real-time systems composed of homogeneous multiple processors with the capability of dynamic voltage scaling (DVS), in which a given task can be rejected with a specified value of rejection penalty. The objective is to minimize the summation of the total rejection penalty for the tasks that are not completed in time and the energy consumption of the system. This study provides analysis to show that there does not exist any polynomial-time approximation algorithm for the studied problem, unless P = NP. Moreover, we propose algorithms for systems with ideal and non-ideal DVS processors. The capability of the proposed algorithms is provided with extensive evaluations. The evaluation results reveal that our proposed algorithms could derive effective solutions of the energy-efficient scheduling problem with task rejection considerations.
Guest Editors' Introduction: Evolving the Infrastructure for Technology-Enhanced Distance Learning
Authors: Vincent P. Wade, Helen Ashman
Venue: IEEE Internet Computing (2007)

Balancing learning theories' educational imperatives while selectively developing and integrating appropriate technology, tools, and services to enhance learning experiences is a challenge. This special issue examines key areas of evolution in learning technology and standards while attempting to maintain the balance between educational imperatives and technology offers.
Integrated multistage MEMS-based optical switch
Authors: Geng-Sheng Kuo, Yong Yin
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

In this paper, we proposed a large NxN MEMS-based optical switch (OXC) architecture design by using small-port switch modules. Two types of integrated multistage switch: Banyan switch and Clos switch with nonblocking in strict sense property are designed. Our proposed architecture can increase the port number of MEMS-based 2D OXC significantly and improve its performance notably.
A Comparison of Efficient Decimation Algorithms for Polygonal Models
Authors: Muhammad Hussain
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

In this paper, we describe two different forms of the error metric proposed in [5] for computing local geometric deviation introduced in a triangle mesh by a half-edge collapse transformation and further investigate them. Besides, we propose a modification of Multiple Choice technique (MC) [10] that is used as a decimation framework instead of greedy design technique (GD) for iterative simplification of triangle meshes. We compare various triangle mesh decimation algorithms, that use the stated error metrics to compute the geometric fidelity every time a half-edge collapse transformation is applied and employ GD approach, MC technique and its modification as decimation frameworks, with the state-of-the-art decimation algorithms. Comparison shows that the modified MC algorithm based on the stated error measure results in better quality LODs.
State Agreement for Continuous-Time Coupled Nonlinear Systems
Authors: Zhiyun Lin, Bruce Francis, Manfredi Maggiore
Venue: SIAM Journal on Control and Optimization (2007)

Two related problems are treated in continuous time. First, the state agreement problem is studied for coupled nonlinear differential equations. The vector fields can switch within a finite family. Associated to each vector field is a directed graph based in a natural way on the interaction structure of the subsystems. Generalizing the work of Moreau, under the assumption that the vector fields satisfy a certain subtangentiality condition, it is proved that asymptotic state agreement is achieved if and only if the dynamic interaction digraph has the property of being sufficiently connected over time. The proof uses nonsmooth analysis. Second, the rendezvous problem for kinematic point-mass mobile robots is studied when the robots&rsquo; fields of view have a fixed radius. The circumcenter control law of Ando &etal; [IEEE Trans. Robotics Automation, 15 (1999), pp. 818-828] is shown to solve the problem. The rendezvous problem is a kind of state agreement problem, but the interaction structure is state dependent.
Three-dimensional structure computation from multiple views
Authors: Long Quan
Venue:  (2006)

3D reconstruction from images is fundamental and has been extensively studied in computer vision. This thesis investigates this problem using multiple images of a rigid 3D scene taken at different viewpoints. We tackle and contribute to several problems in different stages of 3D reconstruction. In the preliminary stage of camera calibration, we work on the problem of camera motion estimation under circular motion. We have developed an effective algorithm that is suitable for a large image sequence. In the 3D reconstruction stage, a dense representation of the scene is computed from calibrated images. We first propose a three-aspect categorization that differentiates previous 3D reconstruction methods based on their various properties, such as scene representation, scene prior, visibility computation, optimization method, etc. We conclude that scene representation is most influential among all these properties. We then study two 3D reconstruction problems based on different scene representations. In the first problem, depth maps used to represent the scene are computed from multi-view images. A novel formulation with asymmetrical occlusion treatment is proposed and two approximate optimization methods are developed. Our approach produces comparable results and is more storage and time efficient compared with previous methods, and therefore suitable for multiple input images. The second problem is image-based hair modeling. It is motivated by needs in computer graphics applications. The problem differs a lot from traditional ones due to the high complexity of hair geometry. We developed a practical multi-view based algorithm. It is highly automatic, convenient to use and produces realistic hair models.
Keyword spotting for video soundtrack indexing
Authors: P. Gelin, C. J. Wellekens
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The amount of available video information is dramatically increasing due to the development of multimedia applications. As a consequence, content based retrieval tools are urgently needed for fast and easy access to multimedia database but also to movies and recorded video news. In particular, queries may rely on off-line indexing. Keyword spotting on video soundtracks could be of great help in this indexation process and in the future associated with pattern or event recognition out of the strictly visual information. Specific constraints for this application are identified and a solution based on phonemic lattices is proposed. The word spotter achieves indexing on open vocabularies uttered by any speaker. It is fast enough for practical applications and does not require much additional stored information.
Team learning in an online lab
Authors: B. Wagner
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This contribution deals with the implementation and subsequent evaluation of a distance-learning experiment as part of a laboratory for process control for students of electrical engineers in the main section of their studies. In one of our control laboratory experiments students have to design, implement and test a discrete controller for a process engineering plant. We have started to investigate students motivation, acceptance and learning results in conjunction with online laboratory access. To compare local and online lab access a summary evaluation has been performed with twenty students grouped into eight small teams. Four teams were not allowed to enter the room with the process engineering plant inside, so they had to operate and control the whole experiment through the Internet. The other four teams have worked on the laboratory experiment in the traditional way while sitting in the same room as the process to be controlled.
Prediction based on backward adaptive recognition of local texture orientation and Poisson statistical model for lossless/near-lossless image compression
Authors: Xiaohui Xue
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper is devoted to prediction-based lossless/near-lossless image compression algorithm. Within this framework, there are three modules, including prediction model, statistical model and entropy coding. This paper focuses on the former two, and puts forward two new methods: prediction model based on backward adaptive recognition of local texture orientation (BAROLTO), and Poisson statistical model. As far as we know, BAROLTO is the best predictor in efficiency. The Poisson model is designed to avoid the context dilution to some extent and make use of a large neighborhood; therefore, we can capture more local correlation. Experiments show that our compression system (BP) based on BAROLTO prediction and Poisson model outperforms the products of IBM and HP significantly.
A wavelet-based multirate/multimedia system
Authors: O. Kucur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We present a new multirate/multimedia system, which we call scale-code division multiple access (SCDMA) that depends on the code, and time and scale orthogonality introduced by pseudo-noise (PN) sequences, and wavelets. Wavelets are used for signaling. In this system, the channel is divided into different scales, and each scale into time slots. In addition, the PN sequences are used in each scale to identify multiple users. In other words, each user encodes its successive information symbols with time-shifted replicas of the same basic wavelet in a specific scale and spreads its scaled and translated wavelets by its PN sequence. However, the finer the scale, the more the symbols are transmitted. We analyze this system over an asynchronous additive white Gaussian noise (AWGN) channel by using conventional detectors and show that it is attractive for multirate/multimedia applications due to its reasonable performance.