Remote-Controlled Ambidextrous Robot Hand Concept

In the development of robotic limbs, the side of members is of importance to define the shape of artificial limbs and the range of movements. It is mainly significant tbr biomedical applications concerning patients suffering arms or legs injuries, fn this paper, the concept of an ambidextrous design lbr robot hands is introduced. The fingers can curl in one xvay or another, to imitate either a right hand or a left hand. The advantages and inconveniences of different models have been investigated to optimise the range and the maximum force applied by fingers. Besides, a remote control interthce is integrated to the system, allowing both to send comrnands through internet and to display a video streaming of the ambidextrous hand as feedback. Therefore, a robotic prosthesis could be used for the first time in telerehabilitation. The main application areas targeted are physiotherapy alter strokes or management of phantom pains/br amputees by/earning to control the ambidextrous hand. A client application is also accessible on Facehook social network, making the robotic limb easily reachable for the patients. Additionally the ambidextrous hand can be used tbr robotics research as well as artistic performances.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGCIust) that builds layers of subgraphs based on this matrix and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure, we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

LEGClust- a clustering algorithm based on layered entropic subgraphs.

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

Software reuse: The Brazilian industry scenario

This paper aims at identifying some of the key factors in adopting an organization-wide software reuse program. The factors are derived from practical experience reported by industry professionals, through a survey involving 57 Brazilian small, medium and large software organizations. Some of them produce software with commonality between applications, and have mature processes, while others successfully achieved reuse through isolated, ad hoc efforts. The paper compiles the answers from the survey participants, showing which factors were more associated with reuse success. Based on this relationship, a guide is presented, pointing out which factors should be more strongly considered by small, medium and large organizations attempting to establish a reuse program.     

Investigations of development process of high hollow beveled microneedles using a combination of ICP RIE and dicing saw

Micromachined needles provide a promising technology for painless delivery of molecules or foreign substance into a living cell. Over the recent years, a variety of different microneedle shapes and materials have been studied and have shown their facility to disrupt stratum corneum layer to increase the skin permeability. In this paper, we described an alternative process to fabricate high and beveled hollow out-of-plane microneedles. Silicon microneedles dimensions are 40–60 μm in inner diameter, 150–200 μm in outer diameter and over 700 μm in height. Tip angles reached are from 30° to 45°.     

Multimodal focus attention and stress detection and feedback in an augmented driver simulator

This paper presents a driver simulator, which takes into account the information about the user’s state of mind (level of attention, fatigue state, stress state). The user’s state of mind analysis is based on video data and biological signals. Facial movements such as eyes blinking, yawning, head rotations, etc., are detected on video data: they are used in order to evaluate the fatigue and the attention level of the driver. The user’s electrocardiogram and galvanic skin response are recorded and analyzed in order to evaluate the stress level of the driver. A driver simulator software is modified so that the system is able to appropriately react to these critical situations of fatigue and stress: some audio and visual messages are sent to the driver, wheel vibrations are generated and the driver is supposed to react to the alert messages. A multi-threaded system is proposed to support multi-messages sent by the different modalities. Strategies for data fusion and fission are also provided. Some of these components are integrated within the first prototype of OpenInterface: the multimodal similar platform.     

Joint Estimation of Location and Scatter in Complex Elliptically Symmetric Distributions

The joint estimation of the location vector and the shape matrix of a set of independent and identically Complex Elliptically Symmetric (CES) distributed observations is investigated from both the theoretical and computational viewpoints. This joint estimation problem is framed in the original context of semiparametric models allowing us to handle the (generally unknown) density generator as an infinite-dimensional nuisance parameter. In the first part of the paper, a computationally efficient and memory saving implementation of the robust and semiparmaetric efficient R-estimator for shape matrices is derived. Building upon this result, in the second part, a joint estimator, relying on the Tyler’s M-estimator of location and on the R-estimator of shape matrix, is proposed and its Mean Squared Error (MSE) performance compared with the Semiparametric Cramér-Rao Bound (SCRB).

     

Lateral inventory transshipment problem in online-to-offline supply chain

Online-to-offline (OTO) is a new commercial model with enormous market potential. Online customer orders are forwarded to the offline brick-and-mortar store to fulfil, which is a combination of dual-channel supply chain. OTO overcomes many disadvantages of the traditional dual-channel supply chain, but still faces uncertain market demand. To reduce the inventory risk caused by demand uncertainty, lateral inventory transshipment is employed in this paper to pool inventory risk in OTO supply chain. We model centralised OTO and decentralised OTO with/without transshipment, and then analyse different scenarios. Our results demonstrate that there exists a unique Nash equilibrium of inventory order levels in dual channels and an optimal transshipment price to maximise the profit of the entire supply chain. Finally, we provide a numerical example of uniform demand distribution. Our analyses offer many managerial insights and show that transshipment always benefits the OTO supply chain.