ppxscal/embedding_network huggingface dataset:
A 5.4-GHz high-Q tunable active-inductor bandpass filter in standard digital CMOS technology
Authors: Haiqiao Xiao, Rolf Schaumann
Venue: Analog Integrated Circuits and Signal Processing (2007)

A transistor-only CMOS active-inductor with an all-NMOS signal path is presented. By tuning the varactor-augmented parasitic capacitance at the only internal node the circuit losses from submicron MOSFETs can be partially or fully compensated to permit realizing unlimited values of Q, with little frequency and no power-consumption penalties. Transistor-only second-order bandpass filters using the active inductor were built in the TSMC 0.18-μm CMOS process, and high filter Q was obtained by tuning the varactor. The highest center frequency measured was f 0 = 5.7 GHz for 0.2-μm gate lengths and the maximum repeatably measured Q was 665. Lower Qs can be obtained by reducing the capacitive compensation or by adjusting the circuit biasing. f 0 and Q are tunable via separate varactors. IIP 3 and input 1-dB compression point were simulated as 0.523 VPP and 0.128 VPP (¿1.65 and ¿13.9 dBm from a 50-¿ source) at 5.7 GHz with Q = 100 and midband gain equal 4.7 dB. For the same conditions, the output noise and noise figure (R S = 50 k¿) were simulated to be 0.8 μV/Hz1/2 and 25.6 dB, respectively. The filter core occupies an area of 26.6 μm × 30 μm and dissipates 4.4 mW at 5.4 GHz from a 1.8-V power supply. As the circuits use only MOSFETs they are fully compatible with standard digital CMOS processes. f 0 statistics were obtained by measuring 40 chips at identical biasing condition.
A Theoretical Framework of Rational and Emotional Agent for Ubiquitous Computing
Authors: Xianwei Lai, Shanli Hu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Human machine interaction, such as virtual reality and 3D interaction, is one of the key technique challenges on the way to achieve ubiquitous computing. In order to realize harmonious human machine interaction, this paper makes some useful efforts on formalizing rational and emotional agents for human machine interface basing on multi-agent technology. An improved model of concurrent game structure is given, mental states (belief, desire and intention) of agent are brought into new multi-agent cooperation logics, multi-subset semantics of individual intention are given and extended to give the semantics to group intentions. Understanding and representing of emotions are added to agent for human machine interface to improve the effective interaction between human and machine, formal representation of emotion are given. Four tough problems (logical omniscience problem, the side-effect problem of tautological implication, disjunction magnification problem and conjunction separation problem) are done away with. Several desired properties are attained finally.
Design method for neuro-fuzzy motion controllers
Authors: O. Popovici Vlad, T. Fukuda
Venue: Integrated Computer-Aided Engineering (2004)

A four-step hybrid method for the design of neuro-fuzzy motion controllers is presented. The design method starts from a preliminary known good control strategy used as learning data. The aim of the method is to find a controller that reproduces as close as possible the good control strategy and ensures the accomplishment of the required motion for the controlled mechanism. An Improved Simple Genetic Algorithm and the Weighted Errors Balance Algorithm were combined with the Global Learning principle within the first two steps of the method in order to design a Takagi-Sugeno type fuzzy controller. The evaluation of the robots' evolution is then used in order to simplify the controller's structure by reducing the number of rules within the rulebase. Finally, the parameters of a feed-forward type neural network structure, that embeds the simplified Takagi-Sugeno fuzzy controller, are derived. As an example, the paper presents the simulated evolution of a brachiation mobile robot (BMR) under the control of the neuro-fuzzy motion controller designed using the proposed method.
A peer-to-peer decentralized strategy for resource management in computational Grids: Research Articles
Authors: Antonella Di Stefano, Corrado Santoro
Venue: Concurrency and Computation: Practice Experience (2007)

This paper presents a peer-to-peer (P2P) approach for the management, in a computational Grid, of those resources that are featured by numerical quantity and thus characterized by a coefficient of utilization, such as percentage of CPU time, disk space, memory space, etc. The proposed approach exploits spatial computing concepts and models a Grid by means of a flat P2P architecture consisting of nodes connected by an overlay network; such a network topology, together with the quantity of resource available in each node, forms a three-dimensional surface, where valleys correspond to nodes with a large quantity of available resource. In this scenario, this paper proposes an algorithm for resource discovery that is based on navigating such a surface, in search of the deepest valley (global minimum, that is, the best node). The algorithm, which aims at fairly distributing among nodes the quantity of leased resource, is based on some heuristics that mimic the laws of kinematics. Experimental results show the effectiveness of the algorithm. Copyright &copy; 2006 John Wiley & Sons, Ltd.
List circular coloring of trees and cycles
Authors: André Raspaud, Xuding Zhu
Venue: Journal of Graph Theory (2007)

Suppose G=(V, E) is a graph and p &ge; 2q are positive integers. A (p, q)-coloring of G is a mapping &phis;: V &rarr; &lcub;0, 1, &hellip;, p-1&rcub; such that for any edge xy of G, q &le; |&phis;(x)-&phis;(y)| &le; p-q. A color-list is a mapping L: V &rarr; $\cal P$(&lcub;0, 1, &hellip;, p-1&rcub;) which assigns to each vertex v a set L(v) of permissible colors. An L-(p, q)-coloring of G is a (p, q)-coloring &phis; of G such that for each vertex v, &phis;(v) &isin; L(v). We say G is L-(p, q)-colorable if there exists an L-(p, q)-coloring of G. A color-size-list is a mapping &ell; which assigns to each vertex v a non-negative integer &ell;(v). We say G is &ell;-(p, q)-colorable if for every color-list L with |L(v)| = &ell;(v), G is L-(p, q)-colorable. In this article, we consider list circular coloring of trees and cycles. For any tree T and for any p &ge; 2q, we present a necessary and sufficient condition for T to be &ell;-(p, q)-colorable. For each cycle C and for each positive integer k, we present a condition on &ell; which is sufficient for C to be &ell;-(2k+1, k)-colorable, and the condition is sharp. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 249&ndash;265, 2007 Part of the work was done during the stay of X.Z. at LaBRI, supported by the French Ministry of Education.
Sharing courseware resources through the NEEDS (National Engineering Education Delivery System) database
Authors: A. M. Agogino, B. Muramatsu, P. A. Eibeck, M. Ramirez, A. O. Oladipupo
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The Synthesis Coalition and NEEDS are at the forefront of courseware creation, delivery and evaluation. NEEDS is the architecture developed by the Synthesis Coalition to enable new pedagogical models based on Internet-mediated environments for learning. The NEEDS database provides an access mechanism for students and faculty to a diverse range of engineering educational materials. The database consists of collections of modular digital courseware and courseware elements. The user is able to access and use courseware developed nationwide. In addition, the existing courseware and courseware elements can be adapted to local use in whole or by distilling several modules and joining them together to create a new customized module. The Synthesis Coalition has the directive of making the NEEDS database available to other NSF undergraduate engineering education coalitions and other universities. The requirements for and the feasibility of making courseware available on the NEEDS database are discussed. Critical issues facing courseware developers are identified. The NEEDS Editorial Board is being established to develop a comprehensive review procedure that will result in three tiers of courseware on the NEEDS database: non-reviewed, endorsed and premier courseware. The process of reviewing the courseware on NEEDS will not only benefit the users of the NEEDS database, but it will also benefit authors by recognizing the scholarly and creative efforts that they have expended in developing effective, high-quality courseware. Both the Editorial Board and the review procedures are discussed.
Break of information-investment flows in the process of switching over intermittency in the change of the trend of development of the dynamic system
Authors: V. G. Kleparskii
Venue: Automation and Remote Control (2007)

Studies are made of basic regularities of the process of switching over intermittency in the change of the trend of development of the cascade-hierarchical system. It is shown that the transition from the section of growth to the section of fall can be explained as a result of the change of the sign of the feedback (from the positive to the negative one) between the increment of the intermittency exponent Δµ and the increment of the fractal dimension Δd f (the expansion of the "channel" of attraction) for the most rapidly orienting (short-term) dynamic substructures. The subsequent break of the information-investment flow (the flow of commands) from the long-term to short-term substructures makes it impossible to support the dynamic equilibrium in the cascade-hierarchical system, which leads to the bifurcation transition to a new section of the channel of attraction.
Bounded Queries and the NP Machine Hypothesis
Authors: Richard Chang, Suresh Purini
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

The NP machine hypothesis posits the existence of an \in \ge 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0 but for which no deterministic Turing machine running in 2^n time can output an accepting path infinitely often. This paper shows two applications of the NP machine hypothesis in bounded query complexity. First, if the NP machine hypothesis holds, then P^SAT[1] = P^SAT[2] \RightarrowPH \subseteqNP. Without assuming the NP machine hypothesis, the best known collapse of the Polynomial Hierarchy (PH) is to the class S_2^P due to a result of Fortnow, Pavan and Sengupta [9]. The second application is to bounded query function classes. If the NP machine hypothesis holds then for all constants d \ge 0, there exists a constant k \ge d such that for all oracles X, PF^SAT[n^k] \not\subsetPF^X[n^d]. In particular, PF^SAT[n^d] \varsubsetneqPF^SAT[n^k]. Without the NP machine hypothesis, there are currently no known consequences even if for all k \ge 1, PF^SAT[n^k] \subseteq PF^SAT[n].
Performance Modeling of Emerging HPC Architectures
Authors: Nikhil Bhatia, Sadaf R. Alam, Jeffrey S. Vetter
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Current state-of-art HPCMP performance modeling techniques primarily rely on combining a performance profile of an application on a well-known HPC architecture, and the machine characteristics of an emerging architecture to project an application's performance on the emerging architecture. Existing profiling and tracing tools on well-known architectures are typically used to collect the necessary performance data by executing applications and benchmarks on available systems. Since the performance enhancing features of novel processing devices may be significantly different from a conventional microprocessor system, current performance modeling schemes have limited applicability on systems like the Cray X1E vector supercomputer and parallel systems with accelerator devices like Cray XD1, which contains FPGAs. We employ an application modeling paradigm that allows a user to develop not only "architecture aware" but also "application aware" performance models. We extend the Modeling Assertions (MA) framework that permits a user to develop multi-resolution, parameterized symbolic models. We demonstrate the application of our modeling scheme by augmenting the MA models with performance enhancing attributes of the Cray X1E Multistreaming Processors (MSPs). Using the extended MA framework, we develop symbolic performance models of critical code blocks of an HPCMP TI-06 benchmark called HYCOM an ocean modeling code. By representing the code characteristics of the critical code blocks in terms of both unique architectural attributes and key input parameters of the HYCOM application, we manage to reduce and sustain performance prediction error rates to less than 30%.
Linux: a platform for innovation in converged mobile handsets
Authors: G. N. Brown
Venue: BT Technology Journal (2007)

The work within the convergent terminals and applications research theme, within BT's Research and Venturing organisation, investigates the emerging trends in the entire device ecosystem -- including components, hardware and software issues for future mobile devices, as enablers for future service offerings. It is evident that lower-layer hardware and protocols are being standardised, with the intelligence for new devices increasingly being supported by a high-level operating system, such as Symbian and Microsoft. This paper describes the emergence of Linux as a third option for a mobile handset OS, reviews the status quo for Linux in this currently dynamic and changing industry segment, and describes BT's activities to address this emerging and potentially disruptive technology.
Activity detection in unknown noise environment
Authors: E. Fishler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In many applications there exists an array of cells (or bins), each containing either an activity (signal) plus noise, or noise only. A common problem is to identify the active bins, assuming that the noise level in the array is unknown. In this paper we present a novel approach for solving this problem. The approach is based on two steps. In the first, we estimate the noise level and in the second we perform a sequential test to decide, for each bin, whether it is active or not. We show that the proposed algorithm collapses to well known special cases. The performance of the proposed algorithm is analyzed analytically and is demonstrated via simulation results.
Session-based intrusion detection system to map anomalous network traffic
Authors: Morgan C. Wang
Venue:  (2005)

Computer crime is a large problem (CSI, 2004; Kabay, 2001a; Kabay, 2001b). Security managers have a variety of tools at their disposal---firewalls, Intrusion Detection Systems (IDSs), encryption, authentication, and other hardware and software solutions to combat computer crime. Many IDS variants exist which allow security managers and engineers to identify attack network packets primarily through the use of signature detection; i.e., the IDS recognizes attack packets due to their well-known "fingerprints" or signatures as those packets cross the network's gateway threshold. On the other hand, anomaly-based ID systems determine what is normal traffic within a network and reports abnormal traffic behavior. This paper will describe a methodology towards developing a more-robust Intrusion Detection System through the use of data-mining techniques and anomaly detection. These data-mining techniques will dynamically model what a normal network should look like and reduce the false positive and false negative alarm rates in the process. We will use classification-tree techniques to accurately predict probable attack sessions. Overall, our goal is to model network traffic into network sessions and identify those network sessions that have a high-probability of being an attack and can be labeled as a "suspect session." Subsequently, we will use these techniques inclusive of signature detection methods, as they will be used in concert with known signatures and patterns in order to present a better model for detection and protection of networks and systems.
Insectopia: exploring pervasive games through technology already pervasively available
Authors: Johan Peitz, Hannamari Saarenpää, Staffan Björk
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We present the pervasive game Insectopia, which have been designed by the approach of utilizing commercially available mobile phones to provide context-dependent gameplay. The design and evaluation of the game is described together with a discussion on how this approach can speed up making pervasive games a viable game genre for the general public.
Maintenance Policy of a Network with Traffic Reconfiguration
Authors: Wojciech Zamojski, Dariusz Caban
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Networks are considered as a set of all their nodes, connections, hardware, software and personnel (users, administrators and managers), participating in the realization of distributed tasks. The networks are operating in an often hostile environment, exposed to such threats as attacks, viruses and human faults. System (network) dependability is discussed with respect to the occurrence of these incidents and their consequences on data flow capabilities. The maintenance policy system is based on a 3-phase system renewal: detection, failure isolation, repair. The isolation process is performed by reconfiguring the dataflow routes and local storing of data. Repair includes information restoration and redistributing the locally stored data. The paper proposes a framework for developing the network maintenance policy based on the cost of implementing the various feasible rules. A procedure for determining this cost is discussed. Some useful cost relationships are identified, justifying the need for such approach.
Virtual Reality Based Knowledge Acquisition and Job Training for Advanced Casting Skills
Authors: Keiichi Watanuki, Kazuyuki Kojima
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The environment where Japanese industry has been paid with respect is changing tremendously due to the globalization of economics, where Asian countries are undergoing economical and technical development as well as advancing in information technology. For example, in the design of custom-made casting product, a designer whom lacking of casting knowledge may not be able to produce a good design. In order to obtain a good design and manufacturing result, it is necessary to equip the designer and manufacturer with a support system related to casting design or so called, knowledge transfer and creation system. In recent years, the design supporting system using VR technology is developed, and introduced in the manufacturing industry. The merit of using VR system is being able to carry out the stereoscopy of the product model drawn by 3D CAD, and to carry out the design review of the product model in the same size as thing. However, since many systems extend the display of the conventional 3D CAD, they cannot input annotation and so on directly in VR environment. In this paper, the system which can input and display the annotation in VR environment is developed. By drawing annotation to the product model displayed on VR environment, sharing of technical tacit knowledge and engineers' communication are promoted, and engineers becomes possible gaining physical tacit knowledge.
Vassal: loadable scheduler support for multi-policy scheduling
Authors: George M. Candea, Michael B. Jones
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

This paper presents Vassal, a system that enables applications to dynamically load and unload CPU scheduling policies into the operating system kernel, allowing multiple policies to be in effect simultaneously. With Vassal, applications can utilize scheduling algorithms tailored to their specific needs and general-purpose operating systems can support a wide variety of special-purpose scheduling policies without implementing each of them as a permanent feature of the operating system. We implemented Vassal in the Windows NT 4.0 kernel. Loaded schedulers coexist with the standard Windows NT scheduler, allowing most applications to continue being scheduled as before, even while specialized scheduling is employed for applications that request it. A loaded scheduler can dynamically choose to schedule threads in its class, or can delegate their scheduling to the native scheduler, exercising as much or as little control as needed. Thus, loaded schedulers can provide scheduling facilities and behaviors not otherwise available. Our initial prototype implementation of Vassal supports two concurrent scheduling policies: a single loaded scheduler and the native scheduler. The changes we made to Windows NT were minimal and they have essentially no impact on system behavior when loadable schedulers are not in use. Furthermore, loaded schedulers operate with essentially the same efficiency as the default scheduler. An added benefit of loadable schedulers is that they enable rapid prototyping of new scheduling algorithms by often removing the time-consuming reboot step from the traditional edit/compile/reboot/debug cycle. In addition to the Vassal infrastructure, we also describe a "proof of concept" loadable real-time scheduler and performance results.
LCSRAM: A Leakage Controlled Six-transistor Static Random Access Memory Cell with Intrinsically High Read Stability
Authors: Sayeed A. Badrudduza, Giby Samson, Lawrence T. Clark
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Highly scaled processes increase leakage and transistor variations, both of which are problematic for SRAM, which is pervasive in modern CMOS integrated circuits. Here, a six transistor SRAM cell is presented that does not suffer from reduced stability when reading. The cell also resides in a low leakage, voltage collapsed, low standby power mode when not being accessed. The cell circuit topology, layout, and impact on memory design are described. Simulation of operation on 130 and 90 nm technologies and with predictive technology models for 65 and 45 nm technologies demonstrate the leakage reduction and measurement on 130 nm demonstrates improved read stability.
Speeding up Monte-Carlo Simulation for Statistical Timing Analysis of Digital Integrated Circuits
Authors: Srinath R. Naidu
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents a pair of novel techniques to speed-up path-based Monte-Carlo simulation for statistical timing analysis of digital integrated circuits with no loss of accuracy. The presented techniques can be used in isolation or they could be used together. Both techniques can be readily implemented in any statistical timing framework. We compare our proposed Monte-Carlo simulation with traditional Monte-Carlo simulation in a rigourous framework and show that the new method is up to 2 times as efficient as the traditional method.