ppxscal/embedding_network huggingface dataset:
Linux Networking Cookbook
Authors: Carla Schroder
Venue:  (2007)

This soup-to-nuts collection of recipes covers everything you need to know to perform your job as a Linux network administrator, whether you're new to the job or have years of experience. With Linux Networking Cookbook, you'll dive straight into the gnarly hands-on work of building and maintaining a computer network. Running a network doesn't mean you have all the answers. Networking is a complex subject with reams of reference material that's difficult to keep straight, much less remember. If you want a book that lays out the steps for specific tasks, that clearly explains the commands and configurations, and does not tax your patience with endless ramblings and meanderings into theory and obscure RFCs, this is the book for you. You will find recipes for: Building a gateway, firewall, and wireless access point on a Linux networkBuilding a VoIP server with AsteriskSecure remote administration with SSHBuilding secure VPNs with OpenVPN, and a Linux PPTP VPN serverSingle sign-on with Samba for mixed Linux/Windows LANsCentralized network directory with OpenLDAPNetwork monitoring with Nagios or MRTGGetting acquainted with IPv6Setting up hands-free networks installations of new systemsLinux system administration via serial console And a lot more. Each recipe includes a clear, hands-on solution with tested code, plus a discussion on why it works. When you need to solve a network problem without delay, and don't have the time or patience to comb through reference books or the Web for answers, Linux Networking Cookbook gives you exactly what you need. 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
A region-based multi-sensor image fusion scheme using pulse-coupled neural network
Authors: Min Li, Wei Cai, Zheng Tan
Venue: Pattern Recognition Letters (2006)

For most image fusion algorithms split relationship among pixels and treat them more or less independently, this paper proposes a region-based image fusion scheme using pulse-coupled neural network (PCNN), which combines aspects of feature and pixel-level fusion. The basic idea is to segment all different input images by PCNN and to use this segmentation to guide the fusion process. In order to determine PCNN parameters adaptively, this paper brings forward an adaptive segmentation algorithm based on a modified PCNN with the multi-thresholds determined by a novel water region area method. Experimental results demonstrate that the proposed fusion scheme has extensive application scope and it outperforms the multi-scale decomposition based fusion approaches, both in visual effect and objective evaluation criteria, particularly when there is movement in the objects or mis-registration of the source images.
SLIM: a simulation and implementation language for VLSI microcode
Authors: John Hennessy
Venue: ACM SIGMICRO Newsletter (1985)

SLIM (Stanford Language for Implementing Microcode) is a programming language based system for specifying and simulating microcode in a VLSI chip. The language is oriented towards PLA implementations of microcoded machines using either a microprogram counter or a finite state machine. The SLIM system supports simulation of the microcode and will drive a PLA layout program to automatically create the PLA.
Recurrent neural network architecture with pre-synaptic inhibition for incremental learning
Authors: Hiroyuki Ohta, Yukio Pegio Gunji
Venue: Neural Networks (2006)

We propose a recurrent neural network architecture that is capable of incremental learning and test the performance of the network. In incremental learning, the consistency between the existing internal representation and a new sequence is unknown, so it is not appropriate to overwrite the existing internal representation on each new sequence. In the proposed model, the parallel pathways from input to output are preserved as possible, and the pathway which has emitted the wrong output is inhibited by the previously fired pathway. Accordingly, the network begins to try other pathways ad hoc. This modeling approach is based on the concept of the parallel pathways from input to output, instead of the view of the brain as the integration of the state spaces. We discuss the extension of this approach to building a model of the higher functions such as decision making.
Evaluation for uncertain image classification and segmentation
Authors: Arnaud Martin, Hicham Laanaya, Andreas Arnold-Bos
Venue: Pattern Recognition (2006)

Each year, numerous segmentation and classification algorithms are invented or reused to solve problems where machine vision is needed. Generally, the efficiency of these algorithms is compared against the results given by one or many human experts. However, in many situations, the location of the real boundaries of the objects as well as their classes are not known with certainty by the human experts. Furthermore, only one aspect of the segmentation and classification problem is generally evaluated. In this paper we present a new evaluation method for classification and segmentation of image, where we take into account both the classification and segmentation results as well as the level of certainty given by the experts. As a concrete example of our method, we evaluate an automatic seabed characterization algorithm based on sonar images.
Application of factorial designs for reducing factors in optimization via discrete-event simulation
Authors: José Arnaldo Barra Montevechi, Renaldo Gonzaga de Almeida Filho, André Luiz Medeiros
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Optimization via simulation came true; most discrete-event simulation packages have some kind of optimization routines but the optimum search can become very timeconsuming as the factor number increases. This paper objectives show how Factorial Designs help the optimization via simulation to reach the optimum solution by reducing number of factors. A comparative study between an optimization without planning and an optimization planned based on Factorial Designs is carried out. Results are presented where the reduction of the number of runs needed to find the optimum is showed. This work concludes with brief considerations on the Factorial Designs and optimization via simulation integration.
Text-dependent Speaker Recognition using Wavelets and Neural Networks
Authors: Chee Peng Lim, Siew Chan Woo
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

An intelligent system for text-dependent speaker recognition is proposed in this paper. The system consists of a wavelet-based module as the feature extractor of speech signals and a neural-network-based module as the signal classifier. The Daubechies wavelet is employed to filter and compress the speech signals. The fuzzy ARTMAP (FAM) neural network is used to classify the processed signals. A series of experiments on text-dependent gender and speaker recognition are conducted to assess the effectiveness of the proposed system using a collection of vowel signals from 100 speakers. A variety of operating strategies for improving the FAM performance are examined and compared. The experimental results are analyzed and discussed.
Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
Authors: P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian
Venue: Pattern Recognition (2006)

Hybrid hierarchical clustering techniques which combine the characteristics of different partitional clustering techniques or partitional and hierarchical clustering techniques are interesting. In this paper, efficient bottom-up hybrid hierarchical clustering (BHHC) techniques have been proposed for the purpose of prototype selection for protein sequence classification. In the first stage, an incremental partitional clustering technique such as leader algorithm (ordered leader no update (OLNU) method) which requires only one database (db) scan is used to find a set of subcluster representatives. In the second stage, either a hierarchical agglomerative clustering (HAC) scheme or a partitional clustering algorithm-'K-medians' is used on these subcluster representatives to obtain a required number of clusters. Thus, this hybrid scheme is scalable and hence would be suitable for clustering large data sets and we also get a hierarchical structure consisting of clusters and subclusters and the representatives of which are used for pattern classification. Even if more number of prototypes are generated, classification time does not increase much as only a part of the hierarchical structure is searched. The experimental results (classification accuracy (CA) using the prototypes obtained and the computation time) of the proposed algorithms are compared with that of the hierarchical agglomerative schemes, K-medians and nearest neighbour classifier (NNC) methods. The proposed methods are found to be computationally efficient with reasonably good CA.
Semantics-based composition for aspect-oriented requirements engineering
Authors: Ruzanna Chitchyan, Awais Rashid, Paul Rayson, Robert Waters
Venue: Proceedings of the 6th international conference on Aspect-oriented software development (2007)

In this paper, we discuss the limitations of the current syntactic composition mechanisms in aspect-oriented requirements engineering (AORE). We highlight that such composition mechanisms not only increase coupling between aspects and base concerns but are also insufficient to capture the intentionality of the aspect composition. Furthermore, they force the requirements engineer to reason about semantic influences and trade-offs among aspects from a syntactic perspective. We present a requirements description language (RDL) that enriches the existing natural language requirements specification with semantic information derived from the semantics of the natural language itself. Composition specifications are written based on these semantics rather than requirements syntax hence providing improved means for expressing the intentionality of the composition, in turn facilitating semantics-based reasoning about aspect influences and trade-offs. We also discuss the practicality of the use of this RDL by outlining the automation support for requirements annotation (realized as an extension of the Wmatrix natural language processing tool suite) to expose the semantics which are in turn utilized to facilitate composition and analysis (supported by the MRAT tool).
Microprogramming of signal processors
Authors: W. D. Ashcraft
Venue: ACM SIGMICRO Newsletter (1973)

This paper is concerned with the hardware and architecture of microprogrammed equipment intended primarily for real time signal processing applications. Principles and structural types are discussed rather than a specific structure. There are numerous advantages to microprogrammed as contrasted to hardwired signal processing equipment. People in different positions view microprogramming as having different advantages. This paper presents some of these advantages together with hardware structure, microinstruction format, diagnostic techniques for both hardware and software, and various methods of control of a microprogrammed processor. 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
Knoppix Hacks
Authors: Kyle Rankin, Klaus Knopper
Venue:  (2004)

Knoppix Hacks is an invaluable collection of one hundred industrial-strength hacks for new Linux users, power users, and system administrators using--or considering using--the Knoppix Live CD. These tips and tools show how to use the enormous amount of software on this live CD to troubleshoot, repair, upgrade, disinfect, and generally be productive without Windows--without the difficulty of installing Linux itself.
A graphics architecture for high-end interactive television terminals
Authors: Pablo Cesar, Petri Vuorimaa, Juha Vierinen
Venue: ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) (2006)

This article presents a graphics software architecture for next-generation digital television receivers. We propose that such receivers should include a standardised Java-based procedural environment capable of rendering 2D/3D graphics and video, and a declarative environment supporting W3C recommendations such as SMIL and XForms. We also introduce a graphics architecture model that meets such requirements. As a proof-of-concept, a prototype implementation of the model is presented. This implementation enhances television content by allowing the user to play 3D graphics games, to run Java applications, and to browse XML-based documents while meeting current hardware restrictions.
eFASE: expressive facial animation synthesis and editing with phoneme-isomap controls
Authors: Zhigang Deng, Ulrich Neumann
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

This paper presents a novel data-driven system for expressive facial animation synthesis and editing. Given novel phoneme-aligned speech input and its emotion modifiers (specifications), this system automatically generates expressive facial animation by concatenating captured motion data while animators establish constraints and goals. A constrained dynamic programming algorithm is used to search for best-matched captured motion nodes by minimizing a cost function. Users optionally specify "hard constraints" (motion-node constraints for expressing phoneme utterances) and "soft constraints" (emotion modifiers) to guide the search process. Users can also edit the processed facial motion node database by inserting and deleting motion nodes via a novel phoneme-Isomap interface. Novel facial animation synthesis experiments and objective trajectory comparisons between synthesized facial motion and captured motion demonstrate that this system is effective for producing realistic expressive facial animations.
A computer mathematics course for secondary school teachers
Authors: Jean H. Bevis
Venue: ACM SIGCUE Outlook (1975)

This popular course has been taught by the Department of Mathematics at Georgia State University for the last several years. The course is designed for students in the Master of Arts for Teachers and Master of Education programs. Most of these students start teaching mathematics at the secondary level before entering the program.
On the role and controllability of persistent clients in traffic aggregates
Authors: Hani Jamjoom, Kang G. Shin
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Flash crowd events (FCEs) present a real threat to the stability of routers and end-servers. Such events are characterized by a large and sustained spike in client arrival rates, usually to the point of service failure. Traditional rate-based drop policies, such as Random Early Drop (RED), become ineffective in such situations since clients tend to be persistent, in the sense that they make multiple retransmission attempts before aborting their connection. As it is built into TCP's congestion control, this persistence is very widespread, making it a major stumbling block to providing responsive aggregate traffic controls. This paper focuses on analyzing and modeling the effects of client persistence on the controllability of aggregate traffic. Based on this model, we propose a new drop strategy called persistent dropping to regulate the arrival of SYN packets and achieves three important goals: 1) it allows routers and end-servers to quickly converge to their control targets without sacrificing fairness; 2) it minimizes the portion of client delay that is attributed to the applied controls; and 3) it is both easily implementable and computationally tractable. Using a real implementation of this controller in the Linux kernel, we demonstrate its efficacy, up to 60% delay reduction for drop probabilities less than 0.5.
Numerical analysis of DAEs from coupled circuit and semiconductor simulation
Authors: Monica Selva Soto, Caren Tischendorf
Venue: Applied Numerical Mathematics (2005)

In this work we are interested in the numerical solution of a coupled model of differential algebraic equations (DAEs) and partial differential equations (PDEs). The DAEs describe the behavior of an electrical circuit that contains semiconductor devices and the partial differential equations constitute drift-diffusion equations modelling the semiconductor devices in the circuit.After space discretization using a finite element method, the coupled system results in a differential-algebraic system with a properly stated leading term. We investigate the structure and the properties of this DAE system. In particular, we develop structural criteria for the DAE index. This is of basic interest since DAE properties like stability, existence and uniqueness of solutions depend strongly on its index.
Structure of an extensible augmented reality framework for visualization of simulated construction processes
Authors: Amir H. Behzadan, Hiam M. Khoury, Vineet R. Kamat
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The presented work describes the recent research being conducted by the authors in the field of visualization of simulated construction processes. The underlying uncertainty involved in almost all construction operations makes it necessary to study and analyze the behavior of the acting resources in more detail and under different scenarios in order to come up with the most efficient method to perform a set of tasks and obtain the best possible result. Simulation and visualization of planned construction processes are powerful tools to achieve this objective. This paper focuses on the application of Augmented Reality (AR) for visualizing simulated construction processes in both outdoor and indoor environments and compares it to methods of visualizing modeled processes in pure Virtual Reality (VR). An AR framework and extensible class library are also introduced which can be used to verify and validate the results of simulation models and can be further applied to develop new AR systems.
A case study of the development and use of a mana-based federation for studying U.S. border operations
Authors: Emmet R. Beeker,  III, Ernest H. Page
Venue: Proceedings of the 38th conference on Winter simulation (2006)

A federation approach is used to expand the geographic extent of MANA (Map Aware Non-uniform Automata), a cellular-automaton based agent simulation, in order to support a study of investment strategies for border protection along a portion of the southern U.S. border. The federation is implemented using the Department of Defense (DoD) High Level Architecture (HLA). Federation performance is optimized using HLA Data Distribution Management (DDM) services and through a bypass of the normal HLA mechanisms for ownership transfer. Analysis of the running federation indicates that overhead due to federation processing is minimal - less than 6% of the total federation runtime (94% of the runtime is due to processing in the MANA simulations).
Simulating the operational control of free ranging AGVs
Authors: Mark B. Duinkerken, Tiemen ter Hoeven, Gabriel Lodewijks
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Most transport systems using automated guided vehicles (AGVs) are centrally controlled and use fixed, pre-defined routes. Incidents cannot be handled as part of the common routine. Instead of using fixed path layouts, new trajectory planners for AGVs are developed that utilize the complete available space. To accommodate the increased flexibility, new operational controllers must be able to adapt to small deviations and incidents. In this paper an operational controller is presented that aims to satisfy two conflicting goals. First, the controller directs an AGV along a preplanned trajectory with high accuracy. Second, the controller will avoid conflicts with static and dynamic obstacles. These conflicts are caused by small deviations between planned and realized paths, as well as by incidents like equipment failure. A simulation model is built to study the performance of this controller. The quality is compared to a PI-controller without collision avoidance characteristics.
Electronic Stamp Model Research
Authors: Zhang Cheng-wei, Zhang Wen-bo, Yang Zi-guo
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

This paper presents an electronic stamp model based on anti-spam technologies. The model is composed of spam identifying model and mail receive-filtering model. It takes the mail transmission’s establishment as a premise, and applies resource identification technology into it. This model realized the goal of hindering spam from the time of sending, cutting off the spam spreading way, and raising the anti spam efficiency.
Highly compact interconnect test patterns for crosstalk and static faults
Authors: Jaehoon Song, Juhee Han, Hyunbean Yi, Taejin Jung, Sungju Park
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

The effect of crosstalk-induced errors becomes more significant hi high-performance circuits and systems. In this paper, compact crosstalk test patterns are introduced for a system-on-a-chip and board level interconnects considering physically effective aggressors. By being able to target multiple victim lines, 6n, where n is the number of nets patterns are drastically reduced to a constant number 6D, where D indicates the effective distance among interconnect nets. The test quality for static and crosstalk faults are completely preserved with 6D patterns.
A simplified expression for the probability of error for binary multichannel communications
Authors: Cillian O'Driscoll, Colin C. Murphy
Venue: IEEE Transactions on Communications (2009)

We present a simplified expression for the probability of error, Pe, for binary multichannel communications. The original expression was derived by Proakis in 1968. More recently, Simon and Alouini presented an expression involving the generalised Marcum Q-function. In this letter we present a simplified form of Simon and Alouini's expression. The application of this result to the calculation of performance metrics for communications over fading channels is also discussed.
A new performance evaluation metric for sub-optimal iterative decoders
Authors: Ashwani Singh, Ali Al-Ghouwayel, Guido Masera, Emmanuel Boutillon
Venue: IEEE Communications Letters (2009)

In this letter, a new metric for fast and efficient performance comparison of iterative sub-optimal decoding algorithms is proposed. It is based on the estimation of a metric between the A-Posteriori Probability (APP) decoded symbol of optimal and suboptimal decoding algorithms. We apply the notion of entropy to evaluate this function. The metric is tested on data sets from the different sub optimal algorithms for the duo binary turbo codes used in WiMax(802.16e) application and a (251,502) Galois Field (26) low density parity check (LDPC) code. Experimental results show that the values of the proposed metric correlate well with the BER performance of the suboptimal implementation of the iterative decoding algorithm.