ppxscal/embedding_network huggingface dataset:
Cost-Effective Security
Authors: Johan Peeters, Paul Dyson
Venue: IEEE Security and Privacy (2007)

The authors discuss what abuse cases bring to software development in terms of planning. They don't assume a fixed budget is assigned to security measures but that budgetary constraints apply to the project as a whole. The authors believe it's reasonable, and often necessary, to trade functionality against security, so the question isn't how to prioritize security requirements but how to prioritize the development effort across both functional and security requirements.
Managing fuzziness on conventional object-oriented platforms: Research Articles
Authors: F. Berzal, N. Marín, O. Pons, M. A. Vila
Venue: International Journal of Intelligent Systems (2007)

During the last few years, many database researchers have aimed their efforts at extending the object-oriented model for dealing with different kinds of imperfect information. Some of these scholars have used the Fuzzy Set Theory to deal with imperfection because it has proved to be useful in problems where imprecision and uncertainty play important roles. This article describes an architecture that can be used to develop a fuzzy object-oriented system on top of an existing classical one. This article also introduces a general framework as the basis for managing fuzziness in conventional object-oriented systems. Foodbi, a fuzzy object-oriented database interface, is presented as a prototype that allows the creation of fuzzy object-oriented schemata that can be translated into sets of standard Java classes. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 781&ndash;803, 2007.
Scalable hybrid data dissemination for internet hot spots
Authors: Vincenzo Liberatore
Venue:  (2007)

Server scalability can be greatly enhanced with hybrid data dissemination. Hybrid data dissemination uses a combination of multicast and unicast techniques. Multicast is ideal for popular data that are of interest to most clients. Multicast aggregates multiple unicast data transfers into a single transmission and is thus more scalable than traditional unicast. On the other hand, multicast is inappropriate for unpopular data since it would force unwanted contents on most clients. Therefore, unpopular data is transferred with traditional unicast. As a result, hybrid data dissemination would ideally achieve scalable utilization of server and network resources while avoiding the reception of unneeded contents. In this dissertation, we first present a deployment framework for hybrid data delivery to support web data dissemination. The framework significantly improves the scalability of web servers. Second, we study a fundamental problem in hybrid data delivery: document selection, which determines the data transfer method that is most appropriate for each data item. We individuate special challenges, such as scalable and robust popularity estimation, appropriate classification of documents, and unpopular large documents. We propose solutions to these problems and evaluate them with collected traces and in the real Internet. Third, we examine the multicast push performance with application-perceived performance criteria. We give both theoretical and experimental analysis on the problem. Finally, we devise an efficient and effective application level protocol for transferring application data on a multicast channel.
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
Authors: Barna Saha, Pabitra Mitra
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper we introduce a dynamic algorithm for clustering undirected graphs, whose edge property is continuously changing. The algorithm can maintain high-quality clusters efficiently in presence of insertion and deletion (update) of edges. The algorithm, is motivated by the minimumcut tree based partitioning algorithm of [3] and [4]. It takes O(k3) time for each update processing, where k is the maximum size of any cluster. This is the worst case time complexity, and in general time taken is much less. To the best of our knowledge, this is the first clustering algorithm, for evolving graphs, providing strong theoretical quality guarantee on clusters.
Loudspeaker fault detection using time-frequency representations
Authors: M. Davy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper addresses the problem of loudspeaker testing. Two applications are investigated: loudspeaker manufacturing fault detection and maintenance. In order to comply with practical requirements, we propose a new, brief, nonstationary test signal. Recorded loudspeaker responses are processed using an improved time-frequency decision algorithm. The fault detection procedure is tested with real data. The results show its accuracy and practical interest.
CSP: a novel system architecture for scalable internet and communication services
Authors: Hemal V. Shah, Dave B. Minturn, Annie Foong, Gary L. McAlpine, Rajesh S. Madukkarumukumana, Greg J. Regnier
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

The boundary between the network edge and the front-end servers of the data center is blurring. Appliance vendors are flooding the market with new capabilities, while switch/router vendors scramble to add these services to their traditional transport services. The result of this competition is a set of ad-hoc technologies and capabilities to provide services at the network edge. This paper describes the Comm Services Platform (CSP); a system architecture for this new 'communication services tier' of the data center. CSP enumerates a set of architectural components to provide scalable communication services built from standard building blocks that utilize emerging server, I/O and network technologies. The building blocks of CSP include a System Area Network, the Virtual Interface Architecture, programmable network processors, and standard high-density servers.
Groupware support in the windowing system
Authors: Peter Hutterer, Bruce H. Thomas
Venue: Proceedings of the eight Australasian conference on User interface - Volume 64 (2007)

In this paper, we discuss the advantages of integrating groupware support for Single Display Groupware (SDG) into the windowing system. For the domain of SDG, a Groupware Windowing System (GWWS) has several advantages over traditional SDG toolkits and applications. A GWWS provides SDG support for legacy applications, custom built SDG applications and supports the execution of multiple applications simultaneously. A GWWS combines the traditional single-user single-input axiom and novel multi-user multi-input desktop environments. We present the Multi-Pointer X Server (MPX), the first GWWS that supports SDG natively, together with our Multi-Pointer Window Manager (MPWM). MPX and MPWM support an arbitrary number of true systems cursors, sophisticated floor control and per-window annotation overlay. To ease the interaction with such a GWWS, we implemented the DeviceShuffler, a system to couple input devices from any computer. The physical connection point of a device is transparent to both the windowing system and the application. This supports true ad-hoc collaboration on shared screens.
A scalable and high performance software iSCSI implementation
Authors: Abhijeet Joglekar, Michael E. Kounavis, Frank L. Berry
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

In this paper we present two novel techniques for improving the performance of the Internet Small Computer Systems Interface (iSCSI) protocol, which is the basis for IP-based networked block storage today. We demonstrate that by making a few modifications to an existing iSCSI implementation, it is possible to increase the iSCSI protocol processing throughput from 1.4 Gbps to 3.6 Gbps. Our solution scales with the CPU clock speed and can be easily implemented in software using any general purpose processor without requiring specialized iSCSI protocol processing hardware. To gain an in-depth understanding of the processing costs associated with an iSCSI protocol implementation, we built an iSCSI fast path in a user-level sandbox environment. We discovered that the generation of Cyclic Redundancy Codes (CRCs) which is required for data integrity, and the data copy operations which are required for the interaction between iSCSI and TCP represent the main bottlenecks in iSCSI protocol processing. We propose two optimizations to iSCSI implementations to address these bottlenecks. Our first optimization is on the way CRCs are being calculated. We replace the industry standard algorithm proposed by Prof. Dilip Sarwate with 'Slicing-by-8' (SB8), a new algorithm capable of ideally reading arbitrarily large amounts of data at a time while keeping its memory requirement at reasonable level. Our second optimization is on the way iSCSI interacts with the TCP layer. We interleave the compute-intensive data integrity checks with the memory access-intensive data copy operations to benefit from cache effects and hardware pipeline parallelism.
MSVQ design for packet networks with application to LSF quantization
Authors: H. Khalil
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The design of a multi-stage vector quantizer (MSVQ) based source-channel coding system is optimized for packet networks. Resilience to packet loss is further enhanced by a proposed interleaving approach that ensures that a single lost packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, packet loss rate, and the interleaving technique in use. The new source-channel-optimized MSVQ is tested on memoryless line spectral frequency (LSF) parameter quantization in speech coders. A source-channel-optimization MSVQ is shown to yield a gain of up to 2.0 dB in SNR, for coding the LSFs, over traditional MSVQ and to substantially enhance the robustness of packetized speech transmission. Although the formulation is given in the context of packet networks, the work is directly extendible to the broader category of erasure channels.
Architectural Design Methodologies for Complex Evolving Systems
Authors: Urjaswala Vora
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Software evolution is a costly yet unavoidable consequence of a successful application. To accommodate the requirements of today's fast changing business world, it is required to adapt the new business rules without disturbing the existing working system. For the business rules evolutions where old and new business rules and business data entities have to exist concurrently in the system, we proposed the Framework, CFFES (Control Flow Framework for Evolving Systems) which focuses on smooth and seamless evolution. CFFES also validates the different business rules as well as business data entities according to their temporal specifications. The Framework capabilities are to be compared with the existing methodologies which are aimed at prioritizing the quality factor - evolvability of a system. The principle of encapsulation in Object Oriented (OO) design overcame the flaws present in structured methodology due to separate data and process components and their interdependencies. However OO design has been proved inadequate in addressing design issues due to crosscutting concerns which are across the objects or components or packages. These crosscutting concerns are main obstacles in the evolution of OO systems. Aspect Oriented software development was proposed as a solution to this problem. In this paper we discuss the impact of evolution on the architectural design of a system designed using Aspect Oriented Design Methodology and a system designed using the Framework (CFFES) proposed by us.
Selecting non-uniform units from a very large corpus for concatenative speech synthesizer
Authors: Min Chu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper proposes a two-module text to speech system (TTS) structure, which bypasses the prosody model that predicts numerical prosodic parameters for synthetic speech. Instead, many instances of each basic unit from a large speech corpus are classified into categories by a classification and regression tree (CART), in which the expectation of the weighted sum of square regression error of prosodic features is used as splitting criterion. Better prosody is achieved by keeping slender diversity in prosodic features of instances belonging to the same class. A multi-tier non-uniform unit selection method is presented. It makes the best decision on unit selection by minimizing the concatenated cost of a whole utterance. Since the largest available and suitable units are selected for concatenating, distortion caused by mismatches at concatenated points is minimized. Very natural and fluent speech is synthesized, according to informal listening test.
Student peer evaluations using the analytic hierarchy process method
Authors: L. Frair
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Employment of the analytic hierarchy process (AHP) to assess the contributions of engineering student team members is described. The students perform this assessment as well as the instructor. The assessments are correlated with the individual team role assignments to making a final determination of the contribution of the individual to the team effort. Using this evaluation technique appears to provide candid student peer input for evaluations. AHP can be characterized as a multi-criteria decision technique in which qualitative factors are of prime of importance. A model of the problem is developed using a hierarchical representation. At the top of the hierarchy is the overall goal or prime objective one is seeking to fulfil. The succeeding lower levels then represent the progressive decomposition of the problem. The knowledgeable parties complete a pair-wise comparison of all entries in each level relative to each of the entries in the next higher level of the hierarchy. The composition of these judgments fixes the relative priority of the entities at the lowest level relative to achieving the top-most objective. A description of AHP for teams within a production engineering class is described. First, the lack of success with traditional student questionnaires to assess team performance is described, followed by a description of what appear to be more meaningful results when AHP is used. Finally, several complicating factors associated with this experiment, some tentative conclusions and a recommendation for continued investigation of the use of AHP for student evaluations are described.
Impulse noise removal by the difference-type noise detector and the cost function-type filter
Authors: Shi-Qiang Yuan, Yong-Hong Tan, Hua-Li Sun
Venue: Signal Processing (2007)

All kinds of median filters have been often adopted in impulse noise reduction. However, many details (e.g., thin lines and step edges) are easily lost, especially at high noise situation. Although many new techniques were added to these filters, the results of image filtering are still not satisfactory. Thus, in this paper, a cost function-based filter is proposed. The corrupted pixels are processed by differentiating the cost function. During image processing, values of the uncorrupted pixels are required to be transformed into constant terms of the cost function, thus, a difference-type noise detector is presented in this paper. During simulations, the proposed filter is compared with several filters in the numerical value and the vision, respectively. Experimental results show that the proposed filter can very effectively remove impulse noise and preserve more details of original images.
A variable-rate filtering system for digital communications
Authors: L. Wasserman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We propose an efficient programmable transmit-receive digital filter structure consisting of a pulse shaping filter (PSF) and a cascaded integrator-comb (CIC) filter which is applicable to variable-rate digital communication systems. The CIC structure is a hardware-efficient means of constructing programmable interpolation and decimation filters, but it introduces a large amount of intersymbol interference (ISI). We solve this problem by proposing a filter design method that determines the PSF coefficients such that the cascade of the PSF and CIC filter exhibits the desired frequency response. 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
Your way your missions: from location-based to route-based pervasive gaming
Authors: Ling Chen, Steve Benford
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, we describe the design and implementation of a route-based pervasive game named Your Way Your Missions (YWYM). Since the game obtains the planned routes of players and returns missions in the routes, players can play the game in a casual way, without changing their routes to respond to picked up missions. A self-reporting method is proposed to obtain the planned routes of players, and a corresponding route defining tool is developed upon Google Maps. Two approaches to realize route-based mission adaptation with spatial databases are presented.
Exploiting result equivalence in caching dynamic web content
Authors: Ben Smith, Anurag Acharya, Tao Yang, Huican Zhu
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Caching is currently the primary mechanism for reducing the latency as well as bandwidth requirements for delivering Web content. Numerous techniques and tools have been proposed, evaluated and successfully used for caching static content. Recent studies show that requests for dynamic web content also contain substantial locality for identical requests. In this paper, we classify locality in dynamic web content into three kinds: identical requests, equivalent requests, and partially equivalent requests. Equivalent requests are not identical to previous requests but result in generation of identical dynamic content. The documents generated for partially equivalent requests are not identical but can be used as temporary place holders for each other while the real document is being generated. We present a new protocol, which we refer to as Dynamic Content Caching Protocol (DCCP), to allow individual content generating applications to exploit query semantics and specify how their results should be cached and/or delivered. We illustrate the usefulness of DCCP for several applications and evaluate its effectiveness using traces from the Alexandria Digital Library and NASA Kennedy Center as case studies.
The Beltrami geometrical framework of color image processing
Authors: N. Sochen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

The Beltrami geometrical framework for scale-space flows is generalized to nontrivial color space geometries and implemented in analysis and processing of color images. We demonstrate how various models of color perception, interpreted as geometries of the color space, result in different enhanced processing schemes.
On the value of pairwise constraints in classification and consistency
Authors: Jian Zhang, Rong Yan
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In this paper we consider the problem of classification in the presence of pairwise constraints, which consist of pairs of examples as well as a binary variable indicating whether they belong to the same class or not. We propose a method which can effectively utilize pairwise constraints to construct an estimator of the decision boundary, and we show that the resulting estimator is sign-insensitive consistent with respect to the optimal linear decision boundary. We also study the asymptotic variance of the estimator and extend the method to handle both labeled and pairwise examples in a natural way. Several experiments on simulated datasets and real world classification datasets are conducted. The results not only verify the theoretical properties of the proposed method but also demonstrate its practical value in applications.
Cooperative and collaborative learning in university aviation education
Authors: M. R. Karp
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Aviation has evolved rapidly in complexity over the past few decades, yet the aviation education process itself has changed little. University aviation training programs, because of their comprehensive academic environment, offer excellent opportunities to develop and maintain technologically current curriculum. This paper suggests an integrated aviation learning model to improve long-term retention and enhance application across a broad spectrum of new aviation situations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A low cost dynamic vocabulary speech recognizer on a GPP-DSP system
Authors: Yu-Hung Kao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Continuous speech recognition is a resource-intensive algorithm. Commercial dictation software requires more than 10 Mbytes to install on the disk and 32 Mbytes RAM to run the application. Because of the resource requirement, such a system can not be implemented in a low cost and low power embedded system. We propose a design of dynamic vocabulary speech recognizer that will fit in a DSP-GPP (general purpose processor) architecture. The computation intensive, small footprint recognizer engine runs on the DSP; and the computation non-intensive, larger footprint grammar, dictionary, and model acoustic components resides on the GPP. The recognition models are prepared on the GPP and transferred to the DSP, the interaction among the application, model generation, and recognition modules is minimal. The result is a speech recognition server implemented in a low cost embedded system. The application can dynamically create flexible vocabulary to suit different recognition contexts. It still does not do large vocabulary dictation; however, it provides unlimited recognition contexts with unlimited vocabulary, all these implementable in a low cost embedded system.