ppxscal/embedding_network huggingface dataset:
Fabrication of ZnO nanorod-based hydrogen gas nanosensor
Authors: Oleg Lupan, Guangyu Chai, Lee Chow
Venue: Microelectronics Journal (2007)

We report a first work on nanofabrication of hydrogen nanosensor from single ZnO branched nanorods (tripod) using in-situ lift-out technique and performed in the chamber of focused ion beam (FIB) system. Self-assembled ZnO branched nanorod has been grown by a cost-effective and fast synthesis route using an aqueous solution method and rapid thermal processing. Their properties were analyzed by X-ray diffraction, scanning electron microscopy, energy dispersion X-ray spectroscopy, transmission electron microscopy, and micro-Raman spectroscopy. These analyses indicate high quality ZnO nanorods. Furthermore, our synthesis technique permits branched nanorods to be easily transferred to other substrates. This flexibility of substrate choice opens the possibility of using FIB system for handling. The main advantage of the proposed in-situ approach is a controllable lift-out procedure which permitted us to obtain a 90% success rate for building nanodevices. The fabricated nanosensor uses only single self-assembled ZnO branched nanorod (tripod) to gauge the 150ppm H"2 in the air at room temperature. The hydrogen sensitivity is in the range of 0.6-2% depending on which two branches to use. The nanosensor has selectivity against other gases such as O"2, CH"4, CO and LPG, which shows sensitivity of
Predicting the Performance and Reliability of Carbon Nanotube Bundles for On-Chip Interconnect
Authors: Arthur Nieuwoudt, Mosin Mondal, Yehia Massoud
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Single-walled carbon nanotube (SWCNT) bundles have the potential to provide an attractive solution for the resistivity and electromigration problems faced by traditional copper interconnect. In this paper, we evaluate the performance and reliability of nanotube bundles for future VLSI applications. We develop a scalable equivalent circuit model that captures the statistical distribution of metallic nanotubes while accurately incorporating recent experimental and theoretical results on inductance, contact resistance, and ohmic resistance. Leveraging the circuit model, we examine the performance and reliability of nanotube bundles including inductive effects. The results indicate that SWCNT interconnect bundles can provide significant improvement in delay over copper interconnect depending on the bundle geometry and process technology.
Dial: A Diagrammatic Animation Language
Authors: S. Feiner
Venue: IEEE Computer Graphics and Applications (1982)

A Simple, Two-Dimensional Notation Lets Animators Easily Express and Recognize Parallelism and Gives Mathematicians a Convenient Way to Experiment with Surfaces in n-Dimensional Space.
Topology exploration for energy efficient intra-tile communication
Authors: Jin Guo, Antonis Papanikolaou, Francky Catthoor
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

With technology nodes scaling down, the energy consumed by the on-chip intra-tile interconnects is beginning to have a significant impact on the total chip energy. The Energyoptimal Sectioned Bus (ESB) template is an energy efficient architecture style for on-chip communication between components. To achieve minimum energy operation, the netlist topology of the ESB bus should however be optimized accordingly. In this paper we present a strategy for the definition of an energy optimal netlist for the ESB bus. An initial floorplanning stage provides information about the eventual lengths of the interconnect wires and a subsequent exploration step defines the optimal topology for the communication architecture. We motivate that a star topology generated using wire length prediction can be up to a factor 4 more energy efficient compared to standard linear bus topologies.
Trespass, nuisance, and spam: 11th century common law meets the internet
Authors: Robert J. Aalberts, Percy Poon, Paul Thistle
Venue: Communications of the ACM (2007)

Even in the instantaneous world of cyberspace, common law still provides a protective shield over many Internet problems.
Ada: A Promising Beginning
Authors: W. E. Carlson
Venue: Computer (1981)

DoD's standardization on Ada will encourage development of Ada-based products benefitting nonmilitary as well as military users.
Pseudo-Random Pattern Generator Design for Column-Matching BIST
Authors: Petr Fiser
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design method. The pattern generator should be as small as possible, whereas patterns generated by it should guarantee satisfactory fault coverage. Weighted random pattern generators offer this. Several weighted pattern generator designs are proposed and their effectiveness is evaluated in this paper. Moreover, two methods for computing the weights are compared. The column-matching method is primarily intended for a test-per-clock BIST, i.e., test patterns are applied to the tested circuit in parallel. Pseudorandom vectors obtained by an LFSR are modified here by a combinational circuit, to obtain deterministic test patterns. The number of inputs of this block corresponds to the width of the LFSR, the outputs correspond to the tested circuit inputs. This paper discusses possibilities of a reduction of the LFSR width.
Means Algorithm
Authors: Wen-Liang Hung, Miin-Shen Yang, De-Hua Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper we propose a Cauchy-type fuzzy c-means (CFCM) algorithm in color image seg- mentation. To speed up CFCM calculations, we use the suppressed idea to modify CFCM algo- rithm and call it a modified CFCM (MCFCM). In our comparisons with FCM and CFCM algo- rithms, the MCFCM algorithm produces better segmentation results according to Liu and Yang's evaluation index.
2007 Special Issue: Indirect biological measures of consciousness from field studies of brains as dynamical systems
Authors: Walter J. Freeman
Venue: Neural Networks (2007)

Consciousness fully supervenes when the 1.5 kgm mass of protoplasm in the head directs the body into material and social environments and engages in reciprocity. While consciousness is not susceptible to direct measurement, a limited form exercised in animals and pre-lingual children can be measured indirectly with biological assays of arousal, intention and attention. In this essay consciousness is viewed as operating simultaneously in a field at all levels ranging from subatomic to social. The relations and transpositions between levels require sophisticated mathematical treatments that are largely still to be devised. In anticipation of those developments the available experimental data are reviewed concerning the state variables in several levels that collectively constitute the substrate of biological consciousness. The basic metaphors are described that represent the neural machinery of transposition in consciousness. The processes are sketched by which spatiotemporal neural activity patterns emerge as fields that may represent the contents of consciousness. The results of dynamical analysis are discussed in terms serving to distinguish between the neural point processes dictated by the neuron doctrine vs. continuously variable neural fields generated by neural masses in cortex.
The Region-Exhaustive Fault Model
Authors: Abhijit Jas, Suriyaprakash Natarajan, Srinivas Patil
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Device failure mechanisms of today's deep submicron processes are not well-modeled by single stuckat faults, and hence several advanced fault models have been proposed in the past. Gate-exhaustive fault models were proposed to exercise a gate completely and then observe the resultant response at an observable output. This paper extends the gateexhaustive fault model to target bigger regions (a collection of gates) with the hypothesis that exercising a region with an exhaustive pattern set can yield coverage on a larger proportion of unmodeled defects. To test out this hypothesis, we use the logic proximity bridge (LPB) fault model as a surrogate for unmodeled defects and grade the region and gate exhaustive patterns against the LPB fault model to gauge their efficacy. We show that region exhaustive patterns are better at detecting untargeted LPB faults compared to patterns obtained using gate exhaustive or traditional stuck-at fault models.
Source Routing for Overlay Multicast in Wireless Ad hoc and Sensor Networks
Authors: Chi-Kuo Chiang, Chung-Ta King
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

A common approach to group multicast in wireless ad hoc and sensor networks is to build an overlay, such as a mesh or a tree, on top of non-member nodes to link the group members. However, the intuitive idea of using multiple unicasts to disseminate the message over the multicast overlay does not take advantage of the broadcast nature of radio transmission. In this paper, we propose to use stateless source routing to perform overlay multicast. By encoding the destinations and forwarders into the packet header, a member node only needs to transmit the packet through the radio once and those neighboring nodes specified in the header will relay the message. Through simulation, we compare our protocol with the Differential Destination Multicast (DDM). The results show that our protocol improves energy efficiency and balances the energy consumption better.
Data sharing through query translation in autonomous sources
Authors: Anastasios Kementsietsidis, Marcelo Arenas
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We consider the problem of data sharing between autonomous data sources in an environment where constraints cannot be placed on the shared contents of sources. Our solutions rely on the use of mapping tables which define how data from different sources are associated. In this setting, the answer to a local query, that is, a query posed against the schema of a single source, is augmented by retrieving related data from associated sources. This retrieval of data is achieved by translating, through mapping tables, the local query into a set of queries that are executed against the associated sources. We consider both sound translations (which only retrieve correct answers) and complete translations (which retrieve all correct answers, and no incorrect answers) and we present algorithms to compute such translations. Our solutions are implemented and tested experimentally and we describe here our key findings.
Block Independent Component Analysis for Face Recognition
Authors: Lei Zhang, Quanxue Gao, David Zhang
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents a subspace algorithm called block independent component analysis (B-ICA) for face recognition. Unlike the traditional ICA, in which the whole face image is stretched into a vector before calculating the independent components (ICs), B-ICA partitions the facial images into blocks and takes the block as the training vector. Since the dimensionality of the training vector in B-ICA is much smaller than that in traditional ICA, it can reduce the face recognition error caused by the dilemma in ICA, i.e. the number of available training samples is greatly less than that of the dimension of training vector. Experiments on the well-known Yale and AR databases validate that the B-ICA can achieve higher recognition accuracy than ICA and enhanced ICA (EICA).
An Algebra Approach for Finding Frequent Subgraphs with Hamiltonian Cycle
Authors: AnGuo Dong, Lin Gao, XiaoFeng Zhou, HongYu Su
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

When referred to functional motif discovery in biological network and drug target recognition in pharmaceutical chemistry, the most important step is to mine subgraphs with certain structure in a graph. Fortunately we notice that those kinds of subgraphs are frequently characterized by a Hamiltonian cycle. Hence, in this paper we develop a matrix theory based approach for mining such subgraphs. Firstly we study the properties of Hamiltonian subgraphs and determine the k-path based on the properties to find subgraph with Hamiltonian cycle. Then, an algorithm for mining subgraph with Hamiltonian cycle is designed under the frame of this approach. Finally, we analyze the complexity of the algorithm and simulate it on five real networks to verify our algorithms. The simulation results show that our algorithms have high efficiency.
Character Reconstruction with Radial-Harmonic-Fourier Moments
Authors: Haiping Ren, Aizhen Liu, Jian Zou, Dongting Bai, Ziliang Ping
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

We have originally proposed Radial-Harmonic- Fourier moments, which are shifting, scaling, rotation and intensity invariant. In this paper, we address an investigation of their character reconstruction ability about the Chinese character with real noises. Results show that Radial-Harmonic-Fourier moments have potential to be widely used in automatic character reconstruction and recognition.
Analyzing Access Timing of Removable Flash Media
Authors: Daniel Parthey, Robert Baumgartl
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Flash memories could be a basis for mass storage with real-time guarantees if a suitable model for access timing could be established. We describe Flanatoo, a suite of benchmarks which extracts relevant timing information from removable flash media such as Compact Flash (CF) and USB flash drives. We identified three major timing in- fluence factors: the access block size, the accessed address and (to a lesser degree) the written bit pattern. Despite numerous timing anomalies we argue that removable flash media behave more predictably than hard disks and are indeed a potential basis for real-time mass storage.
Real-time Gait Generation for Humanoid Robot Based on Fuzzy Neural Networks
Authors: Shouwen Fan, Min Sun, Mingquan Shi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Gait parameters of humanoid robot are optimized by introducing three energy consumption indexes, calculation formulas of driving torque for each joint of humanoid robot are derived based on Lagrange dynamics equation, mathematic models for gait optimization are established. A set of optimal solutions for gait parameters are obtained utilizing Matlab as simulation and optimization tool. The minimum consumed energy gait, which similar with human motion, are used to teach the fuzzy neural network(FNN), after supervised learning, the FNN can quickly generate the humanoid robot gait parameters. A new approach for real-time gait planning of humanoid robot during walking is proposed based on FNN, ZMP criteria, B-spline interpolation and inverse displacement analysis model. Simulation results demonstrate feasibility and effectiveness of the proposed real-time planning method. Numeric examples for gait optimization and real-time gait planning of humanoid robot are given for illustration.
Dual heuristic programming based nonlinear optimal control for a synchronous generator
Authors: Jung-Wook Park, Ronald G. Harley, Ganesh K. Venayagamoorthy, Gilsoo Jang
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper presents the design of an infinite horizon nonlinear optimal neurocontroller that replaces the conventional automatic voltage regulator and the turbine governor (CONVC) for the control of a synchronous generator connected to an electric power grid. The neurocontroller design uses the novel optimization neuro-dynamic programming algorithm based on dual heuristic programming (DHP), which has the most robust control capability among the adaptive critic designs family. The radial basis function neural network (RBFNN) is used as the function approximator to implement the DHP technique. The DHP based optimal neurocontroller (DHPNC) using the RBFNN shows improved dynamic damping compared to the CONVC even when a power system stabilizer is added. Also, the DHPNC provides a robust feedback loop in real-time operation without the need for continual on-line training, thus reducing any risk of possible instability associated with the neural network based controllers.
B-Spline Surfaces: A Tool for Computer Painting
Authors: Herve Huitric, Monique Nahas
Venue: IEEE Computer Graphics and Applications (1985)

B-splines make it possible to model shapes the way a sculptor models clay or plasticine,and their control points can be modified for a variety of effects.
Towards workload shift detection and prediction for autonomic databases
Authors: Marc Holze, Norbert Ritter
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Due to the complexity of industry-scale database systems, the total cost of ownership for these systems is no longer dominated by hardware and software, but by administration expenses. Autonomic databases intend to reduce these costs by providing self-management features. Existing approaches towards this goal are supportive advisors for the database administrator and feedback control loops for online monitoring, analysis and re-configuration. But while advisors are too resource-consuming for continuous operation, feedback control loops suffer from overreaction, oscillation and interference. In this position paper we give a general analysis of the parameters that affect the self-management of a database. Out of these parameters, we identify that the workload has major influence on both physical design of data and DBMS configuration. Hence, we propose to employ a workload model for light-weight, continuous workload monitoring and analysis. This model can be used for the identification and prediction of significant workload shifts, which require autonomic re-configuration of the database.
Distributed Software-based Attestation for Node Compromise Detection in Sensor Networks
Authors: Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

Sensors that operate in an unattended, harsh or hostile environment are vulnerable to compromises because their low costs preclude the use of expensive tamper-resistant hardware. Thus, an adversary may reprogram them with malicious code to launch various insider attacks. Based on verifying the genuineness of the running program, we propose two distributed software-based attestation schemes that are well tailored for sensor networks. These schemes are based on a pseudorandom noise generation mechanism and a lightweight block-based pseudorandom memory traversal algorithm. Each node is loaded with pseudorandom noise in its empty program memory before deployment, and later on multiple neighbors of a suspicious node collaborate to verify the integrity of the code running on this node in a distributed manner. Our analysis and simulation show that these schemes achieve high detection rate even when multiple compromised neighbors collude in an attestation process.
The Model of Order Prediction Based on SVM
Authors: Xiaohui Hua, Xiuxia Yan, Hun Yu
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Under the rapidly changing environment, forecasting the order exactly is the key of improving the flexibility and competition for enterprises. This paper utilized the recognition and regression forecasting function of the support vector machine to put forward the order forecasting model, and proves its validity through handling practical case. Finally, this paper compares the result of this model with the BP neural network, in the condition of the same samples.
Efficient Scheduler for the Growing VoIP Traffic
Authors: Shawish Ahmed, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Voice over Internet Protocol service (VoIP) is growing fast during the last few years. Unlike the usual best effort traffic, the voice traffic is delay and delay jitter sensitive. The current scheduling schemes meet the voice traffic delay constraint by assigning its packets with the highest priority. This behavior is acceptable as long as the volume of voice traffic is relatively very small in comparison with other competitor traffic. With the notable increase of voice traffic volume, the current scheduling will not be able to handle the voice packets with the same behavior otherwise a forceful unfair resource sharing, to other traffic, will rise up. In this paper, we introduce a new flexible scheduling architecture which is capable of satisfying the voice traffic delay constraint while providing a fair resource sharing to the rest of the traffic, as verified by both analytical analysis and an extensive experimental simulation study under various traffic workloads.
Computer Program Schemata and the Processes They Generate
Authors: T. C. Wesselkamper
Venue: IEEE Transactions on Software Engineering (1982)

This paper develops definitions for a program schema, the execution of such a program schema, and a process generated by a program schema. Results due to Hartfiel are used to characterize the cone of stochastic eigenvectors of the class of homogeneous Markov processes generated by a program schema. The stochastic behavior vector of a process generated by the same schema is shown to lie in this cone. In the case of a cyclic structured program schema, all of the vertices of the base of the cone are exactly generated by the circuits of the schema. Some directions for future work are suggested.
A Readily Computable Decision Rule with Variable Dimensionality
Authors: R. W. Ehrich
Venue: IEEE Transactions on Computers (1976)

Optimal decision strategies such as Bayes and Neyman-Pearson require the computation of likelihood ratios that are difficult to compute in all but a few special cases. In practice, unfounded assumptions are frequently made about the nature of the pattern classes so that these strategies can be used. In this correspondence suboptimal decision strategies are explored that are attractive because they are easy to compute. These offer two rather unusual advantages. If, during the operation of the classifier a measurement is undefined or too difficult to make, it is easy to alter the dimensionality of the decision rule. Furthermore, it is possible to use different sets of features for testing different classes so that dimensionality can be minimized rather easily. Normally the features used for each class are "specialists" in discriminating that class from the mixture of remaining classes.
Spam Filtering Issue: FPD Research between False Positive and False Negative
Authors: Zhen Liu, Ming-Tian Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

According to the fact that False Positive is more serious than False Negative while doing spam filtering, novel Email filter with feature of partial dependency(FPD) is asked urgently. This paper investigates the FPD between False Positive and False Negative comprehensively and proposes an advanced fitted Logistic Regression model for spam discrimination by introducing a coefficient function involved with the feature of partial dependency. From four aspects including the precision ratio, dimensionality selection feature, KL divergence distribution between FP R and FN R , and noise withstanding, the new model is proved to be of evident CPD with respect to evaluation tests on real Email testing sets.