ppxscal/embedding_network huggingface dataset:
A Transform for NAND Network Design
Authors: Hsiao-Peng Lee
Venue: IEEE Transactions on Computers (1972)

A transform that operates on the interconnection topology of a NAND network is presented. The output connecting a designated gate to the network is deleted and is connected instead to a number of other gates in the network. The entire transform may be specified by designating a "transformed gate" and a "modified gate." The new connections are made and the resulting network is then simplified logically by casting out redundancy and merging gates in the network.
A new worm exploiting IPv4-IPv6 dual-stack networks
Authors: Qinhua Zheng, Ting Liu, Xiaohong Guan, Yu Qu, Na Wang
Venue: Proceedings of the 2007 ACM workshop on Recurring malcode (2007)

It is commonly believed that the IPv6 protocol can provide good protection against network worms due to its huge address space. However, it is proved to be incorrect by our study on the new "dual-stack worm" which can spread in IPv4-IPv6 dual-stack networks. It is found in this paper that the dual-stack worm can collect the IPv6 addresses of all running hosts on the link-local quickly and effectively, which may result in accelerated worm spreading on the IPv6 link-locals. This worm applies a two-level scanning mechanism to find its targets in dual-stack networks, which is investigated by exploring its similarity to the self-replicating behaviors of biological viruses. Based on the ideas of classifying the population into different species or patches, we categorized all vulnerable hosts into two species and separated all dual-stack hosts into several patches to model the propagation of this worm by differential equations. Simulation is performed to validate the worm propagation model and to study the propagation of the worm in various dual-stack networks with different patch parameters. The simulation results show that the worm is able to spread much faster in IPv4-IPv6 dual-stack network than that in the pure IPv4 Internet. It is also noted that the dual-stack links may influence the propagation of the worm in the Internet
Hardware Description Language Applications: An Introdiction and Prognosis
Authors: S. Y. H. Su
Venue: Computer (1977)

Just as Software designers use high-level languages like Algol, Fortran, PL/I, and Snobol to express algorithms in terms of language statements, so digital hardware designers use hardware description languages to describe the digital systems they want to design. But whereas compilers for many high-level programming languages have been developed and implemented, the process of transforming a high-level computer hardware description language specification of a system into a logic diagram is still in its infancy.
Enhanced Broadside Testing for Improved Transition Fault Coverage
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The use of multiple scan chains was shown to improve the coverage of transition faults achieved by skewed-load tests. For broadside tests, the number of scan chains does not affect the transition fault coverage. We describe an enhanced broadside configuration under which increasing the number of scan chains helps increase the fault coverage. In the enhanced configuration, the first flip-flop of a scan chain operates in skewed-load mode while the other flip-flops operate in broadside mode. This provides flexibility in determining the value of the first flip-flop of every scan chain under the second pattern of a broadside test, thus increasing the transition fault coverage. We also describe a procedure that makes small modifications to a given scan chain configuration in order to improve the transition fault coverage.
Virtual Prototyping of Novel Cathode Designs for the Relativistic Magnetron
Authors: Timothy P. Fleming, Peter J. Mardahl, Lester Bowers, Keith L. Cartwright, Matthew T. Bettencourt, Michael D. Haworth
Venue: Computing in Science and Engineering (2007)

Shaped cathodes enhance key magnetron performance parameters, such as output power, power efficiency, and impedance. Simulations using these novel designs showed a dramatic increase in the range of magnetic field in which the magnetron functions, a doubling of output power, an increase in efficiency, an elimination of mode competition, and a halving of the start-up time.
Bookshelf
Authors: Vahid Garousi, Art Sedighi
Venue: IEEE Software (2007)

Book reviews of Managing Iterative Software Development Projects by Ian Spence and Kurt Bittner and Introduction to Network Security by Neal Krawetz.
On an expansion of nondeterministic finite automata
Authors: Boris Melnikov
Venue: Journal of Applied Mathematics and Computing (2007)

We consider a possible generalization of nondeterministic finite automata. The goals of this consideration are: to apply some obtained algorithms for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; to simplify some proofs for algorithms of simplification for usual nondeterministic automata.
Cluster-based Forwarding in Delay Tolerant Public Transport Networks
Authors: Shabbir Ahmed, Salil S. Kanhere
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Packet forwarding in Public Transport Networks is particularly challenging due to the high mobility, rapidly changing topology and intermittent connectivity observed in these networks. Though clustering of nodes can aid forwarding decision in these Delay Tolerant Networks (DTNs), the clustering process is extremely costly in a large network. In this paper, we introduce a generic efficient clustering method which is suitable for grouping the nodes of large networks. We also demonstrated how encounter frequencies of public transport networks can be fed to that clustering algorithm in order to build clusters of nodes. And finally, our large scale extensive simulation study on real bus traces shows the efficacy of clustering in packet forwarding.
The Application of Data Mining in Mobile Subscriber Classification
Authors: Haiming Fu, Lingling Zhang, Yong Shi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In the field of mobile communication, subscriber classification is very important for company to identify market opportunity. A reasonable subscriber classification could produce an effective market pricing that could increase operator's revenue and market share. But how can we find this reasonable classification? This paper studies on mobile subscriber's revenue and behavior, and then build subscribers' classification model, which could explain some marketing activities, such as pricing. To the topic of mobile subscriber classification, there are some papers studies on, but most of them focus on subscribers' revenue and few focuses on subscribers' behavior. This paper's innovation is to study subscriber classification on both revenue and behavior. This paper refers to the method of data mining, model building, model illustration and model application.
Region-based Image Fusion Using Energy Estimation
Authors: Zhang Yingjie, Ge Liling
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we propose a new region-based image fusion approach using energy estimation. In order to segment an input image into a set of regions according to the homogeneity of the region of the image, an improved method to solving the piecewise smooth Mumford and Shah model is studied, and the level set based optimal algorithm is integrated with it to speedup convergence. For selecting the best fusion rule on every region of the image an energy model is proposed to measure the fusion quality of the candidates. Furthermore, the optimal fusion rules can be determined by comparing the magnitudes of the energies. By numerical experiment, it has been demonstrated that proposed approach has shown many advantages over previous ones, such as the ability to preserve all relevant information and removal of the side effects like sensitive to error of registration and reduction of contrast.
Mathematical Software in Basic Dint: Data Integration
Authors: David Kahaner, Jeffrey Horlick, Webb Wyman
Venue: IEEE Micro (1985)

With this software package, a PC, and a modest grasp of Basic, users can perform and plot integrals over experimental data.
A Refined Electrical Model for Particle Strikes and its Impact on SEU Prediction
Authors: Sybille Hellebrand, Christian G. Zoellin, Hans-Joachim Wunderlich, Stefan Ludwig, Torsten Coym, Bernd Straube
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Decreasing feature sizes have led to an increased vulnerability of random logic to soft errors. A particle strike may cause a glitch or single event transient (SET) at the output of a gate, which in turn can propagate to a register and cause a single event upset (SEU) there. Circuit level modeling and analysis of SETs provides an attractive compromise between computationally expensive simulations at device level and less accurate techniques at higher levels. At the circuit level particle strikes crossing a pn-junction are traditionally modeled with the help of a transient current source. However, the common models assume a constant voltage across the pn-junction, which may lead to inaccurate predictions concerning the shape of expected glitches. To overcome this problem, a refined circuit level model for strikes through pn-junctions is investigated and validated in this paper. The refined model yields significantly different results than common models. This has a considerable impact on SEU prediction, which is confirmed by extensive simulations at gate level. In most cases, the refined, more realistic, model reveals an almost doubled risk of a system failure after an SET.
Energy Effective Time Synchronization inWireless Sensor Network
Authors: Youngtae Jo, Chongmyung Park, Joahyoung Lee, Inbum Jung
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Advance in processor, memory and wireless communication technique have led to an increase of economical and small wireless sensor nodes. To provide the right responses quickly for the diverse events, wireless sensor nodes have cooperation with together. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In wireless sensor networks, message packets are used for the time synchronization. However, the transmission of message packets dissipates the battery energy of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive use of message packets has a negative impact upon their lifetime. In this paper, reference interpolation protocol is proposed for reducing the number of message packets for the time synchronization. The proposed method performs time interpolation between the time of reference packets and the global time of the base station. The proposed method completes the synchronization operation with only two message packets. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.
A highly integrated 565 optical fibre system
Authors: R. M. Brooks, P. Cochrane, L. Bickers, G. Blau, G. P. Coombs, R. Davies, R. Dawes, I. Hawker, G. Hilton, A. Stevenson, S. Whitt
Venue: BT Technology Journal (2007)

This paper describes a 565 Mbit/s optical fibre system, developed by British Telecom Research Laboratories in association with Fulcrum Communications Ltd, which incorporates advanced integrated circuit (IC) technology and offers repeater spacings in excess of 40 km. An outline of the IC architecture and system design is presented together with the thermal management techniques adopted. Finally, a description is given of the results of a field trial of the system over a 77 km route between Birmingham and Derby.
Study on Classification Algorithm of Multi-subject Text
Authors: Yu-ping Qin, Qing Ai, Xiu-kun Wang, Xiang-na Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

One text may belong to multi-class, but it can not be classified by standard SVM and other approaches. In this paper, a multi-subject text classification algorithm based on fuzzy support vector machines is proposed, 1-a-1 method is used to train sub-classifiers. For the sample to be classified, the sub-classifiers are used to obtain membership matrix, and then according to the sum of every line of membership matrix, the subjects that the sample belongs to can be confirmed. The algorithm was tested on Reuters 21578, the experimental results show that the algorithm has higher performance on recall, precision, and F1.
A neural network-assisted finite element analysis of cold flat rolling
Authors: P. P. Gudur, U. S. Dixit
Venue: Engineering Applications of Artificial Intelligence (2008)

The finite element analysis of the cold flat rolling process is well established. However, the requirement of large computational time makes it unsuitable for online applications. Recently, there have been some applications of modeling the rolling process by means of neural networks. In most of the previous works, trained networks predict only roll force and roll torque. The input data for training the neural network have been obtained either through experiments or from finite element method (FEM) code. In this work, the neural networks have been used for predicting the velocity field and location of neutral point. The training data are obtained from a rigid-plastic finite element code. The trained network provides a suitable guess for the velocity field and location of the neutral point, that is further refined by the finite element code. The post-processor of the FEM code computes roll force, roll torque, strain distribution, etc. This procedure provides highly accurate solution with reduced computational time and is suitable for on line control or optimization.
Reliability Control for Aggregation in Wireless Sensor Networks
Authors: Jonathan P. Benson, Tony O'Donovan, Cormac J. Sreenan, Utz Roedig
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Data aggregation is a method used in sensor networks to reduce the amount of messages transported. By aggregating, the data contained in several messages is fused into one single message. If such a message, containing the equivalent of many individual messages, is lost due to transmission errors then this has a detrimental effect on the application quality experienced. In many sensor network applications a constant supply of data is needed and therefore application quality is severely effected by excessive data loss. This paper proposes and evaluates the use of an in-network control mechanism to offset this disadvantageous effect. The control mechanism analytically calculates the correct reliability that an aggregate of given size must be forwarded at in order to meet application specific goals.
Similarity Search in Time Series Database Based on SOFM Neural Network
Authors: Peng Zhang, Xue-ren Li, Jun Du, Zong-lin Zhang, Jian-ye Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A novel algorithm for the similarity search in time series database is proposed. Considering the neural network's poor capability when handling with time change process sequence, the original data is mapped into the feature pattern space by means of Discrete Cosine Transform (DCT) for dimensionality reduction. By analyzing the advantages when the artificial neural network is used as similarity measurement model, the All-pairs query algorithm is presented based on SOFM neural network. For this experiment we examined the real flight data, the simulation result shows the proposed method is correct, and it has multi-scale feature and can reflect different similar patterns of time series under the various resolution.
Fault-dependent/independent Test Generation Methods for State Observable FSMs
Authors: Toshinori Hosokawa, Ryoichi Inoue, Hideo Fujiwara
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Since scan testing is not based on the function of the circuit, but rather its structure, this method is considered to be a form of over testing or under testing. It is important to test VLSIs using the given function. Since the functional specifications are described explicitly in the FSMs, high test quality is expected by performing logical testing and timing testing. This paper proposes two test generation methods, a fault-independent test generation method and a fault-dependent test generation method, for stateobservable FSMs. We give experimental results for MCNC'91 benchmark circuits. The quality and cost of the logic testing and timing testing for proposed test generation methods was evaluated.
Convergence of SSOR multisplitting method for an M-matrix
Authors: Jae Heon Yun, Yu Du Han, Seyoung Oh
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper, we study the convergence of both the multisplitting method and the relaxed multisplitting method associated with SOR or SSOR multisplittings for solving a linear system whose coefficient matrix is an M-matrix.
LYSP: a Lisp dialect for programming small applications
Authors: Paul R. Kosinski
Venue: ACM SIGPLAN Lisp Pointers (1987)

Some ten years ago, a small group of us at IBM Research undertook to write a new kind of text editor, to run in the VM/370 environment, based on our experience with the experimental Business Definition System (BDS) we had implemented previously. This new editor, called the Parametric Editor, or P-EDIT, was to be upwards compatible with an existing popular editor in use at that time, while providing the ability to edit multiple versions of a file simultaneously, and providing a general UNDO command which could be used to return to any previous state of the editing session, and which itself was UNDOable.
Automated detection of api refactorings in libraries
Authors: Kunal Taneja, Danny Dig, Tao Xie
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Software developers often do not build software from scratch but reuse software libraries. In theory, the APIs of a library should be stable, but in practice they do change and thus require changes in software that reuses the library. Our previous study of five reusable components shows that more than 80% of these API changes are caused by refactorings. If these refactorings could be automatically detected, they could be used to automatically upgrade applications. In this paper, we present a technique and its supporting tool, RefacLib, to automatically detect refactorings in libraries. RefacLib uses syntactic analysis in the first phase to quickly detect refactoring candidates across two versions of a library. In the second phase, RefacLib uses various heuristics to refine the results. We used RefacLib to detect refactorings in five open source libraries and frameworks. The experiments show that RefacLib can process realistic code bases and detects refactorings with practical accuracy
A Comparative Study of Compatibility and Transformation between Probability and Possibility
Authors: Li-Ping He, Fu-Zheng Qu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, an annotated survey of approaches to the transformation from a probability measure to a possibility measure or conversely is provided and noticeable properties of the transformations are described. The close relationship of possibility theory and probability theory on quantifying uncertainty is an interesting question which needs further theoretical research. Moreover, the transformations between them are vital for practical applications and attract more attention. The already- existing approaches considered less on discussions of the basis for such transformation. Hence, the compatibility of possibility and probability theory based on evidence theory is investigated first, and then detailed transformations are presented and their characteristics are proved to be a foundation of the transformations. From the systematic point of view, this paper also points out that information semantics inherent in possibility and probability measures may be an elementary factor worth considering. At last, application areas, technical difficulties and future work are stated.
Direct stamp fabrication for NIL and hot embossing using HSQ
Authors: N. Gadegaard, D. McCloy
Venue: Microelectronic Engineering (2007)

Commonly stamps or masters for nanoimprinting are made by electron beam lithography (EBL) and subsequent reactive ion etching into silicon. Here we present a single step procedure to prepare stamps suitable for nanoimprinting and hot embossing. The stamps are directly fabricated in HSQ (hydrogen silsequioxane), a negative EBL resist, which has a high lateral resolution and good mechanical properties. We demonstrate successful pattern transfer in both bulk PMMA and PCL by hot embossing with features down to 20nm. Such pattern transfer is useful for biological applications. Also, we demonstrate that this approach can make stamps suitable for nanoimprint lithography and have achieved features as small as 35nm. It was found that the stability and strength of the HSQ could be improved by annealing and that the application of a non-stick coating was not necessarily required although it aided the demoulding.
Modeling Causal Reinforcement and Undermining for Efficient CPT Elicitation
Authors: Yang Xiang, Ning Jia
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Representation of uncertain knowledge using a Bayesian network requires acquisition of a conditional probability table (CPT) for each variable. The CPT can be acquired by data mining or elicitation. When data are insufficient to support mining, causal modeling, such as the noisy-OR, aids elicitation by reducing the number of probability parameters to be acquired from human experts. Multiple causes can reinforce each other in producing the effect or can undermine the impact of each other. Most existing causal models do not consider causal interactions from the perspective of reinforcement or undermining. Our analysis shows that none can represent both interactions. Except the RNOR, other models also limit parameters to probabilities of single-cause events. We present the first causal model, the non-impeding noisy-AND tree, that allows encoding of both reinforcement and undermining. The model generalizes several existing models for the binary case. It supports efficient CPT acquisition by elicitating a partial ordering of causes in terms of a tree topology, plus necessary numerical parameters. It also allows incorporation of probabilities for multi-cause events.
ITC exhibits for fun and profit
Authors: Jill Sibert
Venue: IEEE Design Test (2007)

Exhibits are an often under-appreciated part of Test Week and the International Test Conference. The main benefit of the exhibits is the information you can pick up. Exhibitors collect the needs and desires of test professionals like you, decide what's most important, and funnel them into products. Listening to demonstrations on the ITC exhibits floor might tell you about a need you didn't even know you had. Perhaps you will find the solution for a problem you have had for a while and thought you'd just have to live with. This year, let's visit the exhibit hall often and prove to the exhibitors how much they are truly appreciated.