ppxscal/embedding_network huggingface dataset:
Circuit Switching
Authors: K. J. Thurber
Venue: Computer (1979)

Currently there is a considerable interest in the development of digital communication techniques. This interest is due to the development of distributed processing concepts,1,2,3to changing regulatory policies of the US Government (the Carterfone decision and subsequent FCC rulings), and to the development of large networks.4 One widely used communication technique that has tremendous growth potential is circuit switching. There are two primary reasons for computer-oriented people to be interested in circuit switching. First, the computer plays a major role in the control and implementation of a circuit switch.5 Second, circuit switches have been used as the interconnection structure for systems containing (or hypothesized to contain) a multiplicity of processing elements.2,5,6
Pretty Good BGP: Improving BGP by Cautiously Adopting Routes
Authors: Josh Karlin, Stephanie Forrest, Jennifer Rexford
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

The Internet's interdomain routing protocol, BGP, is vulnerable to a number of damaging attacks, which often arise from operatormisconfiguration. Proposed solutions with strong guarantees require a public-key infrastructure, accurate routing registries,and changes to BGP. However, BGP routers can avoid selecting and propagating these routes if they are cautious about adoptingnew reachability information. We describe a protocol-preserving enhancement to BGP, Pretty Good BGP (PGBGP), that slows thedissemination of bogus routes, providing network operators time to respond before problems escalate into large-scale Internetattacks. Simulation results show that realistic deployments of PGBGP could provide 99% of Autonomous Systems with 24 hoursto investigate and repair bogus routes without affecting prefix reachability. We also show that without PGBGP, 40% of ASscannot avoid selecting bogus routes; with PGBGP, this number drops to less than 1%. Finally, we show that PGBGP is incrementallydeployable and offers significant security benefits to early adopters and their customers.
Student response behaviors in an instrumented feedback environment
Authors: V. K. Kumar, James L. Rogers
Venue: ACM SIGCUE Outlook (1978)

Three sessions of an Educational Statistics course were taught in an instrumented feedback environment which allowed students to register up to twelve responses (e.g. "Repeat", "Please Summarize") at their initiative, or in response to instructor's queries. Comparison between instrumented and non-instrumented settings indicated no significant difference in overall response rate. However, it was observed that keysets did serve as <u>another mode</u> of responding, particularly for responses which need not be accompanied by oral responses, and for students who had difficulty with the course. Some software and hardware refinements are suggested to study the effects of student responses on systematically shaping instructor's behavior.
A Cyclodespreader Architecture for Detecting Multiple Downlink Aperiodic CDMA Signals
Authors: Vishwanath Venkataraman, John J. Shynk, Richard P. Gooch
Venue: Wireless Personal Communications: An International Journal (2007)

Although a code-division multiple-access (CDMA) system is spectrally efficient and has some immunity against intentional reception, its capacity and performance are generally limited by multiple access interference (MAI) caused by other users. For an aperiodic CDMA system, the spreading sequences span multiple symbol intervals, and the cross-correlations between these sequences, which are a measure of the MAI, are periodic over multiple symbols. In this paper, we present a receiver with a parallel architecture that converts an aperiodic CDMA sequence into a piecewise periodic sequence in each arm. We refer to this receiver as a cyclodespreader because the despreader exploits the cyclostationary property of an aperiodic signal. As a result, the transmitted data can be detected separately in each arm of the receiver using low-complexity conventional algorithms proposed for periodic CDMA systems. The goal of the receiver is to decode several signals received from different cochannel base stations. The performance of the system is evaluated using real aperiodic CDMA signals, and it is compared to that of a conventional matched filter (MF) receiver using the number of correctly decoded messages as the performance measure.
Using Tree Diagram Concepts to model Use Case Flows
Authors: Reyes Juarez-Ramirez, Guillermo Licea, Alfredo Cristobal-Salas
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

The level and quality of the abstraction applied during the analysis phase are key factors for the product robustness and project success. There are not so much techniques to organize the abstraction performed. Also, in the software development process, the analysis phase suffers of a lack of formality at the level of the use cases analysis and description. In this paper we present an approach based on the analogy between probabilistic sequential events and the steps of a use case flow. This analogy represents a kind of formalization that supports the use case flows characterization. Using this approach, the use cases analysis can be performed in a methodological way supported by formal fundamentals.
Simple Methods for the Testing of 2-Summability of Boolean Functions and Isobaricity of Threshold Functions
Authors: S. Ghosh
Venue: IEEE Transactions on Computers (1972)

A simple algorithm for testing the 2-summability of Boolean functions is presented in this note. The concept of asummobility has been extended and the idea of "mutual 2-asummability" has been introduced. The authors show how mutual 2-asummobility can be utilized for the testing of isobaricity of threshold functions containing no more than seven variables.
Effects of SVM parameter optimization on discrimination and calibration for post-procedural PCI mortality
Authors: Michael E. Matheny, Frederic S. Resnic, Nipun Arora, Lucila Ohno-Machado
Venue: Journal of Biomedical Informatics (2007)

Support vector machines (SVM) have become popular among machine learning researchers, but their applications in biomedicine have been somewhat limited. A number of methods, such as grid search and evolutionary algorithms, have been utilized to optimize model parameters of SVMs. The sensitivity of the results to changes in optimization methods has not been investigated in the context of medical applications. In this study, radial-basis kernel SVM and polynomial kernel SVM mortality prediction models for percutaneous coronary interventions were optimized using (a) mean-squared error, (b) mean cross-entropy error, (c) the area under the receiver operating characteristic, and (d) the Hosmer-Lemeshow goodness-of-fit test (HL @g^2). A threefold cross-validation inner and outer loop method was used to select the best models using the training data, and evaluations were based on previously unseen test data. The results were compared to those produced by logistic regression models optimized using the same indices. The choice of optimization parameters had a significant impact on performance in both SVM kernel types.
A New Boundary Element Method for Multiple-Frequency Parameter Extraction of Lossy Substrates
Authors: Xiren Wang, Wenjian Yu, Zeyi Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The couplings via realistic lossy substrates can be modeled as frequency-dependent coupling parameters. The fast extraction at multiple frequencies can be accomplished in two sequent steps. The first is to extract the coupling resistance using a direct boundary element method (DBEM). The second is to revise the resistance into the parameter at the frequency in an exact and rapid way. The first step is time-consuming, while it runs only one time; the second repeats at each frequency, but is much easier. For more frequency calculation, this method is more advanced. Numerical experiments illustrate that this method has high accuracy, and it can be hundreds of times faster than an advanced Green's function based method. Substrates with arbitrary doping profiles can also be easily handled, which is partly verified by experiment.
Supporting top-K join queries in relational databases
Authors: Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results. Current relational query processors do not handle ranking queries efficiently, especially when joins are involved. In this paper, we address supporting top-k join queries in relational query processors. We introduce a new rank-join algorithm that makes use of the individual orders of its inputs to produce join results ordered on a user-specified scoring function. The idea is to rank the join results progressively during the join operation. We introduce two physical query operators based on variants of ripple join that implement the rank-join algorithm. The operators are nonblocking and can be integrated into pipelined execution plans. We address several practical issues and optimization heuristics to integrate the new join operators in practical query processors. We implement the new operators inside a prototype database engine based on PREDATOR. The experimental evaluation of our approach compares recent algorithms for joining ranked inputs and shows superior performance.
Translating topics to words for image annotation
Authors: Yong Wang, Shaogang Gong
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

One of the classic techniques for image annotation is the language translation model. It views an image as a document, i.e., a set of visual words which are obtained by vector quatitizing the image regions generated by unsupervised image segmentation. Annotating images are achieved by translating visual words to textual words, just like translating a document in English to a document in French. In this paper, we also view an image as a document, but we view the annotation processes as two consecutive processes, i.e., document summarization and translation. In the document summarization process, an image document is firstly summarized into its own visual language, which we called visual topics. The translation process translates these visual topics to textual words. Compared to the original translation model, our visual topics learned by the probabilistic latent semantic analysis (PLSA) approach provide an intermediate abstract level of visual description. We show improved annotation performance on the Corel image dataset.
Mechanical Design Productivity Using CAD Graphics — A User's Point of View
Authors: Richard Boltz, J. Avery
Venue: IEEE Computer Graphics and Applications (1985)

Productivity analysis showed that one user realizes a substantial increase in engineering-related activities when using CAD graphics as a design tool.
Nonlinear System Identification Using Least Squares Support Vector Machine
Authors: Hua Liang, Jinya Song, Bolin Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The least squares support vector machines (LS-SVMs) regression is presented for the purpose of nonlinear dynamic system identification. LS-SVMs are used for system identification of system models with static nonlinear part and dynamic linear part. The actuator saturation is a common nonlinear problem in practical control systems. The identification procedure is illustrated using a simulated example. Model obtained using this method is accurate to be implemented in a model based control algorithm. The results indicate that this approach is effective.
Inference Rules for Program Annotation
Authors: N. Dershowitz
Venue: IEEE Transactions on Software Engineering (1981)

Methods are presented whereby an Algol-like program given together with its specifications can be documented automatically. The program is incrementaly annotated with invariant relations that hold between program variables at intermediate points in the program text and explain the actual workings of the program regardless of whether it is correct. Thus, this documentation can be used for proving correctness of programs or may serve as an aid in debugging incorrect programs.
Mobiles can't kiss and hug, so lets meet over coffee
Authors: Salil Sayed
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In Social Interaction, happen the negotiation of cultural context. Through appreciating and sharing of each other's choices, members of a social group regenerate an image which is their cultural identity. In Anthropology there is a move towards seeing identity as a process rather than a product. This paper argues that the process happens in social interaction, and products are a means to record or memorize the image. Analyzing data from an ethnography done in Greece, I try to find answers to why the Greek people complain about not being able to kiss and hug on the mobile phone. Finally I show why the social interaction needs to be studied while zooming on the embedded process of identity creation in order to discover the desires that people impose on the products they use.
On the Use of the SVM Approach in Analyzing an Electronic Nose
Authors: Manlio Gaudioso, Walaa Khalaf, Calogero Pace
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

We present an Electronic Nose (ENose) which is aimed both at identifying the type of gas and at estimating its concentration. Our system contains 8 sensors, 5 of them being gas sensors (of the class TGS from FIGARO USA, INC., whose sensing element is a tin dioxide (SnO2) semiconductor), the remaining being a temperature sensor (LM35 from National Semiconductor Corporation), a humidity sensor (HIH-3610 from Honeywell), and a pressure sensor (XFAM from Fujikura Ltd.). Our integrated hardware software system uses some machine learning principles and least square regression principle to identify at first a new gas sample, and then to estimate its concentration, respectively. In particular we adopt a training model using the Support Vector Machine (SVM) approach to teach the system how discriminate among different gases, then we apply another training model using the least square regression, for each type of gas, to predict its concentration.
A Brief, Personal History of Computer Graphics
Authors: C. Machover
Venue: Computer (1978)

Has computer graphics come of age? Yes-several times, with more companies, better technology, and lower costs each time.
Agile Methodologies Selection Toolbox
Authors: . E. Mnkandla, B. Dwolatzky
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Agile methodologies have been in the software development scene for more than five years and this has resulted in the proliferation of a number of approaches to this new way of developing software. The initial agile problems were mainly focused on the definition of what agile methodologies are all about and empirical evidence of their successful application. Today one of the most formidable challenges is selecting appropriate agile processes for a given project and the next problem that some practitioners are already faced with is agile certification. This paper presents a selection tool that picks the agile practices relevant to a given environment. The activities that relate to each practice are used to classify the practices into either technical or social. The authors believe that all practices can be classified into technical and social oriented activities. The technical practices are those that relate to design coding and testing and the social practices relate to people issues. The practices are analyzed to this detail in order to simplify the tailoring process. In this case the environment is then viewed from the perspective of technical and social issues and it becomes easier to identify possible things that could be done to tailor the agile practices. The tool is a simple application that can be used with other project planning tools on any PC. This is part of further work based on one of the authors' PhD work. The additions include the development of a computer program to implement the tool.
Recursive geometry of the flow complex and topology of the flow complex filtration
Authors: Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthias John
Venue: Computational Geometry: Theory and Applications (2008)

The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in R^k. Flow shapes are topological spaces corresponding to substructures of the flow complex. The flow complex and flow shapes have found applications in surface reconstruction, shape matching, and molecular modeling. In this article we give an algorithm for computing the flow complex of weighted points in any dimension. The algorithm reflects the recursive structure of the flow complex. On the basis of the algorithm we establish a topological similarity between flow shapes and the nerve of a corresponding ball set, namely homotopy equivalence.
The Application of Fuzzy Neural Network in the Iatrical Monitor
Authors: Ping Chen, Mingbo Zhao, Shaoqing Jia
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Due to the nonlinear, time-varying and time lagging property of the transfusion system, conventional control methods cannot achieve good performance in the real time monitoring. This paper proposes a method based on fuzzy neural network, which integrates the advantages of fuzzy logical control and neural network. It utilizes neural network to train fuzzy rules for fuzzy control. Error back propagation is adopted to realize the online self-learning when the control parameters are changed, which can quickly analyze the data and achieve intelligent control.
Evaluating and Improving Recursive Descent Parsers
Authors: J. Cohen
Venue: IEEE Transactions on Software Engineering (1979)

Time formulas are symbolic formulas which express the execution time of a program as a function of its input data and of variables representing the time to execute individual operations (e.g., push, pop, transfer, etc.). It is shown that in many cases the time formulas for recursive descent parsers may be generated automatically by a simple inspection of the parser code. These time formulas are instrumental in estimating the gains attained by various types of optimizations. Several of these optimizations are presented and their efficiency gains are estimated. A parser for a simple programming language is generated, optimized, and evaluated using the proposed techniques.
Testing for Single Intermittent Failures in Combinational Circuits by Maximizing the Probability of Fault Detection
Authors: J. Savir
Venue: IEEE Transactions on Computers (1980)

Intermittent faults in combinational circuits may appear and disappear randomly; hence, their detection requires many repeated applications of test vectors. Since testing reduces the time available for computation, it is necessary to efficiently minimize the time required for a test, while still achieving a high degree of fault detection.
Bus-based Anonymous Multicast in Peer-to-Peer Overlay
Authors: Jian Wang, Changyong Niu, Ruimin Shen
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Peer-to-peer overlay is self-organized by individual hosts in the Internet. The overlay usually serves for collaborationoriented applications and necessitates group communication. Consequently, anonymity is demanded in scenarios such as military, government applications for privacy protection. It prevents communicating party identity from being revealed by others. In this paper we propose Bus-based anonymous multicast upon peer-to-peer overlay, which delivers message from originator to consumers anonymously. The Bus rotates over an Euler tour formed by hosts and takes intentional messages to respective consumers. Theoretical analysis demonstrates that bus-based anonymous multicast gets higher anonymity level comparing to existing ones.
Study on The Property of Training Samples and Learning Space with Genetic Algorithms
Authors: Jingsong He, Jian Tang, QianSheng Fang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Historically, the empirical risk of a pattern classifier was asked to be made zero, therefor the default property of training samples were limited to a separable ones. Nowadays on the contrary, the major idea of learning classification no longer ask the empirical risk of classifier must be made zero. In this situation, inseparable feature sets may not be detrimental to the performance of classifier. However, so far no experimental studies and analytical results show whether an inseparable feature set is available or not. This paper firstly analyzes the interaction between learning algorithms and feature selection, and gives a proof by both the analytical analysis and experimental studies.
Compiler-Directed Region-Based Security for Low-Overhead Software Protection
Authors: Vijay Kongubangaram, Olga Gelbart, Rahul Simha, Bhagirath Narahari
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Software security has become a prominent area of research in recent years, with research efforts spanning a wide range of topics. Among these are techniques such as those in this paper that are in the general area of languages, compilers and architecture aimed at increasing the security of computing systems. This paper describes a compiler technique that performs risk-analysis on source code and generates an encrypted executable that both provides security but yet reduces overhead by selectively encrypting low-risk portions with less overhead. Regions of the code that are more vulnerable receive a higher degree of encryption. Experimental results for this technique, which we call Region-Based Security, using a collection of benchmarks show that execution overhead is reduced considerably by using this approach.
A New Hierarchical Fuzzy Control Method for 2-DOF Underactuated Robots
Authors: Qingbo Liu, Yueqing Yu, Liying Su
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A new hierarchical fuzzy control method for endpoint position control of planar 2-DOF underactuated robots with a passive revolute joint is presented in this paper. The control objective is to move the links from rest to a target-configuration with zero-velocity. This kind of underactuated mechanical system which is subject to the nonholonomic second-order constraints is controlled to gain the desired position by three fuzzy logic controllers. The genetic algorithm is introduced to achieve the global optimization. Fuzzy rules are automatically generated by the way of Genetic Algorithm from the system model according to the defined fitness function. Numerical simulation results show the validity of the proposed method.