Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
home > search

Now showing items 17 - 32 of 143315

  • M. S. Burnaby Munson

    Download Collect
  • P/S WAVE MEASUREMENT AND COMPENSATION

    A method for use in surveying a subsurface region beneath a body of water by detecting S waves propagating through the subsurface region. The method comprises using a first sensor configuration to detect mixed S and P waves on or in the subsurface region, using a second sensor configuration located on or in relatively close proximity to the subsurface region to detect P waves in the water, and using the P waves detected in the water to compensate the detected mixed S and P waves, and thereby attenuate the effects of P waves in the mixed S and P waves.
    Download Collect
  • Lipschitz (p,r,s)-integral operators and Lipschitz (p,r,s)-nuclear operators

    Belacel, Amar   Chen, Dongyang  

    We introduce the notions of strongly Lipschitz (p, r, s)-nuclear operators and strongly Lipschitz (p, r, s)-integral operators. We develop a theory of strongly Lipschitz (p, r, s)-nuclear operators and strongly Lipschitz (p, r, s)-integral operators which closely parallels the theory for linear operators. Their close relationships with other Lipschitz operator ideals are studied. (C) 2018 Elsevier Inc. All rights reserved.
    Download Collect
  • Constacyclic codes of arbitrary lengths over ring(Z_{p^m } + vZ_{p^m })

    Huang, Lei   Zhu, Shixin  

    By constructing a Gray map, constacyclic codes of arbitrary lengths over ring \(R = Z_{p^m } + vZ_{p^m }\) are studied, where v 2 = v The structure of constacyclic codes over R and their dual codes are obtained. A necessary and sufficient condition for a linear code to be self-dual constacyclic is given. In particular, (1+(v+1)αp)-constacyclic codes over R are classified in terms of generator polynomial, where α is a unit of \(Z_{p^m }\).
    Download Collect
  • Group gradings on the superalgebras M ( m , n ), A ( m , n ) and P ( n )

    Hornhardt Caio De Naday   Dos Santos Helen Samara   Kochetov Mikhail  

    Download Collect
  • Beating the S&P 500 Index

    Campasano, Jim  

    Download Collect
  • Professor M. S. Agwani 1928–2018

    Dietl, Gulshan  

    Download Collect
  • S. Beames and M. Brown,

    Alan Price  

    Download Collect
  • S=EX2 || Learning from S&M Clubs

    Estupinyà   Pere  

    Download Collect
  • Log P , a yesterday\"s value?

    Vraka, Chrysoula   Nics, Lukas   Wagner, Karl-Heinz   Hacker, Marcus   Wadsak, Wolfgang   Mitterhauser, Markus  

    Download Collect
  • S=EX² || Learning from S&M Clubs

    Estupinyà, Pere  

    Download Collect
  • Income inequality in S&P 500 companies

    Uygur, Ozge  

    Download Collect
  • Half-Matrix Normal Basis Multiplier Over GF(p(m))

    Trujillo-Olaya, Vladimir   Velasco-Medina, Jaime  

    In this paper, we propose two new algorithms and their hardware implementations for the normal basis multiplication over GF(p(m)), where p is an element of {2, 3}. In this case, the proposed multipliers are designed using serial and digit-serial hardware architectures. The normal basis multipliers over GF(2(m)) and GF(3(m)) are based on two proposed algorithms to compute the multiplication matrices T-k in order to speed-up the execution time and to reduce the area resources. It can be seen that the new hardware architecture for the NB multiplier over GF(2(m)) has the best characteristics of area complexity presented by Reyhani [16] and time complexity presented by Azarderakhsh and Reyhani [31]. The proposed hardware architectures for the normal basis multipliers over GF(2(163)), GF(2(233)), GF(2(283)), GF(2(409)), GF(3(89)) and GF(3(233)) were described in VHDL, and simulated and synthesized using Modelsim and Quartus Prime v16, respectively.
    Download Collect
  • Reply to: Letter to the Editor by M. Olsen, M. K. Sharp, and P. M. Bossuyt

    Michel Shamy  

    Download Collect
  • On Z(p)(r) Z(p)(s)-additive codes

    Aydogdu, Ismail   Siap, Irfan  

    In this paper, we study the algebraic structure of Z(p)(r) Z(p)(s)-additive codes which are Z-submodules where p is prime, and r and s are positive integers. Z(p)(r) Z(p)(s) additive codes naturally generalize Z(2)Z(4) and Z(2)Z(2)s-additive codes which have been introduced recently. The results obtained in this work generalize a great amount of the studies done on additive codes. Especially, we determine the standard forms of generator and parity-check matrices for this family of codes. This leads to the identification of the type and the cardinalities of these codes. Furthermore, we present some bounds on the minimum distance and examples that attain these bounds. Finally, we present some illustrative examples for some special cases.
    Download Collect
  • Idex joins S&P 500

    Download Collect
1 2 3 4 5 6 7 8 9 10

Contact

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

Submit Feedback