1380525
Towards a force-reflecting motion-scale system for microsurgery
This paper presents design aspects of a force-reflecting, motion-scaling teleoperation system for use in microsurgery experiments. A coarse-macro-micro approach is proposed. Two magnetically levitated wrists-a macro-master and a micro-slave-would share a common base positioned at the surgical site by a coarse-motion transport robot. The discussion includes features of the proposed system, a detailed slave wrist description, and aspects of coordination and control for the multistage teleoperation.<<ETX>>
6655534
Wing transmission for a micromechanical flying insect
Flapping wings provide unmatched manoeuvrability for flying microrobots. Recent advances in modelling insect aerodynamics show that adequate wing rotation at the end of the stroke is essential for generating adequate flight forces. We developed a thorax structure using four bar frames combined with an extensible fan-fold wing to provide adequate wing stroke and rotation. Flow measurements on a scale model of the beating wing show promising aerodynamics. Calculations using a simple resonant mechanical circuit model show that piezoelectric actuators can generate sufficient power, force and stroke to drive the wings at 150 Hz.
7363256
Towards flapping wing control for a micromechanical flying insect
Considers a 2 DOF resonant thorax structure signed and fabricated for the MFI project. Miniature piezoelectric PZN-PT unimorph actuators were fabricated and used to drive a four-bar transmission mechanism. The current thorax design utilizes two actuated four-bars and a spherical joint to drive a rigid wing. Rotationally compliant flexure joints have been tested with lifetimes over 10/sup 6/ cycles. Wing spars were instrumented with strain gauges for force measurement and closed-loop wing control.
17691685
WFMS-based Data Integration for e-Learning
As more and more organisations and institutions are moving towards the e-learning strategy, more and more disparate data are distributed by different e-learning systems. How to effectively use this vast amount of distributed data becomes a big challenge. This paper addresses this challenge and works out a new mechanism to implement data integration for e-learning. A workflow management system based (WFMS-based) data integration model is contributed to the e-learning
16598523
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs
Suppose G = (V, E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 ⩽ ri ⩽ ¦Ci¦. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ¦D ∩ Ci¦ ⩾ ri for every maximal clique Ci of G. The problem includes the clique-transversal problem, the i, 1 clique-cover problem, and for perfect graphs, the maximum q-colorable subgraph problems as special cases. This paper gives complexity results for the problem on subclasses of chordal graphs, e.g., strongly chordal graphs, k-trees, split graphs, and undirected path graphs.
34419420
A Semantic Analyzer for Aiding Emotion Recognition in Chinese
13986906
Decentralised Coordination for Software Process Enactment
Software process enactment mainly involves coordination of relevant team members to enact various tasks, which is supported by a centralised client/server architecture traditionally. This paper adopts concepts from peer-to-peer computing and presents an innovative approach to support decentralised process enactment. With this approach, team members are supported with coordination by direct communication among peers, which reflects applications’ increasingly distributed nature better. In addition, as a software process may be modelled incompletely at modelling time, a mechanism supporting run-time refinement of incomplete processes is also described in this paper.
15940423
k-Path Partitions in Trees
For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2-path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the minimum number of message originators necessary to broadcast a message to all vertices in a tree network in one or two time units.