...Florentin Smarandache's account on his visit to Atlanta to participate in the International Conference on Granular Computing, organized by the famous international association of electricity and electronics engineers, on beha...

Merg cu maşina din Gallup, statul New Mexico, SUA, oraşul meu de reşedinţă, la Albuquerque, de unde voi lua avionul pentru Atlanta, capitala statului Georgia, pentru a participa la Conferinţa Internaţională de Calcul Granular (IEEE – GrC 2006), organizată de celebra asociaţie mondială a inginerilor din domeniile electricităţii şi electronicii, pe numele ei oficial Institute of Electrical and Electronics Engineers, Inc, care se scrie prescurtat IEEE (în folclorul savanţilor americani)....

Conferinţa internaţională de calcul granular . Un drum cu... teroare! .................................................. 6 . Ghidaj urban după hartă ............................................... 8 . Suprema onoare – sunt citat de Zadeh ....................... 12 . Asiaticii – 70 % din participanţi! ............................... 13 . În „bucătăria” calculului granular .............................. 14 . Cine-i mai inteligent: omul sau maşina? .................... 16 . În cel mai mare acvariu din lume ............................... 17 . În Atlanta, Pe aripile vântului ................................... 20 . Afacere sau for ştiinţific?! ......................................... 23 . Plimbare cu chinezi prin Atlanta ................................ 25 . Cambei! la restaurantul chinezesc ............................. 27 . Sponsorizarea salvatoare ............................................ 29 . „Exilat” la... clasa I! ................................................... 29 Manneken-Pis! Pregătiri de drum pentru Bruxelles ............................ 31 . Un „Boeing” scuturat! ...........................................

...Professor Florentin Smrandache is invited to spend a period of three months time at the Research Institute of Extension Engineering at Guangdong University of Technology in China in order to conduct research on extenics....

Cu moralul extrem de ridicat, alerg pe autostrada I-40 din Gallup spre aeroportul din Albuquerque. Urlă muzica. Ferestrele deschise. Muzică populară românească, din Banat şi Oltenia, la casetă. Am înregistraţi şi pe cântăreţii mei din Bălceşti: Vasile Oprea (Vasilică a lu’ Tirina, vecinul meu), Mărin Covrig (coleg de şcoală primară şi generală), Gheorghe Lupu (mai mare cu doi ani ca mine, stătea peste drum de casa mea)....

Application / 3 Invitation / 8 Extensica. Fotojurnal instantaneu din Canton / 9 Certificate / 170 Letter / 171

... Finite Interval from one dimension (1D) to 2D, 3D, and in general n-D spaces. Then I used the Extenics, together with Victor Vlădăreanu, Mihai Liviu Smarandache, Tudor Păroiu, and Ştefan Vlăduţescu, in 2D and 3D spaces in technology, philosophy, and information theory....

...Contribution to Extenics (Preface by Florentin Smarandache): 4 1. Generalizations of the Distance and Dependent Function in Extenics to 2D, 3D, and n-D, by Florentin Smarandache: 22 2. Applications of Extenics to 2D-Space and 3D-Space, by Florentin Smarandache...

...This book contains 23 papers, most of which were written by participants to the fifth International Conference on Number Theory and Smarandache Notions held in Shangluo University, China, in March, 2009. In this Conference, several professors gave a talk on Smarandache Notions and many participants lectured on them both extensively and intensively. All th...

3. Remarks Sandor [2] has considered the problem of finding the S-perfect and completely S-perfect numbers, but his proof is not complete. He has proved that the only S-perfect of the form n = p q is n = 6 and there is no S-perfect number of the form n = 2kq where k ¸ 2 is an integer and q is an odd prime. On the other hand, Theorem 2.1 gives all the S-perfect numbers. Again, Sandor only proved that, the only completely S-perfect number of the form n = p2q is n = 28, and all completely S-perfect numbers are given by Theorem 2.2. Theorem 2.1 and Theorem 2.2 ¯nd respectively the S-perfect and completely S-perfect numbers when S(1) = 1. The situation is quite different if one adopts the convention that S(0) = 1. In the latter case, as has been proved by Gronas [3], all completely S-perfect numbers are n = p(prime), 9, 16, 24. All that is known about the S-perfect numbers is that, among the ¯rst 106 numbers, n = 12 is the only S-perfect number (see Ashbacher [4]). In exactly the same way, the Z-perfect and completely Z-perfect numbers may be defined. Thus, given an integer n, 1. ...

...J. Wang : An equation related to the Smarandache power function 1 X. Lu and J. Hu : On the F.Smarandache 3n-digital sequence 5 B. Cheng : An equation involving the Smarandache double factorial function and Euler function 8 A. A. K. Majumdar : S-perfect and c...

In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD code and the binary code as the inner code....

We want to find efficient algebraic methods to improve the realiability of the transmission of messages. In this chapter we give only simple coding and decoding algorithms which can be easily understood by a beginner. Binary symmetric channel is an illustration of a model for a transmission channel. Now we will proceed onto define a linear code algebraically....

Preface 5 Chapter One BASIC CONCEPTS 7 Chapter Two ALGEBRAIC LINEAR CODES AND THEIR PROPERTIES 29 Chapter Three ERASURE DECODING OF MAXIMUM RANK DISTANCE CODES 49 3.1 Introduction 49 3.2 Maximum Rank Distance Codes 51 3.3 Erasure Decoding of MRD Codes 54 Chapter Four MRD CODES –SOME PROPERTIES AND A DECODING TECHNIQUE 63 4.1 Introduction 63 4.2 Error-erasure Decoding Techniques to MRD Codes 64 4.3 Invertible q-Cyclic RD Codes 83 4.4 Rank Distance Codes With Complementary Duals 101 4.4.1 MRD Codes With Complementary Duals 103 4.4.2 The 2-User F-Adder Channel 106 4.4.3 Coding for the 2-user F-Adder Channel 107 Chapter Five EFFECTIVE ERASURE CODES FOR RELIABLE COMPUTER COMMUNICATION PROTOCOLS USING CODES OVER ARBITRARY RINGS 111 5.1 Integer Rank Distance Codes 112 5.2 Maximum Integer Rank Distance Codes 114 Chapter Six CONCATENATION OF ALGEBRAIC CODES 129 6.1 Concatenation of Linear Block Codes 129 6.2 Concatenation of RD Codes With CR-Metric 140 FURTHER READING 153 INDEX 157 ABOUT THE AUTHORS 161...