نتایج جستجو برای: shafi
تعداد نتایج: 150 فیلتر نتایج به سال:
In an emerging computing paradigm, computational capabilities, from processing power to storage capacities, are offered to users over communication networks as a service. This new paradigm holds enormous promise for increasing the utility of computationally weak devices. A natural approach is for weak devices to delegate expensive tasks, such as storing a large file or running a complex computa...
We consider gravity mediated supersymmetry (SUSY) breaking in 5D spacetime with two 4D branes B1 and B2 separated in the extra dimension. Using an off-shell 5D supergravity (SUGRA) formalism, we argue that the SUSY breaking scales could be non-universal even at the fundamental scale in brane world setting, since SUSY breaking effects could be effectively localized. As an application, we suggest...
We implement inflation in a supersymmetric SU(5) model with U(1)R symmetry such that the cosmic microwave anisotropy δT/T is proportional to (M/MPlanck) 2, where M ∼ MGUT = 2 − 3 × 1016 GeV, the SU(5) breaking scale, and MPlanck = 1.2 × 1019 GeV. The presence of a global U(1)X symmetry, spontaneously broken also at scale MGUT , provides an upper bound M2 GUT /MPlanck ∼ 1014 GeV on the masses of...
The supersymmetric sector of minimal supersymmetric standard model (MSSM) possesses a U(1) R-symmetry which contains Z2 matter parity. Non-zero neutrino masses, consistent with a ‘redefined’ R-symmetry, are possible through the see-saw mechanism and/or a pair of superheavy (mass M) SU(2)L triplets with vev ∼ M 2 W /M . If this R-symmetry is respected by the higher order terms, then baryon numbe...
The supersymmetric sector of minimal supersymmetric standard model (MSSM) possesses a U(1) R-symmetry which contains Z2 matter parity. Non-zero neutrino masses, consistent with a ‘redefined’ R-symmetry, are possible through the see-saw mechanism and/or a pair of superheavy (mass M) SU(2)L triplets with vev ∼ M 2 W /M . If this R-symmetry is respected by the higher order terms, then baryon numbe...
We present a designated verifier CS proof system for polynomial time computations. The proof system can only be verified by a designated verifier: one who has published a public-key for which it knows a matching secret key unknown to the prover. Whereas Micali’s CS proofs require the existence of random oracles, we can base soundness on computational assumptions: the existence of leveled fully ...
We discuss a five dimensional inflationary scenario based on a supersymmetric SO(10) model compactified on S/(Z2 × Z ′ 2). Inflation is implemented through scalar potentials on four dimensional branes, and a brane-localized Einstein-Hilbert term plays an essential role. The orbifold boundary conditions break the SO(10) gauge symmetry to SU(4)c×SU(2)L×SU(2)R (≡ H). The inflationary scenario yiel...
In zero-knowledge proofs of knowledge, a single prover tries to convince a single verifier that he has possession of some knowledge s. The verifier accepts with probability 1 if the prover is honest (completeness), and rejects with high probability otherwise (soundness). In either case, the verifier learns nothing about s other than the bit of information as to whether or not the prover knows s...
M. Dugger, J. P. Ball, P. Collins, E. Pasyuk, B. G. Ritchie, G. Adams, P. Ambrozewicz, E. Anciant, M. Anghinolfi, B. Asavapibhop, G. Asryan, G. Audit, H. Avakian, H. Bagdasaryan, N. Baillie, N. A. Baltzell, S. Barrow, V. Batourine, M. Battaglieri, K. Beard, I. Bedlinskiy, M. Bektasoglu,* M. Bellis, N. Benmouna, B. L. Berman, N. Bianchi, A. S. Biselli, B. E. Bonner, S. Bouchigny, S. Boiarinov, R...
We consider three problems in machine learning: * concept learning in the PAC model * mobile robot environment learning * learning-based approaches to protein folding prediction In the PAC framework, we give an efficient algorithm for learning any function on k terms by general DNF. On the other hand, we show that in a well-studied restriction of the PAC model where the learner is not allowed t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید