ppxscal/embedding_network huggingface dataset:
A study on the maximum speed and reliability assurance in wave pipeline-based combinational circuits
Authors: Nohpill Park
Venue:  (2006)

Scope and method of study. Wave pipeline is one of the revolutionary technologies beyond conventional pipeline in the microprocessor architecture research area. Clockless wave pipeline is the cutting-edge and innovative pipeline without relying on clock signal. Due to the stringent requirement for high density and performance of current VLSI technology, reliability is being considered as one of the most crucial issues. Reliability modeling and optimization techniques have been applied extensively. Clock frequency is one of the keys to achieve the fast circuit speed. A clock cycle time optimization and analysis method is proposed in order to achieve a ultra high clock frequency in the context of the proposed new wave pipeline. Findings and conclusions. The reliability-driven design and optimization techniques for the clockless wave pipeline are proposed. It is mainly focused on the two parts, i.e., request signal and datawave. A more aggressive technology beyond wave pipeline with ultra-high throughput and speed towards maximum circuit frequency is mainly proposed, analyzed, simulated, and verified.
Predicting Stock Prices Using a Hybrid Kohonen Self Organizing Map (SOM)
Authors: Mark O. Afolabi, Olatoyosi Olude
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A challenging and daunting task for financial investors is determining stock market timing-when to buy, sell and the future price of a stock. This challenge is due to the complexity of the stock market. New methods have emerged that increase the accuracy of stock prediction. Examples of these methods are Fuzzy logic, Neural Network and hybridized methods such as hybrid Kohonen Self Organizing Map (SOM), Adaptive Neuro-Fuzzy Inference System (ANFIS) etc. This paper presents a number of methods used to predict the stock price of the day. These methods are Backpropagation, Kohonen SOM, and a hybrid Kohonen SOM. The results show that the difference in error of the hybrid Kohonen SOM is significantly reduced compared to the other methods used. Hence, the results suggest that the hybrid Kohonen SOM is a better predictor compared to Kohonen SOM and Backpropagation.
Performance Analysis of Hybrid-ARQ Characteristics in HSDPA
Authors: Irene Bruin, Frank Brouwer, Neill Whillans, Yusun Fu, Youqian Xiao
Venue: Wireless Personal Communications: An International Journal (2007)

This paper describes network level simulation results for Enhanced UMTS. High-Speed Downlink Packet Access (HSDPA) enhances both the capacity and the peak rate of WCDMA-based systems. Link adaptation and Hybrid-Automatic Repeat reQuest (H-ARQ) are two key functions creating these enhancements. This paper considers the results of different aspects of the H-ARQ process. This process is considered from two viewpoints. The results are mainly gathered from the ns-2 based network level simulator Enhanced UMTS Radio Access Networks Extension (EURANE). This is a network level simulator with realistic traffic and user scenarios. Also results from a more fundamental analysis of H-ARQ characteristics based on link-level results will be included. In this more fundamental point of view, only the underlying channel conditions are used for a preliminary study of new ideas. The rounding down and delaying of the CQI reporting both have a significant impact on throughput and transfer delay of the HSDPA channel. The analysis of the link-level results provides a first insight how different parts of the WCDMA system interact with each other and impact the end-to-end performance as experienced by the user. Both viewpoints show that the H-ARQ functionality indeed enhances the capacity and peak rate of the WCDMA system.
Dynamic contextualization using augmented reality
Authors: Charles B. Owen
Venue:  (2006)

This thesis investigates the technical possibility and human factors associated with dynamic contextualization using Augmented Reality technologies. Dynamic contextualization, a new term developed during this research, goes beyond traditional context-aware computing. Dynamic contextualization not only discovers and utilizes context information as a factor in the user interface design, but also modifies context using augmentations and diminishments, virtually contextualizing real object with virtual objects that have connections to the real object. Dynamic contextualization is a new method of human computer interaction. Since the context setting can be manipulated by dynamic contextualization, people's perspectives of the real world can be directed and influenced. Further more, this thesis discusses the application of employing context-aware computing into Augmented Reality systems. Context-aware augmented reality systems can selectively provide more relevant information to users so that the augmentations are more meaningful and useful without disturbing users with excessive information. In addition to providing more relevant information, context-aware computing also provides augmented reality system with more realistic blending if the geometry context and illumination context are taken into account. For example, the virtual elements will be more realistic if they can be lit and shadowed as if the light source was the same as that of the real world. This research investigates the context-aware solutions and dynamic contextualization for augmented reality systems based on the PromoPad test-bed system an augmented reality powered shopping assistant. Several user studies conducted using the system demonstrate the effectiveness of dynamic contextualization. This thesis first presents an overview of context-aware augmented reality technologies. Then the concept of dynamic contextualization is presented in detail. The thesis discusses the design of PromoPad, the test-bed system and user experiments and data analysis that illustrate the effectiveness of the device.
Simple, effective estimation of frequency based on Prony's method
Authors: D. W. Tufts
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We address the design of hardware-efficient digital implementations for the estimation of sinusoidal frequency from noisy data. We are motivated by the design of digital microwave receivers with high sample rates, which thus require simple processing to be cost-effective. By a controlled introduction of potential ambiguities and by use of formulas for the noise-free Prony (1795), or linear prediction coefficients, we provide several novel approaches to simple, effective frequency estimation.
Interlanguage object sharing with SOM
Authors: Jennifer Hamilton
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

Object-oriented programming languages may encourage reuse at the source code level, but they inhibit reuse at the binary object level. Differences in object representation make it much more difficult to share objects, even across different implementations of the C++ language, than to share libraries between different procedural languages such as C and Fortran. IBM has addressed this problem through the System Object Model (SOM). The purpose of this paper is to provide a brief description of the SOM and the mapping from SOM to the object models of several languages: C++, Smalltalk, OO COBOL, and to discuss how binary object interoperability can be achieved through SOM.
Dynamic Malleability in Iterative MPI Applications
Authors: Kaoutar El Maghraoui, Travis J. Desell, Boleslaw K. Szymanski, Carlos A. Varela
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Malleability enables a parallel application's execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to dynamic execution environments, it is limited by the granularity of the application's processes. Malleability empowers process migration by allowing the application's processes to expand or shrink following the availability of resources. We have implemented malleability as an extension to the PCM (Process Checkpointing and Migration) library, a user-level library for iterative MPI applications. PCM is integrated with the Internet Operating System (IOS), a framework for middleware-driven dynamic application reconfiguration. Our approach requires minimal code modifications and enables transparent middlewaretriggered reconfiguration. Experimental results using a two-dimensional data parallel program that has a regular communication structure demonstrate the usefulness of malleability.
Using ethics problems to teach the design method
Authors: J. A. Pearce
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

As an experiment the author has used a method of analysis of ethical problems developed by Dr. Heinz Luegenbiehl of the Rose-Hulman Institute of Technology to teach the design method. In his algorithm a series of analytical steps which closely parallel those of the engineering design method is followed to select an action pathway which solves an ethical dilemma. The ethical problems may be hypothetical, historical in origin, or some hybrid of these. In class, an ethical analysis problem was included in many of the homework sets to give practice in ethics, group work and design. This approach has four advantages: (1) it does not rely on detailed ethical theory, simple common-sense analysis is used; (2) it permits inclusion of ethics into everyday classwork; (3) it teaches the design process independently of design itself; and (4) it raises the consciousness of students to the importance of ethics in engineering practice. The technique has been tried in a senior elective class on electromagnetics (Fall 1996), and in a junior level required class on electronics (Spring 1997) and will be tried in a freshman required class Introduction to EE (Fall 1997). Initial results are far more positive than originally expected (in terms of student performance), and student reaction is also positive.
A Survey on Hair Modeling: Styling, Simulation, and Rendering
Authors: Kelly Ward Florence Bertails Tae-Yong Kim Stephen R. Marschner Marie-Paule Cani Ming C. Lin
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Realistic hair modeling is a fundamental part of creating virtual humans in computer graphics. This paper surveys the state of the art in the major topics of hair modeling: hairstyling, hair simulation, and hair rendering. Because of the difficult, often unsolved problems that arise in all these areas, a broad diversity of approaches are used, each with strengths that make it appropriate for particular applications. We discuss each of these major topics in turn, presenting the unique challenges facing each area and describing solutions that have been presented over the years to handle these complex issues. Finally, we outline some of the remaining computational challenges in hair modeling.
Enthusing and informing potential computer science students and their teachers
Authors: Quintin I. Cutts, Margaret I. Brown, Lynsey Kemp, Calum Matheson
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

School curricula contain little direct Computer Science (CS) content, and pupil surveys confirm that pupils have little idea what CS is. A range of initiatives have been introduced by universities to address this problem, and so attract more CS students. This paper presents the Computer Science Inside... project, one such initiative, the primary goals of which are to provide materials for use in secondary school classrooms, and to motivate and prepare the teachers to deliver them. The materials are principally workshops, to be conducted away from machinery and which bring out key CS concepts underpinning ubiquitous IT products such as the mobile phone or internet. All materials are available on the web, to encourage delivery widely by academics, students or teachers. Our evaluation has shown the approach to be broadly successful, and has also highlighted directions for future work.
Contrast invariant registration of images
Authors: P. Monasse
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We propose a method for image registration which seems to be useful under the three following conditions. First, both images are globally and roughly the result of a translation and rotation. Second, some occlusions due to moving objects occur from image 1 to image 2. Third, because of changes of illumination, contrast may have changed globally and even locally. Under such unfavorable conditions, correlation-based global registration may become inaccurate, because of the global compromise it yields between several displacements. Our method avoids these difficulties by defining a set of local contrast invariant features in order to achieve contrast invariant matching. A voting procedure allows one to eliminate "wrong" matching features due to the displacement of small objects and yields sub-pixel accuracy. This method was tested successfully for registration of watches with moving hands and for road control applications. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Incremental Deterministic Planning
Authors: Stefan Andrei, Wei-Ngan Chin, Martin Rinard
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner deterministically to its goal. In comparison with existing planners, our approach eliminates backtracking and supports efficient incremental planners that add additional subformulas without the need to recompute solutions for previously provided subformulas. Our experimental results show that our approach is competitive with existing state-of-the-art planners that formulate the planning problem as a satisfiability problem, then solve the satisfiability problem using specialized off-the-shelf satisfiability solvers such as zChaff.
Design for Resilience to Soft Errors and Variations
Authors: Ming Zhang, T. M. Mak, Jim Tschanz, Kee Sup Kim, Norbert Seifert, Davia Lu
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper presents Adaptive Variation-and-Error- Resilient Agent (AVERA), an approach to address the challenge of designing reliable systems in the presence of soft errors and variations. AVERA extends our previous Built-In Soft Error Resilience (BISER) approach by adding additional capabilities to support process variation diagnosis, degradation detection, and system adaptation, besides soft error correction. We also discuss open challenges for building variation-and-error-resilient systems.
A Combined Approach for Information Flow Analysis in Fault Tolerant Hardware
Authors: Tim McComb, Luke Wildman
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Fault tolerance in information security devices is difficult to establish due to the large number of possible interactions in the device (e. g. embedded code, boolean logic, electromagnetic interference, etc.) In previous work we examined information flow as a graph problem by composing orthogonal views of the device under analysis. In other work we used fault-tree analysis to reason about information flow as a systemic failure arising from certain configurations (or faults) in either the control logic or data flow "backbone'. In this paper we combine these approaches by taking advantage of an alternative representation of fault trees as reliability block diagrams.
Fuzzy nonparametric regression based on local linear smoothing technique
Authors: Ning Wang, Wen-Xiu Zhang, Chang-Lin Mei
Venue: Information Sciences: an International Journal (2007)

In a great deal of literature on fuzzy regression analysis, most of research has focused on some predefined parametric forms of fuzzy regression relationships, especially on the fuzzy linear regression models. In many practical situations, it may be unrealistic to predetermine a fuzzy parametric regression relationship. In this paper, a fuzzy nonparametric model with crisp input and LR fuzzy output is considered and, based on the distance measure for fuzzy numbers suggested by Diamond [P. Diamond, Fuzzy least squares, Information Sciences 46 (1988) 141-157], the local linear smoothing technique in statistics with the cross-validation procedure for selecting the optimal value of the smoothing parameter is fuzzified to fit this model. Some simulation experiments are conducted to examine the performance of the proposed method and three real-world datasets are analyzed to illustrate the application of the proposed method. The results demonstrate that the proposed method works quite well not only in producing satisfactory estimate of the fuzzy regression function, but also in reducing the boundary effect significantly.
Encoding Catalytic P Systems in π@
Authors: Cristian Versari
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

P systems are theoretical computing devices abstracted away from the biological architecture of the cell, introduced some years ago by Gheorghe Paun and now intensely studied. In the area of concurrent systems, process calculi have recently been applied and extended with similar aim, to simulate (and formalise) the behaviour of the cell. Although many common points can be found between the two approaches, no formal and exhaustive comparison has been carried out yet. @p@ is a new calculus, strongly @p-Calculus based, well-suited to easily encode biologically inspired process calculi. In this paper the encoding in @p@ of one variant of P systems is proposed, thus allowing a better understanding of similarities between P systems and bio-inspired process calculi.
The Death of Distance Has Been Exaggerated
Authors: Charles Day
Venue: Computing in Science and Engineering (2007)

Columnist Charles Day describes what distance means to workers in knowledge-based economies.
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Authors: Milena Milenkovic, Aleksandar Milenkovic, Martin Burtscher
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software developers for program optimization, performance tuning, and debugging. Such traces are typically very large and need to be compressed to reduce the storage, processing, and communication bandwidth requirements. However, preexisting general-purpose and trace-specific compression algorithms are designed for software implementation and are not suitable for runtime compression. Compressing program execution traces at runtime in hardware can deliver insights into the behavior of the system under test without any negative interference with normal program execution. Traditional debugging tools, on the other hand, have to stop the program frequently to examine the state of the processor. Moreover, software developers often do not have access to the entire history of computation that led to an erroneous state. In addition, stepping through a program is a tedious task and may interact with other system components in such a way that the original errors disappear, thus preventing any useful insight. The need for unobtrusive tracing is further underscored by the development of computer systems that feature multiple processing cores on a single chip. In this paper, we introduce a set of algorithms for compressing instruction and data address traces that can easily be implemented in an on-chip trace compression module and describe the corresponding hardware structures. The proposed algorithms are analytically and experimentally evaluated. Our results show that very small hardware structures suffice to achieve a compression ratio similar to that of a software implementation of gzip while being orders of magnitude faster. A hardware structure with slightly over 2 KB of state achieves a compression ratio of 125.9 for instruction address traces, whereas gzip achieves a compression ratio of 87.4. For data address traces, a hardware structure with 5 KB of state achieves a compression ratio of 6.1, compared to 6.8 achieved by gzip.
A look-ahead synthesis technique with backtracking for switching activity reduction in low power high-level synthesis
Authors: Xianwu Xing, Ching Chuen Jong
Venue: Microelectronics Journal (2007)

Research work done has shown that power consumption in digital integrated circuits can be effectively reduced by reducing the switching activity occurring on the functional modules. High-level synthesis of digital integrated circuits for low power often optimizes the switching activity during the two main synthesis processes, operation scheduling and module binding, which are usually performed one control step at a time in two separated stages. As the two processes are strongly interdependent, separate optimization of switching activity in a step-by-step manner frequently leads to sub-optimal solutions. In this paper, we propose a novel look-ahead synthesis technique with backtracking for the reduction of switching activity in low power high-level synthesis, which not only performs the scheduling and binding simultaneously in an integrated manner using a weighted bipartite technique, but also employs a branch and bound approach with look-ahead evaluation of switching activity for one or more control steps. The look-ahead technique generates multiple schedulings and bindings at the same time in one control step and uses each of them to generate more schedulings and bindings for the next one or more control steps. The best scheduling and binding pattern is then used for backtracking, therefore, effectively reducing the probability for the solutions to fall into local minimum. We tested the look-ahead algorithm with several published benchmarks and the experimental results obtained show that the switching activity can be reduced significantly, with an average of more than 50% reduction in switching activity for the tested benchmarks.
Variational inclusions with a general H-monotone operator in Banach spaces
Authors: Fu-Quan Xia, Nan-Jing Huang
Venue: Computers Mathematics with Applications (2007)

In this paper, we introduce a new class of operator-general H-monotone operators in Banach space. We define a proximal mapping associated with the general H-monotone operator and show its Lipschitz continuity. We also consider a new class of variational inclusions involving these general H-monotone operators and constructed a new iterative algorithm for solving the variational inclusion in Banach spaces. Under some suitable conditions, we prove the convergence of the iterative sequence generated by the algorithm.
Absorbent tuples of aggregation operators
Authors: G. Beliakov, T. Calvo, A. Pradera
Venue: Fuzzy Sets and Systems (2007)

We generalize the notion of an absorbent element of aggregation operators. Our construction involves tuples of values that decide the result of aggregation. Absorbent tuples are useful to model situations in which certain decision makers may decide the outcome irrespective of the opinion of the others. We examine the most important classes of aggregation operators in respect to their absorbent tuples, and also construct new aggregation operators with predefined sets of absorbent tuples.