ppxscal/embedding_network huggingface dataset:
Multimode power modeling and maximum-likelihood estimation
Authors: R. Chandramouli, Vamsi K. Srikantam
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

It is known that circuits exhibit multiple modes of power consumption due to various factors such as the presence of many feedback (or sequential) elements, RAM, large size, etc. Previous power-estimation techniques have largely ignored this fact. For example, Monte Carlo simulation-based power estimators tend to produce estimates for the average power consumption that corresponds only to the most probable power mode of the circuit. This can be a cause for trouble later in the design step. The aim of this paper is twofold. First, an algorithm is proposed that estimates the total number of power modes of a circuit based on simulated data. This is then followed by a maximum-likelihood estimation procedure that produces the average values of the power modes along with their probabilities of occurrence. Theoretical ideas are supported by experimental results for ISCAS'85 benchmark circuits and a large industrial circuit. The proposed method is shown to perform well by capturing the multiple power modes for both large and small circuits even when the number of simulated samples is small while the Monte Carlo estimator does not. We conclude with a note that the proposed method is also applicable to other model selection problems in VLSI.
Looking for love (in all the wrong places)
Authors: David West
Venue: ACM SIGPLAN Notices (2004)

Onward! Seeks future directions. The Feyerabend project seeks to redefine computing. Thoroughly disillusioned with traditional and contemporary practices, a significant number are looking for a software development profession that we can love. If a person has a history of repetitive (only the names change) unsuccessful relationships they are advised to look at themselves in order to discover the roots of the problem that leads to them making the same mistaken choices over and over again. The same advice can be given to our profession -- look inward to discover the true source of our problems. This paper introduces five factors that arise from reflective examination of computing and software development.
Rapidly retargetable interactive translingual retrieval
Authors: Gina-Anne Levow, Douglas W. Oard, Philip Resnik
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes a system for rapidly retargetable interactive translingual retrieval. Basic functionality can be achieved for a new document language in a single day, and further improvements require only a relatively modest additional investment. We applied the techniques first to search Chinese collections using English queries, and have successfully added French, German, and Italian document collections. We achieve this capability through separation of language-dependent and language-independent components and through the application of asymmetric techniques that leverage an extensive English retrieval infrastructure.
Accelerated Modeling and New Ferroelectric Materials for Naval SONAR
Authors: Ilya Grinberg, Valentino R. Cooper, Young-Han Shin, Andrew M. Rappe, Thomas J. Baring, Sam B. Cable
Venue: Proceedings of the 2004 Users Group Conference (2004)

We have computationally designed new materials for use in Naval SOund NAvigationRanging (SONAR). Our quantum-mechanical studies show that these lead-free, non-toxic oxides will be high-performance piezoelectrics with promise for use in Naval SONAR and communications applications. To enable this research, we also present techniques for greatly accelerated modeling of oxide materials. We show that a simple atomistic model accurately reproduces our quantum-mechanical results yet is thousands of times faster. We also report successful porting and performance tuning of our computer codes to the CRAY X1, resultingin a great speed-up over previous architectures.
Language-Based Information Erasure
Authors: Stephen Chong, Andrew C. Myers
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Real computing systems sometimes need to forget sensitive information. This paper explores the specification and semantics of information erasure policies, which impose a strong, end-to-end requirement that information be either erased or made less accessible. Simple lattice-based information flow policies, corresponding to a noninterference requirement, are augmented with the ability to express explicit erasure and declassification policies. Examples are given of applying this expressive policy language to real systems. The paper gives tools for reasoning about policy enforcement either statically or dynamically. Further, thesignificance of these policies to security is formally explained in terms of trace-based semantic security properties: generalizations of noninterference that accommodate erasure and declassification.
Rethinking of Medical Information Retrieval and Access
Authors: Nong Chen, Ajantha Dahanayake
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Personalized information retrieval and access is critical to applications in the medical and healthcare domain where the accuracy of the retrieved information and obtaining it in a time critical situation are extremely important. Existing personalized information retrieval and access approaches in the medical and healthcare domain have improved in the last decade, but the centralized system design principle is impeding their ability to be flexible and adaptiveto changing demands. These demands arise from the environment in which the approaches are used and from changing user requirements. In this paper we present our preliminary ideas regarding a new component-based design philosophy for personalized information retrieval and access services. We believe this paper offers a new way of thinking about the retrieval of time critical, personalized information from medical information systems.
Biologically Inspired Approaches to Automated Feature Extraction and Target Recognition
Authors: Gail A. Carpenter, Siegfried Martens, Ennio Mingolla, Ogi J. Ogas, Chaitanya Sai
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Ongoing research at Boston University has produced computational models of biological vision and learning that embody a growing corpus of scientific data and predictions. Vision models perform long-range grouping and figure/ground segmentation, and memory models create attentionally controlled recognition codes that intrinsically combine bottom-up activation and top-down learned expectations. These two streams of research form the foundation of novel dynamically integrated systems for image understanding. Simulations using multispectral images illustrate road completion across occlusions in a cluttered scene and information fusion from input labels that are simultaneously inconsistent and correct. The CNS Vision and Technology Labs (cns.bu.edu/visionlab and cns.bu.edu/techlab) are further integrating science and technology through analysis, testing, and development of cognitive and neural models for large-scale applications, complemented by software specification and code distribution.
Enhancing HMM-based biomedical named entity recognition by studying special phenomena
Authors: Jie Zhang, Dan Shen, Guodong Zhou, Jian Su, Chew-Lim Tan
Venue: Journal of Biomedical Informatics (2004)

The purpose of this research is to enhance an HMM-based named entity recognizer in the biomedical domain. First, we analyze the characteristics of biomedical named entities. Then, we propose a rich set of features, including orthographic, morphological, part-of-speech, and semantic trigger features. All these features are integrated via a Hidden Markov Model with back-off modeling. Furthermore, we propose a method for biomedical abbreviation recognition and two methods for cascaded named entity recognition. Evaluation on the GENIA V3.02 and V1.1 shows that our system achieves 66.5 and 62.5 F-measure, respectively, and outperforms the previous best published system by 8.1 F-measure on the same experimental setting. The major contribution of this paper lies in its rich feature set specially designed for biomedical domain and the effective methods for abbreviation and cascaded named entity recognition. To our best knowledge, our system is the first one that copes with the cascaded phenomena.
Smooth subdivision of tetrahedral meshes
Authors: S. Schaefer, J. Hakenberg, J. Warren
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We describe a new subdivision scheme for unstructured tetrahedral meshes. Previous tetrahedral schemes based on generalizations of box splines have encoded arbitrary directional preferences in their associated subdivision rules that were not reflected in tetrahedral base mesh. Our method avoids this choice of preferred directions resulting a scheme that is simple to implement via repeated smoothing. In an extended appendix, we analyze this tetrahedral scheme and prove that the scheme generates C2 deformations everywhere except along edges of the tetrahedral base mesh. Along edges shared by four or more tetrahedra in the base mesh, we present strong evidence that the scheme generates C1 deformations.
Filter Based Directory Replication: Algorithms and Performance
Authors: Apurva Kumar
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Directories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for Lightweight Directory Access Protocol (LDAP) directories. Instead of replicating entire subtrees from a Directory Information Tree (DIT), only entries matching a filter specification are replicated. Efficient algorithms for selecting such filters, keeping them synchronized with the master copy and for using them to answer directory queries have been proposed. Advantages of the filter based replication framework over existing subtree based mechanisms have been demonstrated for a real enterprise directory using real workloads.
Mobility assessment on-demand (MAOD) routing protocol for mobile ad hoc networks: Research Articles
Authors: Ruay-Shiung Chang, Wei-Wen Chen
Venue: Wireless Communications Mobile Computing (2004)

In ad hoc wireless networks, the high mobility of hosts is usually a major reason for link failures. The general &lsquo;shortest path&rsquo; based routing protocols may not lead to stable routes. In this paper, we propose a mobility assessment on-demand (MAOD) routing protocol to select a stable route in order to enhance system throughput and performance. An error count parameter is used to judge whether a host is highly mobile. The proposed MAOD routing protocol is an on-demand routing protocol similar to dynamic source routing (DSR). The difference between MAOD and DSR is in the path selection method. Because MAOD takes the mobility of hosts into consideration, it will select a more stable and reliable path than DSR. In comparison, DSR only considers whether this route is a shortest path or not. Finally, the system performance is analyzed by using the global mobile simulation (GloMoSim) simulator. We can observe that MAOD routing protocol outperforms DSR routing protocol especially in the high mobility environment. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Achieving high availability and performance computing with an HA-OSCAR cluster
Authors: Chokchai Box Leangsuksun, Lixin Shen, Tong Liu, Stephen L. Scott
Venue: Future Generation Computer Systems (2005)

High availability (HA) computing has long gained much attention in enterprise and mission critical systems. HA goals are to maximize the uptime, thus undoubtedly complementing high-performance computing (HPC) objectives. HA-OSCAR is a project that aims to improve HA in commercial-off-the-shelf (COTS)-based HPC environments. In this paper, we introduce a multihead HPC cluster architecture. Server redundancy is an initial key aspect aiming toward downtime reduction. Two HA-OSCAR types, active-standby and active-active, are studied. We evaluate system dependability for given two models. Stochastic Reward Nets (SRN) are used to model the system availability. We describe our SRN modeling using Stochastic Petri Net Package, and compute several interesting results that characterize HA-OSCAR availability.
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Authors: Bernard Jurkowiak, Chu Min Li, Gil Utard
Venue: Journal of Automated Reasoning (2005)

Because of the inherent NP-completeness of SAT, many SAT problems currently cannot be solved in a reasonable time. Usually, in order to tackle a new class of SAT problems, new ad hoc algorithms must be designed. Another way to solve a new problem is to use a generic solver and employ parallelism to reduce the solve time. In this paper we propose a parallelization scheme for a class of SAT solvers based on the DPLL procedure. The scheme uses a dynamic load-balancing mechanism based on work-stealing techniques to deal with the irregularity of SAT problems. We parallelize Satz, one of the best generic SAT solvers, with our scheme to obtain a parallel solver called PSatz. The first experimental results on random 3-SAT problems and a set of well-known structured problems show the efficiency of PSatz. PSatz is freely available and runs on any networked workstations under Unix/Linux.
STORYBOARD-BASED PROGRAMMING TOOLS
Authors: Michelle Fineblum, Henry Lieberman
Venue: ACM SIGCHI Bulletin (1991)

Despite the progress in graphical capabilities of hardware and software systems to date, programmers do their jobs with little to no graphic support. This absence of graphic support is particularly costly in the process of debugging. The process of debugging is arduous and expensive, and text-based tools are limited in that they can only provide a one-dimensional view of program execution. The crucial factor in the debugging process is the programmer's ability to visualize how the events in the program unfold over time.
Learning Feature Distance Measures for Image Correspondences
Authors: Xi Chen, Tat-Jen Cham
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Standard but ad hoc measures such as sum-of-squared pixel differences (SSD) are often used when comparing and registering two images that have not been previously observed before. In this paper, we propose a framework to address the problem of learning a parametric feature distance measure to measure the dissimilarity between pairs of images. The method is based on optimizing the parameters of the distance measure in order to minimize correspondence classification errors on training data. Because the learning process involves relative (rather than absolute) visual content between image pairs, the learned distance measure may also be applied to other images with very different visual content. Results on matching classification with a wide variety of image content show that the learned feature distance measure clearly outperforms the standard measures of SSD, chamfer and Bhattacharyya histogram distances.
Placement-Oriented Modeling of Partially Reconfigurable Architectures
Authors: Markus Koester, Mario Porrmann, Ulrich Ruckert
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Dynamic reconfiguration is a promising approach for resource efficient utilization of microelectronic systems. However, work on general approaches to model reconfigurable hardware is quite rare. Therefore, we have developed a new analytical model, which can be used for the analysis of the various approaches to dynamic reconfiguration. Based on our model we define metrics for partial reconfiguration to evaluate different system approaches. Our main objective is to analyze placement algorithms for partially reconfigurable architectures. The model is able to consider miscellaneous constraints and cost parameters for online placement. Thus, placement can be adapted to dynamically changing system environments.
Extending TPC-W to allow for fine grained workload specification
Authors: Christian Kurz, Carlos Guerrero, Günter Haring
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This paper presents a method to characterize workload from a web server logfile from a user perspective. The data obtained in this process is used to create workload for the TPC-W benchmark.
A formal approach to lock escalation
Authors: Ji-Woong Chang, Kyu-Young Whang, Young-Koo Lee, Jae-Heon Yang, Yong-Chul Oh
Venue: Information Systems (2005)

Since database management systems(DBMSs) have limited lock resources, transactions requesting locks beyond the limit must be aborted, degrading the performance abruptly. Lock escalation is considered a solution to this problem. However, existing lock escalation methods have been designed in an ad hoc manner. So, they do not provide a complete solution. In this paper, we propose a formal model of lock escalation. Using the model, we analyze the roles of lock escalation formally and solve the problems of the existing methods systematically. In particular, we introduce the concept of the unescalatable lock that cannot be escalated due to conflicts. We identify that the unescalatable lock is the major cause of exhausting lock resources. We then analyze the reasons why unescalatable locks are generated and propose a new lock escalation method, adaptive lock escalation, which controls lock escalation based on the number of unescalatable locks. Through extensive simulation, we show that adaptive lock escalation significantly outperforms existing methods reducing the number of aborts and the average response time and increasing the throughput to a great extent. Adaptive lock escalation drastically reduces (more than 10 fold) the number of lock resources required to maintain the same level of throughput and average response time. At the same time, the throughput and average response time when using adaptive lock escalation are rather insensitive to the number of lock resources. Existing methods rely on users to estimate this number accurately at system initialization time. Adaptive lock escalation greatly alleviates this burden.
Leap-Frog Packet Linking and Diverse Key Distributions for Improved Integrity in Network Broadcasts
Authors: Michael T. Goodrich
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

We present two new approaches to improving the integrity of network broadcasts and multicasts with low storage and computation overhead. The first approach is a leapfrog linking protocol for securing the integrity of packets as they traverse a network during a broadcast, such as in the setup phase for link-state routing. This technique allows each router to gain confidence about the integrity of a packet before passing it on to the next router; hence, allows many integrity violations to be stopped immediately in their tracks. The second approach is a novel key predistribution scheme that we use in conjunction with a small number of hashed message authentication codes (HMACs), which allows end-to-end integrity checking as well as improved hop-by-hop integrity checking. Our schemes are suited to environments, such as in ad hoc and overlay networks, where routers can share only a small number of symmetric keys. Moreover, our protocols do not use encryption (which, of course, can be added as an optional security enhancement). Instead, security is based strictly on the use of one-way hash functions; hence, our algorithms are considerably faster than those based on traditional public-key signature schemes. This improvement in speed comes with only modest reductions in the security for broadcasting, as our schemes can tolerate small numbers of malicious routers, provided they donýt form significant cooperating coalitions.
A comparison of optimal scaling and preconditioning
Authors: D. J. Evans, M. Hatzopoulos
Venue: ACM SIGNUM Newsletter (1979)

In this paper we shall compare two methods proposed for the equilibration of ill-conditioned linear systems when the coefficient matrix is small, dense and positive definite. Many workers have discussed ways of overcoming the problem of ill-conditioning and the main theme of all the methods is to transform the given system to one where the coefficient matrix is better conditioned.
A technique for automatic component extraction from object-oriented programs by refactoring
Authors: Hironori Washizaki, Yoshiaki Fukazawa
Venue: Science of Computer Programming (2005)

Component-based software development (CBD) is based on building software systems from previously-existing software components. In CBD, reuse of common parts in component form can reduce the development cost of new systems, and reduce the maintenance cost associated with the support of these systems. However, existing programs have usually been built using another paradigm, such as the object-oriented (OO) paradigm. OO programs cannot be reused rapidly or effectively in the CBD paradigm even if they contain reusable functions. In this paper, we propose a technique for extracting components from existing OO programs by our new refactoring "Extract Component". Our technique of refactoring can identify and extract reusable components composed of classes from OO programs, and modify the surrounding parts of extracted components in original programs. We have developed a system that performs our refactoring automatically and extracts JavaBeans components from Java programs. As a result of evaluation experiments, it is found that our system is useful for extracting reusable components along with usage examples from Java programs.
Distributed XML Stream Filtering System with High Scalability
Authors: Hiroyuki Uchiyama, Makoto Onizuka, Takashi Honishi
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We propose a distributed XML stream filtering system that uses a large number of subscribersý profiles, written in XPath expressions, to filter XML streams and then publish the filtered data in real-time. To realize the proposed system, we define XPath expression features on XML data and utilize them to forecast the serversý loads. Our method is realized by combining methods to share the total transfer loads of each filtering server and to equalize the sum of overlap size between filtering servers. Experiments show that the rate at which the publishing time increases with the number of XPath expressions is three times smaller in the proposed system than in the round-robin method. Furthermore, the overhead of the proposed method is quite low.
The Erdös-Menger conjecture for source/sink sets with disjoint closures
Authors: Reinhard Diestel
Venue: Journal of Combinatorial Theory Series B (2005)

Erdös conjectured that, given an infinite graph G and vertex sets A, B ⊆ V(G), there exist a set P of disjoint A-B paths in G and an A-B separator X 'on' P, in the sense that X consists of a choice of one vertex from each path in P. We prove the conjecture for vertex sets A and B that have disjoint closures in the usual topology on graphs with ends. The result can be extended by allowing A, B and X to contain ends as well as vertices.