No abstract

M.H. Lee, Q. Meng and F. Chao, 'Staged Competence Learning in Developmental Robotics', Adaptive Behavior, 15(3), pp 241-255, 2007. the full text will be available in September 2008Developmental psychology has long recognized the presence of stages in human cognitive development, although the underlying causes and processes are still an open question and subject to much debate. This article draws inspiration from psychology and describes an approach towards developmental growth for robotics that utilizes natural constraints in a general learning mechanism. The method, summarized as Lift-Constraint, Act, Saturate (LCAS), is applicable to all levels of control and behavior, and can be implemented in any robotic configuration. An implementation based on sensory-motor learning in early infancy is described and the results from experiments are presented and discussed.Peer reviewe

Cinchona alkaloid-derived chiral catalysts represent one of the most widely applied class of organocatalysts, which have been successfully utilized in the promotion of a wide variety of asymmetric reactions. Cinchona alkaloids exist in nature as pseudoenantiomers, which allow cinchona alkaloid-catalyzed reactions to provide high enantioselectivities and yields toward both enantiomers of interest in many reactions. On the other hand, the subtle structural difference between pseudoenantiomeric cinchona alkaloids could also lead to uneven efficiency that severely limits the applicability of some cinchona alkaloid-catalyzed reactions. We describe here the elucidation of the origin of and the consequent development of novel modified cinchona alkaloids to address such a problem in asymmetric imine umpolung reactions by cinchonium salts.

Classifier ensembles constitute one of the main research directions in machine learning and data mining. The use of multiple classifiers generally allows better predictive performance than that achievable with a single model. Several approaches exist in the literature that provide means to construct and aggregate such ensembles. However, these ensemble systems contain redundant members that, if removed, may further increase group diversity and produce better results. Smaller ensembles also relax the memory and storage requirements, reducing system's run-time overhead while improving overall efficiency. This paper extends the ideas developed for feature selection problems to support classifier ensemble reduction, by transforming ensemble predictions into training samples, and treating classifiers as features. Also, the global heuristic harmony search is used to select a reduced subset of such artificial features, while attempting to maximize the feature subset evaluation. The resulting technique is systematically evaluated using high dimensional and large sized benchmark datasets, showing a superior classification performance against both original, unreduced ensembles, and randomly formed subsets.

Electronic government (e-government) uses information and communication technologies to deliver public services to individuals and organisations effectively, efficiently and transparently. E-government is one of the most complex systems which needs to be distributed, secured and privacy-preserved, and the failure of these can be very costly both economically and socially. Most of the existing e-government systems such as websites and electronic identity management systems (eIDs) are centralized at duplicated servers and databases. A centralized management and validation system may suffer from a single point of failure and make the system a target to cyber attacks such as malware, denial of service attacks (DoS), and distributed denial of service attacks (DDoS). The blockchain technology enables the implementation of highly secure and privacy-preserving decentralized systems where transactions are not under the control of any third party organizations. Using the blockchain technology, exiting data and new data are stored in a sealed compartment of blocks (i.e., ledger) distributed across the network in a verifiable and immutable way. Information security and privacy are enhanced by the blockchain technology in which data are encrypted and distributed across the entire network. This paper proposes a framework of a decentralized e-government peer-to-peer (p2p) system using the blockchain technology, which can ensure both information security and privacy while simultaneously increasing the trust of the public sectors. In addition, a prototype of the proposed system is presented, with the support of a theoretical and qualitative analysis of the security and privacy implications of such system.

BackgroundConventional methods of motor imagery brain computer interfaces (MI-BCIs) suffer from the limited number of samples and simplified features, so as to produce poor performances with spatial-frequency features and shallow classifiers.MethodsAlternatively, this paper applies a deep recurrent neural network (RNN) with a sliding window cropping strategy (SWCS) to signal classification of MI-BCIs. The spatial-frequency features are first extracted by the filter bank common spatial pattern (FB-CSP) algorithm, and such features are cropped by the SWCS into time slices. By extracting spatial-frequency-sequential relationships, the cropped time slices are then fed into RNN for classification. In order to overcome the memory distractions, the commonly used gated recurrent unit (GRU) and long-short term memory (LSTM) unit are applied to the RNN architecture, and experimental results are used to determine which unit is more suitable for processing EEG signals.ResultsExperimental results on common BCI benchmark datasets show that the spatial-frequency-sequential relationships outperform all other competing spatial-frequency methods. In particular, the proposed GRU-RNN architecture achieves the lowest misclassification rates on all BCI benchmark datasets.ConclusionBy introducing spatial-frequency-sequential relationships with cropping time slice samples, the proposed method gives a novel way to construct and model high accuracy and robustness MI-BCIs based on limited trials of EEG signals.

This is the author accepted manuscript. The final version is available from Institute of Electrical and Electronics Engineers (IEEE) via http://dx.doi.org/10.1109/TFUZZ.2016.2582526As a substantial extension to fuzzy rule interpolation that works based on two neighbouring rules flanking an observation, adaptive fuzzy rule interpolation is able to restore system consistency when contradictory results are reached during interpolation. The approach first identifies the exhaustive sets of candidates, with each candidate consisting of a set of interpolation procedures which may jointly be responsible for the system inconsistency. Then, individual candidates are modified such that all contradictions are removed and thus interpolation consistency is restored. It has been developed on the assumption that contradictions may only be resulted from the underlying interpolation mechanism, and that all the identified candidates are not distinguishable in terms of their likelihood to be the real culprit. However, this assumption may not hold for real world situations. This paper therefore further develops the adaptive method by taking into account observations, rules and interpolation procedures, all as diagnosable and modifiable system components. Also, given the common practice in fuzzy systems that observations and rules are often associated with certainty degrees, the identified candidates are ranked by examining the certainty degrees of its components and their derivatives. From this, the candidate modification is carried out based on such ranking. This work significantly improves the efficacy of the existing adaptive system by exploiting more information during both the diagnosis and modification processes.publishersversionPeer reviewe

No abstract