Wide Band Rectangular Microstrip Antenna using Symmetric T-shaped Feed

Bandwidth enhancement of a rectangular microstrip antenna using a T-shaped microstrip feed is explored in this paper. A 2:1 VSWR impedance bandwidth of 23% is achieved by employing this technique. The far-field patterns are stable across the pass band. The proposed antenna can be used conveniently in broadband communications

FDTD analysis of a symmetric T-strip fed wideband rectangular microstrip antenna

A theoretical analysis of a symmetric T-shaped rnicrostripfed rectangular microstrip antenna using the finite-difference titnedoniain (FDTD) method is presented in this paper. The resonant frequency, return loss, impedance bandwidth, and radiation patterns are predicted and are in good agreement with the measured results

Axially Symmetric Radiation Patterns from Flanged E-Plane Sectoral Horn

A simple technique for obtaining identical E- and H-plane patterns from E-plane sectoral feed horn is presented. Halfpower beam width and gain of the antenna are also improved considerably. Experimental results for a number of horns with flanges of various parameters are also presented. This system may find practical application in radar and space communication systems

Axially Symmetric Radiation Patterns from Corrugated

A modified H-plane sectoral horn antenna with identical E- and'H- plane.patterns over the X-band frequency is discussed. This system has significantly reduced side lobes and hack lobes. Half=power beam width and gain of the antenna are also improved with enhanced matching , Experimental results for a number of horns with various flanges are presented . These find practical application for illuminating symmetric antennas like paraboloids and polarization measurements in radio astronomy, etc. Compared to the fixed pyramidal horns. the present system offers great convenience in trimming the antenna characteristics

Brain Cholinergic and Dopaminergic Functions in Streptozotocin Induced Diabetic Rats: Effects of Curcumin and Vitamin D3 Supplementation

Department of Biotechnology, Cochin University of Science and Technology

Signatures of Higher Functions of Brain Dynamics in Electroencephalogram: A Nonlinear Analysis

The brain with its highly complex structure made up of simple units,imterconnected information pathways and specialized functions has always been an object of mystery and sceintific fascination for physiologists,neuroscientists and lately to mathematicians and physicists. The stream of biophysicists are engaged in building the bridge between the biological and physical sciences guided by a conviction that natural scenarios that appear extraordinarily complex may be tackled by application of principles from the realm of physical sciences. In a similar vein, this report aims to describe how nerve cells execute transmission of signals ,how these are put together and how out of this integration higher functions emerge and get reflected in the electrical signals that are produced in the brain.Viewing the E E G Signal through the looking glass of nonlinear theory, the dynamics of the underlying complex system-the brain ,is inferred and significant implications of the findings are explored.

An approximation method for evaluating centrifugal distortion constants in XH2 bent symmetric molecules

University of Cochin

Income modeling using Quantile Functions

Department of Statistics, Cochin University of Science and Technology

An Approach Towards The Development Of An Efficient Symmetric Key Encryption Scheme

n the recent years protection of information in digital form is becoming more important. Image and video encryption has applications in various fields including Internet communications, multimedia systems, medical imaging, Tele-medicine and military communications. During storage as well as in transmission, the multimedia information is being exposed to unauthorized entities unless otherwise adequate security measures are built around the information system. There are many kinds of security threats during the transmission of vital classified information through insecure communication channels. Various encryption schemes are available today to deal with information security issues. Data encryption is widely used to protect sensitive data against the security threat in the form of “attack on confidentiality”. Secure transmission of information through insecure communication channels also requires encryption at the sending side and decryption at the receiving side. Encryption of large text message and image takes time before they can be transmitted, causing considerable delay in successive transmission of information in real-time. In order to minimize the latency, efficient encryption algorithms are needed. An encryption procedure with adequate security and high throughput is sought in multimedia encryption applications. Traditional symmetric key block ciphers like Data Encryption Standard (DES), Advanced Encryption Standard (AES) and Escrowed Encryption Standard (EES) are not efficient when the data size is large. With the availability of fast computing tools and communication networks at relatively lower costs today, these encryption standards appear to be not as fast as one would like. High throughput encryption and decryption are becoming increasingly important in the area of high-speed networking. Fast encryption algorithms are needed in these days for high-speed secure communication of multimedia data. It has been shown that public key algorithms are not a substitute for symmetric-key algorithms. Public key algorithms are slow, whereas symmetric key algorithms generally run much faster. Also, public key systems are vulnerable to chosen plaintext attack. In this research work, a fast symmetric key encryption scheme, entitled “Matrix Array Symmetric Key (MASK) encryption” based on matrix and array manipulations has been conceived and developed. Fast conversion has been achieved with the use of matrix table look-up substitution, array based transposition and circular shift operations that are performed in the algorithm. MASK encryption is a new concept in symmetric key cryptography. It employs matrix and array manipulation technique using secret information and data values. It is a block cipher operated on plain text message (or image) blocks of 128 bits using a secret key of size 128 bits producing cipher text message (or cipher image) blocks of the same size. This cipher has two advantages over traditional ciphers. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the key avalanche effect produced in the ciphertext output is better than that of AES.

Entropy of a correlated system of nucleons

Realistic nucleon-nucleon interactions induce correlations to the nuclear many-body system, which lead to a fragmentation of the single-particle strength over a wide range of energies and momenta. We address the question of how this fragmentation affects the thermodynamical properties of nuclear matter. In particular, we show that the entropy can be computed with the help of a spectral function, which can be evaluated in terms of the self-energy obtained in the self-consistent Green's function approach. Results for the density and temperature dependences of the entropy per particle for symmetric nuclear matter are presented and compared to the results of lowest order finite-temperature Brueckner-Hartree-Fock calculations. The effects of correlations on the calculated entropy are small, if the appropriate quasiparticle approximation is used. The results demonstrate the thermodynamical consistency of the self-consistent T-matrix approximation for the evaluation of the Green's functions.

Jerim-320: A New 320-Bit Hash Function Compared To Hash Functions With Parallel Branches

This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications

Bieberbach's Conjecture, the de Branges and Weinstein Functions and the Askey-Gasper Inequality

The Bieberbach conjecture about the coefficients of univalent functions of the unit disk was formulated by Ludwig Bieberbach in 1916 [Bieberbach1916]. The conjecture states that the coefficients of univalent functions are majorized by those of the Koebe function which maps the unit disk onto a radially slit plane. The Bieberbach conjecture was quite a difficult problem, and it was surprisingly proved by Louis de Branges in 1984 [deBranges1985] when some experts were rather trying to disprove it. It turned out that an inequality of Askey and Gasper [AskeyGasper1976] about certain hypergeometric functions played a crucial role in de Branges' proof. In this article I describe the historical development of the conjecture and the main ideas that led to the proof. The proof of Lenard Weinstein (1991) [Weinstein1991] follows, and it is shown how the two proofs are interrelated. Both proofs depend on polynomial systems that are directly related with the Koebe function. At this point algorithms of computer algebra come into the play, and computer demonstrations are given that show how important parts of the proofs can be automated.

A generalization of Student’s t-distribution from the viewpoint of special functions

Student’s t-distribution has found various applications in mathematical statistics. One of the main properties of the t-distribution is to converge to the normal distribution as the number of samples tends to infinity. In this paper, by using a Cauchy integral we introduce a generalization of the t-distribution function with four free parameters and show that it converges to the normal distribution again. We provide a comprehensive treatment of mathematical properties of this new distribution. Moreover, since the Fisher F-distribution has a close relationship with the t-distribution, we also introduce a generalization of the F-distribution and prove that it converges to the chi-square distribution as the number of samples tends to infinity. Finally some particular sub-cases of these distributions are considered.

Duplication coefficients via generating functions

In this paper, we solve the duplication problem P_n(ax) = sum_{m=0}^{n}C_m(n,a)P_m(x) where {P_n}_{n>=0} belongs to a wide class of polynomials, including the classical orthogonal polynomials (Hermite, Laguerre, Jacobi) as well as the classical discrete orthogonal polynomials (Charlier, Meixner, Krawtchouk) for the specific case a = −1. We give closed-form expressions as well as recurrence relations satisfied by the duplication coefficients.

Functions satisfying holonomic q-differential equations

In a similar manner as in some previous papers, where explicit algorithms for finding the differential equations satisfied by holonomic functions were given, in this paper we deal with the space of the q-holonomic functions which are the solutions of linear q-differential equations with polynomial coefficients. The sum, product and the composition with power functions of q-holonomic functions are also q-holonomic and the resulting q-differential equations can be computed algorithmically.