A Comparative Study on Internationalization and the Role of International Offices at Selected Middle Eastern and German Universities

Internationalization of higher education has become one of the most important policies for institutions of higher education worldwide. Though universities are international by nature, the need for intensified quality activities of international nature has promoted internationalization to be under spotlight of researchers, administrators and policy makers and to be an area for research. Each institution follows its certain way to govern its international affairs. Most Universities, especially in the 'Developed World' started to plan it strategically. This study explores the meanings and importance of internationalization especially that it means different things to different people. It also studies the rationales behind internationalizing higher education. It focuses on the four main prevailing rationales; political, cultural/social, economic/financial, and academic on both national and institutional levels. With the increasing need to strategically plan, the study explores internationalization strategies in terms of how to develop them, what are their approaches and types, and their components and dimensions. Damascus University has witnessed an overwhelming development of its international relations and activities. Therefore, it started to face a problem of how to deal with this increasing load especially that its International Office is the only unit that deals with the international issues. In order to study the internationalization phenomenon at Damascus University, the 2WH approach, which asks the what, why, and how questions, is used and in order to define the International Office's role in the internationalization process of the University, it studies it and the international offices of Kassel University, and Humboldt University in Germany, The University of Jordan, and Al Baath University in Syria using the 'SOCIAL' approach that studies and analyses the situation, organization, challenges, involvement, ambitions, and limitations of these offices. The internationalization process at the above-mentioned Universities is studied and compared in terms of its meaning, rationales for both the institution and its academic staff, challenges and strategic planning. Then a comparison is made among the international offices of the Universities to identify their approaches, what led to their success and what led to their failure in their practices. The aim is to provide Damascus University and its International Office with some good practices and, depending on the experiences of the professionals of the case-studies, a suggested guidance to the work of this Office and the University in general is given. The study uses the interviews with the different officials and stakeholders of the case-studies as the main method of collecting the information in addition to site visits, studying their official documents and their websites. The study belongs to qualitative research that has an action dimension in it since the recommendations will be applied in the International Office. The study concludes with few learned lessons for Damascus University and its International Office depending on the comparison that was done according to a set of dimensions. Finally a reflection on the relationship between internationalization of higher education and politics, the impact of politics on Middle Eastern Universities, and institutional internationalization strategies are presented.

Triangulation by Continuous Embedding

When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.

Probabilistic Independence Networks for Hidden Markov Probability Models

Graphical techniques for modeling the dependencies of randomvariables have been explored in a variety of different areas includingstatistics, statistical physics, artificial intelligence, speech recognition, image processing, and genetics.Formalisms for manipulating these models have been developedrelatively independently in these research communities. In this paper weexplore hidden Markov models (HMMs) and related structures within the general framework of probabilistic independencenetworks (PINs). The paper contains a self-contained review of the basic principles of PINs.It is shown that the well-known forward-backward (F-B) and Viterbialgorithms for HMMs are special cases of more general inference algorithms forarbitrary PINs. Furthermore, the existence of inference and estimationalgorithms for more general graphical models provides a set of analysistools for HMM practitioners who wish to explore a richer class of HMMstructures.Examples of relatively complex models to handle sensorfusion and coarticulationin speech recognitionare introduced and treated within the graphical model framework toillustrate the advantages of the general approach.

Neural Networks

We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view learning algorithms as methods for finding parameter values that look probable in the light of the data. We discuss basic issues in representation and learning, and treat some of the practical issues that arise in fitting networks to data. We also discuss links between neural networks and the general formalism of graphical models.

Factorial Hidden Markov Models

We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the Expectation--Maximization (EM) procedure for maximum likelihood estimation. Analogous to the standard Baum-Welch update rules, the M-step of our algorithm is exact and can be solved analytically. However, due to the combinatorial nature of the hidden state representation, the exact E-step is intractable. A simple and tractable mean field approximation is derived. Empirical results on a set of problems suggest that both the mean field approximation and Gibbs sampling are viable alternatives to the computationally expensive exact algorithm.

Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks

Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. Often the parameters used in these networks need to be learned from examples. Unfortunately, estimating the parameters via exact probabilistic calculations (i.e, the EM-algorithm) is intractable even for networks with fairly small numbers of hidden units. We propose to avoid the infeasibility of the E step by bounding likelihoods instead of computing them exactly. We introduce extended and complementary representations for these networks and show that the estimation of the network parameters can be made fast (reduced to quadratic optimization) by performing the estimation in either of the alternative domains. The complementary networks can be used for continuous density estimation as well.

Active Learning with Statistical Models

For many types of learners one can compute the statistically 'optimal' way to select data. We review how these techniques have been used with feedforward neural networks. We then show how the same principles may be used to select data for two alternative, statistically-based learning architectures: mixtures of Gaussians and locally weighted regression. While the techniques for neural networks are expensive and approximate, the techniques for mixtures of Gaussians and locally weighted regression are both efficient and accurate.

On Convergence Properties of the EM Algorithm for Gaussian Mixtures

"Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a projection matrix $P$, and we provide an explicit expression for the matrix. We then analyze the convergence of EM in terms of special properties of $P$ and provide new results analyzing the effect that $P$ has on the likelihood surface. Based on these mathematical results, we present a comparative discussion of the advantages and disadvantages of EM and other algorithms for the learning of Gaussian mixture models.

Learning from Incomplete Data

Real-world learning tasks often involve high-dimensional data sets with complex patterns of missing features. In this paper we review the problem of learning from incomplete data from two statistical perspectives---the likelihood-based and the Bayesian. The goal is two-fold: to place current neural network approaches to missing data within a statistical framework, and to describe a set of algorithms, derived from the likelihood-based framework, that handle clustering, classification, and function approximation from incomplete data in a principled and efficient manner. These algorithms are based on mixture modeling and make two distinct appeals to the Expectation-Maximization (EM) principle (Dempster, Laird, and Rubin 1977)---both for the estimation of mixture components and for coping with the missing data.

On the Convergence of Stochastic Iterative Dynamic Programming Algorithms

Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms, including the TD(lambda) algorithm of Sutton (1988) and the Q-learning algorithm of Watkins (1989), can be motivated heuristically as approximations to dynamic programming (DP). In this paper we provide a rigorous proof of convergence of these DP-based learning algorithms by relating them to the powerful techniques of stochastic approximation theory via a new convergence theorem. The theorem establishes a general class of convergent algorithms to which both TD(lambda) and Q-learning belong.

Hierarchical Mixtures of Experts and the EM Algorithm

We present a tree-structured architecture for supervised learning. The statistical model underlying the architecture is a hierarchical mixture model in which both the mixture coefficients and the mixture components are generalized linear models (GLIM's). Learning is treated as a maximum likelihood problem; in particular, we present an Expectation-Maximization (EM) algorithm for adjusting the parameters of the architecture. We also develop an on-line learning algorithm in which the parameters are updated incrementally. Comparative simulation results are presented in the robot dynamics domain.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning Tree algorithm to find the ML and MAP mixtureof trees for a variety of priors, including the Dirichlet and the MDL priors.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning Tree algorithm to find the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors. We also show that the single tree classifier acts like an implicit feature selector, thus making the classification performance insensitive to irrelevant attributes. Experimental results demonstrate the excellent performance of the new model both in density estimation and in classification.

Active citizenship

The aim of this activity is to allow students to explore the nature of political action, which can be thought of as a form of active as opposed to passive citizenship. By learning about and reflecting upon past instances of political action, or activism, students will be able to start thinking about what is likely to make a campaign successful. It is intended that these reflections can then be applied to their own actions as active citizens. It is hoped that the historical case studies combined with the information provided on different campaigning tools and methods will help to make students feel empowered and inspired to take action. In setting students the task of planning an action, it is expected that time management and organizational skills will be improved. It is believed that by putting themselves in the shoes of activists and going through the process of planning an action, they will have an engaged learning experience. The reflective element of the activity encourages students to form and defend opinions on the relative strengths and weaknesses of different campaigning methods, and on the acceptable limits to political action. This learning activity has been designed presuming no prior knowledge of activism or its methods, and has been successfully used with first year undergraduate students from a variety of disciplines. However, the activity provides a basis for more in-depth study of several issues, or alternatively study into further examples of campaign organizations. There are 3 different learning activities presented on this web site. For a dynamic and well-illustrated introduction to contemporary activism, see Jordan, T. (2002) Activism!: Direct Action, Hacktivism and the Future of Society, London: Reaktion Books Ltd. This material is also available via JORUM.