Using Action Research to Improve Communication and Facilitate Group Work in a Multicultural Classroom: A South African Case Study

This study started with problems that my colleagues (and I) were experiencing with interaction and intercultural communication among students in our diverse classrooms. Educators were also experiencing difficulties in motivating students to work effectively in groups. The purpose of this paper was to seek solutions to these problems by exploring variations of the group oral assessment structure in a multilingual and multicultural context. Four phases of assessments were conducted at two tertiary institutions in South Africa using a combination of action research and a participatory approach. Not only did this study succeed in addressing the problems but it also revealed the added benefits of using an action research methodology.     

CONSTRUCTIVE KISSING NUMBERS IN HIGH-DIMENSIONAL SPACES

In the present paper, we focus on constructive spherical codes. By employing algebraic geometry codes, we give an explicit construction of spherical code sequences. By making use of the idea involved in the proof of the Gilbert-Varshamov bound in coding theory, we construct a spherical code sequence in exponential time which meets the best-known asymptotic bound by Shamsiev and Wyner.     

On the Meromorphic Solutions of Linear Differential Equations

In this paper, we investigate the growth of meromorphic solutions of higher order linear differential equation f^（k） ＋Ak-1 （z）e^Pk-1^（z） f^（k-1） ＋…＋A1 （z）e^P1（z） f′ ＋Ao（z）e^Po（z） f = 0 （k ≤ 2）, where Pj（z） （j = 0, 1,..., k - 1） are nonconstant polynomials such that deg Pj = n （j = 0, 1,..., k - 1） and Aj（z）（≠ 0） （j = 0, 1,..., k - 1） are meromorphic functions with order p（Aj） 〈 n （j = 0, 1,..., k - 1）.     

EXPLORATION/EXPLOITATION TRADEOFF WITH CELL-SHIFT AND HEURISTIC CROSSOVER FOR EVOLUTIONARY ALGORITHMS

In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm （EA） is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains （cell） and each individual locates at an ndimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells （exploration） and subsequently shift the first individual from its initial place to the other individual＇s cell place. If they are already in the same cell heuristic crossover （exploitation） is used. Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity. The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.     

EXISTENCE AND UNIQUENESS AND STABILITY OF SOLUTIONS FOR STOCHASTIC IMPULSIVE SYSTEMS

This paper studies the existence, uniqueness, and stability of solutions for stochastic impulsive systems. By employing Lyapunov-like functions, some sufficient conditions of the global existence, uniqueness, and stability of solutions for stochastic impulsive systems are established. Furthermore, the results are specialized to the case of linear stochastic impulsive systems. Finally, some examples are given to illustrate the applications of our theory.     

AN EXPONENTIAL INEQUALITY FOR AUTOREGRESSIVE PROCESSES IN ADAPTIVE TRACKING

A wide range of literature concerning classical asymptotic properties for linear models with adaptive control is available, such as strong laws of large numbers or central limit theorems. Unfortunately, in contrast with the situation without control, it appears to be impossible to find sharp asymptotic or nonasymptotic properties such as large deviation principles or exponential inequalities. Our purpose is to provide a first step towards that direction by proving a very simple exponential inequality for the standard least squares estimator of the unknown parameter of Gaussian autoregressive process in adaptive tracking.     

INFORMATION CHARACTERIZATION OF COMMUNICATION CHANNELS FOR SYSTEM IDENTIFICATION

This paper studies identification of systems in which the system output is quantized, transmitted through a digital communication channel, and observed afterwards. The concept of the CR Ratio is introduced to characterize impact of communication channels on identification. The relationship between the CR Ratio and Shannon channel capacity is discussed. Identification algorithms are further developed when the channel error probability is unknown.     

PEAK COVARIANCE STABILITY OF A RANDOM RICCATI EQUATION ARISING FROM KALMAN FILTERING WITH OBSERVATION LOSSES

We consider the stability of a random Riccati equation with a Markovian binary jump coefficient. More specifically, we are concerned with the boundedness of the solution of a random Riccati difference equation arising from Kalman filtering with measurement losses. A sufficient condition for the peak covariance stability is obtained which has a simpler form and is shown to be less conservative in some cases than a very recent result in existing literature. Furthermore, we show that a known sufficient condition is also necessary when the observability index equals one.     

ROLE OF α-PSEUDO-UNIVEX FUNCTIONS IN VECTOR VARIATIONAL-LIKE INEQUALITY PROBLEMS

In this paper, we introduce a new class of generalized convex function, namely, a-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinement and improvement of previously known results.     

用小波变换和奇异指数表征蔡氏混沌信号键带

计算了蔡氏电路混沌信号的离散二进小波变换及奇异指数，结果发现，当尺度2∧5上的小波变换结果的模大于某一阈值时，其所对应的信号段就是键带，在混沌信号的键带处，奇异指数限大的正值，而在非键带处，奇异指数取负值或小的正值。