نتایج جستجو برای: tadao ando

تعداد نتایج: 822  

Journal: :Linear & Multilinear Algebra 2022

For positive definite matrices A and B, the Kubo-Ando matrix power mean is defined as P?(p,A,B)=A1/2(1+(A?1/2BA?1/2)p2)1/pA1/2(p?0). In this paper, for 0?p?1?q, we show that if one of following inequalities f(P?(p,A,B))?f(P?(1,A,B))?f(P?(q,A,B)) holds any then function f operator monotone on (0,?). We also study inverse problem non-Kubo-Ando means with powers 1/2 2. As a consequence, establish ...

Journal: :Proceedings of the American Mathematical Society 1996

Journal: :Rheumatology 2009
Doru T Alexandrescu Thomas E Ichim Filamer Kabigting Constantin A Dasanu

MOTOHISA YAMAMOTO, HIROKI TAKAHASHI, KOHHEI HASEBE, CHISAKO SUZUKI, YASUYOSHI NAISHIRO, TOSHIAKI HAYASHI, HIROYUKI YAMAMOTO, TADAO ISHIDA, YASUHISA SHINOMURA First Department of Internal Medicine, Sapporo Medical University School of Medicine, Department of General Internal Medicine, Teine Keijinkai Hospital and Biomedical Research Center, Department of Biomedical Engineering, Sapporo Medical U...

Journal: :Discrete Mathematics 2007
Aidan Roy Gordon F. Royle

We determine the rank and chromatic number of the complements of all Kasami graphs, some of which form an infinite family of counterexamples to the now disproven rank-coloring conjecture. © 2006 Elsevier B.V. All rights reserved.

2013
Anatolii Leukhin Oscar Moreno Andrew Z. Tirkel

Single sequences like Legendre have high linear complexity. Known CDMA families of sequences all have low linear complexities. A new method is presented for constructing CDMA sequence sets with the linear complexity of the Legendre sequences, from new frequency hop patterns. Linear complexity is a measure of the robustness of a sequence to cryptographic attack. These are the first families whos...

2011
LAJOS MOLNÁR

Under some mild conditions, the general form of bijective transformations of the set of all positive linear operators on a Hilbert space which preserve a symmetric mean in the sense of Kubo-Ando theory is described.

Journal: :Information and Control 1971
Harry T. Hsu

In this paper, a class of shortened cyclic codes for a compound channel will be presented. This class of cyclic codes can be used for combating noises in a practical channel, where both burst errors and random errors occur. As compared with the results of a previous paper by Hsu, Kasami, and Chien (1968) (henceforward will be referred to as HKC codes), the shortened cyclic codes presented will ...

2008
S B Gayen D Patranabis

This paper presents implementation of Tadao Kasami decoding algorithm for improved error trapping decoding and firmware realization details. Algorithm has been applied to cyclic (n, k) codes [Golay (23, 12) and BCH (31, 16)] for triple error correction. Microblaze 32-bit soft core processor was used with a Xilinx Spartan3 FPGA. To test decoder functionality, a test procedure with all possible e...

2014
Yukiko Nakamura Farit Mochamad Afendi Aziza Kawsar Parvin Naoaki Ono Ken Tanaka Aki Hirai Morita Tetsuo Sato Tadao Sugiura Md. Altaf-Ul-Amin Shigehiko Kanaya

the Relationships Between Metabolites and Biological Activities Yukiko Nakamura, Farit Mochamad Afendi, Aziza Kawsar Parvin, Naoaki Ono, Ken Tanaka, Aki Hirai Morita, Tetsuo Sato, Tadao Sugiura, Md. Altaf-Ul-Amin and Shigehiko Kanaya* Graduate School of Information Science, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma-shi, Nara, 630-0192 Japan Biopharmaca Research Center...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید