1,190 research outputs found
PP-OMDS: An Effective and Efficient Framework for Supporting Privacy-Preserving OLAP-based Monitoring of Data Streams
No full textPP-OMDS: An Effective and Efficient Framework for Supporting Privacy-Preserving OLAP-based Monitoring of Data Stream
Privacy-Preserving OLAP-based monitoring of data streams: The PP-OMDS approach
No full textIn this paper, we propose PP-OMDS (Privacy-Preserving OLAP-based Monitoring of Data Streams), an innovative framework for supporting the OLAP-based monitoring of data streams, which is relevant for a plethora of application scenarios (e.g., security, emergency management, and so forth), in a privacy-preserving manner. The paper describes motivations, principles and achievements of the PP-OMDS framework, along with technological advancements and innovations. We also incorporate a detailed comparative analysis with competitive frameworks, along with a trade-off analysis
Pseudorandom Self-Reductions for NP-Complete Problems
No full textA language L is random-self-reducible if deciding membership in L can be reduced (in polynomial time) to deciding membership in L for uniformly random instances. It is known that several "number theoretic" languages (such as computing the permanent of a matrix) admit random self-reductions. Feigenbaum and Fortnow showed that NP-complete languages are not non-adaptively random-self-reducible unless the polynomial-time hierarchy collapses, giving suggestive evidence that NP may not admit random self-reductions. Hirahara and Santhanam introduced a weakening of random self-reductions that they called pseudorandom self-reductions, in which a language L is reduced to a distribution that is computationally indistinguishable from the uniform distribution. They then showed that the Minimum Circuit Size Problem (MCSP) admits a non-adaptive pseudorandom self-reduction, and suggested that this gave further evidence that distinguished MCSP from standard NP-Complete problems.
We show that, in fact, the Clique problem admits a non-adaptive pseudorandom self-reduction, assuming the planted clique conjecture. More generally we show the following. Call a property of graphs π hereditary if G ∈ π implies H ∈ π for every induced subgraph of G. We show that for any infinite hereditary property π, the problem of finding a maximum induced subgraph H ∈ π of a given graph G admits a non-adaptive pseudorandom self-reduction
Potential Function Analysis of Greedy Hot-Potato Routing (Extended Abstract)
No full textAmir Ben-Dor Shai Halevi y Assaf Schuster z January 21, 1994 Abstract In this work we study the problem of packet routing in synchronous networks of processors, in which at most one packet can traverse any communication link in each time step. We consider a class of algorithms known as hot-potato or deflection routing algorithms. The important characteristic of these algorithms is that they use no buffer space for storing delayed packets. Each packet, unless already arrived to its destination, must leave the processor at the step following its arrival. The main advantage in hot-potato routing is that there is no need to store delayed packets in the processors, and therefore, the processors can be much simpler, and contain less hardware. This work is concerned with greedy routing, in which a packet is bound to use an out-going link in the direction of its destination, whenever such a link is available. In this way, greediness guarantees that, unless some global congestion forbids..
GNSS Vulnerabilities - Providing Maximum User Protection
No full text03.06.13 KB. Ok to add to Spiral, copyright with the author
Light of the World: The Life and Legacy of Nur Jahan
No full textAbout the Author
Maggie Schuster is a recent graduate from the University of Minnesota. She graduated in May 2017 with a major in Art History and minor in Gender Women and Sexuality Studies
Randomized Single-Target Hot-Potato Routing
No full textWe present randomized hot-potato routing algorithms on d-dimensional meshes and on the n-dimensional hypercube. The algorithms are designed for routing many packets to a single destination, or a relatively small number of destinations. The important feature, which was not obtained previously, is that the algorithms utilize the higher in-degree of the nodes and are asymptotically optimal. A preliminary version was presented at the 3rd ISTCS 1995 (Israeli Symp. on the Theory of Computing Systems). y This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. z Department of Computer Science, Technion, Haifa, Israel 32000. E-mail: [email protected] x Mathematics and Computer Science, Haifa University, Haifa, Israel 31905. E-mail: [email protected] -- Department of Computer Science, Technion, Haifa, Israel 32000. E-mail: [email protected] 1 Introduction In this work we..
1 BOUNDS AND ANALYSIS TECHNIQUES FOR GREEDY HOT-POTATO ROUTING
No full textABSTRACT In this chapter we consider a type of packet routing known as hot-potato routing. In hot-potato routing there is no intermediate storage for the packets (messages) that are on their way to their destinations, which is an important feature for communication networks that are based on optical hardware and for which the messages are composed of beams of light. In particular we consider a "practical " mode of routing, known as greedy routing. In greedy routing, unless some local congestion forbids it, an intermediate network node always attempts to send packets towards their destinations. We present several algorithms and analysis methods that were recently suggested by the author and his colleagues for greedy routing, along with some negative results by means of a general lowerbound
Near Wall PIV-Measurements on the Windward Slope of a Hill
No full textThe turbulent flow over periodic hills was measured near to the wall, using planar Particle-Image-Velocimetry (PIV) at high spatial resolution. Our focus is on the near wall turbulence structure on the windward slope of the hill. For large-eddy simulation (LES) we suspect that, if this was not predicted accurately, it affects the prediction of the velocity profiles over the hill crest which in turn will affect the recirculation length downstream of the hill. Regarding the time averaged velocities, we were able to resolve the linear viscous region of the boundary layer. The velocity distribution and also the Reynolds stress does not comply with the law of the wall as it is valid for a turbulent boundary layer at equilibrium
European psychotraumatology – alongside the recent European history
No full textThis article outlines a personal reflection of experiences within the field of traumatic stress, especially in relation to specific events, which affected the author's professional life. Conclusions for further challenges for European Society for Traumatic Stress Studies (ESTSS) are delineated. ESTSS's role in the global network of traumatic stress societies is discussed. This is a personal view of Brigitte Lueger-Schuster, president of ESTSS on behalf of the 20th birthday of ESTSS
- …
