ppxscal/embedding_network huggingface dataset:
Reconfigurable double gate carbon nanotube field effect transistor based nanoelectronic architecture
Authors: Bao Liu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Carbon nanotubes (CNTs) and carbon nanotube field effect transistors (CNFETs) have demonstrated extraordinary properties and are widely accepted as the building blocks of next generation VLSI circuits. However, no nanoelectronic architecture has been proposed which is solely based on carbon nanotubes and carbon nanotube field effect transistors. The reasons include lack of a self-assembly technology which could form complex carbon nanotube structures, or, absence of a reconfigurable carbon nanotube device which could provide functionality, reliability, and performance via reconfigurability. In this paper, I propose a novel double gate carbon nanotube field effect transistor (RDG--CNFET), which is reconfigurable to be open, short, FET, or via. Layers of orthogonal carbon nanotubes with electrically bistable molecules sandwiched at each crossing form a dense array of RDG-CNFETs and programmable interconnects, and constitute a nanoelectronic architecture of manufacturability (via regularity), reliability (via reconfigurability), and performance (via device density). Simulation based on CNFET and molecular device compact models demonstrates superior logic density, reliability, performance and power consumption of the proposed RDG-CNFET based nanoelectronic circuits compared with the existing, e.g., molecular diode/MOSFET based nanoelectronic circuits.
RNA secondary structure, permutations, and statistics
Authors: Robert Willenbring
Venue: Discrete Applied Mathematics (2009)

We construct a permutation representation for RNA secondary structure. We also introduce some basic combinatorial statistics for RNA secondary structure and relate them to permutation statistics when appropriate. These statistics allow us to quantify some structural phenomena in RNA secondary structure.
Risks to the public
Authors: Peter G. Neumann
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Edited by Peter G. Neumann (Risks Forum Moderator and Chairman of the ACM Committee on Computers and Public Policy), plus personal contributions by others, as indicated. Opinions expressed are individual rather than organizational, and all of the usual disclaimers apply. We address problems relating to software, hardware, people, and other circumstances relevant to computer systems. To economize on space, we include pointers to items in the online Risks Forum: (R i j) denotes RISKS vol i number j. Cited RISKS items generally identify contributors and sources, together with URLs. Official RISKS archives are available at www.risks.org (which redirects to Newcastle and gets you nice html formatting and a search engine courtesy of Lindsay Marshall; http://catless.ncl.ac.uk/Risks/i.j.html gets you (R i j)) and at ftp://www.sri.com/risks.
Data language requirements of database machines
Authors: Dawei Luo, Daozhong Xia, S. Bing Yao
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The selection of a proper set of operations for a database machine has a great influence on the performance of the overall system. In this paper, we will discuss the data language requirements of database machines. The data language for a proposed relational database machine is presented. Methods for supporting hierarchical and network interfaces using a relational database machine language set are introduced. The relative performance for data access using relational and network interfaces is compared through the evaluation of cost functions. It is shown that the support of a network interface in a relational database machine is feasible, but expensive.
Routing Algorithms Based on Partial Deployment of SAVA Nodes in Trustworthy Internet
Authors: Lei Guo, Xingwei Wang, Dong Wang, Weigang Hou
Venue: International Journal of Distributed Sensor Networks (2009)

Although the fundamental principles of best-effort and destination address based packet forwarding in today's Internet have brought tremendous convenience, the trustworthy issue in Internet is a hot problem since the lack of source IP address checking in most cases makes it easy for the attackers to spoof the source address. Therefore, one challenge in trustworthy Internet is to build a feasible mechanism to verify the source address. Recently, a feasible mechanism called Source Address Validation Architecture (SAVA) has been proposed to specify standardization of methods for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In SAVA mechanism, if a packet has been recognized as a spoofed source address, it will be dropped by the SAVA router and not be transmitted to the next hop. In our work, we study the routing algorithms based on partial deployment of SAVA nodes in Internet and propose three kinds of routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). To the best of our best knowledge, this is the first investigation for SAVA mechanism from the point of routing method. In SPA, the packet will be routed on the shortest path that may not traverse the SAVA node, and then the SAVA requirement may not be ensured. In SSPA, the packet will be routed on the shortest path that must traverse one SAVA node such that the SAVA requirement can be ensured. In SSPALB, the packet will be routed on the shortest path that must traverse one SAVA node at the same time this SAVA node must be the least-load such that the SAVA requirement can be ensured and the load can be more balancing. We simulate an incremental traffic model for the three kinds of routing algorithms to compare the performances of SAVA Satisfactory Degree (SSD) and Load Balancing (LB). Simulation results show that: the SSDs of SSPA and SSPALB can reach 100% while the SSD of SPA is only 20%-30%, which means that SSPA and SSPALB are completely satisfactory for SAVA requirements but SPA cannot; the LB of SSPALB can reach 100% while the LBs of SPA and SSPA are only 70%-80%, which means that SSPALB is more favorable for the load balancing.
Nonlinear search based pre-computation path selection algorithm
Authors: Deng Bo, Zheng Yanxing, Wang Xiaoqiing
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Multi-constraints path selection is an important problem challenging Quality of Service routing(QoSR). There are two classes of QoSR algorithms, namely linear and nonlinear search based QoSR algorithms. For linear search based algorithms, they loss some feasible paths sometimes even they search in all directions. While for nonlinear search based algorithms, even the best existing solutions require a few iterations of Dijkstra algorithm, reducing the speed of response. We, for the first time, propose a nonlinear search pre-computation algorithm that gives better responsiveness and higher success rate in identifying feasible paths. Simulations validate the efficiency of our algorithm.
Network Anomaly Detection Based on Wavelet Fuzzy Neural Network with Modified QPSO
Authors: Ruhui Ma, Yuan Liu, Xing Lin
Venue: International Journal of Distributed Sensor Networks (2009)

This paper proposes a novel network anomaly detection method employing wavelet fuzzy neural network (WFNN) to use modified Quantum-Behaved Particle Swarm Optimization (QPSO). In this paper, wavelet transform is applied to extract fault characteristics from the anomaly state. Fuzzy theory and neural network are employed to fuzzify the extracted information. Wavelet is then integrated with fuzzy neural network to form the wavelet fuzzy neural network (WFNN). The Quantum-Behaved Particle Swarm Optimization proposed by Jun Sun, which outperforms the other optimization algorithm considerably on its simple architecture and fast convergence, has previously applied to solve the optimum problem. However, the QPSO also has its own shortcomings. In QPSO if a particle flew off the boundary (the search area), the algorithm usually would regard the position value of the particle as the value of the boundary. If the boundary is at the position of local optimum, the particles were trapped into local optimum easily. It is impossible for them to arrive at the global optimum. With the increase of particle, the diversity of swam would be declined and the global search quality of the algorithm would be also declined. In the modified algorithm, it shows that the particles field off the boundary were distributed in the c*r and () search space. The diversity of swam and the global search quality would be enhanced. So there exists a modified QPSO which is employed to train WFNN in this paper. We have demonstrated performance comparisons to QPSO-WFNN, PSO-WFNN using the same data set extracts from the KDD99 Datasets, and the results have shown that the MQPSO-WFNN model exhibits superior performance with a higher attack detection rate and lower false positive rate. Experiments with KDD Cup 1999 connection traffic data have shown that this model is able to effectively detect intrusive behaviors. It also shows the remarkable ability of our IDS to detect new type of attacks.
Plenary lecture III: triple selection diversity over exponentially correlated Nakagami-m fading channels desired signal and cochannel interference
Authors: Dragana Krstic
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In this paper system performances of selection combining over correlated Nakagami-m channels are analyzed. Selection diversity based on the signal to interference ratio (SIR) is a very efficient technique that reduces fading and cochannel interference influence. Fading between the diversity branches and between interferers is correlated and Nakagami-m distributed with exponential correlation model. Very useful closed-form expressions for the output SIR's probability density function (PDF), cumulative distribution function (CDF), and outage probability are obtained, which is main contribution of this paper.
SAS 9.1.3 Intelligence Platform: Web Application Administration Guide, Third Edition, 3 edition
Authors: SAS Publishing
Venue:  (2008)

Explains how to administer the SAS Web applications that run in the middle tier of the SAS Intelligence Platform. The Web applications include the SAS Information Delivery Portal, SAS Web Report Studio, and SAS Web OLAP Viewer for Java.This guide describes the middle-tier environment, provides sample deployment scenarios, and explains how to configure the Web applications for optimal performance. The guide contains instructions for common administrative tasks, such as configuring trusted Web authentication, as well as instructions for administering the individual Web applications. For example, the guide explains how to add content to the SAS Information Delivery Portal and how to control access to that content.
The Evolving Role of Software Engineering in the Production of Multimedia Applications
Authors: Timothy Arndt
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The traditional approach to software engineering is based on the waterfall model or some variation of this model. It is well known, however, that this approach is not particularly well suited to the production of one-of-a-kind or experimental systems due to fuzzy user requirements - users are not sure what can be accomplished. Since most multimedia applications are currently of this type, we must search for alternative approaches. One such alternative is based on rapid prototyping in which we quickly generate a working system that we use to validate user requirements. For distributed multimedia applications, we have experimented with a prototyping environment based on grammar formalisms and utilizing web technologies such as HTML/XML to generate a working prototype. Such an approach seems to be promising and we are currently pursuing this line of research. For the future, researchers working at the interface of software engineering and multimedia systems may identify high-level abstractions common to such applications which will permit the traditional approach to software engineering, backed up with appropriate CASE tools, to be used. 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
Optimum Selective Decoding Schemes in MAC Protocol for MIMO Ad-Hoc Networks
Authors: Jansilp Aksiripipatkul, Raungrong Suleesathira
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

IEEE 802.11 MAC designs encounter two problems: (1) interferences from neighboring nodes or from hidden nodes and (2) collision from simultaneous transmissions within the same contention floors. This paper presents the optimum selective decoding schemes in MAC protocol (OSDS-MAC) for MIMO Ad-hoc network. It is able to mitigate interferences by using a developed minimum mean-squared error (MMSE) technique. This interference mitigation combined to ML decoding schemes for the Alamouti coding achieves to receive and differentiate the data streams from other co-channel users. As a result, it allows a pair of simultaneous transmissions to the same or different receivers which increase the network utilization. Moreover, the presented three decoding schemes are optimally selected corresponding to the three structures determined by the number of RTSs and the type of CTS packets. Both theoretical channel capacity and simulation results show that the proposed OSDS-MAC system outperforms the MIMA-MAC system for the cases of (1) single data stream and (2) two independent data streams which are simultaneously transmitted from the two transmitters.
Global optimization of robust chance constrained problems
Authors: Panos Parpas, Berç Rustem, Efstratios N. Pistikopoulos
Venue: Journal of Global Optimization (2009)

We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume that the stochastic algorithm exhibits a weak* convergence to a probability measure assigning all its mass to the discretized problem. A diffusion process is derived that has this convergence property. In the second phase, the discretization is improved by solving another nonlinear programming problem. It is shown that the algorithm converges to the solution of the original problem. We discuss the numerical performance of the algorithm and its application to process design.
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
Authors: Paola Spoletini, Mario Verdicchio
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

In open multi-agent systems (MASs) we cannot assume agents to be developed in a centralized fashion. Recent proposals of commitment-based communication frameworks aim at increasing such openness. Interaction with agents whose behavior does not follow a universal standard raises the need for some means of protection for each agent. In this work we propose an automata-based monitoring module that continuously supports an agent during its life in a MAS. Such module includes a Word Composer that observes exchanged messages and keeps track of significant past interactions to express an agent's input in the form of time-stamped words, and a Word Analyzer that processes such words and matches them against some properties expressed in linear temporal logic which are supposed to hold throughout the interactions.
Algebraic codes for improving the reliability of tape storage
Authors: Elwyn R. Berlekamp
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

This paper describes an operational software package for protecting the integrity of tape files with the use of a sophisticated algebraic code, which provides a large amount of protection against a wide variety of possible types of errors for a relatively modest amount of redundancy. The software is implemented on a Univac 1108 computer. Each 36-bit computer word is treated as three 12-bit digits.
Modulation technique for software defined radio application
Authors: Muhammad Islam, M. A. Hannan, Salina Abdul Samad, Aini Hussain
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

The role of radio in the telecommunication systems have extended from simple radio telephone to mobile communications and beyond. Minimization/replacement of hardware in communication technology through software has resulted in the birth of new technology, widely known as Software Defined Radio (SDR). SDR is developed that transfer information from one place to another place through channel. Incoming signal to have analog modulation PSK type, the transceiver is able to demodulate the modulated signal in order to retrieve the transmitted information. It is confirmed that the programmed SDR can demodulate the various kinds of audio modulation signal by Software Programming.
MVSink: Incrementally Building In-Network Aggregation Trees
Authors: Leonardo L. Fernandes, Amy L. Murphy
Venue: Proceedings of the 6th European Conference on Wireless Sensor Networks (2009)

In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. To date, most aggregation protocols assume that data from localized regions is correlated, thus they tend to identify aggregation points within these regions. Our work, instead, targets systems where the data sources are largely independent, and over time, the sink requests different combinations of data sources. The combinations are essentially aggregation functions. This problem is significantly different from the localized one because the functions are initially known only by the sink, and the data sources to be combined may be located in any part of the network, not necessarily near one another. This paper describes MVSink, a protocol that lowers the network cost by incrementally pushing the aggregation function as close to the sources as possible, aggregating early the raw data. Our results show between 20% and 30% savings over a simplistic approach in large networks, and demonstrate that a data request needs to be active only for a reasonably short period of time to overcome the cost of identifying the aggregation tree.
Networked penalty shootout with haptic media and video
Authors: Takeshi Fujimoto, Yutaka Ishibashi, Shinji Sugawara
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This paper deals with a networked penalty shootout in which two users play a penalty shootout through a network by using haptic interface devices while watching video. We realize the networked penalty shootout by using two haptic media and video transfer systems. In each system, a user can control a haptic interface device via a network by using another haptic interface device while watching video. One of the two systems is used by a user who shoots a soccer ball (i.e., a shooter), and the other is employed by another user who tries to block shots (i.e., a keeper). We investigate the influences of network latency on the networked penalty shootout by subjective assessment.
Circuits with light at the nanoscale: meta-nanocircuits and metactronics
Authors: Nader Engheta
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Imagine optical circuit elements so small that you could fit many of them in a tiny microscale volume (e.g., a cell)! Imagine that such circuits could work with light at the nanoscale instead of electronic currents! What could you do with such optical nanocircuits? Would you be able to use them in wireless gadgets at nanoscales, like a "nanoradio", that may connect our nanoworlds? Could these tiny optical nanocircuits be coupled with biological entities and thus provide nanoscale sensors? The fields of metamaterials and plasmonic optics may provide road maps for such futuristic nanocircuits and wireless nanosystems and sensors. In recent years, the two fields of metamaterials and plasmonic optics have each seen exciting developments. Owing to some of the fascinating features that are common in both areas, the two fields are merging into a single topic that may be called "metaplasmonics". We have been developing and investigating some of the fundamental concepts and theories, and key features of such metaplasmonic structures, devices, and circuits. These nano-optical circuit elements and components may be envisioned as a tapestry of properly-arranged nanostructures (e.g., nanoparticles) of sizes much smaller than the wavelengths of light. Indeed, "lumped" nanocircuit elements can be envisioned at the optical wavelengths. This field, for which I have coined the term metactronics, addresses metamaterial-inspired optical nanocircuits and nanosystems (N. Engheta, Science, 317, 1698-1702, 2007). In my group, a variety of ideas and paradigms for nanocircuit functions and systems, optical antennas and sensors for beam shaping and photonic wireless at the nanoscale, optical nanoscopy, nanospectrometer for molecular spectroscopy, nanotagging and barcodes based on these optical circuits are being studied. In this talk, I will give an overview of these studies, present insights into these findings, and forecast future ideas and road maps in these areas.
Service composition using service selection with WS-agreement
Authors: Nrupen Chudasma, Sanjay Chaudhary
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The business requirements are dynamic in nature. Identification of suitable business partners who can satisfy a set of guarantees "on demand" is a critical process. Selection of business partners is influenced by several parameters including maximizing profit, minimizing cost, reliability, credit history, etc. A business process can be decomposed into several tasks, possibly expressed as Web services implementing desired business functionalities. Each service offers a set of guarantees, each defining a Service Level Objective(SLO). Many service providers may provide the similar business functionality in the form of service with different SLOs. Thus, it is necessary to select services offered by service partner(s) such that overall performance of the process is improved. By specifying requirements of a service in the form of multiple service level objectives (SLOs), selection of a service provider can be achieved based on the best or optimal matching of SLOs of service consumer and providers. A set of services, SLOs, and participating actors constitute a Service Level Agreement (SLA). In this work, WS-Agreement specification is used to specify the SLA. The service partner must comply with the multiple criteria and preferences of a requester. Multi Criteria Decision Making (MCDM) method is also required in this process.