scispace - formally typeset
Search or ask a question
Institution

Mahidol University International College

About: Mahidol University International College is a based out in . It is known for research contribution in the topics: Tourism & Corporate governance. The organization has 240 authors who have published 485 publications receiving 6095 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, focus group interviews of parents of 10- to 12-year-old children in Thailand were conducted to understand how they made milk and yogurt purchase decisions, and the transcript analysis indicated that the decision-making process of the parents was influenced by their children.
Abstract: Focus group interviews of parents of 10- to 12-year-old children in Bangkok, Thailand, were conducted to understand how they made milk and yogurt purchase decisions. The transcript analysis indicat...

1 citations

Posted Content
TL;DR: Radius-Stepping (RS) as mentioned in this paper is an algorithm with a tradeoff between work and depth for SSSP with nonnegative edge weights that takes a sequence of steps, each increasing the radius by a user-specified value, each step settles the vertices in its annulus but can take $\Theta(n)$ substeps, each requiring $n$ work.
Abstract: The single-source shortest path problem (SSSP) with nonnegative edge weights is a notoriously difficult problem to solve efficiently in parallel---it is one of the graph problems said to suffer from the transitive-closure bottleneck. In practice, the $\Delta$-stepping algorithm of Meyer and Sanders (J. Algorithms, 2003) often works efficiently but has no known theoretical bounds on general graphs. The algorithm takes a sequence of steps, each increasing the radius by a user-specified value $\Delta$. Each step settles the vertices in its annulus but can take $\Theta(n)$ substeps, each requiring $\Theta(m)$ work ($n$ vertices and $m$ edges). In this paper, we describe Radius-Stepping, an algorithm with the best-known tradeoff between work and depth bounds for SSSP with nearly-linear ($\otilde(m)$) work. The algorithm is a $\Delta$-stepping-like algorithm but uses a variable instead of fixed-size increase in radii, allowing us to prove a bound on the number of steps. In particular, by using what we define as a vertex $k$-radius, each step takes at most $k+2$ substeps. Furthermore, we define a $(k, \rho)$-graph property and show that if an undirected graph has this property, then the number of steps can be bounded by $O(\frac{n}{\rho} \log \rho L)$, for a total of $O(\frac{kn}{\rho} \log \rho L)$ substeps, each parallel. We describe how to preprocess a graph to have this property. Altogether, Radius-Stepping takes $O((m+n\log n)\log \frac{n}{\rho})$ work and $O(\frac{n}{\rho}\log n \log (\rho{}L))$ depth per source after preprocessing. The preprocessing step can be done in $O(m\log n + n\rho^2)$ work and $O(\rho^2)$ depth or in $O(m\log n + n\rho^2\log n)$ work and $O(\rho\log \rho)$ depth, and adds no more than $O(n\rho)$ edges.

1 citations

Book ChapterDOI
01 Jan 2017
TL;DR: This article revisited literature on internationalization theories, highlighting case firms to paint a clearer picture, and discussed implementation of existing theories with case firms from developing countries in the Asia Pacific and addressed the definition of internationalization and other relevant theories in businesses expanding beyond borders.
Abstract: This chapter revisits literature on internationalization theories, highlighting case firms to paint a clearer picture. The chapter also discusses implementation of existing theories with case firms from developing countries in the Asia Pacific and addresses the definition of internationalization and other relevant theories in businesses expanding beyond borders. These comprise the Uppsala model, which demonstrates internationalization processes and channels; Dunning's eclectic paradigm on internationalization and its motivations; as well as other theories on internationalization, network models, institutional theories, and the resource-based view theory. This chapter explores case studies of multinational companies in the Asia-Pacific region to showcase each theory in practice.

1 citations

27 Jun 2019
TL;DR: In this article, the authors developed Chinese textbooks targeting Thai learners by assessing the overall effectiveness of the Chinese textbooks used in the international programs in higher education institutions, Thailand, as well as by analyzing Thai learners' perceptions toward the textbooks.
Abstract: This paper aims to develop Chinese textbooks targeting Thai learners by assessing the overall effectiveness of the Chinese textbooks used in the international programs in higher education institutions, Thailand, as well as by analyzing Thai learners’ perceptions toward the textbooks. The three Chinese textbooks being used were analyzed in terms of the amount of grammar, the level of difficulty of grammar, topics, vocabulary and cultural knowledge. One hundred and sixty-nine college students participated in the study to express their attitudes towards the textbooks. The results showed that although the Chinese textbooks target beginners, there was a lack of content consistency. Moreover, there were significant mismatches between the textbooks and the Thai learners’ needs and wants in terms of text topics, cultural knowledge, and real-life application. The researchers, therefore, would like to propose that Chinese textbooks in Thai market should adopt a learner-centered approach to satisfy Thai learners’ identity.

1 citations


Network Information
Related Institutions (5)
Chulalongkorn University
34.3K papers, 647.8K citations

76% related

Grand Valley State University
4.7K papers, 104.6K citations

75% related

Mahidol University
39.7K papers, 878.7K citations

74% related

Khon Kaen University
14.6K papers, 232.1K citations

74% related

King Mongkut's University of Technology Thonburi
9.3K papers, 165.4K citations

73% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20222
202161
202055
201952
201840
201753