336,138 Hits in 1.8 sec

Probabilistic encryption

Shafi Goldwasser, Silvio Micali
1984 Journal of computer and system sciences (Print)  
functions.  ...  One of the most important and fundamental discoveries of Theoretical Computer Science is the surprising connection between the computational power of randomness, and computational lower bounds on explicit  ...  How to construct pseudorandom permutations from pseudoran- dom functions. SIAM Journal on Comput- ing, 17:373-386, 1988. Extended abstract in FOCS86. [14] N. Nisan.  ... 
doi:10.1016/0022-0000(84)90070-9 fatcat:kh42wiacs5c2nmu4rm6svvqmpa

Pseudo-Cryptanalysis of Luffa [chapter]

Keting Jia, Yvo Desmedt, Lidong Han, Xiaoyun Wang
2011 Lecture Notes in Computer Science  
The pseudocollisions and pseudo-second-preimages can be found easily by computing the inverse of the message injection function at the beginning of Luffa.  ...  For Luffa-384, finding a pseudo-preimage needs about 2 64 iteration computations with 2 67 bytes memory by the extended generalized birthday attack.  ...  We use the extended generalized birthday attack [7] to compute the pseudopreimage of Luffa-384 with 2 64 iteration computations and 2 64 table lookups.  ... 
doi:10.1007/978-3-642-21518-6_14 fatcat:zu5bf7dwwzfanmiv5dhhpzq3ku

Page 6521 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
This allows one to handle linear pseudo-Boolean constraints with specialized methods for extended clauses. The implementation and computational results are described.  ...  In Chapter 7, the author presents a method for trans- forming linear pseudo-Boolean constraints into extended clauses.  ... 

Approximation of Jacobian Inverse Kinematics Algorithms: Differential Geometric vs. Variational Approach

Joanna Karpińska, Krzysztof Tchoń, Mariusz Janiak
2012 Journal of Intelligent and Robotic Systems  
Specifically, we focus on the approximation of the Jacobian pseudo inverse by the extended Jacobian algorithm.  ...  The distribution corresponding to the Jacobian pseudo inverse is non-integrable, while that associated with the extended Jacobian is integrable.  ...  Computations The solutions of problems 1 and 2 provided by the approximate extended Jacobian algorithms and the original, Jacobian pseudo inverse algorithm, are displayed in Figs. 3 and 4 .  ... 
doi:10.1007/s10846-012-9679-4 fatcat:mjtqmwvifvgwvogcnyrwp5tjwa

A generalized scheme for mapping parallel algorithms

V. Chaudhary, J.K. Aggarwal
1993 IEEE Transactions on Parallel and Distributed Systems  
The objective functions include minimizing the communication overhead and minimizing the total execution time which includes both computation and communication times.  ...  Using these representations, we generate a new graphical representation (extended host graph) on which the problem graph is mapped.  ...  Fig. 17 shows the extended host graph and the mappings of processes onto pseudo-processors.  ... 
doi:10.1109/71.210815 fatcat:2n5r5t5pjnejxcl3de4qfqufvi

Multi-reference extension to virtual crystal approximation pseudo-potentials

Akihito Kikuchi
2015 Computational materials science  
In this study a computational method of the multi-reference VCA(virtual crystal approximation) pseudo-potential generation is presented. This is an extension of that proposed Ramer and Rappe [J.  ...  To compensate this drawback, a kind of fine tuning applied to the non-multi-reference VCA pseudo-potential; the form of the pseudo-potential is slightly modified within the cut-off radius in order that  ...  For this purpose, φ V CA 1,l (r) is extended toward the origin (r=0) by some analytic function.  ... 
doi:10.1016/j.commatsci.2015.07.014 fatcat:xhf2hlz2zvgf3kiuw3ufv3zo3a

Pseudo affine Wigner distributions: definition and kernel formulation

P. Goncalves, R.G. Baraniuk
1998 IEEE Transactions on Signal Processing  
Bertrand, these new time-scale distributions support efficient online operation at the same computational cost as the continuous wavelet transform.  ...  In this paper, we introduce a new set of tools for time-varying spectral analysis: the pseudo affine Wigner distributions. Based on the affine Wigner distributions of J. and P.  ...  Flandrin for setting us on the path to the pseudo affine Wigner distributions. They also thank J. and P. Bertrand and the reviewers for their insightful comments and suggestions.  ... 
doi:10.1109/78.678464 fatcat:jrjbukpq5zdlhe7u77ypbejrjq

Duality between two cryptographic primitives [chapter]

Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
1991 Lecture Notes in Computer Science  
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions.  ...  function.  ...  A string generator extending n-bit input into`(n)-bit output strings is a deterministic polynomial time computable function g : D !  ... 
doi:10.1007/3-540-54195-0_66 fatcat:gs5r4twblzhtpp4i4gli7ou2ni

Extending the Network Calculus Algorithmic Toolbox for Ultimately Pseudo-Periodic Functions: Pseudo-Inverse and Composition [article]

Raffaele Zippo, Paul Nikolaus, Giovanni Stea
2022 arXiv   pre-print
Previous work identified the class of piecewise affine functions which are ultimately pseudo-periodic (UPP) as being closed under the main NC operations and able to be described finitely.  ...  In this paper, we introduce algorithms for the above operations when operands are UPP curves, thus extending the available algorithmic toolbox for NC.  ...  In this paper, we aim to fill this gap and extend the existing algorithm toolbox to include lower-and upper-pseudo inverses and composition of functions.  ... 
arXiv:2205.12139v1 fatcat:2sqcsvplbrcirdzrm2e46yu5s4

Using relations between stress and fluid pressure for improved compaction modelling in flow simulation and increased efficiency in coupled rock mechanics simulation

O. Pettersen
2008 Petroleum Geoscience  
The conventional compaction model used in reservoir simulators defines compaction as a function of fluid pressure, whereas, in reality, it is a function of effective stress.  ...  Overall computing time is thereby reduced considerably, while maintaining accuracy in the stress computations.  ...  function for the central pseudo-material region, and the other pseudo-compaction functions are constructed simply by scaling of m l .  ... 
doi:10.1144/1354-079308-718 fatcat:q5ydpc6wlnaezkomo3uvgmg7qi

Pseudo-Lucas Functions of Fractional Degree and Applications

Clemente Cesarano, Pierpaolo Natalini, Paolo Emilio Ricci
2021 Axioms  
For the second kind, the representation formulas for the fractional powers of a r×r matrix, already introduced by using the pseudo-Chebyshev functions, are extended to the Lucas case.  ...  In this article, we introduce the first and second kinds of pseudo-Lucas functions of fractional degree, and we show possible applications of these new functions.  ...  of pseudo-Chebyshev functions [22, 23, 27] , we limit ourselves to recall the the case of the square root a 3 × 3 matrix, but the obtained formulas can be extended to more general roots, with the due  ... 
doi:10.3390/axioms10020051 fatcat:r3jsilmwszeunj5xzpive7uhne

Solving Inverse Kinematics – A New Approach to the Extended Jacobian Technique

M. Šoch, R. Lórencz
2005 Acta Polytechnica  
Then a new approach based on the Extended Jacobian technique is compared with the current Jacobian Inversion method.  ...  The presented method is intended for use in the field of computer graphics for animation of articulated structures.  ...  Penalty function methods Another method adds penalty functions to the objective function.  ... 
doaj:1f62a523be0941c6aa2708f1a48d6094 fatcat:alkpbvsgobf5ddktc5ohftfhpq

Clustering Very Large Dissimilarity Data Sets [chapter]

Barbara Hammer, Alexander Hasenfuss
2010 Lecture Notes in Computer Science  
pseudo-Euclidean space: given D, we can compute corresponding vectors x such that x i , x j pq = d ij holds for all data points.  ...  This cost function relies on the pseudo-Euclidean embedding and has no meaning if only the dissimilarity matrix D is available.  ... 
doi:10.1007/978-3-642-12159-3_24 fatcat:47mzdrblvvh7lpu56nqcf3u7zq

Page 2093 of Mathematical Reviews Vol. , Issue 88d [page]

1988 Mathematical Reviews  
Extended quasi-gcd computation consists in finding such h and additional cofactors u, v such that |u f + vg —h| < e|h|.  ...  One of these uses an arbitrary polynomially computable function T(x), called a test.  ... 

Light-Weight Containers for Isabelle: Efficient, Extensible, Nestable [chapter]

Andreas Lochbihler
2013 Lecture Notes in Computer Science  
| Not bexp | And bexp bexp | Or bexp bexp type synonym literal = nat × bool shallow embedding type synonym clause = literal set of CNF formulas: type synonym cnf = clause set set of sets of literals function  ...  | Not bexp | And bexp bexp | Or bexp bexp type synonym literal = nat × bool shallow embedding type synonym clause = literal set of CNF formulas: type synonym cnf = clause set set of sets of literals function  ...  P y }) = P x impl. set, coset :: α list ⇒ α set (x ∈ set xs) = ( memb (op =) xs x) (x ∈ coset xs) = (¬memb (op =) xs x)new pseudo-constructors pattern-matching on pseudo- compute A = . . . compute .  ... 
doi:10.1007/978-3-642-39634-2_11 fatcat:4agtuvt6sndwjp57y4thpvgocq
« Previous Showing results 1 — 15 out of 336,138 results