ppxscal/embedding_network huggingface dataset:
An Ontology for Microarchitectural Design Knowledge
Authors: Javier Garzas, Mario Piattini
Venue: IEEE Software (2005)

Establishing a profession as a branch of engineering requires understanding that profession's accumulated knowledge. Software engineering has advanced greatly in recent years, but its knowledge still lacks a structured classification. In object-oriented microarchitectural design knowledge, design patterns are the most popular example of accumulated knowledge. However, elements such as principles, heuristics, best practices, "bad smells," and refactorings are not clearly defined. Many of these elements are synonymous, and others are just vague concepts. The authors present an ontology that structures and unifies such knowledge. This ontology differentiates between declarative and operative knowledge, and encompasses rules (principles, heuristic, bad smells, and so on), patterns, and refactorings. It also encompasses the differences and relationships between these types of knowledge.
TiNy Threads: A Thread Virtual Machine for the Cyclops64 Cellular Architecture
Authors: Juan del Cuvillo, Weirong Zhu, Ziang Hu, Guang R. Gao
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

This paper presents the design and implementation of a thread virtual machine, called TNT (or TiNy-Threads) for the IBM Cyclops64 architecture (the latest Cyclops architecture that employs a unique multiprocessor-on-a-chip design with a very large number of hardware thread units and embedded memory) - as the cornerstone of the C64 system software. We highlight how to achieve high efficiency by mapping (and matching) the TNT thread model directly to the Cyclops ISA features assisted by a native TNT thread runtime library. Major results of our experimental study demonstrate good efficiency, scalability and usability of our TNT model/implementation.
Support for arbitrary regions in XSL-FO: a proposal for extending XSL-FO semantics and processing model
Authors: Ana Cristina B. da Silva, Joao B. S. de Oliveira, Fernando T. M. Mano, Thiago B. Silva, Leonardo L. Meirelles, Felipe R. Meneguzzi, Fabio Giannetti
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes an extension of the XSL-FO standard which allows the specification of an unlimited number of arbitrarily shaped page regions. These extensions are built on top of XSL-FO 1.1 to enable flow content to be laid out into arbitrary shapes and allowing for page layouts currently available only to desktop publishing software. Such a proposal is expected to leverage XSL-FO towards usage as an enabling technology in the generation of content intended for personalized printing.
Analysis of long duration traces
Authors: Richard Nelson, Daniel Lawson, Perry Lorier
Venue: ACM SIGCOMM Computer Communication Review (2005)

This paper introduces a new set of long duration captures of Internet traffic headers. The capture is being performed on a continuous on-going basis and is approaching a year in duration. Based on the current extent of the archive some typical analyses are presented, covering protocol mix, network trip times and TCP flag analysis.
Short-range wireless technologies with mobile payments systems
Authors: Jiajun Jim Chen, Carl Adams
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Mobile devices and wireless technologies seem destined to make a large and continuing impact on our lives. Mobile devices especially have been widely used in the last few years, and recent developments in wireless technologies have provided some new solutions to problems of connectivity. Wireless technologies provide a new channel for implementation of mobile payments systems. The potential of short-range wireless technologies in commercial markets is enormous. Mobile payments is one such exciting application presently in development. Mobile payments systems offer great potential for both mobile and non-mobile products and services. However, in this early stage, mobile payments systems are facing some challenges. There are several available technologies for the applications and the mobile payments world is still waiting for standardization.This paper examines several available short-range wireless technologies for mobile payments systems. The ways in which short-range wireless technologies support mobile payments systems are explored. This paper also evaluates the advantages and issues involved with using these technologies. Finally, this paper will discuss the future developments of mobile payments with wireless technologies and the challenges faced by the mobile payments industry.
Noise aware behavioral modeling of the Ε-Δ fractional-N frequency synthesizer
Authors: Lei Yang, Cherry Wakayama, C.-J. Richard Shi
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents the behavioral model of a Ε-Δ fractional-N frequency synthesizer in terms of different noise sources and non-ideal effects. To accurately predict the phase noise of the synthesizer, different jitter noise sources such as phase modulation (PM) noise in phase-frequency detector and divider, frequency modulation (FM) noise in VCO are properly depicted. The Ε-Δ modulator, with its divider value dithered and quantization noise dynamically injected to the PLL, is described in behavioral model, which allows the designer to study the quantization noise impaction to the PLL phase noise. All the models are implemented in VHDL-AMS and simulated using Mentor Graphics ADvance-MS (ADMS). Our behavioral modeling method enables a fast simulation of the PLL system and an accurate phase noise prediction.
Characterizing achievable multicast rates in multi-hop wireless networks
Authors: Randeep Bhatia, Li (Erran) Li
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

In this paper, we consider the multicast throughput optimization problem in multi-hop wireless networks. Given a source, and a set of receivers, we would like to find the set of multicast trees and a schedule such that the rate that the source can multicast to the receivers is maximized. We consider two transmission models: broadcast and unicast. In the broadcast model, a transmission is received by multiple downstream nodes in a multicast tree. In the unicast model, a separate transmission has to be sent to each downstream node. We consider the fundamental constraint that a node can not be involved in multiple communications at the same time. We consider two multicast models: a single multicast tree per session and multiple multicast tree per session. In the single multicast tree case, (1) for the unicast model, we show that the problem is NP-hard and it is not approximable to a factor better than 1.5; we then give a 1.5-approximation algorithm if all links have the same data rate, a 5-approximation algorithm if all nodes have the same transmission power and a 24-approximation algorithm for a realistic heterogeneous ad hoc network where nodes can have different transmission power. (2) for the broadcast model, we show that the problem is NP-hard and it is not approximable to a factor better than 2; we then give a simple 2-approximation algorithm to find the multicast tree and the transmission schedule. In the multiple multicast tree case, (1) for the unicast model, we show that the problem is APX-hard, and give a 1.5Ρ-approximation where Ρ is the best approximation ratio of the minimal cost Steiner tree problem; (2) for the broadcast model, our results indicate that the problem is hard, may not be approximable within a factor better than log(n) where n is the number of multicast receivers. Our evaluation shows that the throughput achieved by our algorithms is much better than both the throughput achieved by using pruned shortest path tree and by using optimal unicast.
Ontology for genome comparison and genomic rearrangements: Conference Papers
Authors: Keith Flanagan, Robert Stevens, Matthew Pocock, Pete Lee, Anil Wipat
Venue: Comparative and Functional Genomics (2004)

We present an ontology for describing genomes, genome comparisons, their evolution and biological function. This ontology will support the development of novel genome comparison algorithms and aid the community in discussing genomic evolution. It provides a framework for communication about comparative genomics, and a basis upon which further automated analysis can be built. The nomenclature defined by the ontology will foster clearer communication between biologists, and also standardize terms used by data publishers in the results of analysis programs. The overriding aim of this ontology is the facilitation of consistent annotation of genomes through computational methods, rather than human annotators. To this end, the ontology includes definitions that support computer analysis and automated transfer of annotations between genomes, rather than relying upon human mediation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Tests for loop nuclei and a new criterion for a Latin square to be group-based
Authors: A. D. Keedwell
Venue: European Journal of Combinatorics (2005)

We give a new and simple criterion for a Latin square to be group-based and we provide easy-to-implement tests for whether a given element of a loop lies in any one of its three nuclei.
Multirate Periodic Systems and Constrained Analytic Function Interpolation Problems
Authors: Li Chai, Li Qiu
Venue: SIAM Journal on Control and Optimization (2005)

Multirate periodic systems and some related constrained analytic function interpolation problems are studied in this paper. After showing how to convert a general multirate periodic system to an equivalent linear time invariant (LTI) system with a structural constraint, we formulate some analytic function interpolation problems with such a constraint that can find various applications in the study of multirate and periodic systems. Both the solvability conditions and characterization of all solutions are presented to these constrained interpolation problems.
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
Authors: S. Ghanbari, M. R. Meybodi, K. Badie
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task assignment in heterogeneous computing systems. The proposed model is a combination of the case based reasoning and the learning automata model. In this new model a learning automata model is used as adaptation mechanism which adapts previously experienced cases to the problem to be solved. The objective of the proposed model is to reduce the number of iterations required to find a semi-optimum solution. The application is modeled as a set of independent tasks and the heterogeneous computing system is modeled as a network of machines. Using computer simulation, it is shown that the combined model outperforms the model that only uses learning automata.
Mixed Consistency Model: Meeting Data Sharing Needs of Heterogeneous Users
Authors: Zhiyuan Zhan, Mustaque Ahamad, Michel Raynal
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Heterogeneous users usually have different requirements as far as consistency of shared data is concerned. This paper proposes and investigates a mixed consistency model to meet this heterogeneity challenge in large scale distributed systems that support shared objects. This model allows combining strong (Sequential) consistency and weak (Causal) consistency. The paper defines the model, motivates it and proposes a protocol implementing it.
Signal Strength-Based Routing Protocol for Mobile Ad Hoc Networks
Authors: San-Yuan Wang, Jia-Yu Liu, Chun-Chien Huang, Mao-Yuan Kao, Yi-Ho Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Mobile ad hoc networks (MANET) have many applications in the civilian environmnet, law enforcement, military and disaster recovery arenas. To facilitate these applications, with heavy traffic among nodes, a stable and efficient routing protocol is crucial. In this paper, a signal strength-based. on-demand routing protocol has been proposed, which first uses the earliest established path to forward packets, then changes to the strongest signal strength path for long transmissions. Through exhaustive simulation on ns-2, our routing showed superior performance for various system parameters in a Ricean fading environment. When combined with a multi-rate MAC protocol, the performance was even more distinguished.
Spectral norm of random matrices
Authors: V. H. Vu
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this paper, we present a new upper bound for the spectral norm of symmetric random matrices with independent (but not necessarily identical) entries. Our results improve an earlier result of Füredi and Komlós and also correct an incomplete argument in their proof.
Referees (Additional List)
Venue: Management Science (2005)

Several referees were inadvertently omitted from the December 2004 issue of Management Science. The editors apologize for this oversight and offer their sincere thanks to the following referees for their vital support of the journal over the past year.
EMPOWERING INDUSTRIAL DESIGNERS
Authors: L. Colgan, A. Gupta, P. J. Rankin, R. Spence
Venue: ACM SIGCHI Bulletin (1991)

Industrial design is an important, but complex activity whose creative phases are poorly supported by computer aids. Numerical methods could assist the process of design innovation, but present many cognitive barriers to their exploitation. We describe an ambitious project aimed at bringing the power of one such method, optimisation, to analogue circuit engineers.
MRF Augmented Particle Filter Tracker
Authors: Hee Lin Wang, Loong-Fah Cheong
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In particle filter trackers, the object a posteriori distribution is severely distorted under more challenging situations like occlusion. To overcome the problem, this paper proposes a principled manner of augmenting the particle filter algorithm with an MRF based representation of the tracked object within a dynamic Bayesian framework, where the object is transformed into a composite of multiple MRF regions. This results in more accurate modeling, thus improving the tracking performance. Additionally, Metropolis based sampling of the regions enhances the tracker with an adaptive ability. Finally, the resultant generative model provides a natural framework to integrate multiple cues. Experiments show good tracking results for challenging situations.
Online Detection and Classification of Moving Objects Using Progressively Improving Detectors
Authors: Omar Javed, Saad Ali, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Boosting based detection methods have successfully been used for robust detection of faces and pedestrians. However, a very large amount of labeled examples are required for training such a classifier. Moreover, once trained, the boosted classifier cannot adjust to the particular scenario in which it is employed. In this paper, we propose a co-training based approach to continuously label incoming data and use it for online update of the boosted classifier that was initially trained from a small labeled example set. The main contribution of our approach is that it is an online procedure in which separate views (features) of the data are used for co-training, while the combined view (all features) is used to make classification decisions in a single boosted framework. The features used for classification are derived from Principal Component Analysis of the appearance templates of the training examples. In order to speed up the classification, background modeling is used to prune away stationary regions in an image. Our experiments indicate that starting from a classifier trained on a small training set, significant performance gains can be made through on-line updation from the unlabeled data.
National Science Foundation funding for computer science projects
Authors: Steve Cunningham
Venue: Journal of Computing Sciences in Colleges (2004)

This panel will highlight National Science Foundation programs of interest to college faculty, focusing on the Division of Undergraduate Education but including pointers to other NSF programs. The panel will include an NSF Program Director and two PIs of recent NSF-funded education projects.
Executing incoherency bounded continuous queries at web data aggregators
Authors: Rajeev Gupta, Ashish Puri, Krithi Ramamritham
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some function over distributed data items, for example, to determine when and whether (a) the traffic entering a highway from multiple feed roads will result in congestion in a thoroughfare or (b) the value of a stock portfolio exceeds a threshold. Using the standard Web infrastructure for these applications will increase the reach of the underlying information. But, since these queries involve data from multiple sources, with sources supporting standard HTTP (pull-based) interfaces, special query processing techniques are needed. Also, these applications often have the flexibility to tolerate some incoherency, i.e., some differences between the results reported to the user and that produced from the virtual database made up of the distributed data sources.In this paper, we develop and evaluate client-pull-based techniques for refreshing data so that the results of the queries over distributed data can be correctly reported, conforming to the limited incoherency acceptable to the users.We model as well as estimate the dynamics of the data items using a probabilistic approach based on Markov Chains. Depending on the dynamics of data we adapt the data refresh times to deliver query results with the desired coherency. The commonality of data needs of multiple queries is exploited to further reduce refresh overheads. Effectiveness of our approach is demonstrated using live sources of dynamic data: the number of refreshes it requires is (a) an order of magnitude less than what we would need if every potential update is pulled from the sources, and (b) comparable to the number of messages needed by an ideal algorithm, one that knows how to optimally refresh the data from distributed data sources. Our evaluations also bring out a very practical and attractive tradeoff property of pull based approaches, e.g., a small increase in tolerable incoherency leads to a large decrease in message overheads.
Exploring the use of structured musical stimuli to communicate simple diagrams: the role of context
Authors: James L. Alty, Dimitrios Rigas
Venue: International Journal of Human-Computer Studies (2005)

The results from previous experiments using structured musical stimuli to communicate coordinate locations within a graphical grid, navigation of an auditory cursor and simple shapes are used as a basis for further exploratory research to communicate diagrams. An experimental framework program (called AudioGraph) provided a platform for investigating musical information processing for blind users. Under this platform, simple arrangements of shapes (forming diagrams) were communicated to users using structured musical stimuli. Meaningfully arranged graphical shapes (at least for the visual sense) were communicated in the absence, and in the presence of a particular perceptual context or different perceptual contexts. The results indicated that perceptual context played an important role in the interpretation of the structured musical stimuli that communicated simple diagrams. The paper concludes with a discussion on the implications of the results, the role of context and the use of structured musical stimuli to communicate graphical information to visually impaired users.
PatchMaker: A Physical Network Patch Manager Tool
Authors: Joseph R. Crouthamel, James M. Roberts, Christopher M. Sanchez, Christopher J. Tengi
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

PatchMaker is a network management tool that tracks and stores descriptions of physical network patches in a database. Physical patches are cables that connect switches, patch panels, and room ports. PatchMaker allows administrators to manage switch ports from multiple vendors giving them the ability to enable/disable ports, make VLAN changes, and perform other switch port functions through a common web front-end. Finally, PatchMaker aids in host management by tracing network connections, identifying what kinds of devices are connected to the network, and helping to troubleshoot physical network problems.
The rising pitch metaphor: an empirical study
Authors: Dimitrios Rigas, James Alty
Venue: International Journal of Human-Computer Studies (2005)

This paper describes a set of experiments that investigated the use of rising pitch notes to communicate graphical information to visually impaired users. The information communicated in the experiments included coordinate locations within a 40 × 40 graphical grid, the navigation of an auditory cursor within the graphical grid, the communication of simple graphical shapes and their size. The five simple shapes communicated were rectangles, squares, circles, horizontal and vertical lines. Stereophony, timbre, rhythms, and short tunes were used in addition to the rising pitch metaphor to aid disambiguation. Results suggested that the rising pitch approach enabled visually impaired users to understand the graphical information communicated in the absence of any visual aid. The paper concludes with a discussion of the use of rising pitch metaphor to communicate graphical information.
Laplacian surface editing
Authors: O. Sorkine, D. Cohen-Or, Y. Lipman, M. Alexa, C. Rössl, H.-P. Seidel
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Surface editing operations commonly require geometric details of the surface to be preserved as much as possible. We argue that geometric detail is an intrinsic property of a surface and that, consequently, surface editing is best performed by operating over an intrinsic surface representation. We provide such a representation of a surface, based on the Laplacian of the mesh, by encoding each vertex relative to its neighborhood. The Laplacian of the mesh is enhanced to be invariant to locally linearized rigid transformations and scaling. Based on this Laplacian representation, we develop useful editing operations: interactive free-form deformation in a region of interest based on the transformation of a handle, transfer and mixing of geometric details between two surfaces, and transplanting of a partial surface mesh onto another surface. The main computation involved in all operations is the solution of a sparse linear system, which can be done at interactive rates. We demonstrate the effectiveness of our approach in several examples, showing that the editing operations change the shape while respecting the structural geometric detail.