ppxscal/embedding_network huggingface dataset:
Exposure maps: removing reliance on attribution during scan detection
Authors: David Whyte, P. C. van Oorschot, Evangelos Kranakis
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

Current scanning detection algorithms are based on an underlying assumption that scanning activity can be attributed to a meaningful specific source (i.e. the root cause or scan controller). Sophisticated scanning activity including the use of botnets, idle scanning, and throwaway systems violates this assumption. We propose a class of scanning detection algorithms that focus on what is being scanned for instead of who is performing the scanning. We pursue this idea, introduce the concept of exposuremaps, and report on a preliminary proof-of-concept that allows one to: (1) estimate the information or exposures revealed to an adversary as a result of scanning activity; (2) detect sophisticated or targeted scanning activity with a footprint as low as a single packet or event; and (3) discover real-time changes in network exposures that may be indicative of a successful attack.
Scalable Mobile Multimedia Group Conferencing Based on SIP Initiated SSM
Authors: Thomas C. Schmidt, Matthias Wahlisch, Hans L. Cycon, Mark Palkow
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Multimedia group communication emerges to focal interest at mobile devices, enriching voice or video conferencing and complex collaborative environments. The Internet uniquely provides the benefit of scalable, dynamic group communication services, vitally aiding commonly limited mobile terminals. The traditional In- ternet approach of Any Source Multicast (ASM) rout- ing, though, remains hesitant to spread beyond limited, controlled environments. It is widely believed that sim- pler and more selective mechanisms for group distri- bution in Source Specific Multicast (SSM) will globally disseminate to many users of multicast infrastructure and services. Mobility management for the recent SSM standard is under debate -- SSM group session initia- tion up until now remains unsupported by the Session Initiation Protocol (SIP). In this paper we present straightforward extensions to SIP for negotiating SSM sessions. SIP protocol spec- ifications and semantic are compatibly extended without adding new SIP methods. We will introduce a multime- dia communication software with distributed architec- ture as implementation reference. Furthermore mobil- ity management of the underlying routing layer is dis- cussed and evaluated on grounds of real-world Internet topologies.
Studying network protocol offload with emulation: approach and preliminary results
Authors: R. Westrelin, N. Fugier, E. Nordmark, K. Kunze, E. Lemoine
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

To take full advantage of high-speed networks while freeing CPU cycles for application processing, the industry is proposing new techniques relying on an extended role for network interface cards such as TCP offload engine and remote direct memory access. The paper presents an experimental study aimed at collecting the performance data needed to assess these techniques. This work is based on the emulation of an advanced network interface card plugged on the I/O bus. In the experimental setting, a processor of a partitioned SMP machine is dedicated to network processing. Achieving a faithful emulation of a network interface card is one of the main concerns and it is guiding the design of the offload engine software. This setting has the advantage of being flexible so that many different offload scenarios can be evaluated. Preliminary throughput results of an emulated TCP offload engine demonstrate a large benefit. The emulated TCP offload engine indeed yields 600% to 900% improvement while still relying on memory copies at the kernel boundary.
Configuration debugging as search: finding the needle in the haystack
Authors: Andrew Whitaker, Richard S. Cox, Steven D. Gribble
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

This work addresses the problem of diagnosing configuration errors that cause a system to function incorrectly. For example, a change to the local firewall policy could cause a network-based application to malfunction. Our approach is based on searching across time for the instant the system transitioned into a failed state. Based on this information, a troubleshooter or administrator can deduce the cause of failure by comparing system state before and after the failure. We present the Chronus tool, which automates the task of searching for a failure-inducing state change. Chronus takes as input a user-provided software probe, which differentiates between working and nonworking states. Chronus performs "time travel" by booting a virtual machine off the system's disk state as it existed at some point in the past. By using binary search, Chronus can find the fault point with effort that grows logarithmically with log size. We demonstrate that Chronus can diagnose a range of common configuration errors for both client-side and server-side applications, and that the performance overhead of the tool is not prohibitive.
A Policy-Driven Trading Framework for Market-Based Spectrum Assignment
Authors: Patroklos Argyroudis, Tim Forde, Linda Doyle, Donal O'Mahony
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We present a policy-driven trading framework for market-based spectrum assignment. Our work allows spectrum consumers to get exclusive access rights through payment of a fee, for a given period of time, and for a given frequency band and location. The key motivation behind our proposal stems from the increased complexity of new spectrum management strategies and the need for extracting the maximum benefit from the available spectrum. In this paper we demonstrate that a policy-driven solution is applicable for the management of spectrum markets, and we present a decentralised and lightweight framework for implementing such markets in networked environments.
A well-conditioned quadratic program for unique design of two-dimensional weighted Chebyshev FIR filters
Authors: S. Nordebo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The weighted Chebyshev design of two-dimensional FIR filters is in general not unique since the Haar condition is not generally satisfied. However, for a design based on the discrete frequency domain, the Haar condition might be fulfilled. The question of uniqueness is, however, rather extensive to investigate. It is therefore desirable to define some simple additional constraints to the Chebyshev design in order to obtain a unique solution. The weighted Chebyshev solution of minimum Euclidean filter weight norm is always unique, and represents a sensible additional constraint since it implies minimum white noise amplification. It is shown that this unique Chebyshev solution can always be obtained by using an efficient quadratic programming formulation with a strictly convex objective function and linear constraints. An example where a conventional Chebyshev solution is non-unique is discussed.
Optimizing instruction-set extensible processors under data bandwidth constraints
Authors: Kubilay Atasu, Robert G. Dimond, Oskar Mencer, Wayne Luk, Can Özturan, Günhan Dündar
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present a methodology for generating optimized architectures for data bandwidth constrained extensible processors. We describe a scalable Integer Linear Programming (ILP) formulation, that extracts the most profitable set of instruction-set extensions given the available data bandwidth and transfer latency. Unlike previous approaches, we differentiate between number of inputs and outputs for instruction-set extensions and the number of register file ports. This differentiation makes our approach applicable to architectures that include architecturally visible state registers and dedicated data transfer channels. We support a comprehensive design space exploration to characterize the area/performance trade-offs for various applications. We evaluate our approach using actual ASIC implementations to demonstrate that our automatically customized processors meet timing within the target silicon area. For an embedded processor with only two register read ports and one register write port, we obtain up to 4.3 &times; speed-up with extensions incurring only a 35% area overhead.
High Availability for Network Management Applications
Authors: S. Prabhu, R. Venkat
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

While hardware failures may cripple a network, network service providers are increasingly finding that software or its configuration is greater source of risk."In the 21st century, it won't matter who has the best 1 hardware, but the best software. That's how the defects per rnillionjigures are going to come down."-AT&T's Chief Technology Oflcer, as quoted in Telephony MagazineIn today's world of ubiquitous computing there is an everlasting need for interconnecting devices. The continuously growing internet has accelerated this need at a pace like never before. This has resulted in a lot of investment in networking infrastructure such as routers, switches, hubs and the like. This ever-growing infrastnccture needs to be manageable in a cost effective manner so as to derive the maximum benefir out of it. For the sake of simplicity we will stick to the traditional definition of management to mean FCAPS. The aim of this paper is to highlight some of the technical challenges in achievrng High Availability (HA) at the application layer 4 4 - L7). While the entire paper is about HA for network management applications the principles and guidelines apply equally well for other enterprise applications also. Also as there is a signficant industry momentum in the direction of adopting Java and its related technologies as the plagorm of choice for building manageability solutions, the scope of this paper is restncted to exploring availability considerations for such applications.
Mobile Healthcare: Opportunities and Challenges
Authors: Yao Y. Shieh, Fong Y. Tsai, Arash Anavim, Michael D. Wang, Chao-Ming Charles Lin
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The healthcare crisis in the US has caught national attention because of its high percentage of GDP spending. Healthcare reform has become a heated topic of discussion. Its key lies in quality of care, the foundation of which is information. Mobilehealthcare has the potential to greatly improve the quality of healthcare. It encompasses the realm of healthcare activities empowered by the whole spectrum of computer, communication and information technologies. The challenges of the current healthcare landscape and potential solutions offered by m-healthcare are presented in four distinct yet related domains: service, technology, finance and organization. This paper addresses healthcare as a whole, with special remarks directed exclusively to the radiology subspecialty due to its unique requirements of large bandwidth for transferring image data and exacting screen size for image display.
Lung nodule diagnosis using 3D template matching
Authors: Onur Osman, Serhat Ozekes, Osman N. Ucan
Venue: Computers in Biology and Medicine (2007)

In this paper, to utilize the third dimension of Computed Tomography, regions of interest (ROI) slices were combined to form 3D ROI image and a 3D template was determined to find the structures with similar properties of nodules. Convolution of 3D ROI image with the proposed template strengthens the shapes similar to the template and weakens the other ones. False-positive (FP) per nodule and per slice versus diagnosis sensitivity were obtained. The Computer Aided Diagnosis system achieved 100% sensitivity with 0.83FP per nodule and 0.46FP per slice, when the nodule thickness was greater than or equal to 5.625mm.
Using multiple methods to evaluate a freshmen design course
Authors: C. J. Atman
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

ENGR 100 is a hands-on, team-based freshmen design course in which students engage in design activities, learn about the field of engineering, and develop an understanding of what kinds of skills and knowledge are necessary to pursue a career in engineering. The learning that results from these kinds of authentic tasks is not easy to assess with traditional tests or a single assessment method. To evaluate the effectiveness of the teaching methods and course content, we created an evaluation plan that utilized triangulation of data through multiple methods. Triangulation is not just a tactic to establish validity and credibility of findings, it is a robust mode of inquiry that provides opportunities to view complementary and contrasting data. The authors present an in-depth description of our evaluation plan. This includes a description of the planning and administration of the assessment tasks, the selection of assessment methods and development of instruments, and how the plan triangulated data across assessment methodologies.
Blind equalization of multiple FIR channels using filter banks with H/sub /spl infin// optimization
Authors: C. W. Kok
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper develops a blind equalization method using the zero-forcing algorithm for multiple FIR channels. The FIR channel can be identified from the second order statistics of the received signal. A zero-forcing equalizer can be constructed from the estimated channel response. To enhance the robustness of the equalizer, the zero-forcing equalizer is formulated to minimize the H/sub /spl infin// norm of the reconstruction error due to additive white noise.
An Inspector/Executor Based Strategy to Efficiently Parallelize N-Body Simulation Programs on Shared Memory Systems
Authors: Juan A. Lorenzo, Julio L. Albin, Tomas F. Pena, Francisco F. Rivera, David E. Singh
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Reordering of data is becoming more and more significant in order to achieve a higher performance in memory data access and, particularly, in program runtime. This fact becomes specially important in parallel applications that are executed in shared memory systems. This work presents a new parallelizing, run time strategy for irregular structures associated to N-Body problem simulation algorithms. Such strategy, so-called STPCLS (Step Classification), is based on the inspector-executor paradigm. It has been tested in a shared memory system using a significant set of irregular loops. The outcomes show that the efficiency of our solution is high, and the benefits overcome the overheads imposed by our algorithm.
Reliable, scalable and interoperable internet telephony
Authors: Henning Schulzrinne
Venue:  (2006)

The public switched telephone network (PSTN) provides ubiquitous availability and very high scalability of more than a million busy hour call attempts per switch. If large carriers are to adopt Internet telephony, then Internet telephony servers should offer at least similar quantifiable guarantees for scalability and reliability using metrics such as call setup latency, server call handling capacity, busy hour call arrivals, mean-time between failures and mean-time to recover. This thesis presents a reliable, scalable and interoperable Internet telephony architecture for user registration, call routing, conferencing and unified messaging using commodity hardware. The results extend beyond Internet telephony to encompass multimedia communication in general. The architecture presented in this thesis deals with two aspects: at least PSTN-grade reliability and scalability of the Internet telephony servers, and interoperable Internet telephony services such as conferencing and voice mail using existing protocols. We describe the architecture and implementation of our Session Initiation Protocol (SIP)-based enterprise Internet telephony architecture known as Columbia InterNet Extensible Multimedia Architecture (CINEMA). It consists of a SIP registration and proxy server, a multi-party conferencing server, a gateway for interworking SIP with ITU's H.323, an interactive voice response system and a multimedia mail server. CINEMA provides a distributed interoperable architecture for collaboration using synchronous communications like multimedia conferencing, instant messaging, shared web-browsing, and asynchronous communications like discussion forum, shared files, voice and video mails. It allows seamless integration with various communication means like telephone, IP phone, web and electronic mail. We present two techniques for providing scalability and reliability in SIP: server redundancy and a novel peer-to-peer architecture. For the former, we use DNS-based load sharing among multiple distributed servers that use backend SQL databases to maintain user records. Our two-stage architecture scales linearly with the number of servers. For the latter, we propose a peer-to-peer Internet telephony architecture that supports basic user registration and call setup as well as advanced services such as offline message delivery, voice mail and multi-party conferencing using SIP. It interworks with server-based SIP infrastructures.
An Era of Change-Tolerant Systems
Authors: Shawn Bohner
Venue: Computer (2007)

Technologies are available to help develop and evolve systems that respond more quickly and efficiently to a changing environment.
Secure data export and auditing using data diodes
Authors: Douglas W. Jones, Tom C. Bowersox
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

Data diodes, that is, devices which permit only one-way communication, without even a reverse channel for acknowledgment, have many potential uses within voting systems. A practical design for a data diode is presented that is simpler and more nearly self-evident than previously published designs. Communication protocols appropriate for use in the voting context are described. Throughout, we emphasize designs that permit a relatively naïve observer to determine that it meets key security constraints.
A Look at Tokyo Youth at Leisure: Towards the Design of New Media to Support Leisure Outings
Authors: Diane J. Schiano, Ame Elliott, Victoria Bellotti
Venue: Computer Supported Cooperative Work (2007)

In this paper we present a set of studies designed to explore Japanese young people's practices around leisure outings (how they are discovered, planned, coordinated, and conducted), and the resources they use to support these practices. Tokyo youth have a wealth of leisure opportunities and tools to choose from; they are technologically savvy, and are in the vanguard of those for whom the new mobile Internet technologies are available. We characterize typical leisure outings described by our study participants, how they are structured, and the tools used to support them. We found that discovery of leisure options tends to occur serendipitously, often through personal recommendations from friends and family. For leisure research and planning, the Internet is the tool of choice, but accessed via PC, not the mobile phone (or "keitai"), which is primarily used to communicate and coordinate, not to search for information. These and related findings suggest some emerging issues and opportunities for the design of future leisure support technologies.
Blind identification of a linear-quadratic mixture of independent components based on joint diagonalization procedure
Authors: K. Abed-Meraim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we address the problem of the blind identification of linear-quadratic instantaneous mixture of statistically independent random variables. This problem consists in the identification of an unknown linear-quadratic transmission channel excited by temporally correlated and mutually independent source signals, using only statistical information on the observations received by an array of sensors. Herein we propose a new technique of blind identification of this non-linear mixture based on joint diagonalization of a set of data correlation matrices. Several numerical simulations are presented to demonstrate the effectiveness of the method in the case of a quadratic phase-coupling mixture.
Differentiated Data Persistence with Priority Random Linear Codes
Authors: Yunfeng Lin, Baochun Li, Ben Liang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable. As such, maintaining the persistence of periodically measured data in a scalable fashion has become a critical challenge in such systems, without the use of centralized servers. To better cope with node dynamics and failures, we propose priority random linear codes, as well as their affiliated pre-distribution protocols, to maintain measurement data in different priorities, such that critical data have a higher opportunity to survive node failures than data of less importance. A salient feature of priority random linear codes is the ability to partially recover more important subsets of the original data with higher priorities, when it is not feasible to recover all of them due to node dynamics. We present extensive analytical and experimental results to show the effectiveness of priority random linear codes.
The Future of Work: What Does Online Community Have to Do with It?
Authors: Dejin Zhao, Mary Beth Rosson, Sandeep Purao
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Amidst constant innovation in information and communication technologies, a new pattern of work is emerging. Hierarchical authority structures are giving way to greater decision-making latitude for individuals and more flexible definitions of job activities [1]. This new style of work presents a challenge to existing organizational forms. In this paper we investigate this concern by contrasting traditional organizational forms against groups that operate as online communities that are characterized by personal motivation and the satisfaction of making one's own decisions. We analyze the work of online communities by discussing three familiar examples. The analysis is guided by four complementary perspectives: economics, organizational structure, management, and knowledge management. We summarize the high-level results of our analysis as three design implications that might be useful for understanding the phenomena and guide the design of online community infrastructure for work activities.