小鹰500飞机获颁型号许可证

中国民用航空局向中航通飞华北飞机工业有限公司颁发了小鹰500飞机型号合格证（TC证）。这标志着中航通色华北公司将完全拥有了小鹰500飞机设计、制造知识产权。     

Mocking Ads through Mobile Web Services

The need for creativity is ubiquitous, and mobile devices connected to Web services can help us. Linguistic creativity is widely used in advertisements to surprise us, to get our attention, and to stick concepts in our memory. However, creativity can also be used as a defense. When we walk in the street, we are overwhelmed by messages that try to get our attention with any persuasive device at hand. As messages get ever more aggressive, often our basic cognitive defenses—trying not to perceive those messages—are not sufficient. One advanced defensive technique is based on transforming the perceived message into something different (for instance, making use of irony or hyperbole) from what was originally meant in the message. In this article, we describe an implemented application for smartphones, which creatively modifies the linguistic expression in a virtual copy of a poster encountered on the street. The mobile system is inspired by the subvertising practice of countercultural art.     

Nonlinear output regulation for invertible nonlinear MIMO systems

In this paper, we address the problem of output regulation for a broad class of multi‐input multi‐output (MIMO) nonlinear systems. Specifically, we consider input–affine systems, which are invertible and input–output linearizable. This class includes, as a trivial special case, the class of MIMO systems which possess a well‐defined vector relative degree. It is shown that if a system in this class is strongly minimum phase, in a sense specified in the paper, the problem of output regulation can be solved via partial‐state feedback or via (dynamic) output feedback. The result substantially broadens the class of nonlinear MIMO systems for which the problem in question is known to be possible. Copyright © 2015 John Wiley & Sons, Ltd.     

Nonrigid structure-from-motion: estimating shape and motion with hierarchical Priors

This paper describes methods for recovering time-varying shape and motion of non-rigid 3D objects from uncalibrated 2D point tracks. For example, given a video recording of a talking person, we would like to estimate the 3D shape of the face at each instant, and learn a model of facial deformation. Time-varying shape is modeled as a rigid transformation combined with a non-rigid deformation. Reconstruction is ill-posed if arbitrary deformations are allowed, and thus additional assumptions about deformations are required. We first suggest restricting shapes to lie within a low-dimensional subspace, and describe estimation algorithms. However, this restriction alone is insufficient to constrain reconstruction. To address these problems, we propose a reconstruction method using a Probabilistic Principal Components Analysis (PPCA) shape model, and an estimation algorithm that simultaneously estimates 3D shape and motion for each instant, learns the PPCA model parameters, and robustly fills-in missing data points. We then extend the model to model temporal dynamics in object shape, allowing the algorithm to robustly handle severe cases of missing data.     

Exploiting probability density function of deep convolutional autoencoders’ latent space for reliable COVID-19 detection on CT scans

The Journal of Supercomputing - We present a probabilistic method for classifying chest computed tomography (CT) scans into COVID-19 and non-COVID-19. To this end, we design and train, in an...     

Photonic-aware neural networks

Neural Computing and Applications - Photonics-based neural networks promise to outperform electronic counterparts, accelerating neural network computations while reducing power consumption and...     

Tunable electrochemistry of gold-silver alloy nanoshells

Nano Research - The widespread and increasing interest in enhancing biosensing technologies by increasing their sensitivities and lowering their costs has led to the exploration and application of...     

Surgical management of total anomalous pulmonary venous drainage: impact of coexisting cardiac anomalies

BACKGROUND: Recent reports have cited improving results for surgical management of isolated total anomalous pulmonary venous drainage. Complex cases (with other cardiac anomalies) are less frequently reported and are associated with higher mortality. METHODS: Retrospective review identified 170 consecutive patients treated for total anomalous pulmonary venous drainage from 1982 to 1996: 44 cases were "complex" (with significant associated cardiac lesions) and 126 cases were "simple." RESULTS: Operative mortality for simple cases decreased from 26% to 8%, and mortality for complex cases remained constant at 52%. Age, size, and the presence of atrial isomerism were univariate predictors of mortality. Multivariable analysis identified only univentricular hearts and associated cardiac lesions as predictors of operative mortality. Pulmonary artery (n = 16) and arteriopulmonary (n = 7) shunting strategies for complex cases resulted in less than 30% long-term survival. CONCLUSIONS: Despite improvement in survival for simple cases, management of total anomalous pulmonary venous drainage with single-ventricle hearts or other associated cardiac lesions remains problematic.     

Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks

In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not synchronized. We name the new model Non Synchronized CAQT (NSCAQT). Clearly, this new extension to the model only affects those scheduling policies that use some form of timing. In a first approach we consider the case in which although not synchronized, all clocks run at the same speed, maintaining constant differences. In this case we show that all universally stable policies in CAQT that use the injection time and the remaining path to schedule packets remain universally stable. These policies include, for instance, Shortest in System (SIS) and Longest in System (LIS). Then, we study the case in which clock differences can vary over time, but the maximum difference is bounded. In this model we show the universal stability of two families of policies related to SIS and LIS respectively (the priority of a packet in these policies depends on the arrival time and a function of the path traversed). The bounds we obtain in this case depend on the maximum difference between clocks. This is a necessary requirement, since we also show that LIS is not universally stable in systems without bounded clock difference. We then present a new policy that we call Longest in Queues (LIQ), which gives priority to the packet that has been waiting the longest in edge queues. This policy is universally stable and, if clocks maintain constant differences, the bounds we prove do not depend on them. To finish, we provide with simulation results that compare the behavior of some of these policies in a network with stochastic injection of packets.