Guiding students to the right questions: adaptive navigation support in an E‐Learning system for Java programming

Rapid growth of the volume of interactive questions available to the students of modern E‐Learning courses placed the problem of personalized guidance on the agenda of E‐Learning researchers. Without proper guidance, students frequently select too simple or too complicated problems and ended either bored or discouraged. This paper explores a specific personalized guidance technology known as adaptive navigation support. We developed JavaGuide, a system, which guides students to appropriate questions in a Java programming course, and investigated the effect of personalized guidance a three‐semester long classroom study. The results of this study confirm the educational and motivational effects of adaptive navigation support.     

Optimization of quality and operational costs through improved scheduling of harvest operations

The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems.     

Guanxi Networks and Creativity in Taiwanese Project Teams

Personal connections, also called guanxi in Chinese culture, are embedded within a network of interdependent social exchanges, providing access to resources, information and supports, therefore facilitating performance. Building guanxi networks means building social networks. Project teams are commonly used as fundamental units in organizations, partly in order to generate more creative ideas, and so this paper evaluates how project teams use their guanxi networks within and outside of their teams and across boundaries to stimulate their creative performance. Fifty‐four product development project teams with 293 members from high‐tech Taiwanese firms participated in this study. Findings suggested that, in a guanxi culture such as Taiwan's, in order to facilitate a project team's creative performance, the most important task is to develop a more cohesive social unit before the team extends its external networks, since Chinese culture regards people first as members of groups, and secondly as individuals.     

A Complex View of Barycentric Mappings

Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex functions has various advantages when interpolating two‐dimensional data in the plane, and in particular for holomorphic maps. We extend and generalize these results by investigating the complex representation of real‐valued barycentric coordinates, when applied to planar domains. We show how the construction for generating real‐valued barycentric coordinates from a given weight function can be applied to generating complex‐valued coordinates, thus deriving complex expressions for the classical barycentric coordinates: Wachspress, mean value, and discrete harmonic. Furthermore, we show that a complex barycentric map admits the intuitive interpretation as a complex‐weighted combination of edge‐to‐edge similarity transformations, allowing the design of “home‐made” barycentric maps with desirable properties. Thus, using the tools of complex analysis, we provide a methodology for analyzing existing barycentric mappings, as well as designing new ones.     

Skeleton computation of orthogonal polyhedra

Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the straight skeleton of a polygon, the straight skeleton of polyhedra has been paid much less attention. We require to compute the skeleton of very large datasets storing orthogonal polyhedra. Furthermore, we need to treat geometric degeneracies that usually arise when dealing with orthogonal polyhedra. We present a new approach so as to robustly compute the straight skeleton of orthogonal polyhedra. We follow a geometric technique that works directly with the boundary of an orthogonal polyhedron. Our approach is output sensitive with respect to the number of vertices of the skeleton and solves geometric degeneracies. Unlike the existing straight skeleton algorithms that shrink the object boundary to obtain the skeleton, our algorithm relies on the plane sweep paradigm. The resulting skeleton is only composed of axis‐aligned and 45° rotated planar faces and edges.     

Comparison of image reconstruction by using near‐field and far‐field data for an imperfect conductor

Image reconstruction by using near‐field and far‐field data for an imperfectly conducting cylinder is investigated. A conducting cylinder of unknown shape and conductivity scatters the incident wave in free space and the scattered near and far fields are measured. By using measured fields, the imaging problem is reformulated into an optimization problem and solved by the genetic algorithm. Numerical results show that the convergence speed and final reconstructed results by using near‐field data are better than those obtained by using far‐field data. This work provides both comparative and quantitative information. © 2001 John Wiley & Sons, Inc. Int J RF and Microwave CAE 11: 69–73, 2001.     

Robust tracking control design for uncertain robotic systems with persistent bounded disturbances

In this study, a robust nonlinear L_∞‐gain tracking control design for uncertain robotic systems is proposed under persistent bounded disturbances. The design objective is that the peak of the tracking error in time domain must be as small as possible under persistent bounded disturbances. Since the nonlinear L_∞ ‐gain optimal tracking control cannot be solved directly, the nonlinear L_∞ ‐gain optimal tracking problem is transformed into a nonlinear L_∞ ‐gain tracking problem by given a prescribed disturbance attenuation level for the L_∞ ‐gain tracking performance. To guarantee that the L_∞ ‐gain tracking performance can be achieved for the uncertain robotic systems, a sliding‐mode scheme is introduced to eliminate the effect of the parameter uncertainties. By virtue of the skew‐symmetric property of the robotic systems, sufficient conditions are developed for solving the robust L_∞ ‐gain tracking control problems in terms of an algebraic equation instead of a differential equation. The proposed method is simple and the algebraic equation can be solved analytically. Therefore, the proposed robust L_∞ ‐gain tracking control scheme is suitable for practical control design of uncertain robotic systems. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society