Query: Modeling Compositionality with Multiplicative Recurrent Neural Networks

Relevant passages:
Efficient Estimation of Word Representations in Vector Space <=SEP=> We propose two novel model architectures for computing continuous vector representations of words from very large data sets. The quality of these representations is measured in a word similarity task, and the results are compared to the previously best performing techniques based on different types of neural networks. We observe large improvements in accuracy at much lower computational cost, i.e. it takes less than a day to learn high quality word vectors from a 1.6 billion words data set. Furthermore, we show that these vectors provide state-of-the-art performance on our test set for measuring syntactic and semantic word similarities.

A unified architecture for natural language processing: deep neural networks with multitask learning <=SEP=> We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and semantically) using a language model. The entire network is trained jointly on all these tasks using weight-sharing, an instance of multitask learning. All the tasks use labeled data except the language model which is learnt from unlabeled text and represents a novel form of semi-supervised learning for the shared tasks. We show how both multitask learning and semi-supervised learning improve the generalization of the shared tasks, resulting in state-of-the-art-performance.

Semantic Compositionality through Recursive Matrix-Vector Spaces <=SEP=> Single-word vector space models have been very successful at learning lexical information. However, they cannot capture the compositional meaning of longer phrases, preventing them from a deeper understanding of language. We introduce a recursive neural network (RNN) model that learns compositional vector representations for phrases and sentences of arbitrary syntactic type and length. Our model assigns a vector and a matrix to every node in a parse tree: the vector captures the inherent meaning of the constituent, while the matrix captures how it changes the meaning of neighboring words or phrases. This matrix-vector RNN can learn the meaning of operators in propositional logic and natural language. The model obtains state of the art performance on three different experiments: predicting fine-grained sentiment distributions of adverb-adjective pairs; classifying sentiment labels of movie reviews and classifying semantic relationships such as cause-effect or topic-message between nouns using the syntactic path between them.

Recognizing Contextual Polarity in Phrase-Level Sentiment Analysis <=SEP=> This paper presents a new approach to phrase-level sentiment analysis that first determines whether an expression is neutral or polar and then disambiguates the polarity of the polar expressions. With this approach, the system is able to automatically identify thecontextual polarityfor a large subset of sentiment expressions, achieving results that are significantly better than baseline.

Finding Structure in Time <=SEP=> Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a proposal along these lines first described by Jordan (1986) which involves the use of recurrent links in order to provide networks with a dynamic memory. In this approach, hidden unit patterns are fed back to themselves; the internal representations which develop thus reflect task demands in the context of prior internal states. A set of simulations is reported which range from relatively simple problems (temporal version of XOR) to discovering syntactic/semantic features for words. The networks are able to learn interesting internal representations which incorporate task demands with memory demands; indeed, in this approach the notion of memory is inextricably bound up with task processing. These representations reveal a rich structure, which allows them to be highly context-dependent while also expressing generalizations across classes of items. These representations suggest a method for representing lexical categories and the type/token distinction.

Grasping Without Squeezing: Design and Modeling of Shear-Activated Grippers <=SEP=> Grasping objects that are too large to envelop is traditionally achieved using friction that is activated by squeezing. We present a family of shear-activated grippers that can grasp such objects without the need to squeeze. When a shear force is applied to the gecko-inspired material in our grippers, adhesion is turned on; this adhesion in turn results in adhesion-controlled friction, a friction force that depends on adhesion rather than a squeezing normal force. Removal of the shear force eliminates adhesion, allowing easy release of an object. A compliant shear-activated gripper without active sensing and control can use the same light touch to lift objects that are soft, brittle, fragile, light, or very heavy. We present three grippers, the first two designed for curved objects, and the third for nearly any shape. Simple models describe the grasping process, and empirical results verify the models. The grippers are demonstrated on objects with a variety of shapes, materials, sizes, and weights.

Quantifying Mental Health from Social Media with Neural User Embeddings <=SEP=> Mental illnesses adversely affect a significant proportion of the population worldwide. However, the typical methods to estimate and characterize the prevalence of mental health conditions are time-consuming and expensive. Consequently, best-available estimates concerning the prevalence of these conditions are often years out of date. Automated approaches that supplement traditional methods with broad, aggregated information derived from social media provide a potential means of furnishing near real-time estimates at scale. These may in turn provide grist for supporting, evaluating and iteratively improving public health programs and interventions. We propose a novel approach for mental health quantification that leverages user embeddings induced from social media post histories. Recent work showed that learned user representations capture latent aspects of individuals (e.g., political leanings). This paper investigates whether these representations also correlate with mental health statuses. To this end, we induced embeddings for a set of users known to be affected by depression and post-traumatic stress disorder, and for a set of demographically matched ‘control’ users. We then evaluated the induced user representations with respect to: (i) their ability to capture homophilic relations with respect to mental health statuses; and (ii) their predictive performance in downstream mental health models. Our experimental results demonstrate that learned user embeddings capture relevant signals for mental health quantification.

Discriminative shape from shading in uncalibrated illumination <=SEP=> Estimating surface normals from just a single image is challenging. To simplify the problem, previous work focused on special cases, including directional lighting, known reflectance maps, etc., making shape from shading impractical outside the lab. To cope with more realistic settings, shading cues need to be combined and generalized to natural illumination. This significantly increases the complexity of the approach, as well as the number of parameters that require tuning. Enabled by a new large-scale dataset for training and analysis, we address this with a discriminative learning approach to shape from shading, which uses regression forests for efficient pixel-independent prediction and fast learning. Von Mises-Fisher distributions in the leaves of each tree enable the estimation of surface normals. To account for their expected spatial regularity, we introduce spatial features, including texton and silhouette features. The proposed silhouette features are computed from the occluding contours of the surface and provide scale-invariant context. Aside from computational efficiency, they enable good generalization to unseen data and importantly allow for a robust estimation of the reflectance map, extending our approach to the uncalibrated setting. Experiments show that our discriminative approach outperforms state-of-the-art methods on synthetic and real-world datasets.

Electroporation of Cells and Tissues <=SEP=> Electrical pulses that cause the transmembrane voltage of fluid lipid bilayer membranes to reach at least 0 2 V, usually 0.5–1 V, are hypothesized to create primary membrane “pores” with a minimum radius of ∼1 nm. Transport of small ions such as Na and Cl through a dynamic pore population discharges the membrane even while an external pulse tends to increase , leading to dramatic electrical behavior. Molecular transport through primary pores and pores enlarged by secondary processes provides the basis for transporting molecules into and out of biological cells. Cell electroporationin vitro is used mainly for transfection by DNA introduction, but many other interventions are possible, including microbial killing. Ex vivo electroporation provides manipulation of cells that are reintroduced into the body to provide therapy. In vivo electroporation of tissues enhances molecular transport through tissues and into their constituative cells. Tissue electroporation, by longer, large pulses, is involved in electrocution injury. Tissue electroporation by shorter, smaller pulses is under investigation for biomedical engineering applications of medical therapy aimed at cancer treatment, gene therapy, and transdermal drug delivery. The latter involves a complex barrier containing both high electrical resistance, multilamellar lipid bilayer membranes and a tough, electrically invisible protein matrix.

Computing With Words for Hierarchical Decision Making Applied to Evaluating a Weapon System <=SEP=> The perceptual computer (Per-C) is an architecture that makes subjective judgments by computing with words (CWWs). This paper applies the Per-C to hierarchical decision making, which means decision making based on comparing the performance of competing alternatives, where each alternative is first evaluated based on hierarchical criteria and subcriteria, and then, these alternatives are compared to arrive at either a single winner or a subset of winners. What can make this challenging is that the inputs to the subcriteria and criteria can be numbers, intervals, type-1 fuzzy sets, or even words modeled by interval type-2 fuzzy sets. Novel weighted averages are proposed in this paper as a CWW engine in the Per-C to aggregate these diverse inputs. A missile-evaluation problem is used to illustrate it. The main advantages of our approaches are that diverse inputs can be aggregated, and uncertainties associated with these inputs can be preserved and are propagated into the final evaluation.

Attribute-Based Encryption for Circuits <=SEP=> In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public index ind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows decrypting the ciphertext and learning m if and only if P(ind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext.
 We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit. Our construction is secure under the standard learning with errors (LWE) assumption. Previous constructions of attribute-based encryption were for Boolean formulas, captured by the complexity class NC1.
 In the course of our construction, we present a new framework for constructing ABE schemes. As a by-product of our framework, we obtain ABE schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions.

The Impact of Nonlinear Junction Capacitance on Switching Transient and Its Modeling for SiC MOSFET <=SEP=> The nonlinear junction capacitances of power devices are critical for the switching transient, which should be fully considered in the modeling and transient analysis, especially for high-frequency applications. The silicon carbide (SiC) MOSFET combined with SiC Schottky Barrier Diode (SBD) is recognized as the proposed choice for high-power and high-frequency converters. However, in the existing SiC MOSFET models only the nonlinearity of gate-drain capacitance is considered meticulously, but the drain-source capacitance, which affects the switching commutation process significantly, is generally regarded as constant. In addition, the nonlinearity of diode junction capacitance is neglected in some simplified analysis. Experiments show that without full consideration of nonlinear junction capacitances, some significant deviations between simulated and measured results will emerge in the switching waveforms. In this paper, the nonlinear characteristics of drain-source capacitance in SiC MOSFET are studied in detail, and the simplified modeling methods for engineering applications are presented. On this basis, the SiC MOSFET model is improved and the simulation results with improved model correspond with the measured results much better than before, which verify the analysis and modeling.

Learning Mixtures of Gaussians in High Dimensions <=SEP=> Efficiently learning mixture of Gaussians is a fundamental problem in statistics and learning theory. Given samples coming from a random one out of k Gaussian distributions in Rn, the learning problem asks to estimate the means and the covariance matrices of these Gaussians. This learning problem arises in many areas ranging from the natural sciences to the social sciences, and has also found many ma- chine learning applications. Unfortunately, learning mixture of Gaussians is an information theoretically hard problem: in order to learn the parameters up to a reasonable accuracy, the number of samples required is exponential in the number of Gaussian components in the worst case. In this work, we show that provided we are in high enough dimensions, the class of Gaussian mixtures is learnable in its most general form under a smoothed analysis framework, where the parameters are randomly perturbed from an adversarial starting point. In particular, given samples from a mixture of Gaussians with randomly perturbed parameters, when n ≥ Ω(k2), we give an algorithm that learns the parameters with polynomial running time and using polynomial number of samples.
 The central algorithmic ideas consist of new ways to de- compose the moment tensor of the Gaussian mixture by exploiting its structural properties. The symmetries of this tensor are derived from the combinatorial structure of higher order moments of Gaussian distributions (sometimes referred to as Isserlis' theorem or Wick's theorem). We also develop new tools for bounding smallest singular values of structured random matrices, which could be useful in other smoothed analysis settings.

Nonlinear observers for predicting state-of-charge and state-of-health of lead-acid batteries for hybrid-electric vehicles <=SEP=> This paper describes the application of state-estimation techniques for the real-time prediction of the state-of-charge (SoC) and state-of-health (SoH) of lead-acid cells. Specifically, approaches based on the well-known Kalman Filter (KF) and Extended Kalman Filter (EKF), are presented, using a generic cell model, to provide correction for offset, drift, and long-term state divergence-an unfortunate feature of more traditional coulomb-counting techniques. The underlying dynamic behavior of each cell is modeled using two capacitors (bulk and surface) and three resistors (terminal, surface, and end), from which the SoC is determined from the voltage present on the bulk capacitor. Although the structure of the model has been previously reported for describing the characteristics of lithium-ion cells, here it is shown to also provide an alternative to commonly employed models of lead-acid cells when used in conjunction with a KF to estimate SoC and an EKF to predict state-of-health (SoH). Measurements using real-time road data are used to compare the performance of conventional integration-based methods for estimating SoC with those predicted from the presented state estimation schemes. Results show that the proposed methodologies are superior to more traditional techniques, with accuracy in determining the SoC within 2% being demonstrated. Moreover, by accounting for the nonlinearities present within the dynamic cell model, the application of an EKF is shown to provide verifiable indications of SoH of the cell pack.

Pilot Contamination and Precoding in Multi-Cell TDD Systems <=SEP=> This paper considers a multi-cell multiple antenna system with precoding used at the base stations for downlink transmission. Channel state information (CSI) is essential for precoding at the base stations. An effective technique for obtaining this CSI is time-division duplex (TDD) operation where uplink training in conjunction with reciprocity simultaneously provides the base stations with downlink as well as uplink channel estimates. This paper mathematically characterizes the impact that uplink training has on the performance of such multi-cell multiple antenna systems. When non-orthogonal training sequences are used for uplink training, the paper shows that the precoding matrix used by the base station in one cell becomes corrupted by the channel between that base station and the users in other cells in an undesirable manner. This paper analyzes this fundamental problem of pilot contamination in multi-cell systems. Furthermore, it develops a new multi-cell MMSE-based precoding method that mitigates this problem. In addition to being linear, this precoding method has a simple closed-form expression that results from an intuitive optimization. Numerical results show significant performance gains compared to certain popular single-cell precoding methods.

Design of IRNSS receiver antennae for smart city applications in India <=SEP=> In this research paper, a rectangular fractal antenna is designed which may be used for IRNSS based smart city applications in India. For tracking and positioning applications, the government of India has developed its own navigation system which is called Indian Regional Navigational Satellite System (IRNSS). To design an antenna for such an application is desirable. For the upcoming smart cities in India, the IRNSS will play a vital role in terms of traffic management, intelligent transportation, vehicle tracking and disaster management. A rectangular fractal antenna based on Sierpinski carpet antenna geometry for dual band resonant frequencies is simulated and tested. The antenna has operational frequencies at 2492.08 MHz (S-band) and 1176.45 MHz (L5-band) at return loss of -24.323 dB and -13.41dB respectively.

A Low-Cost Gate Driver Design Using Bootstrap Capacitors for Multilevel MOSFET Inverters <=SEP=> Multilevel inverters require a large number of power semiconductors. The gate driver for each power semiconductor requires its own floating or isolated DC voltage source. Traditional methods on meeting the requirement are expensive and bulky. This paper presents a gate driver design for floating voltage source type multilevel inverters. Bootstrap capacitors are used to form the floating voltage sources in the design, which allows a single DC power supply to be used by all the gate drivers. Specially configured diode plus the proper charging cycles maintain adequate capacitor voltage levels. Such a simple and low cost solution allows user to utilize the easy accessible single-channel gate drivers for multilevel inverter applications without the extra cost on the bulky isolated DC power supplies for each gate driver. A prototype 3-cell 8-level floating voltage source inverter using the method illustrates the technique

Detecting Text in the Wild with Deep Character Embedding Network <=SEP=> Most text detection methods hypothesize texts are horizontal or multi-oriented and thus define quadrangles as the basic detection unit. However, text in the wild is usually perspectively distorted or curved, which can not be easily tackled by existing approaches. In this paper, we propose a deep character embedding network (CENet) which simultaneously predicts the bounding boxes of characters and their embedding vectors, thus making text detection a simple clustering task in the character embedding space. The proposed method does not require strong assumptions of forming a straight line on general text detection, which provides flexibility on arbitrarily curved or perspectively distorted text. For character detection task, a dense prediction subnetwork is designed to obtain the confidence score and bounding boxes of characters. For character embedding task, a subnet is trained with contrastive loss to project detected characters into embedding space. The two tasks share a backbone CNN from which the multi-scale feature maps are extracted. The final text regions can be easily achieved by a thresholding process on character confidence and embedding distance of character pairs. We evaluated our method on ICDAR13, ICDAR15, MSRA-TD500, and Total Text. The proposed method achieves state-of-the-art or comparable performance on all of the datasets, and shows a substantial improvement in the irregular-text datasets, i.e. Total-Text.

Heterogeneous Transfer Learning for Image Classification <=SEP=> Transfer learning as a new machine learning paradigm has gained increasing attention lately. In situations where the training data in a target domain are not sufficient to learn predictive models effectively, transfer learning leverages auxiliary source data from other related auxiliary domains for learning. While most of the existing works in this area are only focused on using the source data with the same representational structure as the target data, in this paper, we push this boundary further by extending a heterogeneous transfer learning framework for knowledge transfer between text and images. We observe that for a target-domain classification problem, some annotated images can be found on many social Web sites, which can serve as a bridge to transfer knowledge from the abundant text documents available over the Web. A key question is how to effectively transfer the knowledge in the source data even though the text documents are arbitrary. Our solution is to enrich the representation of the target images with semantic concepts extracted from the auxiliary source data through matrix factorization, and to use the latent semantic features generated by the auxiliary data to build a better image classifier. We empirically verify the effectiveness of our algorithm on the Caltech-256 image dataset.

Employing U.S. Military Families to Provide Business Process Outsourcing Services: A Case study of Impact Sourcing and Reshoring <=SEP=> This paper describes how a startup business process outsourcing (BPO) provider named Liberty Source helped a large U.S.-based client reshore business services from an established Indian BPO provider. Founded in 2014, Liberty Source is a for-profit firm that provides a competitive alternative to offshoring while fulfilling its social mission to launch and sustain the careers of U.S. military spouses and veterans who face various employment disadvantages. Thus, the case describes reshoring in the context of impact sourcing. It addresses key impact sourcing issues pertaining to workforce development, scalability, and impact on employees. The impact was positive: the workers found the employment and stable salary were beneficial, “the military” culture fit well with the workers, and workers received considerable flexibility and greater career options. Liberty Source was able to reduce a client’s costs after reshoring the client’s processes because Liberty Source’s U.S. site had about 20 percent fewer full time equivalents (FTEs) FTEs than the original India location and because Liberty Source received subsidies. We found evidence that the offshore BPO provider and Liberty source experienced difficulties with finding enough skilled staff for the wages offered and both firms experienced attrition problems, although attrition was greater in India.

A New Metrics for Countries' Fitness and Products' Complexity <=SEP=> Classical economic theories prescribe specialization of countries industrial production. Inspection of the country databases of exported products shows that this is not the case: successful countries are extremely diversified, in analogy with biosystems evolving in a competitive dynamical environment. The challenge is assessing quantitatively the non-monetary competitive advantage of diversification which represents the hidden potential for development and growth. Here we develop a new statistical approach based on coupled non-linear maps, whose fixed point defines a new metrics for the country Fitness and product Complexity. We show that a non-linear iteration is necessary to bound the complexity of products by the fitness of the less competitive countries exporting them. We show that, given the paradigm of economic complexity, the correct and simplest approach to measure the competitiveness of countries is the one presented in this work. Furthermore our metrics appears to be economically well-grounded.

What's Wrong with the Diffusion of Innovation Theory <=SEP=> This paper examines the usefulness of the diffusion of innovation research in developing theoretical accounts of the adoption of complex and networked IT solutions. We contrast six conjectures underlying DOI research with field data obtained from the study of the diffusion of EDI. Our analysis shows that DOI based analyses miss some important facets in the diffusion of complex technologies. We suggest that complex IT solutions should be understood as socially constructed and learning intensive artifacts, which can be adopted for varying reasons within volatile diffusion arenas. Therefore DOI researchers should carefully recognize the complex, networked, and learning intensive features of technology; understand the role of institutional regimes, focus on process features (including histories) and key players in the diffusion arena, develop multi-layered theories that factor out mappings between different layers and locales, use multiple perspectives including political models, institutional models and theories of team behavior, and apply varying time scales while crafting accounts of what happened and why. In general the paper calls for a need to develop DOI theories at the site by using multiple levels of

Computer-Mediated Communication Conflict Management in Groups that Work in Two Different Communication Contexts : Face-To-Face and <=SEP=> can be found at: Small Group Research Additional services and information for http://sgr.sagepub.com/cgi/alerts  Email Alerts: http://sgr.sagepub.com/subscriptions  Subscriptions: http://www.sagepub.com/journalsReprints.nav Reprints: http://www.sagepub.com/journalsPermissions.nav Permissions: http://sgr.sagepub.com/cgi/content/refs/33/5/481 SAGE Journals Online and HighWire Press platforms): (this article cites 36 articles hosted on the Citations

Static detection of cross-site scripting vulnerabilities <=SEP=> Web applications support many of our daily activities, but they often have security problems, and their accessibility makes them easy to exploit. In cross-site scripting (XSS), an attacker exploits the trust a web client (browser) has for a trusted server and executes injected script on the browser with the server's privileges. In 2006, XSS constituted the largest class of newly reported vulnerabilities making it the most prevalent class of attacks today. Web applications have XSS vulnerabilities because the validation they perform on untrusted input does not suffice to prevent that input from invoking a browser's JavaScript interpreter, and this validation is particularly difficult to get right if it must admit some HTML mark-up. Most existing approaches to finding XSS vulnerabilities are taint-based and assume input validation functions to be adequate, so they either miss real vulnerabilities or report many false positives.
 This paper presents a static analysis for finding XSS vulnerabilities that directly addresses weak or absent input validation. Our approach combines work on tainted information flow with string analysis. Proper input validation is difficult largely because of the many ways to invoke the JavaScript interpreter; we face the same obstacle checking for vulnerabilities statically, and we address it by formalizing a policy based on the W3C recommendation, the Firefox source code, and online tutorials about closed-source browsers. We provide effective checking algorithms based on our policy. We implement our approach and provide an extensive evaluation that finds both known and unknown vulnerabilities in real-world web applications.

Combinatorial Bounds for Broadcast Encryption <=SEP=> Abst rac t . A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broad~ cast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.

Database security - concepts, approaches, and challenges <=SEP=> As organizations increase their reliance on, possibly distributed, information systems for daily business, they become more vulnerable to security breaches even as they gain productivity and efficiency advantages. Though a number of techniques, such as encryption and electronic signatures, are currently available to protect data when transmitted across sites, a truly comprehensive approach for data protection must also include mechanisms for enforcing access control policies based on data contents, subject qualifications and characteristics, and other relevant contextual information, such as time. It is well understood today that the semantics of data must be taken into account in order to specify effective access control policies. Also, techniques for data integrity and availability specifically tailored to database systems must be adopted. In this respect, over the years, the database security community has developed a number of different techniques and approaches to assure data confidentiality, integrity, and availability. However, despite such advances, the database security area faces several new challenges. Factors such as the evolution of security concerns, the "disintermediation" of access to data, new computing paradigms and applications, such as grid-based computing and on-demand business, have introduced both new security requirements and new contexts in which to apply and possibly extend current approaches. In this paper, we first survey the most relevant concepts underlying the notion of database security and summarize the most well-known techniques. We focus on access control systems, on which a large body of research has been devoted, and describe the key access control models, namely, the discretionary and mandatory access control models, and the role-based access control (RBAC) model. We also discuss security for advanced data management systems, and cover topics such as access control for XML. We then discuss current challenges for database security and some preliminary approaches that address some of these challenges.

Deep learning and process understanding for data-driven Earth system science <=SEP=> Machine learning approaches are increasingly used to extract patterns and insights from the ever-increasing stream of geospatial data, but current approaches may not be optimal when system behaviour is dominated by spatial or temporal context. Here, rather than amending classical machine learning, we argue that these contextual cues should be used as part of deep learning (an approach that is able to extract spatio-temporal features automatically) to gain further process understanding of Earth system science problems, improving the predictive ability of seasonal forecasting and modelling of long-range spatial connections across multiple timescales, for example. The next step will be a hybrid modelling approach, coupling physical process models with the versatility of data-driven machine learning. Complex Earth system challenges can be addressed by incorporating spatial and temporal context into machine learning, especially via deep learning, and further by combining with physical models into hybrid models.

Efficient mesh denoising via robust normal filtering and alternate vertex updating <=SEP=> The most challenging problem in mesh denoising is to distinguish features from noise. Based on the robust guided normal estimation and alternate vertex updating strategy, we investigate a new feature-preserving mesh denoising method. To accurately capture local structures around features, we propose a corner-aware neighborhood (CAN) scheme. By combining both overall normal distribution of all faces in a CAN and individual normal influence of the interested face, we give a new consistency measuring method, which greatly improves the reliability of the estimated guided normals. As the noise level lowers, we take as guidance the previous filtered normals, which coincides with the emerging rolling guidance idea. In the vertex updating process, we classify vertices according to filtered normals at each iteration and reposition vertices of distinct types alternately with individual regularization constraints. Experiments on a variety of synthetic and real data indicate that our method adapts to various noise, both Gaussian and impulsive, no matter in the normal direction or in a random direction, with few triangles flipped.

An Orbital Angular Momentum (OAM) Mode Reconfigurable Antenna for Channel Capacity Improvement and Digital Data Encoding <=SEP=> For purpose of utilizing orbital angular momentum (OAM) mode diversity, multiple OAM beams should be generated preferably by a single antenna. In this paper, an OAM mode reconfigurable antenna is proposed. Different from the existed OAM antennas with multiple ports for multiple OAM modes transmitting, the proposed antenna with only a single port, but it can be used to transmit mode 1 or mode −1 OAM beams arbitrary by controlling the PIN diodes on the feeding network through a programmable microcontroller which control by a remote controller. Simulation and measurement results such as return loss, near-field and far-field radiation patterns of two operating states for mode 1 and mode −1, and OAM mode orthogonality are given. The proposed antenna can serve as a candidate for utilizing OAM diversity, namely phase diversity to increase channel capacity at 2.4 GHz. Moreover, an OAM-mode based encoding method is experimentally carried out by the proposed OAM mode reconfigurable antenna, the digital data are encoded and decoded by different OAM modes. At the transmitter, the proposed OAM mode reconfigurable antenna is used to encode the digital data, data symbol 0 and 1 are mapped to OAM mode 1 and mode −1, respectively. At the receiver, the data symbols are decoded by phase gradient method.

Unsupervised deformable image registration with fully connected generative neural network <=SEP=> In this paper, a new deformable image registration method based on a fully connected neural network is proposed. Even though a deformation field related to the point correspondence between fixed and moving images are high-dimensional in nature, we assume that these deformation fields form a low dimensional manifold in many real world applications. Thus, in our method, a neural network generates an embedding of the deformation field from a low dimensional vector. This lowdimensional manifold formulation avoids the intractability associated with the high dimensional search space that most other methods face during image registration. As a result, while most methods rely on explicit and handcrafted regularization of the deformation fields, our algorithm relies on implicitly regularizing the network parameters. The proposed method generates deformation fields from latent low dimensional space by minimizing a dissimilarity metric between a fixed image and a warped moving image. Our method removes the need for a large dataset to optimize the proposed network. The proposed method is quantitatively evaluated using images from the MICCAI ACDC challenge. The results demonstrate that the proposed method improves performance in comparison with a moving mesh registration algorithm, and also it correlates well with independent manual segmentations by an expert.