Psychology in Sangam Songs

The hymns included in the Sangam literature date back two thousand years. Sangam literature, a new psychology which has emerged recently, is an early literature available in Tamil. The sum including the sum of that number is called the number. Patu means tens and Suma means eights These eight books were called Sangailyakyam. “If you ask for another name for associational literature, feel free to mention it as 'psychological literature'. There are one hundred internal songs and one hundred and seventy-five external songs. Palandamizhar literature was divided into two sections namely Akam and Puram. Songs that describe the life of a similar male and female son and daughter are called Agam Areas that tell about war, gift, victory etc. are called Puram. Inward life belongs to domestic pleasure and outward life to national pride. The psychological knowledge possessed by the Sangam saints who sang of the inner love life and the outer heroic life was remarkable

Creativity in the works of Kannadasan and Pattukkottaiyar

'Personality' can be defined as the success of the psychological impulse that expresses its full potential in the subjective and objective aspects of one or more, such as subconsciousness, mood, social expression, and the manner in which they deal with individual movement in their modes of action. The symbol of creativity depends on the nature of the work, the nature of the creator, and the consumer's reception of the work. Generally, this work applies not only to literary works but also to all kinds of works. The scope of this creativity expands around the central theme of creativity

New Nonexistence Results on Circulant Weighing Matrices

A circulant weighing matrix $W = (w_{i,j})$ is a square matrix of order $n$ and entries $w_{i,j}$ in $\{0, \pm 1\}$ such that $WW^T=kI_n$. In his thesis, Strassler gave a table of existence results for such matrices with $n \leq 200$ and $k \leq 100$. In the latest version of Strassler's table given by Tan \cite{arXiv:1610.01914} there are 34 open cases remaining. In this paper we give nonexistence proofs for 12 of these cases, report on preliminary searches outside Strassler's table, and characterize the known proper circulant weighing matrices.Comment: 15 page

A Nonexistence Result for Abelian Menon Difference Sets Using Perfect Binary Arrays

A Menon difference set has the parameters (4N2, 2N2-N, N2-N). In the abelian case it is equivalent to a perfect binary array, which is a multi-dimensional matrix with elements ±1 such that all out-of-phase periodic autocorrelation coefficients are zero. Suppose that the abelian group H×K×Zpα contains a Menon difference set, where p is an odd prime, |K|=pα, and pj≡−1 (mod exp (H)) for some j. Using the viewpoint of perfect binary arrays we prove that K must be cyclic. A corollary is that there exists a Menon difference set in the abelian group H×K×Z3α, where exp (H)=2 or 4 and |K|=3α, if and only if K is cyclic

Blowfish Algorithm with Verifiable Outsourced using Cryptography

Cloud Computing is an emerging paradigm in our day to day world. As good as it is, this technique also bring forth many new trails for data security and access control when users outsource sensitive data for sharing on cloud.Attribute-based encryption (ABE) is a promising strategy for ?ne-grained access control of scrambled information in a distributed storage, nonetheless, unscrambling included in the ABEs is generally excessively costly for asset compelled front-end clients, which incredibly blocks it’s down to earth fame. Keeping in mind the end goal to decrease the decoding overhead for a client to recuperate the plaintext wereoutsourced most of the unscrambling work without uncovering really information or private keys. Here a novel technique is proposed to build an ABE with Veri?able outsourced decryption based on a blowfish encryption. It provides a unified model, which can be considered in both key-policy (KP) and cipher text-policy (CP) settings. In verifiability,it guarantees the correctness of the transformation done between the original cipher text and the simplified cipher text. A major issue is the absence of access control rights. So, it considered an access key structure for improving the security and performance by specifying access rights for the authorized user. Access control rights, restrictions and privileges for an individual are established. The access control rights is validated and results shows increased security level

New Constructions of Menon Difference Sets

Menon difference sets have parameters (4N2, 2N2 − N, N2 − N). These have been constructed for N = 2a3b, 0 ⩽ a,b, but the only known constructions in abelian groups require that the Sylow 3-subgroup be elementary abelian (there are some nonabelian examples). This paper provides a construction of difference sets in higher exponent groups, and this provides new examples of perfect binary arrays

Some Non-Existence Results on Divisible Difference Sets

In this paper, we shall prove several non-existence results for divisible difference sets, using three approaches: (i) character sum arguments similar to the work of Turyn [25] for ordinary difference sets, (ii) involution arguments, and (iii) multipliers in conjunction with results on ordinary difference sets. Among other results, we show that an abelian affine difference set of odd order s (s not a perfect square) in G can exist only if the Sylow 2-subgroup of G is cyclic. We also obtain a non-existence result for non-cyclic (n, n, n, 1) relative difference sets of odd order n

A Note on Intersection Numbers of Difference Sets

We present a condition on the intersection numbers of difference sets which follows from a result of Jungnickel and Pott [3]. We apply this condition to rule out several putative (non-abelian) difference sets and to correct erroneous proofs of Lander [4] for the nonexistence of (352, 27, 2)- and (122, 37, 12)-difference sets

A Note on Intersection Numbers of Difference Sets

We present a condition on the intersection numbers of difference sets which follows from a result of Jungnickel and Pott [3]. We apply this condition to rule out several putative (non-abelian) difference sets and to correct erroneous proofs of Lander [4] for the nonexistence of (352, 27, 2)- and (122, 37, 12)-difference sets