SearcharxivSearch

arXiv subjects

K. Viswanathan Iyer

Publications and source records attributed to K. Viswanathan Iyer.

9 recordsLinked to original sources

Big data analytics: The stakes for students, scientists & managers - a management perspective

For a developing nation, deploying big data (BD) technology and introducing data science in higher education is a challenge. A pessimistic scenario is: Mis-use of data in many possible ways, waste of trained manpower, poor BD certifications from institutes, under-utilization of resources, disgruntled management staff, unhealthy competition in the market, poor integration with existing technical infrastructures. Also, the questions in the minds of students, scientists, engineers, teachers and managers deserve wider attention. Besides the stated perceptions and analyses perhaps ignoring socio-political and scientific temperaments in developing nations, the following questions arise: How did the BD phenomenon naturally occur, post technological developments in Computer and Communications Technology and how did different experts react to it? Are academicians elsewhere agreeing on the fact that BD is a new science? Granted that big data science is a new science what are its foundations as compared to conventional topics in Physics, Chemistry or Biology? Or, is it similar to astronomy or nuclear science? What are the technological and engineering implications and how these can be advantageously used to augment business intelligence, for example? Will the industry adopt the changes due to tactical advantages? How can BD success stories be carried over elsewhere? How will BD affect the Computer Science and other curricula? How will BD benefit different segments of our society on a large scale? To answer these, an appreciation of the BD as a science and as a technology is necessary. This paper presents a quick BD overview, relying on the contemporary literature; it addresses: characterizations of BD and the BD people, the background required for the students and teachers to join the BD bandwagon, the management challenges in embracing BD.

cs.CY

A dynamic intranet-based online-portal support for Computer Science teaching

The paper is a suggested experiment in effectively teaching subjects in Computer Science. The paper addresses effective content-delivery with the help of a university intranet. The proposal described herein is for teaching a subject like Combinatorics and Graph Theory - the main idea is to supplement lectures with a teacher-moderated online forum against an associated intranet portal. Keywords and phrases -computer-assisted learning; learning portal; active learning; OEIS; intranet portal; undergraduate teaching; Combinatorics and Graph theory

cs.CY

An Introduction to Functional dependency in Relational Databases

This write-up is the suggested lecture notes for a second level course on advanced topics in database systems for master's students of Computer Science with a theoretical focus. A prerequisite in algorithms and an exposure to database systems are required. Additional reading may require exposure to mathematical logic. The starting point for these notes are from M.Y.Vardi's survey listed herein as a reference - some of the proofs are presented as such . This select rewrite on functional dependency is intended to provide a few clarifications even though radically new design approaches are now being proposed.

cs.DB

A case for Intranet-based 0nline portal for undergraduate Computer Science education

Our proposal for selective subjects especially those involving intensive problem-solving assignments and/or tutorials, such as Introduction to Algorithms and Data structures, Discrete Mathematics, Coding Theory, Number theory, Combinatorics and Graph Theory (CGT), Automata theory, is to supplement lectures with a moderated online forum against an intranet portal. By way of illustration we take the example of a restricted view of OEIS (http://oeis.org). The restriction can be w.r.t. sequences in OEIS that are directly relevant to say CGT. N.J.A.Sloane's OEIS is a collection of over 2,39,147 integer sequences and their properties. In particular OEIS contains definitions of many combinatorial structures, dense range of interpretations, generating functions and conjectured ones, cross references within OEIS and to outside resources, references to texts and technical articles, codes in Maple, Mathematica etc. For organizing courses such as the above mentioned, a first task is to partially create an OEIS-like instructor-moderated portal in a university intranet. During the course of lectures and tutorials students are invited to contribute to the portal and these may be augmented/approved by instructors suitably, to find a place in the portal. By this many concepts can be conveyed to the students in an interesting way with the desired results. In the arguments presented, examples related to CGT are given.

cs.CY

Conditional and Unique Coloring of Graphs

For integers $k, r > 0$, a conditional $(k,r)$-coloring of a graph $G$ is a proper $k$-coloring of the vertices of $G$ such that every vertex $v$ of degree $d(v)$ in $G$ is adjacent to at least $\min\{r, d(v)\}$ differently colored vertices. Given $r$, the smallest integer $k$ for which $G$ has a conditional $(k,r)$-coloring is called the $r$th order conditional chromatic number $χ_r(G)$ of $G$. We give results (exact values or bounds for $χ_r(G)$, depending on $r$) related to the conditional coloring of some graphs. We introduce \emph{unique conditional colorability} and give some related results. (Keywords. cartesian product of graphs; conditional chromatic number; gear graph; join of graphs.)

cs.DM

Conditional coloring of some parameterized graphs

For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r,d(v)} different colors. The smallest integer k for which a graph G has a conditional (k,r)-coloring is called the rth order conditional chromatic number, denoted by $χ_r(G)$. For different values of r we obtain $χ_r(G)$ of certain parameterized graphs viz., Windmill graph, line graph of Windmill graph, middle graph of Friendship graph, middle graph of a cycle, line graph of Friendship graph, middle graph of complete k-partite graph and middle graph of a bipartite graph.

cs.DM

On conditional coloring of some graphs

For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for different values of r we obtain the conditional chromatic number of a grid $G(2,n) \cong P_2 \ \Box \ P_n$, $C_n^2$ and the strong product of $P_n$ and $P_m$ (n,m being positive integers). Also, for integers $n \geq 3$ and $t \geq 1$ the second order conditional chromatic number (also known as dynamic chromatic number) of the (t,n)-web graph is obtained.

cs.DM

Algorithms for enumerating and counting D2CS of some graphs

A D2CS of a graph G is a set $S \subseteq V(G)$ with $diam(G[S]) \leq 2$. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree, binary Fibonacci tree and the binomial tree. Next we give an algorithm for enumerating and counting D2CS of a graph. We then give a linear time algorithm for finding all maximal D2CS in a strongly chordal graph.

cs.DM