Search results for "Hard"
showing 10 items of 2294 documents
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…
Polynomial method to study the entanglement of pure N-qubit states
2009
We present a mapping which associates pure N-qubit states with a polynomial. The roots of the polynomial characterize the state completely. Using the properties of the polynomial we construct a way to determine the separability and the number of unentangled qubits of pure N-qubit states.
Multi-valued F-contractions and the solution of certain functional and integral equations
2013
Wardowski [Fixed Point Theory Appl., 2012:94] introduced a new concept of contraction and proved a fixed point theorem which generalizes Banach contraction principle. Following this direction of research, we will present some fixed point results for closed multi-valued F-contractions or multi-valued mappings which satisfy an F-contractive condition of Hardy-Rogers-type, in the setting of complete metric spaces or complete ordered metric spaces. An example and two applications, for the solution of certain functional and integral equations, are given to illustrate the usability of the obtained results.
Modulus of continuity with respect to semigroups of analytic functions and applications
2016
Abstract Given a complex Banach space E , a semigroup of analytic functions ( φ t ) and an analytic function F : D → E we introduce the modulus w φ ( F , t ) = sup | z | 1 ‖ F ( φ t ( z ) ) − F ( z ) ‖ . We show that if 0 α ≤ 1 and F belongs to the vector-valued disc algebra A ( D , E ) , the Lipschitz condition M ∞ ( F ′ , r ) = O ( ( 1 − r ) 1 − α ) as r → 1 is equivalent to w φ ( F , t ) = O ( t α ) as t → 0 for any semigroup of analytic functions ( φ t ) , with φ t ( 0 ) = 0 and infinitesimal generator G , satisfying that φ t ′ and G belong to H ∞ ( D ) with sup 0 ≤ t ≤ 1 ‖ φ ′ ‖ ∞ ∞ , and in particular is equivalent to the condition ‖ F − F r ‖ A ( D , E ) = O ( ( 1 − r ) α ) as r …
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Online Scheduling of Task Graphs on Heterogeneous Platforms
2020
Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous $4\sqrt{m/k}$ 4 m / k -competitive online algorithm by Amaris et al. [1] , where $m$ m is the number of CPUs and $k$ k the number of GPUs ( $m\geq k$ m ≥ k ). We prove that no online…
Embedding of analytic function spaces with given mean growth of the derivative
2006
MSC (2000) 30D55 If φ is a positive function defined in (0,1) and 0 <p< ∞, we consider the space L(p, φ) which consists of all functions f analytic in the unit disc D for which the integral means of the derivative Mp(r, f � )= " 1 2π Rπ −π þ f � (re iθ ) þ p dθ "1/p , 0 <r< 1, satisfy M p(r, f � )=O (φ(r)) ,a sr → 1. In this paper, for any given p ∈ (0,1), we characterize the functions φ, among a certain class of weight functions, to be able to embedd L(p, φ) into classical function spaces. These results complement other previously obtained by the authors for p ≥ 1. c
172 REAL TIME EDGES DETECTION USING WAVELET TRANSFORM
2000
One of the way to extract edges uses the fast wavelet transform algorithm. This technique allows the detection of multiscale edges and is used to detect all the details, which are in a picture by modifying the scale. The real time application for edge detection involves the implementation of the algorithm on an integrated circuit like a FPGA and the development of an appropriated board. This article deals about the implementation of a wavelet transform algorithm onto a FPGA and development of an electronic board to detect multiscale edges.
The differences between distributed shared memory caching and proxy caching
2000
The authors discuss the similarities in caching between the extensively studied distributed shared memory systems and the emerging proxy systems. They believe that several of the techniques used in distributed shared memory systems can be adapted and applied to proxy systems.
Programming languages for data-Intensive HPC applications: A systematic mapping study
2020
This work is a result of activities from COST Action 10406 High -Performance Modelling and Simulation for Big Data Applications (cHiPSet), funded by the European Cooperation in Science and Technology. FCT, Portugal for grants: NOVA LINCS Research Laboratory Ref. UID/ CEC/ 04516/ 2019); INESC-ID Ref. UID/CEC/50021/2019; BioISI Ref. UID/MULTI/04046/2103; LASIGE Research Unit Ref. UID/CEC/00408/ 2019. A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity…