The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.

/pdf/community-detection-in-graphs-34rogm3r6p.pdf

Community detection in graphs

This paper presents an overview on the state of the art of semantics for abstract argumentation, covering both some of the most influential literature proposals and some general issues concerning semantics definition and evaluation. As to the former point, the paper reviews Dung's original notions of complete, grounded, preferred, and stable semantics, as well as subsequently proposed notions like semi-stable, ideal, stage, and CF2 semantics, considering both the extension-based and the labelling-based approaches with respect to their definitions. As to the latter point, the paper presents an extensive set of general properties for semantics evaluation and analyzes the notions of argument justification and skepticism. The final part of the paper is focused on the discussion of some relationships between semantics properties and domain-specific requirements.

https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0269888911000166

Review: an introduction to argumentation semantics

The increasing integration of technology into our lives has created unprecedented volumes of data on society’s everyday behaviour. Such data opens up exciting new opportunities to work towards a quantitative understanding of our complex social systems, within the realms of a new discipline known as Computational Social Science. Against a background of financial crises, riots and international epidemics, the urgent need for a greater comprehension of the complexity of our interconnected global society and an ability to apply such insights in policy decisions is clear. This manifesto outlines the objectives of this new scientific direction, considering the challenges involved in it, and the extensive impact on science, technology and society that the success of this endeavour is likely to bring about.

/pdf/manifesto-of-computational-social-science-4fafrm65p2.pdf

Manifesto of computational social science

The embodiments herein provide a secure computing resource set identification, evaluation, and management arrangement, employing in various embodiments some or all of the following highly reliable identity related means to establish, register, publish and securely employ user computing arrangement resources in satisfaction of user set target contextual purposes. Systems and methods may include, as applicable, software and hardware implementations for Identity Firewalls; Awareness Managers; Contextual Purpose Firewall Frameworks for situationally germane resource usage related security, provisioning, isolation, constraining, and operational management; liveness biometric, and assiduous environmental, evaluation and authentication techniques; Repute systems and methods assertion and fact ecosphere; standardized and interoperable contextual purpose related expression systems and methods; purpose related computing arrangement resource and related information management systems and methods, including situational contextual identity management systems and methods; and/or the like.

Methods and systems for secure and reliable identity-based computing

Phonological mean length of utterance (PMLU) is a whole word measure for measuring phonological proficiency. It measures the length of a child’s word and the number of correct consonants. The present study investigated the phonological length of utterance in native Kannada speaking children of 3 to 7 years age. A total of 400 subjects in the age range of 3-7 years participated in the study. Spontaneous speech samples were elicited from each child and analyzed for PMLU as per the rules suggested by Ingram. Mann-Whitney U test and Kruskal Wallis test were employed to compare the differences between the means of PMLU scores across the gender and the age respectively. The result revealed increase in PMLU score as the age increased suggesting a developmental trend in PMLU acquisition. No statistically significant differences were observed between the means of PMLU scores across the gender.

/pdf/language-in-india-strength-for-today-and-bright-hope-for-dfy0rj03tc.pdf

LANGUAGE IN INDIA Strength for Today and Bright Hope for Tomorrow

This book is presented with a paninian perspective [Panini 500 B was a grammarian and well known for his contribution to the grammar and structure of the language.] It introduces three western grammar frameworks using examples from English.

Natural language processing : a Paninian perspective

The paper introduces a dependency annotation effort which aims to fully annotate a million word Hindi corpus. It is the first attempt of its kind to develop a large scale tree-bank for an Indian language. In this paper we provide the motivation for following the Paninian framework as the annotation scheme and argue that the Paninian framework is better suited to model the various linguistic phenomena manifest in Indian languages. We present the basic annotation scheme. We also show how the scheme handles some phenomenon such as complex verbs, ellipses, etc. Empirical results of some experiments done on the currently annotated sentences are also reported.

Dependency Annotation Scheme for Indian Languages

There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more efficient. Second, such a formalism is also likely to be linguistically more elegant and satisfying. In this paper, we describe such a formalism, called the Paninian framework, that has been successfully applied to Indian languages.This paper shows that the Paninian framework applied to modern Indian languages gives an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles. The mapping is elegant and compact. The same basic account also explains active-passives and complex sentences. This suggests that the solution is not just adhoc but has a deeper underlying unity.A constraint based parser is described for the framework. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints. Efficient solutions are known for these problems.It is interesting to observe that such a parser (designed for free word order languages) compares well in asymptotic time complexity with the parser for context free grammars (CFGs) which are basically designed for positional languages.

/pdf/parsing-free-word-order-languages-in-the-paninian-framework-1go1mjcv60.pdf

Parsing Free Word Order Languages in the Paninian Framework

Proceedings of the 20th international joint conference on Artifical intelligence

Fully-automatic general-purpose high-quality machine translation systems (FGH-MT) are extremely difficult to build. In fact, there is no system in the world for any pair of languages which qualifies to be called FGH-MT. The reasons are not far to seek. Translation is a creative process which involves interpretation of the given text by the translator. Translation would also vary depending on the audience and the purpose for which it is meant. This would explain the difficulty of building a machine translation system. Since, the machine is not capable of interpreting a general text with sufficient accuracy automatically at present - let alone re-expressing it for a given audience, it fails to perform as FGH-MT. FOOTNOTE{The major difficulty that the machine faces in interpreting a given text is the lack of general world knowledge or common sense knowledge.}

Rajeev Sangal

Papers

Natural language processing : a Paninian perspective

Dependency Annotation Scheme for Indian Languages

Parsing Free Word Order Languages in the Paninian Framework

Proceedings of the 20th international joint conference on Artifical intelligence

Anusaaraka: Machine Translation in Stages