1,555 research outputs found
Bharathi and the State of Malayalam
No full textMahakavi Bharathi, a multi-lingual poet, loved language, nationality, and culture. He was keen to end the differences between the people. He is the creator of the new world by throwing a spear of writing. He wiped out the thinking of "I" and planted the tradition of thinking "We". He spread the feeling that the human race is one despite differences in language. He did not think that his language was his race; he respected all living beings as a single group. Therefore, Bharathi looked into the problems of Malayalam-speaking people. Just as there was a 'Bharathidasan' in Pudhuchery, there was also a 'Dasan' (follower) for Bharathi in Kerala. The Dasan who tried to implement Bharati's ideological ideas was Krishnasamy Iyer. Although Bharathi had no knowledge of Malayalam, he understood the nature of the language very well. This article focuses on Bharathiyar's article focusing on ideological thoughts on the topics of caste problem, Theeyar society, Vivekananda thoughts, Renaissance thoughts, Thunchaththu Ezhuthachan, nature of Malayalam language, land environment, Raghava Shastri, Krishnasamy Iyer, etc
Bharathi an Idealist
No full textThe beginning of 19th century was a time of scientific and technological development and the development of education for a particular community. Bharathi, who celebrated international politics had phrased “Aagavendru ezhunthathu paaryugap puratchi” (Translation: O! See the glorifying revolution) about the Russian Revolution. Bharathi is also immersed in the idealism of taking the natural phenomenon to the divine level without clarifying it. It can be seen in his writings about myths in general. We can also observe several differences among his poems and prose. He had incorporated lesser vernacular words like Sanskrit in his prose in comparison to his poems. This is also one of the evidents to outlay that he had given more priority to the concept in particular. To define Bharathi as an idealist, there are several grounded concepts have clinched. For say, the political contexts, social contexts, the attraction towards the feudalist society, searching answers within himself and with the divine, experiences with his family and the knowledge which had driven from his life experiments were the main concepts of his writings rather than the scientific explanations. With this notion the present research article has aimed to limelight his idealism in particular
Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain
No full textThe Ideal Membership Problem (IMP) asks if an input polynomial f ∈ [x₁,… ,x_n] with coefficients from a field belongs to an input ideal I ⊆ [x₁,… ,x_n]. It is a well-known fundamental problem with many important applications, though notoriously intractable in the general case. In this paper we consider the IMP for polynomial ideals encoding combinatorial problems and where the input polynomial f has degree at most d = O(1) (we call this problem IMP_d). Our main interest is in understanding when the inherent combinatorial structure of the ideals makes the IMP_d "hard" (NP-hard) or "easy" (polynomial time) to solve.
Such a dichotomy result between "hard" and "easy" IMPs was recently achieved for Constraint Satisfaction Problems over finite domains [Andrei A. Bulatov, 2017; Dmitriy Zhuk, 2017] (this is equivalent to IMP₀) and IMP_d for the Boolean domain [Mastrolilli, 2019], both based on the classification of the IMP through functions called polymorphisms. For the latter result, each polymorphism determined the complexity of the computation of a suitable Gröbner basis.
In this paper we consider a 3-element domain and a majority polymorphism (constraints under this polymorphism are a generalisation of the 2-SAT problem). By using properties of the majority polymorphism and assuming graded lexicographic ordering of monomials, we show that the reduced Gröbner basis of ideals whose varieties are closed under the majority polymorphism can be computed in polynomial time. This proves polynomial time solvability of the IMP_d for these constrained problems. We conjecture that this result can be extended to a general finite domain of size k = O(1). This is a first step towards the long term and challenging goal of generalizing the dichotomy results of solvability of the IMP_d for a finite domain
Ideal Membership Problem for Boolean Minority and Dual Discriminator
No full textThe polynomial Ideal Membership Problem (IMP) tests if an input polynomial f ∈ [x_1,… ,x_n] with coefficients from a field belongs to a given ideal I ⊆ [x_1,… ,x_n]. It is a well-known fundamental problem with many important applications, though notoriously intractable in the general case. In this paper we consider the IMP for polynomial ideals encoding combinatorial problems and where the input polynomial f has degree at most d = O(1) (we call this problem IMP_d).
A dichotomy result between "hard" (NP-hard) and "easy" (polynomial time) IMPs was achieved for Constraint Satisfaction Problems over finite domains [Andrei A. Bulatov, 2017; Dmitriy Zhuk, 2020] (this is equivalent to IMP_0) and IMP_d for the Boolean domain [Mastrolilli, 2019], both based on the classification of the IMP through functions called polymorphisms. For the latter result, there are only six polymorphisms to be studied in order to achieve a full dichotomy result for the IMP_d. The complexity of the IMP_d for five of these polymorphisms has been solved in [Mastrolilli, 2019] whereas for the ternary minority polymorphism it was incorrectly declared in [Mastrolilli, 2019] to have been resolved by a previous result. In this paper we provide the missing link by proving that the IMP_d for Boolean combinatorial ideals whose constraints are closed under the minority polymorphism can be solved in polynomial time. This completes the identification of the precise borderline of tractability for the IMP_d for constrained problems over the Boolean domain. We also prove that the proof of membership for the IMP_d for problems constrained by the dual discriminator polymorphism over any finite domain can also be found in polynomial time. Bulatov and Rafiey [Andrei A. Bulatov and Akbar Rafiey, 2020] recently proved that the IMP_d for this polymorphism is decidable in polynomial time, without needing a proof of membership. Our result gives a proof of membership and can be used in applications such as Nullstellensatz and Sum-of-Squares proofs
Comparison of Different Orthographies for Machine Translation of Under-Resourced Dravidian Languages
No full textUnder-resourced languages are a significant challenge for statistical approaches to machine translation, and recently it has been shown that the usage of training data from closely-related languages can improve machine translation quality of these languages. While languages within the same language family share many properties, many under-resourced languages are written in their own native script, which makes taking advantage of these language similarities difficult. In this paper, we propose to alleviate the problem of different scripts by transcribing the native script into common representation i.e. the Latin script or the International Phonetic Alphabet (IPA). In particular, we compare the difference between coarse-grained transliteration to the Latin script and fine-grained IPA transliteration. We performed experiments on the language pairs English-Tamil, English-Telugu, and English-Kannada translation task. Our results show improvements in terms of the BLEU, METEOR and chrF scores from transliteration and we find that the transliteration into the Latin script outperforms the fine-grained IPA transcription
sj-docx-2-pie-10.1177_09544089221139108 - Supplemental material for Experimental studies and optimization of process parameters in laser welding of stainless steel 304 H
No full textSupplemental material, sj-docx-2-pie-10.1177_09544089221139108 for Experimental studies and optimization of process parameters in laser welding of stainless steel 304 H by Srinath Selvaperumal and Deepan Bharathi Kannan Thangaraju in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-docx-1-pie-10.1177_09544089221139108 - Supplemental material for Experimental studies and optimization of process parameters in laser welding of stainless steel 304 H
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089221139108 for Experimental studies and optimization of process parameters in laser welding of stainless steel 304 H by Srinath Selvaperumal and Deepan Bharathi Kannan Thangaraju in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
High capacity and low cost spinel Fe3O4 for the Na-ion battery negative electrode materials
No full textThe iron-containing electrode material is a promising candidate for low-cost Na-ion batteries. In this work, the electrochemical properties of Fe3O4 nanoparticles obtained by simple hydrothermal reaction are investigated as an anode material for Na-ion batteries. The Fe3O4 with alginate binder delivers a reversible capacity of 248 mAhg (1) after 50 cycles at a current density of 83 mAg (1) (0.1C), while the electrode using polyvinylidene fluoride binder shows a gradually capacity fading to 79 mAhg (1) after 50 cycles. The high electrochemical performance can be ascribed to both the nano size of Fe3O4 and excellent binding ability of alginate binder which can buffer large volume change. The mechanism of conversion reaction for Fe3O4 is also tracked by combining electrochemical impedance spectroscopy analysis and magnetization measurement after electrochemical cycling. Finally, the Na-ion full cell consisting of the Fe3O4-alginate anode and the Na3V2(PO4)(3)/graphene cathode is assembled to demonstrate performance of the Fe3O4 anode for Na-ion batteries
sj-docx-1-usj-10.1177_00420980211072855 – Supplemental material for Residential segregation and public services in urban India
No full textSupplemental material, sj-docx-1-usj-10.1177_00420980211072855 for Residential segregation and public services in urban India by Naveen Bharathi, Deepak Malghan, Sumit Mishra and Andaleeb Rahman in Urban Studies</p
- …
