ppxscal/embedding_network huggingface dataset:
Secure distribution of events in content-based publish subscribe systems
Authors: Lukasz Opyrchal, Atul Prakash
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Content-based publish-subscribe systems are an emerging paradigm for building a range of distributed applications. A specific problem in content-based systems is the secure distribution of events to clients subscribing to those events. In content-based systems, every event can potentially have a different set of interested subscribers. To provide confidentiality guarantee, we would like to encrypt messages so that only interested subscribers can read the message. In the worst case, for n clients, there can be 2n subgroups, and each event can go to a potentially different subgroup. A major problem is managing subgroup keys so that the number of encryptions required per event can be kept low. We first show the difficulties in applying existing group key management techniques to addressing the problem. We then propose and compare a number of approaches to reduce the number of encryptions and to increase message throughput. We present analytical analysis of described algorithms as well as simulation results.
The price of privacy and the limits of LP decoding
Authors: Cynthia Dwork, Frank McSherry, Kunal Talwar
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

This work is at theintersection of two lines of research. One line, initiated by Dinurand Nissim, investigates the price, in accuracy, of protecting privacy in a statistical database. The second, growing from an extensive literature on compressed sensing (see in particular the work of Donoho and collaborators [4,7,13,11])and explicitly connected to error-correcting codes by Candès and Tao ([4]; see also [5,3]), is in the use of linearprogramming for error correction. Our principal result is the discovery of a sharp threshhold ρ*∠ 0.239, so that if ρ < ρ* and A is a random m x n encoding matrix of independently chosen standardGaussians, where m = O(n), then with overwhelming probability overchoice of A, for all x ∈ Rn, LP decoding corrects ⌊ ρ m⌋ arbitrary errors in the encoding Ax, while decoding can be made to fail if the error rate exceeds ρ*. Our boundresolves an open question of Candès, Rudelson, Tao, and Vershyin [3] and (oddly, but explicably) refutesempirical conclusions of Donoho [11] and Candès et al [3]. By scaling and rounding we can easilytransform these results to obtain polynomial-time decodable random linear codes with polynomial-sized alphabets tolerating any ρ < ρ* ∠ 0.239 fraction of arbitrary errors. In the context of privacy-preserving datamining our results say thatany privacy mechanism, interactive or non-interactive, providingreasonably accurate answers to a 0.761 fraction of randomly generated weighted subset sum queries, and arbitrary answers on the remaining 0.239 fraction, is blatantly non-private.
Towards an Ontology-based Risk Assessment in Collaborative Environment Using the SemanticLIFE
Authors: Mansoor Ahmed, Amin Anjomshoaa, Tho Manh Nguyen, A Min Tjoa
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The rise in interconnectivity in the last few years has made computer systems and networks more vulnerable to threats as they are accessed by an ever increasing number of users. Nowadays organizations are lacking proper security measures and means to calculate risk assessment for their assets. Legacy systems in organizations are facing different kind of risks like viruses, bugs and system failure causing damages to hardware and software resulting in data loss. The ultimate challenge in many organizations is to assess their risk factors for their computers and networks. There is no way to completely overcome the threat that an organization might have. The goal is to calculate risks, so that problems resulting from them could be minimized and to fill the gap between business entities (like a project, a role) and organization infrastructure using Semantic Web technologies. SemanticLIFE is a Personal Information Management System which gathers the user interaction events and correlates those by using ontologies. In this paper the ontology-based risk assessment in the context of the organizational security, a fundamental issue for planners and decision makers in the IT field, is explored using SemanticLIFE tool.
Internet and the Digital Economy Introduction to the Track
Authors: Dave King, Alan Dennis
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This is the 11th anniversary of the Internet and Digital Economy Track. The 15 minitracks in this track cover a variety of methodologies and technical issues. Some of these minitracks have been in existence for years, such B2B e-commerce and electronic marketing. Other minitracks and issues are much newer in origin, such as systems security, and open source development exemplify these recent entries.. This track will continue to encourage the research and discussion of new ideas, both within established areas, and in newly emerging areas. The minitracks are listed below along with the names of the minitrack chairs:
From fuzzy sets to the decompositions of non-rigid sets
Authors: Fathi B. Saidi, Ali Jaballah
Venue: Fuzzy Sets and Systems (2007)

The concept of identifying a fuzzy subset of a set R with its collection of level sets and its collection of membership values plays an important role in many real life applications. Such identification is possible only if the fuzzy set can be recaptured. This implies that uniqueness of the fuzzy set plays an important role. It has been recently shown that in order to have uniqueness it is necessary and sufficient that the collection S of membership values of the fuzzy set be a rigid set. With this in mind, the authors went on to show that if S has the min-max-property then S is a rigid set and left the converse as an open problem. We start this paper by constructing a counterexample that shows that rigid sets do not have to have the min-max-property. We then take a closer look at non-rigid sets by decomposing them into isomorphism-invariant components and into S-connected components in the hope of getting a characterization of non-rigid sets, which will lead to a characterization of rigid sets and hence of uniqueness of the fuzzy set. We also investigate, in the case of nonuniqueness, the number of fuzzy sets corresponding to a collection of level sets and a collection of membership values.
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation
Authors: Joerg Decker, Joerg Schneider
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Applications to be executed in Grid computing environments become more and more complex and usually consist of multiple interdependent tasks. The coordinated execution of such tightly or loosely coupled tasks often requires simultaneous access to different Grid resources. This leads to the problem of resource co-allocation. Efficient and robust scheduling algorithms have to be developed that can cope with the Grid's largescale distribution, a high number of competing and demanding applications, the inherent resource heterogeneity and the often limited view on resource availability. In this paper, we present two heuristic scheduling algorithms that are based on a well-known list scheduling algorithm and both support coallocation and advance resource reservation. Our first algorithm preserves the run-time efficiency of Greedy list schedulers while the second approach incorporates more sophisticated search techniques in order to achieve better results with respect to the performance metrics. Both algorithms have been implemented within a Grid simulation framework. An extensive simulation study was conducted to evaluate and compare the performance of both algorithms. It showed the general suitability of our enhanced list scheduling heuristics within heterogeneous Grid environments.
Part count and design of robust systems
Authors: Daniel Frey, Joseph Palladino, John Sullivan, Malvern Atherton
Venue: Systems Engineering (2007)

Systems engineering frequently includes efforts to reduce part count with the goal of cutting costs, enhancing performance, or improving reliability. This paper examines the engineering practices related to part count, applying three different theories&mdash;Theory of Inventive Problem Solving, Axiomatic Design, and Highly Optimized Tolerance. Case studies from the jet engine industry are used to illustrate the complicated tradesoffs involved in real-world part count reduction efforts. The principal conclusions are that: (1) Part consolidation at the component level has generally been accomplished as technological advancements enable them which is consistent with the &ldquo;law of ideality&rdquo; in the Theory of Inventive Problem Solving; (2) part count reduction frequently increases coupling among functional requirements, design parameters, and processing variables while also delivering higher reliability which conflicts with the theory of Axiomatic Design; and (3) at the overall system level, jet engine part count has generally increased in response to escalating demands for system robustness as suggested by the theory of Highly Optimized Tolerance. &copy; 2007 Wiley Periodicals, Inc. Syst Eng 10: 203&ndash;221, 2007 This paper was presented at the 16th Annual International Symposium of the International Council on Systems Engineering (INCOSE), July 9&ndash;14, 2006, Orlando, FL.
Adjusting the instruction of the personal software process to improve student participation
Authors: L. A. Williams
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

No customer is fully satisfied unless they receive a product that does what they want, and they receive it when they want it, defect-free and at an agreed upon price. To address all four of these requirements, Watts Humphrey, at the Software Engineering Institute (SEI), developed the personal software process (PSP), which applies proven quality principles to the work of individual software engineers. PSP was initially taught to practicing software engineers in industry and to graduate students. Earlier this year, Humphrey published a new text, suitable for the beginning software engineering student. This text outlines a process for managing and producing high quality software, reducing the mathematical and statistical rigor of the original PSP, but maintaining a solid base of disciplined practices and an overriding quality philosophy. This paper describes how the PSP has been incorporated into the undergraduate computer science courses at the University of Utah, USA. It highlights how instruction has been adapted to improve student participation, retention and utilization of the material.
Field Server Projects
Authors: Masayuki Hirafuji, Seishi Ninomiya, Takuji Kiura, Tokihiro Fukatsu, Haoming Hu, Hideo Yuoichi, Kei Tanaka, Koji Sugahara, Tomonari Watanabe, Takaharu Kameoka, Atsushi Hashimoto, Ryoei Ito, Reza Ehsani, Hiroshi Shimamura
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

A Field Server is a sensor node which can create a wireless sensor network and simultaneously serve as Wi-Fi hotspots in open fields. Since 2001, we have been working on several Research and Development projects to develop Field Server technology and its applications. So far, three generations of Field Servers have been developed and are in use in more than a dozen countries for collaborative research and educational applications such as a global sensor network for Earth observation, food safety/IT-agriculture, advanced sensor technology in fields and image monitoring for urban areas. The field servers have proved to be quite robust for field applications. More work is in progress to develop applications for the Field Server and resolve issues with power consumption and increasing the communication range for certain applications
Mathematical modeling of mass transfer in symmetric heterogeneous and nanoporous media with a system of n-interface interactions
Authors: M. R. Petryk
Venue: Cybernetics and Systems Analysis (2007)

An exact analytical solution is obtained to describe mass transfer in symmetric heterogeneous and nanoporous media with a system of n-interface interactions. The Laplace integral transform and Cauchy fundamental functions are used. A solvability theorem is proved. New recurrence algorithms and computational procedures are developed to form influence matrices, which are due to heterogeneities and n-interface interactions.
Efficient Reservoir Sampling for Transactional Data Streams
Authors: Manoranjan Dash, Willie Ng
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Reservoir sampling maintains a sample that is a "sketch" of the whole data. Existing reservoir sampling methods introduced by J.S Vitter are based on simple random sampling. These algorithms work fine for larger sampling ratios but for small sampling ratios, their performance drops drastically. Note that for streaming data, it is quintessential that the sampling algorithm works efficiently particularly for a very small ratio because streaming data is potentially infinite in size. We proposed a distance based sampling (DSS) for transactional data streams. DSS is designed to produce samples that are "close" to the whole data. It assures the accuracy of the final sample even at very small sampling ratios. Experimental comparison between DSS algorithm and the existing reservoir sampling methods shows that DSS outperforms them significantly particularly for small sample ratios.
On the Influence of Arm Inertia and Configuration on Motion Planning of Reaching Movements in Haptic Environments
Authors: Igor Goncharenko, Mikhail Svinin, Sven Forstmann, Yutaka Kanou, Shigeyuki Hosoe
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The paper presents an analysis of human reaching movements in the manipulation of flexible objects. Two models, the minimum hand jerk and the minimum driving hand force-change, are used for modeling and verification of experimental data. The data are collected with the haptic system supporting dynamic simulation of the flexible object in real time. We describe some initial experimental results and analyze the applicability of the models. It is found that even for short-term movements human motion planning strategy can depend on arm mass and configuration. This conclusion is based on the experimental evidence of the multi-phased hand velocity profiles that can be well captured by the minimum driving hand forcechange criterion.
2007 Special Issue: An associative memory readout for ESNs with applications to dynamical pattern recognition
Authors: Mustafa C. Ozturk, José C. Principe
Venue: Neural Networks (2007)

The use of echo state networks (ESN) to find patterns in time (dynamical pattern recognition) has been limited. This paper argues that ESNs are particularly well suited for dynamical pattern recognition and proposes a linear associative memory (LAM) as a novel readout for ESNs. From the class of LAMs, the minimum average correlation energy (MACE) filter is adopted because of its high rejection characteristics that allow its use as a detector in the automatic pattern recognition literature. In the ESN application, the MACE interprets the states of the ESN as a two-dimensional ''image'', one dimension being time and the other the processing element index (space). An optimal template image for each class, which associates ESN states with the class label, can be analytically computed using training data. During testing, ESN states are correlated with each template image and the class label of the template with the highest correlation is assigned to the input pattern. The ESN-MACE combination leads to a nonlinear template matcher with robust noise performance as needed in non-Gaussian, nonlinear digital communication channels. A real-world data experiment for chemical sensing with an electronic nose is included to demonstrate the validity of this approach. Moreover, the proposed readout can also be used with liquid state machines eliminating the need to convert spike trains into continuous signals by binning or low-pass filtering.
SLA Decomposition: Translating Service Level Objectives to System Level Thresholds
Authors: Yuan Chen, Subu Iyer, Xue Liu, Dejan Milojicic, Akhil Sahai
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

In today's complex and highly dynamic computing environments, systems/services have to be constantly adjusted to meet Service Level Agreements (SLAs) and to improve resource utilization, thus reducing operating cost. Traditional design of such systems usually involves domain experts who implicitly translate Service Level Objectives (SLOs) specified in SLAs to system-level thresholds in an ad-hoc manner. In this paper, we present an approach that combines performance modeling with performance profiling to create models that translate SLOs to lower-level resource requirements for each system involved in providing the service. Using these models, the process of creating an efficient design of a system/service can be automated, eliminating the involvement of domain experts. We demonstrate that our approach is practical and that it can be applied to different applications and software architectures. Our experiments show that for a typical 3-tier e-commerce application in a virtualized environment the SLAs can be met while improving CPU utilization up to 3 times.
A holistic paradigm for large scale schema matching
Authors: Kevin Chen-Chuan Chang
Venue:  (2006)

Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise attribute correspondences in isolation. In contrast, this thesis proposes a new matching paradigm, holistic schema matching, to match many schemas at the same time and find all matchings at once. By handling a set of schemas together, we can explore their context information that reflects the semantic correspondences among attributes. Such information is not available when schemas are matched only in pairs. As the realizations of holistic schema matching, we develop two approaches in sequence. To begin with, we develop the MGS framework, which finds simple 1:1 matchings by viewing schema matching as hidden model discovery. Then, to deal with complex matchings, we further develop the DCM framework by abstracting schema matching as correlation mining. Further, to automate the entire matching process, we incorporate the DCM framework with automatically extracted interfaces and find that the inevitable errors in automatic interface extraction may significantly affect the matching result. To make the DCM framework robust against such "noisy" schemas, we propose to integrate it with an ensemble approach by randomizing the schema data into multiple DCM matchers and aggregating their ranked results by taking majority voting. Last, as our matching algorithms require large-scale schemas in the same domain (e.g., Books and Airfares) as input, we develop an object-focused crawler for effectively collecting query interfaces and a model-differentiation based clustering approach to clustering schemas into their domain hierarchy.
Building cross-browser interfaces for digital libraries with scalable vector graphics (SVG)
Authors: Francis Molina, Brian Sweeney, Ted Willard, André Winter
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We share our experience with developing interactive, crossbrowser strand maps using SVG. These maps will provide educators with free and easy access to carefully selected instructional resources linked to national and state learning goals. We will show the interface in at least two browsers, Internet Explorer with Adobe's SVG Viewer plug-in and Mozilla Firefox.
Sensor-based machine olfaction with neuromorphic models of the olfactory system
Authors: Ricardo Gutierrez-Osuna
Venue:  (2005)

Electronic noses combine an array of cross-selective gas sensors with a pattern recognition engine to identify odors. Pattern recognition of multivariate gas sensor response is usually performed using existing statistical and chemometric techniques. An alternative solution involves developing novel algorithms inspired by information processing in the biological olfactory system. The objective of this dissertation is to develop a neuromorphic architecture for pattern recognition for a chemosensor array inspired by key signal processing mechanisms in the olfactory system. Our approach can be summarized as follows. First, a high-dimensional odor signal is generated from a chemical sensor array. Three approaches have been proposed to generate this combinatorial and high dimensional odor signal: temperature-modulation of a metal-oxide chemoresistor, a large population of optical microbead sensors, and infrared spectroscopy. The resulting high-dimensional odor signals are subject to dimensionality reduction using a self-organizing model of chemotopic convergence. This convergence transforms the initial combinatorial high-dimensional code into an organized spatial pattern (i.e., an odor image), which decouples odor identity from intensity. Two lateral inhibitory circuits subsequently process the highly overlapping odor images obtained after convergence. The first shunting lateral inhibition circuits perform gain control enabling identification of the odorant across a wide range of concentration. This shunting lateral inhibition is followed by an additive lateral inhibition circuit with center-surround connections. These circuits improve contrast between odor images leading to more sparse and orthogonal patterns than the one available at the input. The sharpened odor image is stored in a neurodynamic model of a cortex. Finally, anti-Hebbian/Hebbian inhibitory feedback from the cortical circuits to the contrast enhancement circuits performs mixture segmentation and weaker odor/background suppression, respectively. We validate the models using experimental datasets and show our results are consistent with recent neurobiological findings.
Open Caps and Cups in Planar Point Sets
Authors: Pavel Valtr
Venue: Discrete Computational Geometry (2007)

Points p1,p2,...,pk in the plane, ordered in the x-direction, form a k-cap (k-cup}, respectively) if they are in convex position and p2,...,pk-1 lie all above (below, respectively) the segment p1pk. We prove the following generalization of the Erdos-Szekeres theorem. For any k, any sufficiently large set P of points in general position contains k points, p11,p2,...,pk, that form either a k-cap or a k-cup, and there is no point of P vertically above the polygonal line p1p2&#x00b7;&#x00b7;&#x00b7;pk. We give double-exponential lower and upper bounds on the minimal size of P. We also give several related results.