ppxscal/embedding_network huggingface dataset:
FFPF: fairly fast packet filters
Authors: Herbert Bos, Willem de Bruijn, Mihai Cristea, Trung Nguyen, Georgios Portokalidis
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and exibility. Multiple applications that need to access overlapping sets of packets may share their packet buffers, thus avoiding a packet copy to each individual application that needs it. In addition, context switching and copies across the kernel boundary are minimised by handling most processing in the kernel or on the network card and by memory mapping all buffers to userspace, respectively. For these reasons, FFPF has superior performance compared to existing approaches such as BSD packet lters, and especially shines when multiple monitoring applications execute simultaneously. Flexibility is achieved by allowing expressions written in different languages to be connected to form complex processing graphs (not unlike UNIX processes can be connected to create complex behaviour using pipes). Moreover, FFPF explicitly supports extensibility by allowing new functionality to be loaded at runtime. By also implementing the popular pcap packet capture library on FFPF, we have ensured backward compatibility with many existing tools, while at the same time giving the applications a significant performance boost.
End-to-end WAN service availability
Authors: Bharat Chandra, Mike Dahlin, Lei Gao, Amol Nayate
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

This paper seeks to understand how network failures affect the availability of service delivery across wide area networks and to evaluate classes of techniques for improving end-to-end service availability. Using several large-scale connectivity traces, we develop a model of failures that includes key parameters such as failure location and failure duration. We then use trace-based simulation to evaluate several classes of techniques for coping with network failures. We find that caching alone is seldom effective at insulating services from failures but that the combination of mobile extension code and prefetching can improve failure rates by as much as an order of magnitude for classes of service whose semantics support disconnected operation. We find that routing-based techniques may provide significant improvements, but that the improvements of many individual techniques are limited because they do not address all significant categories of network failures. By combining the techniques are examine, some systems may be able to improve availability by as much as one or two orders of magnitude.
Integrating Algorithm Visualization Systems
Authors: Ville Karavirta
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Helping students to understand difficult pieces of code remains a challenge in Computer Science education. By providing a view of the code on a higher level of abstraction, Algorithm Visualization (AV) aims at making the code more understandable. However, teachers consider producing AVs with the existing tools to require too much time and effort to be worthwhile. One way to lower this effort is to allow data exchange between AV systems. This paper continues the work of the ITiCSE Working Group (WG) ''Development of XML-based Tools to Support User Interaction with Algorithm Visualization''. The WG aimed at specifying a common language for AV systems. We analyzed a number of existing AV languages and came up with requirements for a common language. Based on these requirements and the previous work by the WG, this paper defines a new AV language. Furthermore, this study describes a set of tools that allow data exchange between some of the existing AV systems. This data exchange gives teachers more choices and ready-made examples to be used in teaching.
Developing online educational materials for "computer applications" undergraduate courses
Authors: M. Uskova
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Midstate College and Bradley University (both in Peoria, IL, USA) are involved into two National Science Foundation (NSF) projects on Advanced Technological Education (project # DUE-9950029) and Online Undergraduate Education in Information Technology (IT) Area (project # DUE-0196015). The overall goal of both projects is accelerating the rate of production of highly skilled IT technicians and technologists. The methods to be employed to reach this goal include but are not limited to: (1) active re-education of teachers of high schools and faculty of 2-year/community colleges in IT area through multiple faculty development workshops on: (a) information systems and services; (b) networking systems; (c) programming and software development; and (d) interactive multimedia systems; and (2) design, development and active use of innovative online educational materials (OEM) that can be delivered into the workplace and home at any time. Web-based teaching and learning technologies will be based on "active learning" paradigm of education and Web-based instructional tool of the 3rd generation-the INTERLABS Web-lecturing tool.
A novel adaptive IIR filter for active noise control
Authors: D. H. Crawford
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper introduces a novel adaptive IIR filter structure and its corresponding LMS weight update equations. This "full-feedback" structure has performance advantages over the conventional adaptive IIR filter structure in certain situations. A full-feedback filtered-u adaptive IIR algorithm is also presented, which may be applied to active noise control in ducts.
Smart batteries for automotive applications
Authors: Henry A. Catherino, David C. Batson
Venue: Integrated Computer-Aided Engineering (2002)

The US Army has been pursuing the development of a Smart Battery development as part of its on-going efforts for reducing operation and maintenance costs of the Army's ground vehicles. As a consequence of this effort, it became evident that the smart battery has a much broader significance well beyond that of an operations and maintenance cost reduction exercise. In effect, the traditional concept of a battery as a simple energy storage unit yielded to that of a critical component in a power management subsystem. A smart battery is a standard battery having an embedded microcontroller that monitors key sensor inputs, processes and stores the derived information and reports the results on a shared data bus. In that arrangement, the smart battery serves the function of a status-reporting load-leveling component of the over-all subsystem. As such, the smart battery becomes an essential contributor to a digital nervous system in vehicle systems. The smart battery is creating a new way of defining what a battery is. It is evident that the use of smart batteries has a direct bearing on vehicle readiness and enables system-wide planning, organization and control of the power and energy resources.
Challenges and Lessons Learned in Teaching Software Engineering and Programming to Hearing-Impaired Students
Authors: Damiano Distante, Shihong Huang
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Teaching academic courses to students with disabilities is a challenging task, particularly for academics who are presented with the teaching requirements and needs that this implies, for the first time. Courses in the field of engineering and computer science, by requiring a lot of handson practices and teamwork, further exacerbate the situation as how to provide an effective learning experience for these disabled students. This situation requires a higher-level commitment than normal, from both the teachers and students. This paper presents the experience gained from teaching courses that involved hearing-impaired students of an undergraduate software engineering and a programming language course in two different universities. Some of the challenges faced by both instructors and the students are identified and some possible solutions are described.
Two-dimensional multi-resolution analysis of speech signals and its application to speech recognition
Authors: C. P. Chan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes a novel approach of using multi-resolution analysis (MRA) for automatic speech recognition. Two-dimensional MRA is applied to the short-time log spectrum of speech signal to extract the slowly varying spectral envelope that contains the most important articulatory and phonetic information. After passing through a standard cepstral analysis process, the MRA features are used for speech recognition in the same way as conventional short-time features like MFCCs, PLPs, etc. Preliminary experiments on both clean connected speech and noisy telephone conversation speech show that the use of MRA cepstra results in a significant reduction in insertion error when compared with MFCCs.
The java hotspotTM server compiler
Authors: Michael Paleczny, Christopher Vick, Cliff Click
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

The Java HotSpotTM Server Compiler achieves improved asymptotic performance through a combination of object-oriented and classical-compiler optimizations. Aggressive inlining using class-hierarchy analysis reduces function call overhead and provides opportunities for many compiler optimizations.
Critical success factors for a customer relationship management strategy
Authors: Luis E. Mendoza, Alejandro Marius, María Pérez, Anna C. Grimán
Venue: Information and Software Technology (2007)

Most organizations have perceived the customer relationship management (CRM) concept as a technological solution for problems in individual areas, accompanied by a great deal of uncoordinated initiatives. Nevertheless, CRM must be conceived as a strategy, due to its human, technological, and processes implications, at the time an organization decides to implement it. On this basis, the main goal stated in this research is to propose, justify, and validate a model based on critical success factors (CSFs) that will constitute a guide for companies in the implementation and diagnosis of a CRM strategy. The model is conformed by a set of 13 CSFs with their 55 corresponding metrics, which will serve as a guide for organizations wishing to apply this type of strategy. These factors cover the three key aspects of every CRM strategy (human factor, processes, and technology); giving a global focus and propitiating success in the implementation of a CRM strategy. These CSFs - and their metrics - were evaluated by a group of internationally experts allowing determining guidelines for a CRM implementation as well as the probable causes of the deficiencies in past projects.
The GNOME future
Authors: Miguel de Icaza
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Miguel will be talking about the new technologies being developed as part of the GNOME system and where the system is headed. The Bonobo component system, the GNOME printing architecture, the visual tools for creating user interfaces and the internationalization efforts.
Analysis of Numerically Induced Oscillations in 2D Finite-Element Shallow-Water Models Part I: Inertia-Gravity Waves
Authors: Daniel Y. Le Roux, Virgile Rostand, Benoit Pouliot
Venue: SIAM Journal on Scientific Computing (2007)

The numerical approximation of shallow-water models is a delicate problem. For most of the discretization schemes, the coupling between the momentum and the continuity equations usually leads to anomalous dispersion in the representation of fast waves. A dispersion relation analysis is employed here to ascertain the presence and determine the form of spurious modes as well as the dispersive nature of the finite-element Galerkin mixed formulation of the two-dimensional linearized shallow-water equations. Nine popular finite-element pairs are considered using a variety of mixed interpolation schemes. For each pair the frequency or dispersion relation is obtained and analyzed, and the dispersion properties are compared analytically and graphically with the continuous case. It is shown that certain choices of mixed interpolation schemes may lead to significant phase and group velocity errors and spurious solutions in the calculation of fast waves. The $P^{NC}_{1} - P^{}_{1}$ and RT0 pairs are identified as a promising compromise, provided the grid resolution is high relative to the Rossby radius of deformation for the RT0 element. The numerical solutions of two test problems to simulate fast waves are in good agreement with the analytical results.
Domain engineering for mission critical environments
Authors: Chris Rouland
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

Windows NT has grown quickly as an integrated solution for file and print services in Microsoft environments. Engineering NT solutions beyond the workgroup to integrate into heterogeneous environments is a task that in the past has required a large amount of trial and error. This paper addresses some real world issues that affect global NT deployments. The structure of the NT domains and their relationships is built upon organizational and performance requirements. The logical domain architecture affects the NT deployment from day one. Name services under NT are critical to day to day operations and must be engineered to incorporate fault tolerance while avoiding shortcomings in product. Authentication under NT must be molded to fit security and organizational requirements, while keeping cross platform and performance issues in mind.
12th Annual IEEE Symposium on High Performance Interconnects [2004] - Cover
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The following topics are dealt with: high-performance interconnects; buffers; network innovation; parallel computers; network processor security; system level interconnects; PCI Express; distributed shared memory architecture; packet classification and lookup; routers and switches; high-speed optical interconnects; wireless enterprise backbone network architecture; global grid computing; high-bandwidth low-latency communication; Internet infrastructure security. 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
Fast and recursive algorithms for magnitude retrieval from DTFT phase at irregular frequencies
Authors: A. E. Yagle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We derive two new algorithms for reconstructing a discrete-time 1-D signal from the phase of its discrete-time Fourier transform (DTFT) at irregular frequencies. Previous algorithms for this problem have either required the computation of a matrix nullspace, requiring O(N/sup 3/) computations, or have been iterative in nature; for the latter, the irregularity of the frequency samples precludes use of the fast Fourier transform. Our first algorithm requires only O(N/sup 2/) computations (O(N log/sup 3/ N) asymptotically). In the special case of equally-spaced frequency samples, it is related to a previous algorithm. The second algorithm is recursive-at each recursion a meaningful magnitude retrieval problem is solved. This is useful for updating a solution; it also allows checking of the result at each recursion, avoiding any errors due to computational roundoff error and ill-conditioning of the problem.
Canonic look ahead: critical cycle relaxed IIR filtering with minimum multiplicative complexity
Authors: J. Rubio
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In this paper we present an architecture to relax the critical cycle associated with the feedback operations in IIR filtering when high sampling frequencies exceed the computation bandwidth of digital arithmetics. Its complexity, evaluated in terms of multiplications per output sample per pole, equals that of the canonic IIR recursion and provides considerable savings in comparison to existing techniques such as clustered and scattered look ahead. The procedure is shown to yield unconditionally stable implementations.
Diagnosis of Bridging Defects Based on Current Signatures at Low Power Supply Voltages
Authors: D. Arumi, R. Rodriguez-Montanes, J. Figueras, S. Eichenberger, C. Hora, B. Kruseman, M. Lousberg, A. K. Majhi
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Improvement of diagnosis methodologies is a key factor for fast failure analysis and yield improvement. As bridging defects are a common defect type in CMOS circuits, diagnosing this class of defect becomes relevant for present and future technologies. Bridging defects cause two additional current components, the bridge and the downstream current. This work presents the effect of the downstream current on current signatures and its impact on the diagnosis of such defects. We demonstrate that the impact of downstream current is minimized at low power supply (VDD) values. Therefore, current measurements at low power supply voltages are proposed to enhance bridge diagnosis. Experimental evidence of this behaviour is presented for real devices. Furthermore, current signatures measured at VVLV are used for the diagnosis of fifteen failing 0.18\mu m technology devices, which are demonstrated to contain a bridging defect.
An automatic acquisition method of statistic finite-state automaton for sentences
Authors: M. Suzuki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Statistic language models obtained from a large number of training samples play an important role in speech recognition. In order to obtain higher recognition performance, we should introduce long distance correlations between words. However, traditional statistic language models such as word n-grams and ergodic HMMs are insufficient for expressing long distance correlations between words. We propose an acquisition method for a language model based on HMnet taking into consideration long distance correlations and word location.
Efficient similarity search by summarization in large video database
Authors: Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these video data, an important issue is to effectively organize videos by data compacting and indexing. However, practically, many useful distances for video comparison are suitable to human perception, but non-metric. Therefore, traditional high dimensional data structures can not be utilized to index videos directly when non-metric measures are applied. In this paper, we propose a compact video representation based on global summarization, by which each video in database is mapped into a digital string(a series of cluster id). Consequently, the inter-frame similarity measure is transformed into inter-cluster comparison. Then, we propose an efficient index strategy based on sequence decomposition and reconstruction, by which the spatial index methods can be utilized with non-metric measures for video similarity search. We employ an optimal B+-tree with an inverted list attached, for quickly identifying similar clusters and locating potentially similar videos respectively. Finally, a clustering based query summarization technique is proposed, which can greatly reduce the IO and CPU cost in the query processing by batch mapping.
Introducing Semantic Technologies in Web Services-Based Application Discovery within Grid Environments
Authors: Serena Pastore
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Service discovery is an essential critical element in large scale, open distributed systems. Its implementation is a key functionality of the distributed underlying infrastructures of both web services frameworks and grid systems where searching and finding services are one of the main tasks. In the framework of sharing grid software resources, different discovery mechanisms have been evaluated. Grid solutions have been considered, together with industry-initiated methods, but the main hurdle for all methods is a lack of automation. In dealing with such WSDL-based services, the paper outlines the different methods in terms of the information model and searching tools. Moreover, to enable automation, it proposes an approach to introducing semantic technologies on the discovery process. Analyzing a web service process and its actors, semantics could be added to the interactions between provider and client or directly to the broker. The former solution moves towards enriching web service description by means of semantic languages. The second requires the modification of the broker responsible for the matching user requirements with the service capabilities offered by introducing new modules.
Advantages of global discrete recombination in (/spl mu///spl mu/,/spl lambda/,)-evolution strategies
Authors: Y. Matsumura, K. Ohkura, K. Ueda
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper experimentally investigates the effect of global recombination operators on multirecombination Evolution Strategies ((/spl mu///spl rho/,/spl lambda/)-ES). For ES, each individual has a pair of real-valued vectors, i.e., object parameters and strategy parameters. We adopt two popular global recombination operators, namely Global Intermediate Recombination (GIR) and Global Discrete Recombination (GDR), and apply GIR or GDR to both object parameters and strategy parameters. Computer simulations are conducted using three types of (/spl mu///spl mu/,/spl lambda/)-ES, which are Classical-ES (CES), Fast-ES (FES) and Robust-ES (RES). We show the advantages of GIR or GDR in CES, FES and RES. Especially, GDR on a pair of an object parameters and a strategy parameters improves the performance of all ESs in our experiments.
Project scheduling with multi-purpose resources: models, algorithms and applications
Authors: Keith Womer
Venue:  (2005)

This research encompasses Project Scheduling with Multi-Purpose Resources as constraints (PSMPR), where a multi-purpose resource is defined as a resource unit that is versatile enough to perform different types of operations. Complexity of the model and its relationship with other well-known scheduling models are analyzed. We also investigate variants and extensions of the standard PSMPR model to capture more general and complex problem settings. Two hybrid decomposition algorithms, combining the complementary strengths of both the Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP) techniques, are developed to solve the standard PSMPR. The U.S. Navy's DD(X) manpower scheduling problem is studied as an application of the proposed model.