ppxscal/embedding_network huggingface dataset:
Policy Analysis Using a Hybrid Semantic Reasoning Engine
Authors: Kris Verlaenen, Bart De Win, Wouter Joosen
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

Policies enable configuring services by declaratively specifying the (desired) behavior of these services in various, specific circumstances. Different policy languages allow the specification of policies in specific areas such as security, quality of service, functional user preferences, etc. Semantic Web technologies can be used to express the semantics of these policies and the domain they are applied to. In a large, distributed environment, the number of actual policies can quickly become substantial. Moreover, different stakeholders can each describe a set of policies. Such a set may interact with the policies of other actors. Therefore, reasoning about policies has become a necessity, for instance for detecting possible conflicts, inclusion, etc. Semantic Web technologies offer support for reasoning - but this support is insufficient. This paper presents an approach to support enhanced reasoning capabilities by combining the best of two worlds: a solution based on Semantic Web technologies on the one hand, and a general-purpose rule language on the other hand. We illustrate how such a hybrid reasoning system can improve policy management in complex distributed service platforms.
Tools and Products
Venue: IEEE Computer Graphics and Applications (2007)

A look at new products on the market, including the Screen Pointer by the Feather Pointer Company, optical media for the Sony XDCAM HD tapeless video system, the AD57xx converters by Analog Devices, Softimage XSI 6 3D animation and character creation software, PTC's Mathcad 14.0, NextEngine RapidWorks software, the V4x Sequencer, Curtiss-Wright's Champ-FX2, Micronas, MicHognose 2D-X, CompAmerica's Tiger Shark 9500 X2 series of laptops, the SBC4670 from Micro/sys, and Corel's Asustek Computer bundled with InterVideo WinDVD HD.
Fast implementation of orthogonal wavelet filterbanks using field-programmable logic
Authors: U. Meyer-Baese
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Field-programmable logic (FPL) is on the verge of revolutionizing digital signal processing (DSP) in the manner that programmable DSP microprocessors did nearly two decades ago. While FPL densities and performance have steadily improved to the point where some DSP solutions can be integrated into a single FPL chip, they still have limited the use in high-precision high-bandwidth applications. In this paper it is shown that alternative implementation strategies can be found which overcome the precision/bandwidth barrier. The design of Daubechies length 4 and 8 filter is presented to compare FPL and programmable DSP solutions.
Possible Ontologies: How Reality Constrains the Development of Relevant Ontologies
Authors: Martin Hepp
Venue: IEEE Internet Computing (2007)

Making the Semantic Web a reality demands more and better ontologies. Yet, building ontologies is inherently a social process constrainedby technical, social, economic, and legal bottlenecks. That means that researchers must bring the same interest they do to purelytechnical issues to addressing the other challenges reality imposes on ontology projects.
Interactive experience in a public context
Authors: Zafer Bilda, Ernest Edmonds, Deborah Turnbull
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

In this demonstration, we show an interactive artwork that responds to sound and describe a field study evaluating audience engagement within a public context. Audience in the public setting largely recognized the interactivity of the media immediately, engaged very briefly with the work and were highly self conscious about their behavior and voice during their engagement.
Self-Organizing Information Matching in InformANTS
Authors: Rainer Hilscher, Sven Brueckner, Theodore C. Belding, H. Van Dyke Parunak
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

In current information systems, information is passive. People act upon it, either sending it to known destinations or pulling it from known sources. InformANTS makes information active, enabling it to move actively from one user to another. This paper introduces the InformANTS vision and describes one of its major system components, the Information Matching System. Particular emphasis is placed on the distinctive self-organizing processes from which emerge the information exploration and exploitation capabilities of InformANTS.
Data fusion for robust head tracking by particles
Authors: Yonggang Jin, F. Mokhtarian
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

The paper presents a data fusion panicle filter for robust head tracking in video surveillance applications. With head detection based on moving region contour analysis, we propose a data fusion particle filter to fuse head detection results with colour and edge cues for robust head tracking. Connections of the proposed particle filter with previous work are also discussed where proposal distributions of M. Isard and A. Blake (1998) and P.Perez et al., (2004) are shown to be an approximation with fixed ratio of importance and prior samples. Experimental results demonstrate the robustness of head tracking using proposed data fusion particle filter.
Towards a Unified Public Safety Scale
Authors: Elizabeth Avery Gomeza, Linda Plotnick, Eli Rohn, Jon Kenneth Morgan, Murray Turoff
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

There exists an acute need for an unambiguous objectively measurable emergency scale to facilitate communication and mutual understanding of the nature of any emergency, by the public and government agencies. A review of existing emergency scales and their potential indicates no one scale can accurately describe all emergencies. Our research solicits ideas for such a scale using a modified Delphi process followed by a survey. The goal of this research is to gain a better understanding on how the public understands emergency scales and anticipate response for emergency events. The contribution of this research is to identify a set of fundamental dimensions for a measurable emergency scale, derived from the Delphi process outcomes. We also present preliminary findings from the survey developed from the results of the Delphi process.
A combinatorial, primal-dual approach to semidefinite programs
Authors: Sanjeev Arora, Satyen Kale
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

Semidefinite programs (SDP) have been used in many recentapproximation algorithms. We develop a general primal-dualapproach to solve SDPs using a generalization ofthe well-known multiplicative weights update rule to symmetricmatrices. For a number of problems, such as Sparsest Cut and Balanced Separator in undirected and directed weighted graphs, and the Min UnCut problem, this yields combinatorial approximationalgorithms that are significantly more efficient than interiorpoint methods. The design of our primal-dual algorithms is guidedby a robust analysis of rounding algorithms used to obtain integersolutions from fractional ones.
BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization
Authors: Sethuraman Janardhanan, Ambuj Mahanti, Debashis Saha, Samir K. Sadhukhan
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Central Office (CO) maintenance is becoming a major overhead for backbone service providers. Trunk to Switch Assignment (TSA) problem is seen as a crucial problem in maintenance of a Central Office. In this paper we formulate the TSA problem as a set partitioning problem and present an efficient heuristic search algorithm BDFS (Block Depth First Search) for minimizing switching overhead in Central Offices. To guide this algorithm, we have developed a new lower bound function, based on relaxation of the problem of merging external trunks into switches. We used the lower bound admissible heuristic (H-III) along with the proposed technique to solve this problem. While comparing the performance of BDFS, we have found that BDFS outperforms IDA* on various performance metrics. We have also suggested a real-time version of BDFS algorithm that gives high quality sub-optimal or optimal solution with a user specified time. Real-time BDFS gives optimal solution within 50-60% of the total execution time for most of the problem instances. The Real-time BDFS can be used to optimize the existing configurations with minimal changes and can also help service providers in taking quick decisions before making a detailed study regarding planning requirements.
Wireless Technologies and Architectures for Health Monitoring Systems
Authors: Doan B. Hoang
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Various wireless technologies have been used in health monitoring systems; however, it is not always clear why one technology is chosen over another and how it fits into the overall architecture of an application. This paper explores many limiting characteristics of relevant wireless technologies and attempts to provide a basis for making an appropriate selection. The paper also suggests an architecture that supports collaboration among multiple caregivers over a particular health monitoring application.
Scalable audio coder based on quantizer units of MDCT coefficients
Authors: A. Jin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A scalable codec has been constructed by using transform coding and the basic modules for scalable encoder and decoder. It allows users to choose a variety of scalable configurations in the frequency domain. The basic module is a quantizer that can quantize MDCT (modified DCT) coefficients transformed from a variety of frequency regions. This module mainly works at bit rates of more than 8 kbit/s. We can also change the target frequency regions of the basic module's input-output signals in each transform frame; i.e., we can change the scalable structure according to the nature of the input signals. In the scalable codec described here, the input-output signals are monaural and the sampling frequency is 24 kHz. The total bit rate of this scalable codec is more than 8 kbit/s. Subjective quality evaluation tests, mainly for musical sound sources, showed that it's sound quality is better than that of an MPEG-2 layer 3 codec at 8, 16, and 24 kbit/s when our scalable codec is constructed of 8-kbit/s basic modules. In combination with AAC (advanced audio coding), our scalable codec will be chosen as an international standard in ISO/IEC-MPEG-4/Audio.
Direction of arrival estimation based on nonlinear microphone array
Authors: H. Kamiyanagida
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper describes a new method for estimating the direction of arrival (DOA) using a nonlinear microphone array based on complementary beamforming. Complementary beamforming is based on two types of beamformers designed to obtain complementary directivity patterns with each other. In this system, since the resultant directivity pattern is proportional to the product of these directivity patterns, the proposed method can be used to estimate DOAs even when the number of sound sources is equal to or exceeds that of microphones. First, DOA-estimation experiments are performed using actual devices in real acoustic environments. The results clarify that DOA estimation for two sound sources can be accomplished by the proposed method with only two microphones. Also, by comparing the resolutions of DOA estimation by the proposed method and by the conventional minimum variance method, we can show that the performance of the proposed method is superior to that of the conventional method.
Generation of Long Sorted Runs on a Unidirectional Array
Authors: Yen-Chun Lin, Horng-Yi Lai
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

A parallel algorithm is presented for generation of long sorted runs as the first phase of sorting a large file. It can generate runs of length about 2mp + 2 on a unidirectional linear array of p processors each with a heap of size m. Internal computations can be completely overlapped with I/O, and almost only disk read time is required. Experiments with the algorithm and its variations have been conducted. The results show that all the versions can generate longer runs than a previous algorithm run on a bidirectional linear array.
In search of the perfect mega-widget
Authors: Stephen A. Uhler
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

Mega-widgets are Tk widgets that can be created entirely in Tcl, yet behave indistinguishably from their native counterparts. Although several different frameworks have been constructed to create and manage mega-widgets, none does a perfect job, as there are aspects of a native widget's behavior that can't be simulated strictly in Tcl. We propose a small set of enhancements to the Tk event binding and focus models that will enable mega-widget frameworks, including those that are currently available, to do a better job supporting the semantics of native widgets. This allows a script that uses a native widget on one platform, to use a mega-widget implementation of the same functionality on a different platform without the need to know whether the widget is native or not.
Quantum Key Distribution with Classical Bob
Authors: Michel Boyer, Dan Kenigsberg, Tal Mor
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

Secure key distribution among two remote parties is impossible when both are classical, unless some unproven (and arguably unrealistic) computation-complexity assumptions are made, such as the difficulty of factorizing large numbers. On the other hand, a secure key distribution is possible when both parties are quantum. What is possible when only one party (Alice) is quantum, yet the other (Bob) has only classical capabilities? We present two protocols with this constraint, and prove their robustness against attacks: we prove that any attempt of an adversary to obtain information (and even a tiny amount of information) necessarily induces some errors that the legitimate users could notice.