188,379 research outputs found

    Purging of untrustworthy recommendations from a grid

    Full text link
    In grid computing, trust has massive significance. There is lot of research to propose various models in providing trusted resource sharing mechanisms. The trust is a belief or perception that various researchers have tried to correlate with some computational model. Trust on any entity can be direct or indirect. Direct trust is the impact of either first impression over the entity or acquired during some direct interaction. Indirect trust is the trust may be due to either reputation gained or recommendations received from various recommenders of a particular domain in a grid or any other domain outside that grid or outside that grid itself. Unfortunately, malicious indirect trust leads to the misuse of valuable resources of the grid. This paper proposes the mechanism of identifying and purging the untrustworthy recommendations in the grid environment. Through the obtained results, we show the way of purging of untrustworthy entities.Comment: 8 pages, 4 figures, 1 table published by IJNGN journal; International Journal of Next-Generation Networks (IJNGN) Vol.3, No.4, December 201

    A note on convexity of sections of quaternionic numerical range

    Full text link
    The quaternionic numerical range of matrices over the ring of quaternions is not necessarily convex. We prove Toeplitz-Hausdorff like theorem, that is, for any given quaternionic matrix every section of its quaternionic numerical range is convex. We provide some additional equivalent conditions for the quaternionic numerical range of matrices over quaternions to be convex and prove some numerical radius inequalities

    Alias-free, real coefficient m-band QMF banks for arbitrary m

    Get PDF
    Based on a generalized framework for alias free QMF banks, a theory is developed for the design of uniform QMF banks with real-coefficient analysis filters, such that aliasing can be completely canceled by appropriate choice of real-coefficient synthesis filters. These results are then applied for the derivation of closed-form expressions for the synthesis filters (both FIR and IIR), that ensure cancelation of aliasing for a given set of analysis filters. The results do not involve the inversion of the alias-component (AC) matrix

    An Alternate Construction of an Access-Optimal Regenerating Code with Optimal Sub-Packetization Level

    Full text link
    Given the scale of today's distributed storage systems, the failure of an individual node is a common phenomenon. Various metrics have been proposed to measure the efficacy of the repair of a failed node, such as the amount of data download needed to repair (also known as the repair bandwidth), the amount of data accessed at the helper nodes, and the number of helper nodes contacted. Clearly, the amount of data accessed can never be smaller than the repair bandwidth. In the case of a help-by-transfer code, the amount of data accessed is equal to the repair bandwidth. It follows that a help-by-transfer code possessing optimal repair bandwidth is access optimal. The focus of the present paper is on help-by-transfer codes that employ minimum possible bandwidth to repair the systematic nodes and are thus access optimal for the repair of a systematic node. The zigzag construction by Tamo et al. in which both systematic and parity nodes are repaired is access optimal. But the sub-packetization level required is rkr^k where rr is the number of parities and kk is the number of systematic nodes. To date, the best known achievable sub-packetization level for access-optimal codes is rk/rr^{k/r} in a MISER-code-based construction by Cadambe et al. in which only the systematic nodes are repaired and where the location of symbols transmitted by a helper node depends only on the failed node and is the same for all helper nodes. Under this set-up, it turns out that this sub-packetization level cannot be improved upon. In the present paper, we present an alternate construction under the same setup, of an access-optimal code repairing systematic nodes, that is inspired by the zigzag code construction and that also achieves a sub-packetization level of rk/rr^{k/r}.Comment: To appear in National Conference on Communications 201

    On Rational Sets in Euclidean Spaces and Spheres

    Full text link
    IFor a positive rational ll, we define the concept of an ll-elliptic and an ll-hyperbolic rational set in a metric space. In this article we examine the existence of (i) dense and (ii) infinite ll-hyperbolic and ll-ellitpic rationals subsets of the real line and unit circle. For the case of a circle, we prove that the existence of such sets depends on the positivity of ranks of certain associated elliptic curves. We also determine the closures of such sets which are maximal in case they are not dense. In higher dimensions, we show the existence of ll-ellitpic and ll-hyperbolic rational infinite sets in unit spheres and Euclidean spaces for certain values of ll which satisfy a weaker condition regarding the existence of elements of order more than two, than the positivity of the ranks of the same associated elliptic curves. We also determine their closures. A subset TT of the kk-dimensional unit sphere SkS^k has an antipodal pair if both x,xTx,-x\in T for some xSkx\in S^k. In this article, we prove that there does not exist a dense rational set TS2T\subset S^2 which has an antipodal pair by assuming Bombieri-Lang Conjecture for surfaces of general type. We actually show that the existence of such a dense rational set in SkS^k is equivalent to the existence of a dense 22-hyperbolic rational set in SkS^k which is further equivalent to the existence of a dense 1-elliptic rational set in the Euclidean space Rk\mathbb{R}^k.Comment: 20 page

    Analytic Light-Curves of Gamma-Ray Burst Afterglows: Homogeneous versus Wind External Media

    Get PDF
    Assuming an adiabatic evolution of a Gamma-Ray Burst (GRB) remnant interacting with an external medium, we calculate the injection, cooling, and absorption break frequencies, and the afterglow flux for plausible orderings of the break and observing frequencies. The analytical calculations are restricted to a relativistic remnant and, in the case of collimated ejecta, to the phase where there is an insignificant lateral expansion. Results are given for both a homogeneous external medium and for a wind ejected by the GRB progenitor. We compare the afterglow emission at different observing frequencies, for each type of external medium. It is found that observations at sub-millimeter frequencies during the first day provide the best way of discriminating between the two models. By taking into account the effect of inverse Compton scatterings on the electron cooling, a new possible time-dependence of the cooling break is identified. The signature of the up-scattering losses could be seen in the optical synchrotron emission from a GRB remnant interacting with a pre-ejected wind, as a temporary mild flattening of the afterglow decay. The up-scattered radiation itself should be detected in the soft X-ray emission from GRB remnants running into denser external media, starting few hours after the main event.Comment: 11 pages, to be published in the ApJ, vol 54
    corecore