ppxscal/embedding_network huggingface dataset:
Comparing Classifier Combining Techniques for Mobile-Masquerader Detection
Authors: Oleksiy Mazhelis, Seppo Puuronen
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Contemporary mobile terminals (smartphones, PDAs, communicators) are often used to store or access sensitive private or corporate information, and an unauthorized use of these terminals may result in an abuse of this information. In order to resist such unauthorized use, along with traditional authentication mechanisms, the means of masquerader detection can be employed. In this paper, the problem of mobile-masquerader detection is approached as a classification problem. The detection is based on the monitoring of the current user behavior and environment, and matching them with the behavior and the environment of the legitimate user. The matching is performed by an ensemble of the so-called one-class classifiers each analyzing a separate set of behavioral or environmental features, and classifying the current values of these features as belonging to the legitimate user or not. Using a combining scheme, the individual classifications of these classifiers are combined so as to improve the final classification accuracy. In the paper, three combining schemes are empirically compared in the context of mobile-masquerader detection; these are the mean of the estimated probabilities (MP), the product combination of probabilities (PP), and the modified mean of the estimated probabilities (modMP) rules. According to the results of experiments, the use of modMP rule is justified in mobile-masquerader detection, since this rule provides the classification accuracy greater than or approximately equal to the accuracy of the other rules. Meanwhile, the obtained results suggest that, for the modMP rule to provide high classification accuracy, the means of the classifier outputs need to be estimated accurately.
Re-configuration of sub-blocks for effective application of time domain tests
Authors: Jens Anders, Shaji Krishnan, Guido Gronthoud
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

AC sensitivities guide most Analogue Automatic Test Pattern Generator (AATPG) while determining the optimal frequencies of a sinusoidal test stimulus. The optimal frequencies thus determined, normally lie in the close vicinity of the operating frequency of the circuit. Although these frequencies are justifiable by the principles of the circuit, these test frequencies do not bring any added value to the ultimate goal of cheap alternatives (low frequency test signal and cheaper measurement equipment) for the analogue and RF tests. In this paper, we propose to re-configure the circuit blocks, in such a way that the operating frequencies of the respective sub-block are shifted to lower testable frequencies. We have validated our proposal on a sub-block of a satellite receiver circuit that resulted in lowering the test frequencies of the corresponding sub-blocks from 12 GHz to 4MHz, while attaining the same level of defect coverage.
On-Chip Voltage Down Converter Based on Moderate Inversion for Low- Power VLSI Chips
Authors: Qianneng Zhou, Fengchang Lai, Yongsheng Wang
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

An on-chip differential-amplifier-based voltage down converter (VDC) is proposed. Employing a reference voltage generator, which operates in moderate inversion region, the architecture of the proposed VDC is simple and can be fabricated by conventional CMOS technology. VDC converts 3.3V to lower voltage so that the internal circuits of VLSI are used. In this paper, 1.8V is used as an experiment vehicle. The output voltage (Vout) of the VDC is stabilized within ±3.8mV for load current varying from 0 to 100mA and within ±0.75% for ±10% variation of external supply voltage. The temperature dependency of Vout is only 0.329mV/0C.
Tracking the role of adversaries in measuring unwanted traffic
Authors: Mark Allman, Paul Barford, Balachander Krishnamurthy, Jia Wang
Venue: Proceedings of the 2nd conference on Steps to Reducing Unwanted Traffic on the Internet - Volume 2 (2006)

Measurements related to security are being carried out on many sites on the Internet at network ingress points, between specific points on the Internet, and across the wide area Internet. The goals range from identifying sources of and possibly filtering unwanted traffic, to characterizing and coming up with new mechanisms for deterring attacks. Most of the measurements do not systematically consider adversarial traffic aimed at their measurement system. We explore the role adversaries can play and present a taxonomy on the potential impact of unwanted traffic on measurement systems. Our goal is to both enhance the robustness of such systems and spur development of tools that can alter the playing field by increasing the cost to adversaries.
Teaching environmental risk assessment to community groups
Authors: A. Velez
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Summary form only given. To facilitate community involvement in environmental management issues, workshops and lectures on human health risk assessment (RA) are designed for community groups. The article describes the development of lectures in risk assessment for community groups at contaminated sites. Methods of teaching and course organization are adapted to deal with the complexity and multidisciplinary nature of the subject and the heterogeneity of the audience.
Wrapping DCE/OSF client/server applications
Authors: Israel Gold, Uri Shani
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

DCE is a comprehensive RPC-based solution for client/server applications across networks of heterogeneous machines. Unfortunately, DCE is hard to learn and use. The fact is, that even simple DCE applications may have a rather complicated structure, requiring a good understanding of the elaborate DCE technology. This paper presents GLUEGEN -- an automatic tool for "wrapping" plain C code to become part of a distributed application. The approach taken separates DCE-specific from DCE-independent elements of the application, via a high-level specification language. This language provides an easy and flexible way to describe the distributed application topology, and frees the programmer from having to get into the gory details of the DCE run-time. Using GLUEGEN, the development of simple DCE applications remains a rather simple task, requiring very little knowledge of DCE, and of the DCE run-time. The tool is particularly useful for splitting existing monolithic programs into clients and servers, with almost no change to the original application code. Complex DCE applications which do not neatly fit splitting are supported as well.
Characterizing UDP Consecutive Packet Losses in Multicast Networks
Authors: Suk Kim Chin
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The Internet's explosive growth was spurred by a variety of new and emerging applications and the simultaneous exponential growth of the Internet user community. In particular, multimedia applications are becoming increasingly important in the Internet and this makes the ubiquitous deployment of multicast, native or otherwise, an imminent event. As such, it is important to understand multicast traffic. This paper examines UDP consecutive packet losses and finds that this burst loss characteristic conforms approximately to the head of a geometric distribution which facilitates the derivation of an "ideal" burst loss distribution, assuming an ideal multicast network with no stray long burst losses.
An overview of the saturn project
Authors: Alex Aiken, Suhabe Bugrara, Isil Dillig, Thomas Dillig, Brian Hackett, Peter Hawkins
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

We present an overview of the Saturn program analysis system, including a rationale for three major design decisions: the use of function-at-a-time, or summary-based, analysis, the use of constraints, and the use of a logic programming language to express program analysis algorithms. We argue that the combination of summaries and constraints allows Saturn to achieve both great scalability and great precision, while the use of a logic programming language with constraints allows for succinct, high-level expression of program analyses.
Intelligent multimedia tutoring for manufacturing education
Authors: E. Rogers, Y. Kennedy, T. Walton, P. Nelms, I. Sherry
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The paper describes current work on the design and implementation of intelligent multimedia tutoring modules which are intended to supplement short training courses in nondestructive inspection for the Boeing Defense and Space group.
A Research Agenda for Service-Oriented Architecture
Authors: Kostas Kontogiannis
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Service-Oriented Architecture (SOA) is having a significant impact on the way software systems are developed. Organizations as diverse as banks, health care providers, and government organizations are focusing on SOA as a way to reach a previously unachievable level of interoperability among systems and agility within business practices.
Model for Non-invasive Cardiac Output Measurement
Authors: Siegfried Wassertheurer, Felix Breitenecker
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Aim of the presented work has been the development of an algorithm for a non-invasive, portable, easy to use, and affordable device for measuring systemic cardiovascular parameters like cardiac output and peripheral resistance. The data acquisition is based on a common oscillometric measurement using an occlusive blood pressure cuff and no additional calibration is necessary. The introduced novel algorithm combines several simulation techniques like neural networks or differential equations, which will be explained briefly. Finally we present some results that justify our approach. This kind of model needs no additional external parameters to work and opens therefore good perspectives for non-expert use.
The state of the arts: linux tools for the graphic artist
Authors: Michael J. Hammel
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

A long time ago, in a nerd's life far, far away.... I can trace certain parts of my life back to certain events. I remember how getting fired from a dormitory cafeteria job forced me to focus more on completing my CS degree, which in turn led to working in high tech instead of food service. I can thank the short, fat, bald egomaniac in charge there for pushing my life in the right direction. I can also be thankful he doesn't read papers like this. Like that fortuitous event, the first time I got my hands on a Macintosh and MacPaint - I don't even remember if that was the tools name - was when my love affair with computer art was formed. I'm not trained in art. In fact, I can't draw worth beans. But I can use computers. And computers open up my creativity in ways pen and paper never quite could. Tracing the roots of my obsession of Linux graphics, I have to go back to working for Dell Computer around 1990. My boss at the time was a fellow named Jeremy Chatfield, now at Xi Graphics. Our stint at Dell was just north of Hell, minus the actual burning brimstone. Jeremy moved to Denver, invited me up to work for a short lived company doing SVR4 for PCs, and then into a new company formed by another of our cohorts at Dell - Thomas Roell. X Inside was my first real paid gig in the world of computer graphics, though compiling Motif for various flavors of PC Unix was hardly graphically compelling. But the foundation was laid. Eventually, Jeremy played one last roll of the dice that put me over the edge - he pointed me to a new tool, called the Gimp. Since those early days in 1994-1995, I've been an avid Gimp user and at one point even contributed a small piece of code (though I think it has been rewritten so many times my electrons have long since vanished). Gimp opened up a world that I had only been interested in previously. It let me become a participant. I even got a chance to make my first (and only, to date) trip to a SIGGRAPH show. It all led to my writing the first draft of what was then the Linux Graphics mini-Howto. Eventually, Marjorie Richardson at Linux Journal and I hooked up for an article on graphics tools for Linux, based on my mini-Howto. It was 1995 by then. I reviewed the state of tools - rather modest at the time. I've since moved the mini-Howto, and the Linux Gazette column which it spawned, into my own graphics Web site, The Graphics Muse. After all these years of playing, I've finally moved out of software development and write full time. It's been some time since that first look at the state of tools for graphics on Linux, and the time is ripe for another, closer, look. I won't delve too deeply into installation issues for any of these tools. The point here is to explain what the tool options are. Once a user decides to go with Linux, they'll need dig into specific tools documentation for help on installation.
Geometric properties of the blind digital co-channel communications problem
Authors: L. K. Hansen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Due to the rapid growth of wireless cellular communications, an important problem in cellular radio today is increasing the frequency re-use factor of the cells. One way to achieve this increase is through smart antenna arrays at the cell base sites. We examine a space division multiple access (SDMA) problem arising from the demodulation of multiple co-channel digital signals arriving at an antenna array. In the absence of noise, the problem can be completely described by the equation X=AS, where A is an unknown array response matrix and S is the unknown digital signal matrix. We show that the matrix A is completely described by the facets of the convex hull of X. We then give an algorithm that solves exactly for A and S (up to a simple matrix factor T). We conclude with a description of how the algorithm can be extended to solve the noisy problem X=AS+V.
Data-Parallel Spatial Join Algorithms
Authors: Erik G. Hoel, Hanan Samet
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Efficient data-parallel spatial join algorithms for bucket PMR quadtrees and R-trees, common spatial data structures, are given. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line files). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the scan model of parallel computation on the hypercube architecture of the Connection Machine.
Benchmark problems of Signal Processing and Control for Testing Emergent Architectures and Programming Techniques of DSP's, FASIC's, and PLD's
Authors: Adam Dabrowski, Pawel Pawlowski
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper we present four carefully selected computationally intensive signal processing problems, which can serve as benchmark applications for efficiency testing of modern DSP's, FASIC's, and PLD's.
A domain-specific programming language for secure multiparty computation
Authors: Janus Dam Nielsen, Michael I. Schwartzbach
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

We present a domain-specific programming language for Secure Multiparty Computation (SMC). Information is a resource of vital importance and considerable economic value to individuals, public administration, and private companies. This means that the confidentiality of information is crucial, but at the same time significant value can often be obtained by combining confidential information from various sources. This fundamental conflict between the benefits of confidentiality and the benefits of information sharing may be overcome using the cryptographic method of SMC where computations are performed on secret values and results are only revealed according to specific protocols We identify the key linguistic concepts of SMC and bridge the gap between high-level security requirements and low-level cryptographic operations constituting an SMC platform, thus improving the efficiency and security of SMC application development. The language is implemented in a prototype compiler that generates Java code exploiting a distributed cryptographic runtime.
Digital library education: some international course structure comparisons
Authors: Yongqing Ma, Ann O'Brien, Warwick Clegg
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Following our recent review of progress in Digital Library (DL) education [1], we present here a brief overview of current work to investigate the commonality/diversity of course structure between ten institutions outside North America which offer DL education in their library schools. The weighting of specifically DL module topic credits as a proportion of the overall course taught credits varies between 13% and 63%, and coverage of a proposed core topic set [2] is as high as 85%.
Parallel Programming Environment: A Key to Translating Tera-Scale Platforms into a Big Success
Authors: Jesse Fang
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Moore's Law will continue to increase the number of transistors on die for a couple of decades, as silicon technology moves from 65nm today to 45nm, 32 nm and 22nm in the future. Since the power and thermal constraints increase with frequency, multi-core or many-core will be the way of the future microprocessor.
Representing, Analyzing, and Visualizing Scholarly Data in Support of Research Management
Authors: Thomas Neirynck, Katy Borner
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper describes a data management system that serves leaders and members of scholarly units (e.g., research groups, laboratories or centers) to organize, store, and access information relevant to their work and to the operation of their unit. In particular, we discuss the representation of major data types such as people, projects, teaching, publications, presentations, calls & events, datasets, software, hardware, and funding as well as their interlinkages. Based on this representation, different analyses and visualizations become possible. Each visualization is presented in detail and its usage and relevance for the management and presentation of a unit's operation is discussed. We conclude with an outlook and discussion.
Timing-Constrained Yield-Driven Wiring Reconstruction for Critical Area Minimization
Authors: Jin-Tai Yan, Bo-Yi Chiang
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In this paper, given a full-chip routing result with a set of rectilinear Steiner trees, based on the computation of critical areas for short and open wires, a two-phase timingconstrained yield-driven approach is proposed to minimize the critical area for short wires by using timing-constrained path reconstruction and minimize the critical area for open wires by using width-and timing-constrained wire sizing. The experimental results show that our proposed two-phase timing-constrained yield-driven approach increases about 8%~12% chip yield for the tested benchmark examples in reasonable CPU time.
Component Updates as a Boolean Optimization Problem
Authors: Alexander Stuckenholz
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Component updates always bear the risk of negatively influencing the operativeness of software systems. Due to improper combinations of component versions, dependencies may break. In practise this often turns out to be due to missing or incompatible interfaces and signatures (syntactical interface) but may also be caused by changes in behavior or quality. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. To achieve this, we introduce objective functions and constraints that lead to most recent, minimal systems and use Branch-and-Bound to restrict the search space.
Assessing the value of a journal beyond the impact factor
Authors: Anita Coleman
Venue: Journal of the American Society for Information Science and Technology (2007)

The well-documented limitations of journal impact factor rankings and perceptual ratings, the evolving scholarly communication system, the open-access movement, and increasing globalization are some reasons that prompted an examination of journal value rather than just impact. Using a single, specialized journal established in 1960, about education for the Information professions, the author discusses the fall from citation grace of the Journal of Education for Library and Information Science (JELIS) in terms of impact factor and declining subscriptions. Journal evaluation studies in Library and Information Science based on subjective ratings are used to show the high rank of JELIS during the same period (1984&ndash;2004) and explain why impact factors and perceptual ratings either singly or jointly are inadequate measures for understanding the value of specialized, scholarly journals such as JELIS. This case study was also a search for bibliometric measures of journal value. Three measures, namely journal attraction power, author associativity, and journal consumption power, were selected; two of them were redefined as journal measures of affinity (the proportion of foreign authors), associativity (the amount of collaboration), and calculated as objective indicators of journal value. The affinity and associativity for JELIS calculated for 1984, 1994, 2004, and consumption calculated for 1985 and 1994 show a holding pattern; however, they also reveal interesting dimensions for future study. Journal value is multidimensional and citations do not capture all the facets; costs, benefits, and measures for informative and scientific value must be distinguished and developed in a fuller model of journal value. &copy; 2007 Wiley Periodicals, Inc.
Determining the importance of learning the underlying dynamics of sea clutter for radar target detection
Authors: M. R. Cowper
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Existing evidence for and against sea clutter being chaotic and nonlinearly predictable is briefly discussed. Despite the uncertainty surrounding the chaotic nature of sea clutter, and its nonlinear predictability, the purpose of this paper is to examine what the best design criterion is for a nonlinear predictor which is to be used to detect targets against clutter which is known to be chaotic: mean square error performance or capturing the chaotic clutter's underlying dynamics. Single pulse detection analysis using a Swerling I target and chaotic "clutter" is carried out using predictor-based detectors in an attempt to determine which criterion is most suitable. The predictor detectors are compared with standard detection strategies.