ppxscal/embedding_network huggingface dataset:
Region detection and description for Object Category Recognition
Authors: Ehsan Fazl, John S. Zelek
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

The way images are decomposed and represented biases how well subsequent object learning and recognition methods will perform. We choose to initially represent the images by sets of local distinctive regions and their description vectors. We evaluate the problems of distinctive region detection and description in two separate stages, by first reviewing some of the state-of-the-art methods, and then discussing the methods we propose to use for object category recognition. In comparing the performance of our region detection-description technique for scale and rotation invariance with the performance of the other detectiondescription techniques, we find that our approach provides better results than existing methods, in the context of object category recognition. The evaluation consists of clustering similar descriptor regions and computing (1) the number of single measure clusters (measures intra-class sensitivity), (2) cluster precision clusters (measures how clusters are shared between different classes) and (3) the generalizability property of regions (measures matching to classes). Our technique, which is a variant on the Kadir-Brady saliency detector scored better and not worse than all the other methods evaluated.
Planning of IP Networks with Quality of Service Guarantee
Authors: Thi-Thanh-Mai Hoang
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This article presents a new architectural approach and its implementation prototype MSNEP (Multi-service Network Planning) for planning of IP networks under particular consideration of QoS required by elastic and stream applications as well as of their service differentiation at the network layer. In this approach, the services at the transport layer and at the Internet layer are taken into consideration. The approach consists of the following main components: (1) the traffic dimension deals with the estimating of the bandwidth needed for a given set of traffic demands; (2) the traffic mapping computes the optimal path for delivering the traffic and allocates the estimated bandwidth on this path; (3) the "capacity assignment and link dimension" deals with determination of an optimal physical network structure used for delivering the given traffic demands with required QoS. This article also shows numerical results of some practical examples.
Blind equalizers for multipath channels with best equalization delay
Authors: Hui Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Previous studies show that equalizers with different equalization delays achieve different performances. The best performed equalizer is not necessarily the one with 0-delay, and often not the case when the channel is non-minimum-phase. In this paper, a blind channel equalization algorithm is presented, by which equalizers with all possible equalization delays can be calculated simultaneously from the second order statistics of the received signals. A (blind) evaluation index is then presented for the purpose of selecting the best equalizer. Simulation shows that the best delayed equalizer performs much better than that for other equalization delays and those given by constant modulus algorithm and linear prediction algorithm.
Distributed Visualization Using VTK in Grid Environments
Authors: Marcio Dutra, Paulo S. S. Rodrigues, Gilson A. Giraldi, Bruno Schulze
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In this paper we focus on distributed visualization using the Visualization Toolkit (VTK) in grid environments. We propose a distributed architecture, based on data parallelism, that allows the distribution of visualization tasks over a grid environment. We decided for Globus Toolkit as a middleware to provide access and location transparencies. We also add facilities for dynamic allocation of resources by using a Java framework. The focused visualization technique is Laplacian smoothing which is provided by a specific filter of the VTK library. We emphasize the obtained speedup in the experiments and discuss the implementation of pipeline parallelism as well as the generalization of our architecture for other VTK applications.
Towards Secure E-Elections in Turkey: Requirements and Principles
Authors: Orhan Cetinkaya, Deniz Cetinkaya
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

E-democracy is a necessity in this era of computers and information technology. E-voting is one of the most significant parts of e-democracy, which refers to the use of computers or computerized voting equipment to cast ballots in an election. This is a study on e-voting requirements specifically pointing out its implementation in Turkey. Nowadays, the Turkish Government has begun to test an e-voting system, which has been developed by a private company for Turkish electoral needs. Since there is neither technical nor academic comprehensive documentation available regarding the system, we are not sure about that it may or may not be a satisfactory solution to Turkish electoral needs. The aim of this paper is to define an extensive set of requirements that any e-voting system, which is planned to be used instead of paper-based voting system in the countries that have representative democracy so as in Turkey, should satisfy.
Point Based Representations for Hierarchical Environments
Authors: Kedarnath Thangudu, Lakshmi Gade, Jag Mohan Singh, P. J. Narayanan
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The advent of advanced graphics technologies and improved hardware has enabled the generation of highly complex models with huge number of triangles. Point-based representations and rendering have emerged as viable representations for high-quality models in this scenario. These methods have been demonstrated only on high resolution, compact objects so far. They have to be adapted to environments that extend over large areas to be considered serious representations. In this paper, we present an adaptation of the point-based representation to large, hierarchical environments. We show how point-based data can be generated by sampling polygon-based representations. We also show the combination of an object hierarchy and multiresolution point representations and develop rendering algorithms for the same. The multiresolution representation is constructed during the generation process. We then show a hybrid representation in which the more complex portions of the environment are represented using points and others using the original polygon-based representation. This produces better rendering performance by keeping large, flat regions as triangles. We demonstrate the method on the model of the Fatehpur Sikri which has 14000 objects with over 500,000 triangles.
Attitudes and beliefs about computer science among students and faculty
Authors: Clayton Lewis
Venue: ACM SIGCSE Bulletin (2007)

What students think about a discipline --- its structure, usefulness, and how it can be learned --- plays an important role in shaping how they approach it. Just as faculty aim to have students learn the facts and skills of a discipline, so they may also want to shape students' beliefs and attitudes. This study reports the attitudes of undergraduate computer science students early and late in the curriculum, and compares them with the beliefs and attitudes of faculty in the same department. The results show where students think what faculty would like them to think, where they do not, and whether there is evidence that senior students agree more or less with faculty than do students in introductory courses. The results can guide curricular improvements.
WS-VLAM: towards a scalable workflow system on the grid
Authors: Vladimir Korkhov, Dmitry Vasyunin, Adianto Wibisono, Victor Guevara-Masis, Adam Belloum, Cees de Laat, Pieter Adriaans, L.O. Hertzberger
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

Large scale scientific applications require extensive support from middleware and frameworks that provide the capabilities for distributed execution in the Grid environment. In particular, one of the examples of such frameworks is a Grid-enabled workflow management system. In this paper we present WS-VLAM workflow management system, describe its current design and the developments targeting to support efficient and scalable execution of large workflow applications on the Grid.
Text detection and segmentation in complex color images
Authors: C. Garcia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Text is a very powerful index in content-based image and video indexing. We propose a new text detection and segmentation algorithm that is especially designed for being applied to color images with complicated background. Our goal is to minimize the number of false alarms and to binarize efficiently the detected text areas so that they can be processed by standard OCR software. First, potential areas of text are detected by enhancement and clustering processes, considering most of constraints related to the texture of words. Then, classification and binarization of potential text areas are achieved in a single scheme performing color quantization and characters periodicity analysis. We report a high rate of good detection results with very few false alarms and reliable text binarization.
A Conversation with Michael Stonebraker and Margo Seltzer
Authors: John Stanik
Venue: Queue (2007)

Over the past 30 years Michael Stonebraker has left an indelible mark on the database technology world. Stonebraker&rsquo;s legacy began with Ingres, an early relational database initially developed in the 1970s at UC Berkeley, where he taught for 25 years. The Ingres technology lives on today in both the Ingres Corporation&rsquo;s commercial products and the open source PostgreSQL software. A prolific entrepreneur, Stonebraker also started successful companies focused on the federated database and stream-processing markets. He was elected to the National Academy of Engineering in 1998 and currently is adjunct professor of computer science at MIT.
Rapid document navigation for information triage support
Authors: George Buchanan
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper introduces a novel interaction for supporting rapid between-page comparison of texts within a limited screen estate. In comparison with existing interfaces and interactions, it gives a high degree of visual feedback and allows rapid between-page flicking, similar to what is readily achieved in physical environments using the fingers and thumbs of a reader as they flip between related pages.
An improved wavelet-based corner detection technique
Authors: A. Quddus
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

An improved, wavelet-based technique for corner detection, in 2-D planar curves, is presented. This boundary based technique is simple to implement and computationally efficient and exploits wavelet transform modulus maxima (WTMM) to detect corners. The proposed algorithm is robust with respect to object geometry. We also report results under additive white Gaussian noise (AWGN).
The NSF Foundation Coalition-looking toward the future [engineering education]
Authors: K. Frair
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The Foundation Coalition was funded in 1993 as the fifth coalition in the National Science Foundation's Engineering Education Coalitions Program. The member institutions-Arizona State University, Maricopa Community College District, Rose-Hulman Institute of Technology, Texas A&M University, Texas A&M University, Kingsville, Texas Woman's University and the University of Alabama-have developed improved curricula and learning environment models that are based on four primary thrusts: integration of subject matter within the curriculum, cooperative and active learning, technology-enabled learning and continuous improvement through assessment and evaluation. This paper discusses Coalition projects to date that have been especially important for achieving goals, and describes Coalition plans for future accomplishments.
IntelliJuke: a caching jukebox-based storage server
Authors: Yitzhak Birk, Uri Kareev, Mark Mokryn
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

The cost-effectiveness of CDs applies only to the storage medium itself; once a drive is included, CD-ROM often becomes inferior to magnetic hard drives. Moreover, a CD is often far from full, thus further reducing its cost-effectiveness. (For this reason, DVD will not help in many cases.) Jukeboxes (AKA changers) feature high volumetric storage density with moderate communication bandwidth and multi-second access times. Jukebox manufacturers have focused on building very robust systems with high-performance robotics in order to mitigate the intrinsic performance shortcomings, resulting in a price-per-slot of $30-$120 in late 1996! We believe that jukeboxes should provide access to a very large number of CDs at minimal cost, and that caching on magnetic disk drives should provide the performance. A byproduct of caching is reduced jukebox activity, so the jukebox's robustness may be reduced without increasing the mean time between failures. Our focus is on efficient caching.
Complex independent component analysis by nonlinear generalized Hebbian learning with Rayleigh nonlinearity
Authors: E. Pomponi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a non-linear extension of the Sanger's (1989) generalized Hebbian algorithm to the processing of complex-valued data. A possible choice of the involved nonlinearity is discussed recalling the Sudjianto-Hassoun (1994) interpretation of the nonlinear Hebbian learning. Extension of this interpretation to the complex case leads to a nonlinearity called the Rayleigh function, which allows for separating mixed independent complex-valued source signals.
Spatially varying image based lighting by light probe sequences: Capture, processing and rendering
Authors: Jonas Unger, Stefan Gustavson, Anders Ynnerman
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

We present a novel technique for capturing spatially or temporally resolved light probe sequences, and using them for image based lighting. For this purpose we have designed and built a real-time light probe, a catadioptric imaging system that can capture the full dynamic range of the lighting incident at each point in space at video frame rates, while being moved through a scene. The real-time light probe uses a digital imaging system which we have programmed to capture high quality, photometrically accurate color images of 512&#x00d7;512 pixels with a dynamic range of 10000000:1 at 25&#x00a0;frames per second. By tracking the position and orientation of the light probe, it is possible to transform each light probe into a common frame of reference in world coordinates, and map each point and direction in space along the path of motion to a particular frame and pixel in the light probe sequence. We demonstrate our technique by rendering synthetic objects illuminated by complex real world lighting, first by using traditional image based lighting methods and temporally varying light probe illumination, and second an extension to handle spatially varying lighting conditions across large objects and object motion along an extended path.
Configurable hardware implementation of triple-DES encryption algorithm for wireless local area network
Authors: P. Hamalainen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents three implementations of triple data encryption standard (3DES) algorithm on a configurable platform. Implementations are aimed at the medium access control (MAC) protocol of a multimedia-capable wireless local area network (WLAN). For this reason, very strict timing constraints as well as demands for area-efficiency are present. The MAC processing is handled by a digital signal processor (DSP) and a Xilinx Virtex field programmable gate array (FPGA) chip. The latter one is also used for the presented encryption implementations. As a result of the study, 3DES implementations with small area and reasonable throughput and, on the contrary, with large area and very high throughput are realized. Even though 3DES turns out to be quite large and resource-demanding, the implementations still leave enough chip area for the other MAC functions. Consequently, the set requirements are met and the cipher can be integrated into the system.
Interactive presentation: On power-profiling and pattern generation for power-safe scan tests
Authors: V. R. Devanathan, C. P. Ravikumar, V. Kamakoti
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

With increasing use of low cost wire-bond packages for mobile devices, excessive dynamic IR-drop may cause tests to fail on the tester. Identifying and debugging such scan test failures is a very complex and effort-intensive process. A better solution is to generate correct-by-construction "power-safe" patterns. Moreover, with glitch power contributing to a significant component of dynamic power, pattern generation needs to be timing-aware to minimize glitching. In this paper, we propose a timing-based, power and layout-aware pattern generation technique that minimizes both global and localized switching activity. Techniques are also proposed for power-profiling and optimizing an initial pattern set to obtain a power-safe pattern set, with the addition of minimal patterns. The proposed technique also comprehends irregular power grid topologies for constraints on localized switching activity. Experiments on ISCAS benchmark circuits reveal the effectiveness of the proposed scheme.
Game Smarts
Authors: Michael van Lent
Venue: Computer (2007)

AI advances will move games beyond battles and sports to explore complex social interactions.
A Tool for Diligent Argumentation: Experiences, Requirements and Design
Authors: Michael Engler, Denny Vrandecic, York Sure
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Ontologies are defined as "the formal specification of a shared conceptualization of a domain of interest" [7]. Unlike most other ontology engineering methodologies, the DILIGENT methodology aims specifically at the collaborative and distributed building of ontologies, providing a rich argumentation framework in order to quickly proceed with building the ontology and tracking all relevant discussions about the conceptualization. Based upon first experience with DILIGENT, we designed a tool to support engineers and domain experts to follow the DILIGENT processes. In this paper we present the experiences and requirements our work is based on, and present the resulting design and state of the ongoing implementation.
Braided learning: investigating an emerging model of online professional debate between international educators
Authors: Christina Preston
Venue: ACM SIGCSE Bulletin (2007)

This short paper highlights some of the features of online debate in an established international e-community of practice, The MirandaNet Fellowship. The debate started by an ICT co-coordinator who requested members online to send evidence within twenty-four hours that will prevent his head from banning social software on the school network. Salient features of this braided text include the variety of participant perspectives, the range of responses from different cultures, the pragmatic experience expressed and the demands for action. In the future, wikis might provide the best environment for deeper online collaboration.
Blocked stochastic sampling versus Estimation of Distribution Algorithms
Authors: R. Santana, H. Muhlenbein
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The Boltzmann distribution is a good candidate for a search distribution for optimization problems. We compare two methods to approximate the Boltzmann distribution - Estimation of Distribution Algorithms (EDA) and Markov Chain Monte Carlo methods (MCMC). It turns out that in the space of binary functions even blocked MCMC methods outperform EDA on a small class of problems only. In these cases a temperature of T = 0 performed best.
Algorithms for the scaling toward nanometer vlsi physical synthesis
Authors: Jiang Hu
Venue:  (2005)

Along the history of Very Large Scale Integration (VLSI), we have successfully scaled down the size of transistors, scaled up the speed of integrated circuits (IC) and the number of transistors in a chip - these are just a few examples of our achievement in VLSI scaling. It is projected to enter the nanometer (10-9m) scale era in the nearest future. At the same time, the scaling has imposed new challenges to physical synthesis. Among all the challenges, this thesis focuses on the following problems: (1) Increasingly domination of interconnect delay leads to a need in interconnect-centric design flows; (2) Different design stages (e.g. floorplanning, placement and global routing) have unmatched timing estimation, which brings difficulty in timing closure; (3) More and more VLSI circuits are designed in architectural styles, which require a new set of algorithms. The paper consists of two parts, each of which focuses on several specific problems in VLSI physical synthesis when facing the new challenges. (1) Place and route aware buffer Steiner tree construction. Efficient techniques are presented for the problem of buffered interconnect tree construction under blockage and routing congestion constraint. This part also contains timing estimation and buffer planning for global routing and other early stages such as floorplanning. A novel path based buffer insertion scheme is also included, which can overcome the weakness of the net based approaches. (2) Circuit clustering techniques with the application in Field-Programmable Gate Array (FPGA) technology mapping. The problem of timing driven n-way circuit partitioning with application to FPGA technology mapping is studied and a hierarchical clustering approach is presented for the latest multi-level FPGA architectures. Moreover, a more general delay model is included in order to accurately characterize the delay behavior of the clusters and circuit elements.