ppxscal/embedding_network huggingface dataset:
Dual-Modulus Prescaler Based on Transmission Gates and Pseudo-PMOS Logic
Authors: Ram Singh Rana
Venue: Analog Integrated Circuits and Signal Processing (2005)

The Dual Modulus Prescaler is a critical block in CMOS systems like high speed frequency synthesizers. The design of high divide-by-value, high speed and low power dual modulus prescaler, however, remains a design challenge. In order to face the challenge, this paper introduces an idea of using transmission gates and pseudo-PMOS logic in realization of the dual modulus prescaler. The topology of the prescaler proposed in this paper is different from the prior designs primarily in two ways: (i) it uses transmission gates in the critical path and (ii) the D-flip flops used in the synchronous counter are comprised of pseudo-PMOS invertors and ratioed latches. A design of the pseudo-PMOS logic based DFF is introduced and used in the proposed prescaler design. Based on the proposed topology, a dual-modulus divide-by-127/128 prescaler is implemented in 0.35 ¿ m CMOS technology. Its maximum operating frequency is observed as 2.4 GHz. It consumes 4.8 mW power from a 3 V supply. Circuit operations and measurement results are provided. The silicon estate required is only 0.06 mm2. There is no flip flop and logic gate in the critical path. The proposed topology is suitable firstly for the high speed and high divide-by-value prescaler designs. Secondly, it reduces: (i) design complexity, (ii) power consumption and (iii) load to preceding circuit.
Towards asymptotic optimality in probabilistic packet marking
Authors: Micah Adler, Jeff Edmonds, Jivri Matousek
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

There has been considerable recent interest in probabilistic packet marking schemes for sending information from nodes (routers) along one or more paths traveled by a stream of packets to the end-host receiving that stream. A central consideration for such schemes is the tradeoff between the number B of possible states of the marking bits in a packet, the number of bits n of information being sent by the nodes, and the expected number of packets T required to reconstruct this information. For the case where the packets all travel along the same path, we prove a lower bound of T ≥ Ω(B22n/(B-1)), roughly the square of an earlier lower bound of Adler.For an upper bound, we consider a model where each of m nodes along a single path must send one of s possible messages (thus n = m log2 s total bits are sent). We prove that T ≤ O(m • 22m(log2 s)/(B-1)) suffices (the implicit constant depends on B and s); this almost matches the lower bound, and is roughly the square root of an earlier upper bound of Adler. The new bound holds for all B and s in two slightly relaxed models, while under the strictest requirements we prove it only for some special values of B and s. This is related to a challenging geometric problem: the existence of an s-reptile (B-1)-dimensional simplex, i.e. a simplex S that can be tiled by s congruent simplices similar to S.We also consider the case where the packets travel along multiple paths to the same destination. In this case, we present a new protocol and analysis technique that together allow us to significantly generalize over previous work the scenarios where the protocol is effective.
Visualization and analysis of phased behavior in Java programs
Authors: Priya Nagpurkar, Chandra Krintz
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

To enable analysis and visualization of phased behavior in Java programs and to facilitate optimization development, we have implemented a freely-available, phase analysis framework within JikesRVM. The framework couples existing techniques into a unifying set of tools for data collection, processing, and analysis of dynamic phased behavior in Java programs. The framework enables program and optimization developers to significantly reduce analysis time and target optimization (by-hand or automatic) to parts of the code that will recur with sufficient regularity. We use the framework to evaluate phased behavior in the SpecJVM benchmark suite.
Automating metadata generation: the simple indexing interface
Authors: Kris Cardinaels, Michael Meire, Erik Duval
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

In this paper, we focus on the development of a framework for automatic metadata generation. The first step towards this framework is the definition of an Application Programmer Interface (API), which we call the Simple Indexing Interface (SII). The second step is the definition of a framework for implementation of the SII. Both steps are presented in some detail in this paper. We also report on empirical evaluation of the metadata that the SII and supporting framework generated in a real-life context.
Galaxy DS: Directory Service for Service Composition Based on Smart Space Structure
Authors: Jun'ichi Yura, Jin Nakazawa, Hideyuki Tokuda
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

This paper proposes a service model based on the service hierarchical structure called Galaxy Service Model, and a service discovery framework called Galaxy Service Directory System. In a ubiquitous computing environment, software services are embedded into various devices. The application construction requires service discovery mechanism and a recursive definition of services. The service discovery mechanism should, therefore, provide applications with common interface to look up the hierarchically represented composite services. In existing service framework, applications cannot be combined into other applications, since they do not provide the recursive service representation facility. In contrast, a service in Galaxy has a hierarchical description by deploying nested services. This model makes other services and applications to deal with an application that is composed by services. Galaxy service directory system facilitates structure-bounded service registration and service discovery. The system enables applications to find different composition-levels of services through a common interface.
Disciplined Methods of Software Specification: A Case Study
Authors: Robert L. Baber, David L. Parnas, Sergiy A. Vilkomir, Paul Harrison, Tony O'Connor
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

We describe our experience applying tabular mathematical approaches to software specifications. Our purpose is to show alternative approaches to writing tabular specifications and to help practitioners who want to apply such methods by allowing them to pick the best one for their problem. The object for the case study is software used by Dell Products for testing the functionality of the keyboards on notebook computers. Starting from informal documents, we developed a variety of tabular representations of finite state machine specifications and tabular trace specifications. We found that the discipline required by these methods raised issues that had never been considered and resulted in documents that were both more complete and much clearer. The various tabular representations are compared from a user's point of view, i.e., clarity, consistency, unambiguity, completeness, suitability, etc.
Optimal placement of a two-link planar manipulator using a genetic algorithm
Authors: Lianfang Tian, Curtis Collins
Venue: Robotica (2005)

In this paper, we study the base placement problem for a two-degree-freedom-robot. The feasible area for the robot base is described, and its manipulability measure is formulated. To find the optimal base location of the robot, we develop a genetic algorithm (GA) to search for the valid solution in the reachable area of the robot base. To speed up the evolutionary process, we keep the elitists from one generation to the next generation according to certain elitist rate. The genetic algorithm approach is beneficial because it can also be extended to trajectory planning for robots with more degrees-of-freedom. We demonstrate the algorithm with some examples.
A database-driven web application in 18 lines of code
Authors: Paul Barry
Venue: Linux Journal (2005)

Want to see all the code for a soccer team tracking application? Want to see it again?
Super realistic and surrealistic visualizations in physics, math and computer science
Authors: Stuart L. Hutton, David L. Sonnier
Venue: Journal of Computing Sciences in Colleges (2005)

In our internet-enabled classrooms, many tools are freely available to present students with interactive experiential learning opportunities. At Lyon College, we have spent time and energy studying techniques for constructing animations to enhance learning. Mathematics and Physics concepts are presented using surrealistic animations which demonstrate difficult ideas in short "concept clips" that can be accessed at appropriate times. We have found that this approach is greatly appreciated by students and indeed may serve to enable educators to present difficult concepts in a way that captures the students' imagination and facilitates comprehension. In our presentation, we will show several of these visualizations, discussing the particular algorithm, theorem or physical law which is applicable.
On Declassification and the Non-Disclosure Policy
Authors: Ana Almeida Matos, Gerard Boudol
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

We address the issue of declassification in a language-based security approach. We introduce, in a Core ML-like language with concurrent threads, a declassification mechanism that takes the form of a local flow policy declaration. The computation in the scope of such a declaration is allowed to implement information flow according to the local policy. This dynamic view of information flow policies is supported by a concrete presentation of the security lattice, where the confidentiality levels are sets of principals, similar to access control lists. To take into account declassification, and more generally dynamic flow policies, we introduce a generalization of non-interference, that we call the non-disclosure policy, and we design a type and effect system for our language that enforces this policy.
Parallelization Strategies for Rollout Algorithms
Authors: F. Guerriero, M. Mancini
Venue: Computational Optimization and Applications (2005)

Rollout algorithms are innovative methods, recently proposed by Bertsekas et al. [3], for solving NP-hard combinatorial optimization problems. The main advantage of these approaches is related to their capability of magnifying the effectiveness of any given heuristic algorithm. However, one of the main limitations of rollout algorithms in solving large-scale problems is represented by their computational complexity. Innovative versions of rollout algorithms, aimed at reducing the computational complexity in sequential environments, have been proposed in our previous work [9]. In this paper, we show that a further reduction can be accomplished by using parallel technologies. Indeed, rollout algorithms have very appealing characteristics that make them suitable for efficient and effective implementations in parallel environments, thus extending their range of relevant practical applications.We propose two strategies for parallelizing rollout algorithms and we analyze their performance by considering a shared-memory paradigm. The computational experiments have been carried out on a SGI Origin 2000 with 8 processors, by considering two classical combinatorial optimization problems. The numerical results show that a good reduction of the execution time can be obtained by exploiting parallel computing systems.
Resolution cannot polynomially simulate compressed-BFS
Authors: Doron B. Motter, Jarrod A. Roy, Igor L. Markov
Venue: Annals of Mathematics and Artificial Intelligence (2005)

Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to find proofs by resolution. However it has been known since the 1980s that every resolution proof of the pigeonhole principle (PHPnm), suitably encoded as a CNF instance, includes exponentially many steps [18]. Therefore SAT solvers based upon the DLL procedure [12] or the DP procedure [13] must take exponential time. Polynomial-sized proofs of the pigeonhole principle exist for different proof systems, but general-purpose SAT solvers often remain confined to resolution. This result is in correlation with empirical evidence. Previously, we introduced the Compressed-BFS algorithm to solve the SAT decision problem. In an earlier work [27], an implementation of a Compressed-BFS algorithm empirically solved $\overline{\mathrm{PHP}_{n}^{n+1}}$ instances in ¿(n4) time. Here, we add to this claim, and show analytically that these instances are solvable in polynomial time by Compressed-BFS. Thus the class of tautologies efficiently provable by Compressed-BFS is different than that of any resolution-based procedure. We hope that the details of our complexity analysis shed some light on the proof system implied by Compressed-BFS. Our proof focuses on structural invariants within the compressed data structure that stores collections of sets of open clauses during the Compressed-BFS algorithm. We bound the size of this data structure, as well as the overall memory, by a polynomial. We then use this to show that the overall runtime is bounded by a polynomial.
Subband decomposition soft-decision algorithm for heart rate variability analysis in patients with obstructive sleep apnea and normal controls
Authors: Abdulnasir Hossen, Bader Al Ghunaimi, Mohammed O. Hassan
Venue: Signal Processing (2005)

A new method for screening of obstructive sleep apnea (OSA) is investigated. This method is based on the estimation of the energy distribution of the R-R interval (RRI) signals in the time domain. The novelty of the technique arises from the implementation of the soft-decision algorithm of subband decomposition. This soft-decision algorithm will help in finding the ratio of energy (power spectral density (PSD)) in the different frequency bands of the RRI spectrum without implementing any transform technique. Two different ratios--low-frequency/very low-frequency (LF/VLF) and low-frequency/high-frequency (LF/HF)--are used for screening normal and apnea cases. The algorithm can be implemented directly on the (RRI) raw-data or after some pre-processing and filtering steps. The training data used in this study are drawn from the MIT-trial database, while the test data are drawn from the MIT-challenge (chal) database as well as from the sleep disorders laboratory of Sultan Qaboos University (SQU) hospital. Threshold values to identify normal and OSA cases are selected using the receiver operating characteristics (ROC) on the training data. These threshold values are then used for the screening of the test data. The best classification accuracy obtained with the test data (MIT-chal and SQU data) approaches 93% using the LF/VLF ratio. In this case, the sensitivities obtained with MIT-chal and SQU data are 95% and 100%, respectively, while the specificities are 90% and 86% for the same two groups of data.
Real-Time Non-Rigid Surface Detection
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches between an undeformed image of the object and the image in which it is to be detected. The matches are used not only to detect but also to compute a precise mapping from one to the other. The algorithm is robust to large deformations, lighting changes, motion blur, and occlusions. It runs at 10 frames per second on a 2.8 GHz PC and we are not aware of any other published technique that produces similar results. Combining deformable meshes with a well designed robust estimator is key to dealing with the large number of parameters involved in modeling deformable surfaces and rejecting erroneous matches for error rates of up to 95%, which is considerably more than what is required in practice.
Automatic Hybrid Registration for 2-Dimensional CT Abdominal Images
Authors: Xiuying Wang, David Dagan Feng
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Registration of abdominal images plays an important role in clinical practice, however, because of the complex deformations of organ structure and volume, abdominal image registration remains a challenge. In this paper, a hybrid registration approach is proposed, which consists of two procedures: intensity-based registration procedure and landmark-based registration procedure. In intensity-based registration, in order to speed up registration convergence and to improve registration computation efficiency, a wavelet-based hierarchical method is proposed, in which the global displacements are corrected using mutual information algorithm. In landmark-based registration, firstly, the landmark points are selected automatically; and then, the local non-linear deformations are corrected using thin-plate splines elastically. By combining the advantages of intensity-based registration method and that of landmark-based method, the proposed approach can register the images accurately and efficiently. The registration performance of the proposed algorithm is validated by experiments on clinical computed tomography (CT) abdominal images.
Introducing data mining
Authors: Richard Connelly
Venue: Journal of Computing Sciences in Colleges (2004)

An introduction to data mining has been incorporated into two courses. The breadth of data mining makes it a challenge to select material and topics. This paper discusses the material evaluated and the material and topics selected. The paper continues with a condensed version of the material presented to students.
EGRID Project: Experience Report on the Implementation of a Grid Infrastructure for the Analysis of Financial Data
Authors: Angelo Leto, Ezio Corso, Riccardo Murri, Alessio Terpin, Cristian Zoicas, Stefano Cozzini
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The EGRID project aims at implementing a national facility for processing economic and financial data using computational grid technology. As such, it acts as the underlying fabric on top of which partner projects, more strictly focused on research in itself, develop end-user applications. In this paper we present the first release of the infrastructure, which is based on European DataGrid (EDG) middleware and is hosted as an independent Virtual Organization (VO) within INFN-GRID. However, the EDG middleware is partially inadequate for our partners because of security, privacy and user friendliness. A detailed discussion of temporary workarounds and planned future enhancements will be presented.
Application of redundant computation in software performance analysis
Authors: Zakarya Alzamil, Bogdan Korel
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Redundant computation is an execution of a program statement(s) that does not contribute to the program output. The same statement on one execution may exhibit redundant computation whereas on a different execution, it contributes to the program output. A redundant (dead) statement always exhibits redundant computation, i.e., its execution is always redundant. However, a statement that exhibits redundant computation is not necessarily a redundant statement. Redundant computation represents a partial redundancy of a statement. A high degree of redundant computation in a program may indicate a performance deficiency. Therefore, elimination (or reduction) of redundant computation may improve program's performance. In this paper we present an approach of automated detection of redundant computation in programs and show its application in performance analysis. We developed a tool that automatically detects redundant computations in C programs and identifies potential performance deficiencies related to redundant computation. We have performed an experimental study that showed that redundant computation is a commonly occurring phenomenon in programs, and it is frequently a source of performance deficiency.
Extensions for interactivity and retargeting in X3D
Authors: Pablo Figueroa, Omer Medina, Roger Jiménez, José Martínez, Camilo Albarracín
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

This paper presents X3D extensions that support complex virtual reality (VR) applications, in which novel interaction techniques and devices can be used and easily replaced. It is based on previous work on the Interaction Techniques Markup Language (In Tml) and some immersive VR applications we have developed. The main objectives of this proposal are to facilitate changes in VR applications among different VR setups, and to ease the development of highly interactive VR applications. X3D applications in our scheme explicitly describe all its devices, navigation, and interaction techniques, in order to facilitate changes. We ease the development of VR applications with a platform-independent set of reusable components, and a framework that describes where to locate new extensions. We describe here such extensions and the integration mechanisms to the current X3D specification.
StreamGlobe: adaptive query processing and optimization in streaming P2P environments
Authors: Bernhard Stegmaier, Richard Kuntschke, Alfons Kemper
Venue: Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004 (2004)

Recent research and development efforts show the increasing importance of processing data streams, not only in the context of sensor networks, but also in information retrieval networks. With the advent of various mobile devices being able to participate in ubiquitous (wireless) networks, a major challenge is to develop data stream management systems (DSMS) for information retrieval in such networks. In this paper, we present the architecture of our StreamGlobe system, which is focused on meeting the challenges of efficiently querying data streams in an ad-hoc network environment. StreamGlobe is based on a federation of heterogeneous peers ranging from small, possibly mobile devices to stationary servers. On this foundation, self-organizing network optimization and expressive in-network query processing capabilities enable powerful information processing and retrieval. Data streams in StreamGlobe are represented in XML and queried using XQuery. We report on our ongoing implementation effort and briefly show our research agenda.