ppxscal/embedding_network huggingface dataset:
An RF CMOS Q-Enhanced LC Resonator
Authors: Per Madsen, Jan Hvolgaard Mikkelsen, Jens Christian Lindof, Torben Larsen
Venue: Analog Integrated Circuits and Signal Processing (2006)

This paper investigates a Q-enhanced LC resonator implemented with a Q-enhancement circuit based on both active and reactive components. An analytical expression is presented for the Q-enhancement circuit and simulations are compared with measurements on a differential Q-enhanced LC tank operating at 1779---1870 MHz. Sensitive circuits and inaccurate models leads to inaccurate simulations. To improve the accuracy of simulations, S-parameter measurements of components and sub-circuits are included in the simulations whereby an accuracy of 3 MHz in the estimate of the resonator center frequency results.
A general framework for types in graph rewriting
Authors: Barbara K&#x00f6;nig
Venue: Acta Informatica (2005)

We investigate a general framework which can be instantiated in order to obtain type systems for graph rewriting, allowing us to statically infer behavioural properties of a graph. We describe conditions such as the subject reduction property and compositionality that should be satisfied by such a framework. We present a methodology for proving these conditions, specifically we prove that it is sufficient to show properties that are local to graph transformation rules. In order to show the applicability of this framework, we describe in several case studies how to integrate existing type systems (for the &#x03c0;-calculus and the &#x03bb;-calculus) and a system for typing acyclic graphs.
Exploration and apprenticeship learning in reinforcement learning
Authors: Pieter Abbeel, Andrew Y. Ng
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider reinforcement learning in systems with unknown dynamics. Algorithms such as E3 (Kearns and Singh, 2002) learn near-optimal policies by using "exploration policies" to drive the system towards poorly modeled states, so as to encourage exploration. But this makes these algorithms impractical for many systems; for example, on an autonomous helicopter, overly aggressive exploration may well result in a crash. In this paper, we consider the apprenticeship learning setting in which a teacher demonstration of the task is available. We show that, given the initial demonstration, no explicit exploration is necessary, and we can attain near-optimal performance (compared to the teacher) simply by repeatedly executing "exploitation policies" that try to maximize rewards. In finite-state MDPs, our algorithm scales polynomially in the number of states; in continuous-state linear dynamical systems, it scales polynomially in the dimension of the state. These results are proved using a martingale construction over relative losses.
Fabrication and nonlinear characterization of GaN HEMTs on SiC and sapphire for high-power applications: Research Articles
Authors: V. Camarchia, S. Donati Guerrieri, M. Pirola, V. Teppati, A. Ferrero, G. Ghione, M. Peroni, P. Romanini, C. Lanzieri, S. Lavanga, A. Serino, E. Limiti, L. Mariucci
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2006)

In this work, we present the characterization results for several HEMT GaN-based devices developed by SELEX Sistemi Integrati. Due to the wide band-gap properties of this material, these devices are very well-suited for high-power applications, and must be characterized under strongly nonlinear and high-power conditions. An extensive power characterization of devices fabricated on GaN grown either on SiC or sapphire substrates is carried out, including pulsed I-V, power sweeps, and load-pull measurements in different bias conditions from class A to class B. An active load-pull bench optimized for high-voltage and high-power measurements allows the load-pull characterization to be extended to the whole Smith chart and the optimum loads to be localized, even for devices with almost reactive optimum terminations. The characterization procedure is performed on HEMT devices fabricated with different technologies and different layouts, in order to improve and refine the fabrication methodology and verify the scaling rules and the effects of defects and thermal degradation. SELEX SI devices show a growing maturity, with performances comparable to state-of-the-art technology. &copy; 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.
A supervised clustering algorithm for computer intrusion detection
Authors: Xiangyang Li, Nong Ye
Venue: Knowledge and Information Systems (2005)

We previously developed a clustering and classification algorithm&#x2014;supervised (CCAS) to learn patterns of normal and intrusive activities and to classify observed system activities. Here we further enhance the robustness of CCAS to the presentation order of training data and the noises in training data. This robust CCAS adds data redistribution, a supervised hierarchical grouping of clusters and removal of outliers as the postprocessing steps.
Infinite Player Noncooperative Games with Vector Payoffs Under Relative Pseudomonotonicity
Authors: E. Allevi, A. Gnudi, I. V. Konnov, S. Schaible
Venue: Journal of Global Optimization (2006)

In this paper we consider the Nash equilibrium problem for infinite player games with vector payoffs in a topological vector space setting. By employing new concepts of relative (pseudo)monotonicity, we establish several existence results of solutions for usual and normalized vector equilibria. The results strengthen existence results for vector equilibrium problems, which were based on classical pseudomonotonicity concepts. They also extend previous results for vector variational inequalities and finite player games under relative (pseudo)monotonicity.
Rapid asset allocation for dynamic TACAIR decision support
Authors: John McDonnell, Aaron Rice
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This work addresses a decision support system that can be used for effectively re-tasking TACAIR assets under a variety of constraints. Analysis of the common operational picture provides augmented situational awareness. Automatic risk analysis keeps the user aware of current and planned risk levels to blue force assets. Options for reacting to changes in the battlefield environment are generated using an evolutionary search algorithm.
Statistical Language Models for On-line Handwritten Sentence Recognition
Authors: Solen Quiniou, Eric Anquetil, Sabine Carbonnel
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper investigates the integration of a statistical language model into an on-line recognition system in order to improve word recognition in the context of handwritten sentences. Two kinds of models have been considered: n-gram and n-class models (with a statistical approach to create word classes). All these models are trained over the Susanne corpus and experiments are carried out on sentences from this corpus which were written by several writers. The use of a statistical language model is shown to improve the word recognition rate and the relative impact of the different language models is compared. Furthermore, we illustrate the interest to define an optimal cooperation between the language model and the recognition system to re-enforce the accuracy of the system.
Debugging sequential circuits using Boolean satisfiability
Authors: M. Fahim Ali, A. Veneris, A. Smith, S. Safarpour, R. Drechsler, M. Abadir
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Logic debugging of today's complex sequential circuits is an important problem. In this paper, a logic debugging methodology for multiple errors in sequential circuits with no state equivalence is developed. The proposed approach reduces the problem of debugging to an instance of Boolean satisfiability. This formulation takes advantage of modern Boolean satisfiability solvers that handle large circuits in a computationally efficient manner. An extensive suite of experiments with large sequential circuits confirm the robustness and efficiency of the proposed approach. The results further suggest that Boolean satisfiability provides an effective platform for sequential logic debugging.
A Data-Aided Symbol Timing and Frequency Offset Estimation Algorithm for OFDM Systems
Authors: T. Fusco, M. Tanda
Venue: Wireless Personal Communications: An International Journal (2005)

In this paper the problem of data-aided symbol timing and frequency offset estimation in OFDM systems is considered. A synchronization scheme based on a pilot symbol containing two identical parts obtained by transmitting BPSK data symbols on the even subcarriers and setting zero on the remaining subcarriers is proposed. In this case, if the number of subcarriers is sufficiently large, the pilot symbol can be modeled as a noncircular (NC) complex Gaussian random vector (CGRV). By exploiting the joint probability density function of NC-CGRVs, the joint maximum likelihood estimator for the parameters of interest is derived. Since its implementation complexity is high, a simpler synchronization scheme is obtained. Moreover, refined symbol timing and frequency offset estimators, that assure relevant performance in multipath channels, are proposed.
A Framework for Three-Dimensional Simulation of Morphogenesis
Authors: Trevor M. Cickovski, Chengbang Huang, Rajiv Chaturvedi, Tilmann Glimm, H. George E. Hentschel, Mark S. Alber, James A. Glazier, Stuart A. Newman, Jesus A. Izaguirre
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2005)

We present CompuCell3D, a software framework for three-dimensional simulation of morphogenesis in different organisms. CompuCell3D employs biologically relevant models for cell clustering, growth, and interaction with chemical fields. CompuCell3D uses design patterns for speed, efficient memory management, extensibility, and flexibility to allow an almost unlimited variety of simulations. We have verified CompuCell3D by building a model of growth and skeletal pattern formation in the avian (chicken) limb bud. Binaries and source code are available, along with documentation and input files for sample simulations, at http://compucell.sourceforge.net.
Recognition of Indian Multi-oriented and Curved Text
Authors: U. Pal, N. Tripathy
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In stylistic (artistic) documents text lines of a single page may have different orientations or the text lines may be curve in shape. As a result, it is difficult to detect the skew of such documents and hence character segmentation as well as recognition of such documents is a complex task. In this paper, we propose a novel scheme towards the recognition of Indian stylistic documents. Here, at first, using water reservoir concept based features the characters are segmented from stylistic documents without any skew correction. Next, individual characters are recognized. For recognition, contour distances of the outer contour points of the characters are calculated from the centroid. These contour distances are then arranged in a particular order to get size and rotation invariant feature. Finally, computing statistical feature on these arranged contour distances the input character is recognized.
Attaining higher performance in collective communication
Authors: E. Chan, M. Heimlich, A. Purkayastha, R. van de Geijn
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

Summary form only given. It has long been thought that research into collective communication algorithms on distributed-memory parallel computers has been exhausted. This project demonstrates that the implementations available as part of widely-used libraries are suboptimal. We demonstrate this through the implementation of the "reduce-scatter" collective communication and comparison with the MPICH implementation of MPI. Performance on a large cluster is reported.
Fair Bandwidth Allocation among LSPs for AF Class Accommodating TCP and UDP Traffic in a Diffserv-Capable MPLS Network
Authors: Kenji Tsunekawa
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

To resolve the issue of excess AF bandwidth unfairly allocated by RIO (RED with IN/OUT) among LSPs with AFclass TCP traffic in a Difffserv-Capable MPLS network, we previously proposed a technique, called weighted fair RIO (WF-RIO)[1], to allocate excess AF bandwidth among LSPs in proportion to the minimum guaranteed AF bandwidth. In the case of TCP traffic and UDP traffic coexisting in an AF class, WF-RIO does not effectively provide the fair bandwidth allocation, because the behavior of UDP traf- fic is different from that of TCP traffic. To solve this problem, we examine a scheme, which includes marking at the MPLS ingress router and queuing at the MPLS core router, for implementing a policy in which excess AF bandwidth should be allocated to the TCP traffic and UDP traffic in the AF class of each LSP in proportion to the quality demand for each kind of traffic. To demonstrate the effectiveness of the proposed scheme, we evaluate it by computer simulation.
Searching to eliminate personal information management
Authors: Edward Cutrell, Susan T. Dumais, Jaime Teevan
Venue: Communications of the ACM (2006)

Search systems can alleviate the need to organize personal information by helping us find it no matter where we encountered it, what we remember about it, and even if we forget it exists.
A Real-Time Software Platform for the Cell Processor
Authors: Seiji Maeda, Shigehiro Asano, Tomofumi Shimada, Koichi Awazu, Haruyuki Tago
Venue: IEEE Micro (2005)

Scalability, efficiency, and programmability are essential for using the Cell processor in consumer electronics. A real-time resource scheduler virtualizes the processor cores and ensures the application of real-time constraints at the system level. These features let the platform control resource usage and helps exploit the power management features implemented in the Cell processor.
Geometric Graphs with No Three Disjoint Edges
Authors: Jakub Cerny
Venue: Discrete Computational Geometry (2005)

A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position and edges are represented by straight line segments. We show that a geometric graph on n vertices with no three pairwise disjoint edges has at most 2.5n edges. This result is tight up to an additive constant. 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
SOMG: A Service Oriented Manufacturing Grid System
Authors: Liu Shijun, Meng Xiangxu, Tong Yexin
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The term of manufacturing grid (MG) is the applying of grid technologies on manufacturing, which really a cooperation platform and resource sharing system among manufacturing enterprises. Many works have done on MG architecture but most are case-bycase for the complicated of manufacturing itself. By analyze the trend of advanced manufacturing technology development and the characteristics of MG, point out that the essential of MG concept is a virtual manufacturing organization, which a combination of Data grids and Service grids. After discussing the feasibility of Service Oriented MG model and give the realization thought of SOMG, the whole architecture of SOMG is presented. In this architecture, a Peer-to- Peer node structure responsible for aggregating manufacturing resource and service by Distributed Hash Table approach. At last, the way of manufacturing services organizing is discussed too.
2nd Workshop on the state of the art in automated software engineering
Authors: Andrea Zisman, Tom Ellman
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The 2nd Workshop on the State of the Art in Automated Software Engineering took place on the 27 th of July 2005, at City University, London - UK. During the workshop there were seven presentations about various aspects concerning the theory and practice of automating the software engineering process. The presentations generated interesting discussions among the participants of the workshop. The title, name of the speaker, and abstract of each presentation are given below in the order that they were presented during the workshop. We would like to take this opportunity to thank all the presenters and participants of the workshop who helped make the day possible and interesting. [2] S. Ishtiaq, P. O'Hearn, BI as an Assertion Language for Mutable Data Structures, In the Proceedings of the 28th Annual ACM Symposium on Principles of Programming Languages, ACM, 2001. [3] J. Reynolds, Separation Logic: A Logic for Shared Mutable Data Structures, In the Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2002. Recent Evolutions of the Tobias Combinatoria.
Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems
Authors: Tarek A. AlEnawy, Hakan Aydin
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

In this paper, we explore performance optimization problems for real-time systems that have to rely on a fixed energy budget during an operation/mission. We adopt the weakly-hard realtime scheduling paradigm to ensure a predictable performance for all the tasks: Our aim is to minimize the number of dynamic failures (in terms of (m,k)-firm deadline constraints) while remaining within the energy budget. We prove that this problem is NP-Hard in the strong sense even for an ideal DVS architecture with continuous speed spectrum. We propose techniques to statically compute the speed of the CPU in order to meet the (m,k)-firm deadline constraints. We present on-line speed adjustment algorithms to exploit the slack time of skipped and completed jobs. Through extensive simulations, we show how the performance can be significantly improved by selectively dispatching jobs by considering their energy costs as well as their contribution to the system performance.
Color Texture Classification Using Wavelet Transform
Authors: S. Arivazhagan, L. Ganesan, V. Angayarkanni
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Texture and color are two very important attributes in image analysis. While the color information describes the first order image properties, the texture generally describes second order property of surfaces and scenes, measured over image intensities. The need to include color aspect in texture analysis is being felt increasingly. The important aspect is, the way in which the chromatic information is involved in the formation and description of a texture. This paper describes an algorithm for classifying color textures using wavelet transform. Wavelet transform is useful for extracting texture features of images. A set of features are derived and color texture classification is done for different combination of the features and for different color models. The results obtained are found to be satisfactory.
A new approach to interactive performance systems
Authors: Hüseyin Kuşcu, B. Tevfik Akgün
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we describe the basic principles that has to be in an interactive performance system, and we present a new solution to realize the principles to be used in dance performance with a distributable and hybrid approach of time and states. By the frame of this research, a timer-state machine hybrid, modular and distributed system that can be used for virtual performances is introduced for choreographers to edit the audiovisual linear interaction choices in hand.
General systems problem solving packages
Authors: George J. Klir
Venue: ACM SIGSIM Simulation Digest (1977)

Various approaches to general systems research have been suggested during the last two decades or so. One of the approaches, to which this author has become commiteed since the late 1960's, is oriented toward general systems problem solving. This approach aims at the characterization of systems problems, their classification, and the development of mathematical, computational or heuristic methodological tools for solving the individual classes of systems problems.
The Genesis of a Pattern Language for Agent-based Enterprise Systems
Authors: Paul R. Taylor, Peter Evans-Greenwood, James Odell
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Patterns have recognised utility in software engineering design and development processes. The body of knowledge of design and development of agent-based systems is now sufficiently mature to be usefully expressed as a pattern language. The essential elements of agent-based decomposition autonomous agents, relationships between agents, and organisational structures-lend themselves to a pattern-based description. This paper describes an initiative currently underway at Agentis Software to mine, document and evolve a complete pattern language for agent-based systems. These patterns define recurring agent-based structures for both individual agents and multi-agent system architectures. This paper discusses the software engineering motivations for making this investment in patterns by describing the strategic and pragmatic motivations, the pattern mining process, how the patterns are used in the design of agent-based solution architectures, and our experiences in using and evolving the pattern language.
Asymptotics and computations for approximation of method of regularization estimators
Authors: Sang-Joon Lee
Venue:  (2004)

Inverse problems arise in many branches of natural science, medicine and engineering involving the recovery of a whole function given only a finite number of noisy measurements on functionals. Such problems are usually ill-posed, which causes severe difficulties for standard least-squares or maximum likelihood estimation techniques. These problems can be solved by a method of regularization. In this dissertation, we study various problems in the method of regularization. We develop asymptotic properties of the optimal smoothing parameters concerning levels of smoothing for estimating the mean function and an associated inverse function based on Fourier analysis. We present numerical algorithms for an approximated method of regularization estimator computation with linear inequality constraints. New data-driven smoothing parameter selection criteria are proposed in this setting. In addition, we derive a Bayesian credible interval for the approximated method of regularization estimators.
Reverse Engineering Goal Models from Legacy Code
Authors: Yijun Yu, Yiqiao Wang, John Mylopoulos, Sotirios Liaskos, Alexei Lapouchnian, Julio Cesar Sampaio do Prado Leite
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

A reverse engineering process aims at reconstructing high-level abstractions from source code. This paper presents a novel reverse engineering methodology for recovering stakeholder goal models from both structured and unstructured legacy code. The methodology consists of the following major steps: 1) Refactoring source code by extracting methods based on comments; 2) Converting the refactored code into an abstract structured program through statechart refactoring and hammock graph construction; 3) Extracting a goal model from the structured program¿s abstract syntax tree; 4) Identifying nonfunctional requirements and derive softgoals based on the traceability between the code and the goal model. To illustrate this requirements recovery process, we refactor stakeholder goal models from two legacy software code bases: an unstructured Web-based email in PHP (SquirrelMail) and a structured email client system in Java (Columba).