104,121 research outputs found
K. Balasubramanian oral history interview and transcript
No full textThis recording and transcript form part of a collection of oral history interviews conducted by the Chao Center for Asian Studies at Rice University. This collection includes audio recordings and transcripts of interviews with Asian Americans native to or living in Houston.K. Balasubramanian was born in December of 1942 in a small village called Palghat in Kerala, India. K. Balasubramanian studied engineering at the University of Rhode Island. Soon after, he moved to Texas in August of 1969 to become an electronics designer. K. Balasubramanian then became a key player in designing the first single chip integrated circuit calculator. In this interview, K. Balasubramanian discusses his successes and shares several other stories about himself
A SURVEY ON -FREENESS
No full textWe say that an integer n is k–free (k 2) if for every
prime p the valuation vp(n) < k. If f : N ! Z, we consider
the enumerating function Sk
f (x) defined as the number of positive
integers n x such that f(n) is k–free. When f is the identity
then Sk
f (x) counts the k–free positive integers up to x. We review
the history of Sk
f (x) in the special cases when f is the identity, the
characteristic function of an arithmetic progression a polynomial,
arithmetic. In each section we present the proof of the simplest
case of the problem in question using exclusively elementary or
standard techniques
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Elderly Learning in the Digital Age: Towards Empowerment
No full textPresented by Professor Asha Kanwar, President & CEO, Commonwealth of Learning at Zhejiang Open University, 16 November 2023. Co-written with Dr K Balasubramanian, former VP, COL and Mr Ricky Cheng, Knowledge Services Manager, COL
Skills for Development: Paradigm Shift
No full textPresented by Dr K. Balasubramanian, Vice President, Commonwealth of Learning, at the Minsterial Roundtable of the 20th Conference of Commonwealth Education Ministers, Nadi, Fiji, on 22 February 2018
Lifelong Learning for Sustainable Development
No full textPresented by Professor Asha Kanwar, COL President & CEO at the Lillehammer Lifelong Learning ICDE Conference in Norway, on 15 February 2023. Co-written with Dr K Balasubramanian
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
The role of brand awareness and product involvement on choice and recall in the context of product placement
No full textProduct placement has been attracting attention in recent years due to marketers seeking new
tools to reach consumers that have become more emancipated due to the development of adskipping
technologies like TiVo which helps audiences skip commercial messages. Nevertheless
not much work has been done in exploring and testing the real efficacy of product placement as a
marketing communication tool. Following the integrative conceptual model proposed by
Balasubramanian, Karrh, and Patwardhan (in press) to understand how such messages generate
audience impact, we further explore the role product involvement and brand awareness play in
influencing consumers in the context of product placement in movies. We focus on two different
effects: brand recall (cognitive) which is most widely used to assess the efficacy of product
placement investments and brand choice (behavioral). We discuss our findings and point out
some managerial implications for marketers based on our findings
Adaptive synchronisation of pushdown automata
No full textWe introduce the notion of adaptive synchronisation for pushdown automata, in which there is an external observer who has no knowledge about the current state of the pushdown automaton, but can observe the contents of the stack. The observer would then like to decide if it is possible to bring the automaton from any state into some predetermined state by giving inputs to it in an adaptive manner, i.e., the next input letter to be given can depend on how the contents of the stack changed after the current input letter. We show that for non-deterministic pushdown automata, this problem is 2-EXPTIME-complete and for deterministic pushdown automata, we show EXPTIME-completeness.
To prove the lower bounds, we first introduce (different variants of) subset-synchronisation and show that these problems are polynomial-time equivalent with the adaptive synchronisation problem. We then prove hardness results for the subset-synchronisation problems. For proving the upper bounds, we consider the problem of deciding if a given alternating pushdown system has an accepting run with at most k leaves and we provide an n^O(k²) time algorithm for this problem
Our Common Future
No full textDelivered by Professor Asha Kanwar, President & CEO, Commonwealth of Learning, at the Foreign Ministers Meeting, Commonwealth Heads of Government Meeting (CHOGM), London, UK, 20 April 2018. Co-written with Dr K Balasubramanian, Vice-President, COL
- …
