ppxscal/embedding_network huggingface dataset:
Information security technology?...don't rely on it: a case study in social engineering
Authors: Ira S. Winkler, Brian Dealy
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

Many companies spend hundreds of thousands of dollars to ensure corporate computer security. The security protects company secrets, assists in compliance with federal laws, and enforces privacy of company clients. Unfortunately, even the best security mechanisms can be bypassed through Social Engineering. Social Engineering uses very low cost and low technology means to overcome impediments posed by information security measures. This paper details a Social Engineering attack performed against a company with their permission. The attack yielded sensitive company information and numerous user passwords, from many areas within the company, giving the attackers the ability to cripple the company despite extremely good technical information security measures. The results would have been similar with almost any other company. The paper concludes with recommendations for minimizing the Social Engineering threat.
Power provisioning for a warehouse-sized computer
Authors: Xiaobo Fan, Wolf-Dietrich Weber, Luiz Andre Barroso
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Large-scale Internet services require a computing infrastructure that can beappropriately described as a warehouse-sized computing system. The cost ofbuilding datacenter facilities capable of delivering a given power capacity tosuch a computer can rival the recurring energy consumption costs themselves.Therefore, there are strong economic incentives to operate facilities as closeas possible to maximum capacity, so that the non-recurring facility costs canbe best amortized. That is difficult to achieve in practice because ofuncertainties in equipment power ratings and because power consumption tends tovary significantly with the actual computing activity. Effective powerprovisioning strategies are needed to determine how much computing equipmentcan be safely and efficiently hosted within a given power budget. In this paper we present the aggregate power usage characteristics of largecollections of servers (up to 15 thousand) for different classes ofapplications over a period of approximately six months. Those observationsallow us to evaluate opportunities for maximizing the use of the deployed powercapacity of datacenters, and assess the risks of over-subscribing it. We findthat even in well-tuned applications there is a noticeable gap (7 - 16%)between achieved and theoretical aggregate peak power usage at the clusterlevel (thousands of servers). The gap grows to almost 40% in wholedatacenters. This headroom can be used to deploy additional compute equipmentwithin the same power budget with minimal risk of exceeding it. We use ourmodeling framework to estimate the potential of power management schemes toreduce peak power and energy usage. We find that the opportunities for powerand energy savings are significant, but greater at the cluster-level (thousandsof servers) than at the rack-level (tens). Finally we argue that systems needto be power efficient across the activity range, and not only at peakperformance levels.
Multiresolution blind deconvolution of symmetric point-spread functions from bioelectrical potentials
Authors: A. E. Yayle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Cardiac muscle tissue consists of multiple, electrically-active layers, whose electrical potentials can be reconstructed from surface measurements as a volume conductor inverse problem. These are useful in diagnosis following myocardial infarction. The measurements include an unknown point-spread function, which must be blindly deconvolved from the bioelectrical potentials. We present a new divide-and-conquer approach to this problem: (1) unwrap the 2-D problem into a huge 1-D problem; (2) perform a multiresolution (subband) decomposition of the huge 1-D problem into small 1-D problems; (3) solve the small 1-D problems by finding the null vector of a Toeplitz-plus-Hankel matrix. Depending on the noise level, the polynomial Euclidian algorithm or structured total least squares may be used. 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
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks
Authors: Xin Liu, Qingfeng Huang, Ying Zhang
Venue: IEEE Transactions on Mobile Computing (2007)

In this paper, we investigate efficient strategies for supporting on-demand information dissemination and gathering in large-scale wireless sensor networks. In particular, we propose a “comb-needle” discovery support model resembling an ancient method: Use a comb to help find a needle in sand or a haystack. The model combines push and pull for information dissemination and gathering. The push component features data duplication in a linear neighborhood of each node. The pull component features a dynamic formation of an on-demand routing structure resembling a comb. The comb-needle model enables us to investigate the cost of a spectrum of push and pull combinations for supporting query and discovery in large-scale sensor networks. Our result shows that the optimal routing structure depends on the frequency of query occurrence and the spatial-temporal frequency of related events in the network. The benefit of balancing push and pull for information discovery is demonstrated.
High-utility pattern mining: A method for discovery of high-utility item sets
Authors: Jianying Hu, Aleksandra Mojsilovic
Venue: Pattern Recognition (2007)

We present an algorithm for frequent item set mining that identifies high-utility item combinations. In contrast to the traditional association rule and frequent item mining techniques, the goal of the algorithm is to find segments of data, defined through combinations of few items (rules), which satisfy certain conditions as a group and maximize a predefined objective function. We formulate the task as an optimization problem, present an efficient approximation to solve it through specialized partition trees, called High-Yield Partition Trees, and investigate the performance of different splitting strategies. The algorithm has been tested on ''real-world'' data sets, and achieved very good results.
Specification and Detection of TCP/IP Based Attacks Using the ADM-Logic
Authors: Meriam Ben Ghorbel, Mehdi Talbi, Mohamed Mejri
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Intrusion detection systems (IDS) are considered nowadays as one of the most important components in the security architecture of information systems. For a Misusebased IDS, also known as signature based IDS, the effi- ciency of detection is highly correlated to the quality of signatures. It is therefore very important to select a suitable formal language that provides both high expressiveness and simplicity when specifying attack signatures. It is also fundamental to have a user friendly and automatic tool allowing the specification and the verification of these signatures. This paper shows the efficiency and the suitability of the ADM-logic as a and formal language to specify a large variety of signatures characterizing attacks based on the TCP/IP protocols. A prototype of an IDS based on this logic will be also introduced.
Multiple frequency estimation in additive and multiplicative colored noises
Authors: M. Coulon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper addresses the problem of estimating sinusoidal frequencies in additive and multiplicative colored noises. Specific Yule-Walker equations yield second-order statistic-based estimates. The frequency estimates are shown to be asymptotically normally distributed. Their asymptotic covariance is derived.
Image Quality Assessment Complemented with Visual Regions of Interest
Authors: D. Venakata Rao, N. Sudhakar, I. Ramesh Babu, L. Pratap Reddy
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Measurement of visual quality is of fundamental importance to numerous image and video processing applications. This paper introduces an image quality index, Visual region of interest Weighted Quality Index (VroiWQI). The index integrates the notion of Visual regions of interest with the measurement of structural distortion between the original image and the distorted image to effectively match with Human Visual System (HVS). The method evaluates the structural distortion between the original image and the distorted image to arrive at the quality index in a local region. These local indices are then weighted based on the Visual interest of the corresponding region, characterized by entropy in the local region that emphasizes the texture variance. VroiWQI of the image is calculated by averaging these weighted indices, considering different subsets of visual regions with degree of interest greater than a threshold value. Test results show that VroiWQI correlates well with subjective scores.
Design, implementation, and evaluation of duplicate transfer detection in HTTP
Authors: Jeffery C. Mogul, Yee Man Chan, Terence Kelly
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Organizations use Web caches to avoid transferring the same data twice over the same path. Numerous studies have shown that forward proxy caches, in practice, incur miss rates of at least 50%. Traditional Web caches rely on the reuse of responses for given URLs. Previous analyses of real-world traces have revealed a complex relationship between URLs and reply payloads, and have shown that this complexity frequently causes redundant transfers to caches. For example, redundant transfers may result if a payload is aliased (accessed via different URLs), or if a resource rotates (alternates between different values), or if HTTP's cache revalidation mechanisms are not fully exploited. We implement and evaluate a technique known in the literature as Duplicate Transfer Detection (DTD), with which a Web cache can use digests to detect and potentially eliminate all redundant payload transfers. We show how HTTP can support DTD with few or no protocol changes, and how a DTD-enabled proxy cache can interoperate with unmodified existing origin servers and browsers, thereby permitting incremental deployment. We present both simulated and experimental results that quantify the benefits of DTD.
Architecture of the Secoqc Quantum Key Distribution network
Authors: Mehrdad Dianati, Romain Alleaume
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

The European projet Secoqc (Secure Communication based on Quantum Cryptography) [1] aims at developing a global network for unconditionally secure key distribution. This paper specifies the requirements and presents the principles guiding the design of this network, and relevant to its architecture and protocols.
Privacy and Utility in Business Processes
Authors: Adam Barth, John Mitchell, Anupam Datta, Sharada Sundaram
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We propose an abstract model of business processes for the purpose of (i) evaluating privacy policy in light of the goals of the process and (ii) developing automated support for privacy policy compliance and audit. In our model, agents that send and receive tagged personal information are assigned organizational roles and responsibilities. We present approaches and algorithms for determining whether a business process design simultaneously achieves privacy and the goals of the organization (utility). The model also allows us to develop a notion of minimal exposure of personal information, for a given process. We investigate the problem of auditing with inexact information and develop methods to identify a set of potentially culpable individuals when privacy is breached. The audit methods draw on traditional causality concepts to reduce the effort needed to search audit logs for irresponsible actions.
Tele-Immersive Collaboration Using High-Resolution Video in Tiled Displays Environment
Authors: Yasuo Ebara, Nobuyuki Kukimoto, Jason Leigh, Koji Koyamada
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In tele-communication via WAN, the existence of co-researchers by transmission of a video in real scene is important in order to realize high-presence, and its display by the large-scale screen is effective. However, the video image by wide-area display using a projector and large screen is low-resolution, and sufficient presence is not obtained. In this paper, we constructed the scalable tiled displays environment by two or more LCD panels and tried to display a high-resolution video image on the large-scale display. Moreover, we located an small IEEE1394 camera at the center of tiled displays, and discussed the possibility of remote communication which eye-to-eye contact can realize with each other. From these results, we have showed that the existence of participant and ambiance in remote place realized to display in high-presence on local tiled displays environment, and high-resolution display of hand-written characters on tiled displays have become clearer when compared to DV stream on plasma display. Moreover, we have examined that user's gaze was tendency to face front for tiled displays in the case of center position.
WSMO-PA: Formal Specification of Public Administration Service Model on Semantic Web Service Ontology
Authors: Xia Wang, Tomas Vitvar, Vassilios Peristeras, Adrian Mocan, Sotirios K. Goudos, Konstantinos Tarabanis
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this paper we define a formal model for a Public Administration service on the basis of the Web Service Modeling Ontology (WSMO). For this purpose we employ the generic public service object model of the Governance Enterprise Architecture (GEA) providing a PAdomain specific semantics. We investigate conceptual mappings between PAentities andWSMO elements, and on the real-world use case present the detailed formal PAservice model based on the WSMO service model.
Food for Thought: Improving the Market for Assurance
Authors: Carl E. Landwehr
Venue: IEEE Security and Privacy (2007)

Better information can improve a marketplace. An evaluation/certification process that leveraged modern programming languages and analytic tools could accelerate both the development and the adoption of less vulnerable and more effective programming practices, products, and systems. *This article also includes a letter to the editor, regarding "Alien vs. Quine" by Vanessa Gratzer and David Naccache from the March/April 2007 issue.
Object caching in a CORBA compliant system
Authors: R. Kordale, M. Ahamad, M. Devarakonda
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

Distributed object systems provide the key to build large scale applications that can execute on a range of platforms. The Common Object Request Broker Architecture (CORBA) specification from OMG attempts to address interoperability and heterogeneity issues that arise in such systems. Our goal is to investigate performance issues for distributed object systems. We claim that object caching is a must for improved performance and scalability in distributed object systems. However, to our knowledge, the CORBA specification does not address object caching. The purpose of this paper is to serve as a data point in a discussion of issues related to caching in CORBA by describing the design and implementation of Flex, a scalable and flexible distributed object caching system. Flex is built on top of Fresco that uses the CORBA object model. Fresco runs on the UNIX operating system and our implementation of Flex exploits the features of object technology, Fresco and UNIX. This system allows us to quantify the performance improvements for object invocations that are made possible by caching.
A class based language model for speech recognition
Authors: W. Ward, S. Issar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Class based language models are often used when there is insufficient data to generate a word based language model directly from the training data. In this approach, similar items are clustered into classes, an n-gram language model for the class tokens is generated, and then the probabilities for words in a class are distributed according to the smoothed relative unigram frequencies of the words. Classes expand to lists of single word tokens, that is, a class cannot represent a sequence of lexical tokens. We propose a more general mechanism for defining a language model class. In it, classes are expanded to word sequences through finite-state networks. This allows expansion to word sequences without requiring compound words in the lexicon. Where finite-state models are too brittle to represent sentence-level strings, they can represent class-level strings (dates, names and titles for example). We compared the perplexity on the ARPA Dec93 ATIS Test set and found that the new model reduced the perplexity by approximately 17 percent (relative).
Using a Grid Platform for Enabling Real Time User Modeling in On-line Campus
Authors: Santi Caballe, Fatos Xhafa, Thanasis Daradoumis, Joan Esteve, Leonard Barolli, Arjan Durresi
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

User modelling in on-line distance learning is an important research field focusing on two important aspects: describing and predicting students' actions and intentions as well as adapting the learning process to students' features, habits, preferences, and so on. The aim is to greatly stimulate and improve the learning experience. Indeed, on the one hand, students' intentions may change during the realization of learning activities and thus their actions evolve accordingly as the learning process moves forward. On the other hand, adaptive systems can effectively plan and design appropriate learning tasks according to students' features, habits and interests with the aim of facilitating the achievement of the learning goal. In this context, user modelling implies a continuous processing and analysis of user interaction data during long-term learning activities, which produces large and considerably complex information. As a consequence, processing this information is costly and could require computational capacity beyond that of a single computer. In this paper, we show how a Grid approach can considerably decrease the processing time of log data of on-line distance educational web-based systems. Our prototype is based on the masterworker paradigm and is implemented using a peer-topeer platform running on the Planetlab nodes. The results of our study show the feasibility of using Grid middleware to speed and scale up the processing of log data and thus achieve an efficient and dynamic user modeling in on-line distance learning.
A generic methodology for the software managing of caches in multi-processors DSP architectures
Authors: F. Lohier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This article introduces a novel software engineering methodology designed for the real-time execution of low-level image operators running on multi-processors DSP architectures. We detail the results we gained while implementing our approach on the TMS320C80, a shared memory multi-processors architecture. Our contribution compares to other existing C80's image processing libraries in terms of genericity, flexibility, and performance improvement. More specifically, generic mechanisms allows one to address various operator's requirements as well as expanding them using a standard framework. Our approach is flexible enough to allow for the dynamic composing of concurrent and reconfigurable processing chains thanks to a modular library implementing basic operators. Processing chains work on various image sizes and with any number of processors. Above all, our methodology permits performance improvement by enhancing data locality.
Dynamic resource allocation for network echo cancellation
Authors: T. Gansler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Network echo canceler chips are designed to handle several channels simultaneously. With the processing speeds now available, a single chip might handle several hundred channels. In current implementations, however, the adaptation algorithm is designed for a single channel, and the computations are replicated N/sub c/ times, where N/sub c/ is the number of channels. With such an implementation, the computational requirement is N/sub c/ times the peak load for a single channel. The number of computations required in each channel, however, varies widely over time. Therefore, a considerable reduction in computational load can be achieved by designing the system for the average load plus a margin to account for load variations. The reduction in complexity is achieved by exploiting three features: (a) the inherent pauses in conversations; (b) the sparseness of network echo paths; and (c) the fact that an adaptive filter does not need to be updated when the error signal is small. It is shown that, in principle, such a design can reduce the computational load by a very large factor - perhaps as large as thirty. It remains to be seen whether a customized hardware architecture can be implemented to take advantage fully of the proposed algorithm.