Labahitha nom.n., çàìåùàþùåå íàçâàíèå äëÿ Mystes Bristowe, 1938, ñ ïåðåîïèñàíèåì òèïîâîãî âèäà (Aranei: Filistatidae)

The monotypic genus Mystes Bristowe, 1938, and its type species, M. oonopiformis Bristowe, 1938, are redescribed based on the neotype male (designated here) and several females. The male is described for the first time and the female endogyne is illustrated for the first time. Morphological analysis reveals that the genus belongs to the Prithinae and is close to the Australian genera Wandella Gray, 1994 and Yardiella Gray, 1994. As the name Mystes is preoccupied by Mystes Champion, 1895 (Coleoptera: Melandryidae), we propose Labahitha nom.n. as a replacement name.Монотипичный род Mystes Bristowe, 1938, и его типовой вид M. oonopiformis Bristowe, 1938 переописываются по обозначенному здесь сам- цу-неотипу и нескольким самкам. Впервые для вида описываются самец и приводятся изображения эн- догины самки. Морфологические признаки этого рода указывают на то, что он принадлежит к под- сем. Prithinae и может быть близкородственным по отношению к Wandella Gray, 1994, и Yardiella Gray, 1994. Так как название Mystes преоккупировано ро- дом Mystes Champion, 1895 (Coleoptera: Melandryidae), мы предлагаем Labahitha nom. n. как замеща- ющее название.Fil: Zonstenin, Sergei L.. Steinhardt Museum Of Natural History, Tel-aviv Universi; IsraelFil: Marusik, Yuri M.. Institute For Biological Problems Of The North; RusiaFil: Fiorini de Magalhaes, Ivan Luiz. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Museo Argentino de Ciencias Naturales ; Argentin

The B -- TAU FCNC connection in SUSY Unified Theories

In the context of SUSY grand unification a link is established between the hadronic and leptonic soft breaking sectors. Such relation is here exploited in particular for FCNC processes in B physics. It is shown how bounds on leptonic FCNC involving the third generation translate into constraints on FC B decays. In the second part of the contribution we show that tests of lepton universality in K and B decays can represent an interesting handle to obtain relevant information on the amount of FCNC in the second and third fermion generation.Comment: 9 pages, 4 figures. Based on talks given at: DIF06, International Workshop on discoveries in flavour physics at e+e- colloders, Laboratori Nazionali di Frascati (Italy), February 28- March 03, 2006; XLIst Rencontres de Moriond, La Thuile, 5-11 March 2006; CORFU2005, Corfu Summer Institute on EPP, Corfu, Greece, September 4-26, 200

Time Calibration of TileCal Modules with Cosmic Muons

A method to synchronize TileCal readout in time using cosmic muons has been developed. It is based on the comparison between the expected time of flight of muons crossing TileCal cells and the measured time. The method has been applied to cosmic data from September and October of 2007, when different sub-detectors of ATLAS were integrated during the Milestone Weeks. The resolution reached with this method is better than 0.7 ns when the statistical error is not the main contribution to the uncertainty

A plug and play transparent communication layer for cloud robotics architectures

The cloud robotics paradigm aims at enhancing the abilities of robots by using cloud services, but it still poses several challenges in the research community. Most of the current literature focuses on how to enrich specific robotic capabilities, overlooking how to effectively establish communication between the two fields. Our work proposes a “plug-and-play” solution to bridge the communication gap between cloud and robotic applications. The proposed solution is designed based on the mature WebSocket technology and it can be extended to any ROS-based robotic platform. The main contributions of this work are the definition of a reliable autoconnection/autoconfiguration mechanism as well as to outline a scalable communication layer that allows the effective control of multiple robots from multiple users. The “plug-and-play” solution was evaluated in both simulated and real scenarios. In the first case, the presence of users and robots was simulated with Robot Operating System (ROS) nodes running on five machines. In the real scenario, three non-expert users teleoperated, simultaneously, three remote robots by using the proposed communication layer with different networking protocols. Results confirmed the reliability at different levels: at startup (success_rate = 100%); during high-rate communications (message_lost = 0%); in performing open-loop spiral trajectories with enhancement, with respect to similar works; and in the quality of simultaneous teleoperations

ADAGSS: Automatic Dataset Generation for Semantic Segmentation

A common issue in medical deep learning research is the creation of dataset for training the neural networks. Medical data collection is also tied-up by privacy laws and even if a lot of medical data are available, often their elaboration can be time demanding. This problem can be avoided using neural networks architectures that can achieve a good predicting precision with few images (e.g. U-Net). In the case of semantic segmentation, the dataset generation is even more cumbersome since it requires the creation of segmentation masks manually. Some automatic ground-truth creation techniques may be employed like filtering, thresholding and Self Organized Maps1 (SOM). These automatic methods can be very powerful and useful, but they always have a bottle-neck phase: data validation. Due to algorithm reliability (that sometimes can fail), data needs to be validated manually before they can be included in a dataset for training. In this work, we propose a method to automatize this phase by moving manual intervention to an easier task: instead of creating masks and then validate them manually, we train a convolutional neural network to classify segmentation quality. Therefore, the validation is performed automatically. An initial manual phase is still required, but the classification task requires a smaller number of elements in the dataset that will feed a network employed for classification. After this phase, similar dataset creations will require less effort. This procedure is based on the fact that to obtain a high classification precision, fewer data are required than the data that are needed to obtain high precision in semantic segmentation. High classification score, can automatize validation procedure in dataset creation, being able to discard failure case in dataset creation. Being able to produce bigger dataset in less time can led to higher precision in semantic segmentation

Effect of PAF on polyrnorphonuclear leucocyte plasma membrane polarity: a fluorescence study

The effect of PAF on the plasma membrane polarity of polymorphonuclear leukocytes (PMNs) was investigated by measuring the steady-state fluorescence emission spectra of 2-dimethylamino(6-1auroyl) naphthalene (Laurdan), which is known to be incorporated at the hydrophobic-hydrophilic interface of the bilayer, displaying spectral sensitivity to the polarity of its surrounding. Laurdan shows a marked steady-state emission blue-shift in non-polar solvents, with respect to polar solvents. Our results demonstrate that PAF (10−7 M) induces a blue shift of the fluorescence emission spectra of Laurdan. These changes are blocked in the presence of the PAF antagonist, L-659,989. Our data indicate that the interaction between PAF and PMNs is accompanied by a decrease in polarity in the hydrophobic-hydrophilic interface of the plasma membrane

The VPN problems with concave costs

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. Combining this with previous results by Fingerhut, Suri and Turner (J. Alg., 1997) and Gupta, Kleinberg, Kumar, Rastogi and Yener (Proc. STOC, 2001), sVPN can be solved in polynomial time. In this paper we investigate an APX-hard generalization of sVPN, where the contribution of each edge to the total cost is proportional to some non-negative, concave and non-decreasing function of the capacity reservation. We show that the tree routing property extends to the new problem, and give a constant-factor approximation algorithm for it. We also show that the undirected uncapacitated single-source minimum concave-cost flow problem has the tree routing property when the cost function has some property of symmetry