ppxscal/embedding_network huggingface dataset:
An Efficient Round-Robin Algorithm for Combined Input-Crosspoint-Queued Switches
Authors: Yanfeng Zheng, Chun Shao
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The combined input-crosspoint-queued (CICQ) crossbar switch is becoming attractive because of the simplicity of scheduling. Although the previously proposed round-robin algorithms achieves 100% throughput asymptotically under uniform Bernoulli i.i.d. traffic, these algorithms do not have a satisfactory performance under nonuniform traffic. In this paper, we propose a dual round-robin algorithm for a CICQ switch with one-cell crosspoint buffers. With our algorithm, each input arbiter is associated with dual round-robin pointers. Unlike the previously proposed algorithms, the new algorithm has distinctive roundrobin pointer updating rules which are efficient to cope with nonuniform traffic patterns. Extensive simulations show that our algorithm achieves nearly 100% throughput and low average delay under uniform and a broad class of nonuniform traffic patterns.
LQG Control under Input Variance Constraint
Authors: A. Krolikowski, D. Horla, T. Kubiak
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In this paper, a variance-constrained LQG control is considered for a plant given by discrete-time ARMAX model. The minimization of constrained quadratic cost is approached by Kalman filter and output feedback methods. The obtained optimization algorithms are simulated for second-order plant model and different constraints.
User-Centered Security: Stepping Up to the Grand Challenge
Authors: Mary Ellen Zurko
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

User-centered security has been identified as a grand challenge in information security and assurance. It is on the brink of becoming an established subdomain of both security and human/computer interface (HCI) research, and an influence on the product development lifecycle. Both security and HCI rely on the reality of interactions with users to prove the utility and validity of their work. As practitioners and researchers in those areas, we still face major issues when applying even the most foundational tools used in either of these fields across both of them. This essay discusses the systemic roadblocks at the social, technical, and pragmatic levels that user-centered security must overcome to make substantial breakthroughs. Expert evaluation and user testing are producing effective usable security today. Principles such as safe staging, enumerating usability failure risks, integrated security, transparent security and reliance on trustworthy authorities can also form the basis of improved systems.
GPGPU: general purpose computation on graphics hardware
Authors: David Luebke, Mark Harris, Jens Krüger, Tim Purcell, Naga Govindaraju, Ian Buck, Cliff Woolley, Aaron Lefohn
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

The graphics processor (GPU) on today's commodity video cards has evolved into an extremely powerful and flexible processor. The latest graphics architectures provide tremendous memory bandwidth and computational horsepower, with fully programmable vertex and pixel processing units that support vector operations up to full IEEE floating point precision. High level languages have emerged for graphics hardware, making this computational power accessible. Architecturally, GPUs are highly parallel streaming processors optimized for vector operations, with both MIMD (vertex) and SIMD (pixel) pipelines. Not surprisingly, these processors are capable of general-purpose computation beyond the graphics applications for which they were designed. Researchers have found that exploiting the GPU can accelerate some problems by over an order of magnitude over the CPU.However, significant barriers still exist for the developer who wishes to use the inexpensive power of commodity graphics hardware, whether for in-game simulation of physics of for conventional computational science. These chips are designed for and driven by video game development; the programming model is unusual, the programming environment is tightly constrained, and the underlying architectures are largely secret. The GPU developer must be an expert in computer graphics and its computational idioms to make effective use of the hardware, and still pitfalls abound. This course provides a detailed introduction to general purpose computation on graphics hardware (GPGPU). We emphasize core computational building blocks, ranging from linear algebra to database queries, and review the tools, perils, and tricks of the trade in GPU programming. Finally we present some interesting and important case studies on general-purpose applications of graphics hardware.The course presenters are experts on general-purpose GPU computation from academia and industry, and have presented papers and tutorials on the topic at SIGGRAPH, Graphics Hardware, Game Developers Conference, and elsewhere.
Automated rich presentation of a semantic topic
Authors: Lie Lu, Zhiwei Li
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

To have a rich presentation of a topic, it is not only expected that many relevant multimodal information, including images, text, audio and video, could be extracted; it is also important to organize and summarize the related information, and provide users a concise and informative storyboard about the target topic. It facilitates users to quickly grasp and better understand the content of a topic. In this paper, we present a novel approach to automatically generating a rich presentation of a given semantic topic. In our proposed approach, the related multimodal information of a given topic is first extracted from available multimedia databases or websites. Since each topic usually contains multiple events, a text-based event clustering algorithm is then performed with a generative model. Other media information, such as the representative images, possibly available video clips and flashes (interactive animates), are associated with each related event. A storyboard of the target topic is thus generated by integrating each event and its corresponding multimodal information. Finally, to make the storyboard more expressive and attractive, an incidental music is chosen as background and is aligned with the storyboard. A user study indicates that the presented system works quite well on our testing examples.
Present and Future Prospects for Mobile Learning in Korea
Authors: Young-Kyun Baek, Dong-Uk Cheong
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper, the present state of mobile learning in Korea is explored and its implications for future Korean education are discussed. In Korea, hardware and Internet infrastructure is well established and mobile devices are ubiquitous, therefore making learning with mobile devices in schools appear natural and imminent. Although mobile learning is in its beginning stages, it has bright prospects. This discussion attempts to provide meaningful direction for the future development of mobile learning in Korea.
uLearn: Facilitating Ubiquitous Learning through Camera Equipped Mobile Phones
Authors: Keith Mitchell, Nicholas J. P. Race
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper describes a prototype application based on Smartphone devices which supports independent learners within a mobile environment. The techniques employed allow children to rapidly gain access to a large repository of multimedia information through the use of a camera equipped mobile phone or smartphone. More specifically, the use of visual codes [20] attached to locations and objects within a museum and park in Lancaster enable the retrieval of web based information to be triggered by capturing images using the integrated CCD camera. Moreover, the location and orientation of the phone are used as contextual parameters in order to control the specific information to be retrieved by the system. The prototype described in this paper is currently under evaluation by groups of children in Lancaster in order to evaluate the use of this platform for teaching and learning. Our aim was to establish whether or not this user interaction technique could be harnessed for education based applications targeted at young children.
DRAMsim: a memory system simulator
Authors: David Wang, Brinda Ganesh, Nuengwong Tuaycharoen, Kathleen Baynes, Aamer Jaleel, Bruce Jacob
Venue: ACM SIGARCH Computer Architecture News (2005)

As memory accesses become slower with respect to the processor and consume more power with increasing memory size, the focus of memory performance and power consumption has become increasingly important. With the trend to develop multi-threaded, multi-core processors, the demands on the memory system will continue to scale. However, determining the optimal memory system configuration is non-trivial. The memory system performance is sensitive to a large number of parameters. Each of these parameters take on a number of values and interact in fashions that make overall trends difficult to discern. A comparison of the memory system architectures becomes even harder when we add the dimensions of power consumption and manufacturing cost. Unfortunately, there is a lack of tools in the public-domain that support such studies. Therefore, we introduce DRAMsim, a detailed and highly-configurable C-based memory system simulator to fill this gap. DRAMsim implements detailed timing models for a variety of existing memories, including SDRAM, DDR, DDR2, DRDRAM and FB-DIMM, with the capability to easily vary their parameters. It also models the power consumption of SDRAM and its derivatives. It can be used as a standalone simulator or as part of a more comprehensive system-level model. We have successfully integrated DRAMsim into a variety of simulators including MASE [15], Sim-alpha [14], BOCHS[2] and GEMS[13]. The simulator can be downloaded from www.ece.umd.edu/dramsim.
Tracking points using projective reconstruction for augmented reality
Authors: S. K. Ong, M. L. Yuan, A. Y. C. Nee
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Natural feature tracking is a popular research topic in computer vision and has been used in Augmented Reality (AR) applications. Current natural feature trackers have two major limitations in AR applications. Firstly, the natural features may be lost during the tracking process such that the annotations that are linked to these natural features will also be lost. Secondly, if the virtual objects have to be augmented on regions where there are no distinct natural features that can be tracked, the current natural feature cannot be used directly. This paper proposes a method for points tracking or transferring based on the Kanade-Lucas-Tomasi (KLT) feature tracker and the projective reconstruction technique. The points to be tracked include the lost natural features, and any points that are specified by the users. The proposed method is useful for AR applications, including scene annotation, registration, etc. Some indoor and outdoor experiments have been conducted to validate the performance of the proposed method.
Research Issues in the Development of Context-Aware Middleware Architectures
Authors: Hung Quoc Ngo, Anjum Shehzad, Kim Anh Pham Ngoc, S. Y. Lee, Manwoo Jeon
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Context-aware middleware encompasses uniform abstractions and reliable services for common operations, supports for most of the tasks involved in dealing with context, and thus simplifying the development of context-aware applications. In this paper1, we address some key issues of a middleware for context-aware ubiquitous computing, ranging from design considerations of a unified sensing framework, formal modeling and representation of the real world, pluggable reasoning engines for high-level contexts, and context delivery-runtime service composition mechanisms. Our implementation experience indicates that a comprehensive approach throughout the system layers results in a flexible and reusable middleware architecture.
Multi-Class Biclustering and Classification Based on Modeling of Gene Regulatory Networks
Authors: Ilias Tagkopoulos, Nikolai Slavov, S. Y. Kung
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

The attempt to elucidate biological pathways and classify genes has led to the development of numerous clustering approaches to gene expression. All these approaches use a single metric to identify genes with similar expression levels. Until now, the correlation between the expression levels of such genes has been based on phenomenological and heuristic correlation functions, rather than on biological models. In this paper, we derive six distinct correlation functions based on explicit thermodynamic modeling of gene regulatory networks. We then combine these correlation functions with novel biclustering algorithms to identify functionally enriched groups. The statistical significance of the identified groups is demonstrated by precision-recall curves and calculated p-values. Furthermore, comparison with chromatin immunoprecipitation data indicates that the performance of the derived correlation functions depends on the specific regulatory mechanisms. Finally, we introduce the idea of multi-class biclustering and with the help of support vector machines we demonstrate its improved classification performance in a microarray dataset.
Design of a high-performance unsteady Naiver-Stokes solver using a flexible-cycle additive-correction multigrid technique
Authors: Hongyi Xu, Weixing Yuan, Mahmood Khalid
Venue: Journal of Computational Physics (2005)

A multigrid technique, based on a flexible-cycle additive-correction multigrid (FCAC-MG) scheme, is utilized to design a high-performance solver for the unsteady incompressible Navier-Stokes (N-S) equations. The unsteady incompressible N-S solver discussed here incorporates the fractional step method and finite volume discretization over a staggered Cartesian grid. The current research indicates that the FCAC-MG acceleration technique is highly efficient, reliable and robust, which makes it feasible for CPU-intensive computations, such as large eddy simulation (LES) and direct numerical simulation (DNS). The high efficiency and the robustness of the solver are achieved through developing the FCAC-MG acceleration technique as well as flow-physics oriented solving strategies. The flow solver based on the FCAC-MG technique is applied to both temporal and spatial turbulence simulations using both LES and DNS. The residuals of the large-scale algebraic equation system are guaranteed to be continuously driven down to the level of the computer machine round-off error on each time marching step, which warrants strong conservations of mass and momentum satisfied over all the control volumes. In addition, the flow solver developed in the current research possesses the potential capability for handling complex geometry flows since the performance of the solver does not rely on the use of special type of operations on the large-scale algebraic equation system, unlike the cyclic reduction algorithm, but instead it is driven by a flow-physics oriented solving strategy. LES for flows in a square duct, a square annular duct and a confined square coaxial jet are performed to present the advantages of the FCAC-MG technique and the flow-physics oriented solving strategy. The analyses of the simulation results for these three flow configurations provide strong evidence that the flow solver based on FCAC-MG method is capable of capturing the major characteristics of turbulence physics and correctly predicting the relevant turbulent flow phenomena.
3D Facial Normalization with Spin Images and Influence of Range Data Calculation over Face Verification
Authors: Cristina Conde, Angel Serrano
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper face verification techniques have been performed over 3D data acquired by a Laser Scanner. Advantages of 3D face models have been used to perform a normalization task over each face. First, an original method to detect local features points, based on Spin Images, has been developed. Once local features, as the nose tip or eyes corners, have been detected, a normalization process is carried out. After face normalization, different depth maps are calculated using several transform functions to equalize the images. The adequacy of each equalization to face verification has been measured to determine which one emphasizes most the feature discrimination. Face verification has been performed through a Principal Component Analysis and a Support Vector Machine. Final results show the importance of a careful 3D normalization and an optimal election of the depth map towards a improvement in the verification method.
Supporting Organizational E-Learning
Authors: Ian Douglas
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

A learning organization is one that continuously monitors key performance metrics and collaboratively identifies interventions that can lead to measurable performance improvement. This paper will report upon the experience of developing software architecture for facilitating the continuous monitoring and improvement of individual and organizational performance. In collaboration with a number of analysts from the US military, software prototypes have been developed that demonstrate different models of performance improvement support. Together the prototypes and the common underlying architecture illustrate a configurable computing approach, and a means of improving performance, problem solving, knowledge reuse and sharing.
A research framework for software-fault localization tools
Authors: Steven P. Reiss
Venue:  (2005)

Once a program run exposes a bug, the programmers' first task is fault localization: identifying the portions of code they need to change to correct the bug. Help for this task takes the form of fault-localization tools, which vary from static code analyzers to debuggers. This dissertation develops a research framework for fault-localization tools that require only a set of runs, some of which fail, to produce their output. The first part of the framework is an architecture for fault-localization tools. The architecture prescribes five phases: data collection for each run, data abstraction for each run, modeling of sets of runs to produce models of correct and failing runs, contrasting the two models, and finally mapping the difference back to source code. This architecture also describes a number of existing tools. The second part of the framework provides an evaluation method for fault-localization tools, based on the effort an ideal user must invest to interpret a tool's results. This effort is measured as the proportion of code that lies between the report and the faulty locations on a graph representing the structure of source locations. The dissertation presents and evaluates a number of fault-localization tools developed within this framework that are built around program profiles and collections of dynamically discovered invariants. Notable contributions include the nearest neighbor idea, where failing runs are compared with their most similar successful run, and the discrete comparison and differencing of program profiles based on permutation distances. The combination of these two contributions achieved the best results of the tools we developed, as computed by the evaluation method. Finally, this dissertation presents and quantifies elided events, a cause for caution in the interpretation of program profile data. The problem is that the execution of a part of code may have no effect on the run's correctness. As a result, code that should be suspicious is considered safe, with adverse effects for debugging.
Numerical simulations of ring galaxies: first ring events, star formation, and am0644-741
Authors: Alex Antunes
Venue:  (2005)

We examine first ring events in collisional galaxy simulations in order to model physical systems such as AM0644-741 and to draw broader conclusions about the nature of first ring formation events. Rings in collisional remnant galaxies such as AM0644-741 are the result of the gas response of a disk galaxy to the near-center collision of a smaller neighboring galaxy. We discuss resolution biases in typical density-based star formation laws, offer an experimental star formation recipe of rndra dt , and also investigate the relatively low significance of heating, cooling and feedback mechanisms in determining the gross morphology and kinematics of collisional systems. Utilizing a very large search of the pericenter passage impact parameter phase space, we set constraints on the likely mass of the primary galaxy as well as providing insight into the time scales involved for ring formation and ring lifetime. We then focus on one simulation in depth to produce both a morphological and kinematic match to ring galaxy AM0644-741. A general approach to simulating observed systems is then presented.
Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct
Authors: Oscar Waddell, Dipanwita Sarkar, R. Kent Dybvig
Venue: Higher-Order and Symbolic Computation (2005)

A Scheme letrec expression is easily converted into more primitive constructs via a straightforward transformation given in the Revised5 Report. This transformation, unfortunately, introduces assignments that can impede the generation of efficient code. This article presents a more judicious transformation that preserves the semantics of the revised report transformation and also detects invalid references and assignments to left-hand-side variables, yet enables the compiler to generate efficient code. A variant of letrec that enforces left-to-right evaluation of bindings is also presented and shown to add virtually no overhead.
Learn to weight terms in information retrieval using category information
Authors: Rong Jin, Joyce Y. Chai, Luo Si
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

How to assign appropriate weights to terms is one of the critical issues in information retrieval. Many term weighting schemes are unsupervised. They are either based on the empirical observation in information retrieval, or based on generative approaches for language modeling. As a result, the existing term weighting schemes are usually insufficient in distinguishing informative words from the uninformative ones, which is crucial to the performance of information retrieval. In this paper, we present supervised term weighting schemes that automatically learn term weights based on the correlation between word frequency and category information of documents. Empirical studies with the ImageCLEF dataset have indicated that the proposed methods perform substantially better than the state-of-the-art approaches for term weighting and other alternatives that exploit category information for information retrieval.