An interactive mobile learning system for generic wireless networks

This paper describes how a simple interactive mobile learning system, originally developed for the 2G system, evolved to a system for the 3G (TD-SCDMA) system, then to a system for the WiFi access system and finally become a generic Interactive Wireless Mobile Learning System which can be used in any wireless networks. The system designs in different stages of evolution are presented. To promote mobile learning and celebrate the Beijing 2008 Olympics, the Wireless Mobile Learning System was modified to become a tool used in an Inter-School Mobile Quiz Contest with participation of 17 secondary and primary schools and the results were very successful and encouraging.published_or_final_versionThe 5th IEEE GCC Conference & Exhibition, Kuwait City, Kuwait, 17-19 March 2009. In Proceedings of the IEEE - GCC Conference & Exhibitio

Exception handling in distributed workflow systems using mobile agents

2005-2006 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

End-to-End Learning of Video Super-Resolution with Motion Compensation

Learning approaches have shown great success in the task of super-resolving an image given a low resolution input. Video super-resolution aims for exploiting additionally the information from multiple images. Typically, the images are related via optical flow and consecutive image warping. In this paper, we provide an end-to-end video super-resolution network that, in contrast to previous works, includes the estimation of optical flow in the overall network architecture. We analyze the usage of optical flow for video super-resolution and find that common off-the-shelf image warping does not allow video super-resolution to benefit much from optical flow. We rather propose an operation for motion compensation that performs warping from low to high resolution directly. We show that with this network configuration, video super-resolution can benefit from optical flow and we obtain state-of-the-art results on the popular test sets. We also show that the processing of whole images rather than independent patches is responsible for a large increase in accuracy.Comment: Accepted to GCPR201

Adherence therapy versus routine psychiatric care for people with schizophrenia spectrum disorders : a randomised controlled trial

2015-2016 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Irreducible Highest Weight Representations Of The Simple n-Lie Algebra

A. Dzhumadil'daev classified all irreducible finite dimensional representations of the simple n-Lie algebra. Using a slightly different approach, we obtain in this paper a complete classification of all irreducible, highest weight modules, including the infinite-dimensional ones. As a corollary we find all primitive ideals of the universal enveloping algebra of this simple n-Lie algebra.Comment: 24 pages, 24 figures, mistake in proposition 2.1 correcte

Visualizing sound emission of elephant vocalizations: evidence for two rumble production types

Recent comparative data reveal that formant frequencies are cues to body size in animals, due to a close relationship between formant frequency spacing, vocal tract length and overall body size. Accordingly, intriguing morphological adaptations to elongate the vocal tract in order to lower formants occur in several species, with the size exaggeration hypothesis being proposed to justify most of these observations. While the elephant trunk is strongly implicated to account for the low formants of elephant rumbles, it is unknown whether elephants emit these vocalizations exclusively through the trunk, or whether the mouth is also involved in rumble production. In this study we used a sound visualization method (an acoustic camera) to record rumbles of five captive African elephants during spatial separation and subsequent bonding situations. Our results showed that the female elephants in our analysis produced two distinct types of rumble vocalizations based on vocal path differences: a nasally- and an orally-emitted rumble. Interestingly, nasal rumbles predominated during contact calling, whereas oral rumbles were mainly produced in bonding situations. In addition, nasal and oral rumbles varied considerably in their acoustic structure. In particular, the values of the first two formants reflected the estimated lengths of the vocal paths, corresponding to a vocal tract length of around 2 meters for nasal, and around 0.7 meters for oral rumbles. These results suggest that African elephants may be switching vocal paths to actively vary vocal tract length (with considerable variation in formants) according to context, and call for further research investigating the function of formant modulation in elephant vocalizations. Furthermore, by confirming the use of the elephant trunk in long distance rumble production, our findings provide an explanation for the extremely low formants in these calls, and may also indicate that formant lowering functions to increase call propagation distances in this species'

Atypical lateralization of phonological working memory in developmental dyslexia

published_or_final_versio

Obstacle Numbers of Planar Graphs

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility graph has no crossing edges (hence that it is a planar geometric drawing of $G$). In this paper, we prove that the maximum planar obstacle number of a planar graph of order $n$ is $n-3$, the maximum being attained (in particular) by maximal bipartite planar graphs. This displays a significant difference with the standard obstacle number, as we prove that the obstacle number of every bipartite planar graph (and more generally in the class PURE-2-DIR of intersection graphs of straight line segments in two directions) of order at least $3$ is $1$.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

A new lateral trench-gate conductivity modulated power transistor

In this paper, a new conductivity modulated power transistor called the Lateral Trench-Gate Bipolar Transistor (LTGBT) is presented. This structure incorporates a trench-gate in which the locations of the channel and source in conventional LIGBT have been interchanged. This channel and source arrangement results in significant improvement in latch-up current density. Experimental results indicate that the static and dynamic latch-up current densities are improved by 2.3 and 4.2 times, respectively, compared to those of the LIGBT at a n+ cathode length of 5 μm. Dependence of the latch-up current density of the LTGBT on the design of the n+ and p+ cathode regions is examined both numerically and experimentally. The maximum controllable current density is found to be increased when the space between the trench-gate and the p+ cathode is reduced. Specifically, as the space is decreased to 2 μm, no latch-up phenomenon was observed. This nonlatch-up characteristic is obtained at the expense of a slight increase (0.8 V) in threshold voltage.published_or_final_versio