A Re-ranking Model for Dependency Parser with Recursive Convolutional Neural Network

In this work, we address the problem to model all the nodes (words or phrases) in a dependency tree with the dense representations. We propose a recursive convolutional neural network (RCNN) architecture to capture syntactic and compositional-semantic representations of phrases and words in a dependency tree. Different with the original recursive neural network, we introduce the convolution and pooling layers, which can model a variety of compositions by the feature maps and choose the most informative compositions by the pooling layers. Based on RCNN, we use a discriminative model to re-rank a $k$-best list of candidate dependency parsing trees. The experiments show that RCNN is very effective to improve the state-of-the-art dependency parsing on both English and Chinese datasets

Progressive Neural Architecture Search

We propose a new method for learning the structure of convolutional neural networks (CNNs) that is more efficient than recent state-of-the-art methods based on reinforcement learning and evolutionary algorithms. Our approach uses a sequential model-based optimization (SMBO) strategy, in which we search for structures in order of increasing complexity, while simultaneously learning a surrogate model to guide the search through structure space. Direct comparison under the same search space shows that our method is up to 5 times more efficient than the RL method of Zoph et al. (2018) in terms of number of models evaluated, and 8 times faster in terms of total compute. The structures we discover in this way achieve state of the art classification accuracies on CIFAR-10 and ImageNet.Comment: To appear in ECCV 2018 as oral. The code and checkpoint for PNASNet-5 trained on ImageNet (both Mobile and Large) can now be downloaded from https://github.com/tensorflow/models/tree/master/research/slim#Pretrained. Also see https://github.com/chenxi116/PNASNet.TF for refactored and simplified TensorFlow code; see https://github.com/chenxi116/PNASNet.pytorch for exact conversion to PyTorc

Peptides of interest:Editing of Lactococcus lactis proteolytic system to increase its bioactive potential

The goal of this thesis was to answer one question in particular: can one increase the quantity or the diversity (or both) of milk-derived bioactive peptides by engineering the Lactococcus lactis proteolytic system? The main research line explored that question itself. In addition, the three issues that derive from that main questions are separately tackled in this thesis: (i) bioactive peptides: How much do we know about bioactive peptides derived from milk-derived and, more specifically, beta-casein? (ii) L. lactis engineering: Which tools are there and are they good enough or can we develop new/better ones; (iii) 3. The L. lactis proteolytic system: what do we know about that system and, especially, what do we know about the in vivo (complementing) activities of the peptidases with respect to cellular growth and peptide degradation Chapter 1 comprehensively reviews the knowhow on β-casein-derived bioactive peptides and the potential of using lactic acid bacteria to produce such peptides; In Chapter 2, which is the founding chapter of the thesis, we engineered the L. lactis proteolytic system by making a large collection of various combinations of peptidase gene mutants and used those mutants to increase the quantity of different bioactive peptides and the diversity of different bioactivities which derived from β-casein; In Chapter 3, we broaden the knowledge about the L. lactis proteolytic system, and prove that the dipeptidase PepV plays an important role in peptidoglycan biosynthesis by acting as a link between nitrogen metabolism and cell wall synthesis. In Chapter 4, we expand the genetic toolbox for L. lactis by developing plasmid- and genome-based CRISPRi systems that will allow rapidly e.g., editing biological pathways or characterizing essential genes, as was explored in Chapter 5

Research on Scientific Management Innovation in the Era of Digital Economy

With the rapid development of digital economy, the wide application of information technology is reshaping the operation mode and management structure of enterprises. At the heart of the digital economy is data-driven decision making, intelligent management, and networked collaboration, which provide unprecedented opportunities and challenges for enterprises. By combining the successful cases of specific enterprises, this paper aims to provide practical strategies for business managers to help them better adapt to the rapid changes of the digital economy and improve management efficiency and decision-making ability. Finally, this paper hopes to provide a new perspective and thinking for the future scientific management research in the era of digital economy

Distributed access control and the prototype of the Mojoy trust policy language

In a highly distributed computing environment, people frequently move from one place to another where the new system has no previous knowledge of them at all. Traditional access control mechanisms such as access matrix and RBAC depend heavily on central management. However, the identities and privileges of the users are stored and administered in different locations in distributed systems. How to establish trust between these strange entities remains a challenge. Many efforts have been made to solve this problem. In the previous work, the decentralised administration of trust is achieved through delegation which is a very rigid mechanism. The limitation of delegation is that the identities of the delegators and delegatees must be known in advance and the privileges must be definite. In this thesis, we present a new model for decentralised administration of trust: trust empowerment. In trust empowerment, trust is defined as a set of properties. Properties can be owned and/or controlled. Owners of the properties can perform the privileges denoted by the properties. Controllers of the properties can grant the properties to other subjects but cannot gain the privileges of the properties. Each subject has its own policy to define trust empowerment. We design the Mojoy tmst policy language that supports trust empowerment. We give the syntax, semantics and an XML implementation of the language. The Mojoy trust policy language is based on XACML, which is an OASIS standard. We develop a compliance checker for the language. The responsibility of the compliance checker is to examine the certificates and policy, and return a Boolean value to indicate whether the user's request is allowed. We apply our new model, the language and the compliance checker to a case study to show that they are capable of coping with the trust issues met in the distributed systems

A hybrid cavity and parallel-plate PEEC method for analysis of complex power net area fills, and a tool development for peak distortion analysis

Modern ASICs and FPGAs are becoming more and more dense, which is causing an increasing demand of the current draw from the power distribution network (PDN). And one of the main design objectives of a power distribution network is to reduce the voltage noise ripple below a specified allowable limit. Although the target impedance is a commonly used criterion in most PDN designs, it may not be efficient because it\u27s usually rather pessimistic. Herein a time domain voltage ripple decomposition approach is proposed to avoid overdesign as well as provide design guidance to PI engineers. Based on a physics-based circuit model for PDN and a switching current generator including both high frequency switching and low frequency power gating, the total voltage ripple can be divided into several components. Each component will have a one-to-one correspondence to the real PDN geometry. Thus design curves can also be derived, which can guide PI engineers when making design decisions. Peak distortion analysis (PDA) is commonly used to find the worst-case eye diagram and data pattern. Compared to traditional long transient simulations, PDA can significantly reduce the computation time by only taking into consideration the worst case. Generally PDA is based on a superposition technique with a single bit response (SBR), which requires the system to be linear time invariant (LTI) or can be well approximated as an LTI system. SBR is no longer applicable for systems which have different rising and falling edge responses due to asymmetric I/O design or mismatches between pull-up and pull-down drivers. Also sometimes the nonlinearity can extend beyond the edge transitions which can result from the voltage noise on the power distribution network (PDN). Herein PDA based on the superposition of multiple edge responses (MER) is proposed to account for a non-LTI system as well as asymmetric rising and falling edges --Abstract, page iii

A New Dynamic Path Planning Approach for Unmanned Aerial Vehicles

Dynamic path planning is one of the key procedures for unmanned aerial vehicles (UAV) to successfully fulfill the diversified missions. In this paper, we propose a new algorithm for path planning based on ant colony optimization (ACO) and artificial potential field. In the proposed algorithm, both dynamic threats and static obstacles are taken into account to generate an artificial field representing the environment for collision free path planning. To enhance the path searching efficiency, a coordinate transformation is applied to move the origin of the map to the starting point of the path and in line with the source-destination direction. Cost functions are established to represent the dynamically changing threats, and the cost value is considered as a scalar value of mobile threats which are vectors actually. In the process of searching for an optimal moving direction for UAV, the cost values of path, mobile threats, and total cost are optimized using ant optimization algorithm. The experimental results demonstrated the performance of the new proposed algorithm, which showed that a smoother planning path with the lowest cost for UAVs can be obtained through our algorithm. (PDF) A New Dynamic Path Planning Approach for Unmanned Aerial Vehicles. Available from: https://www.researchgate.net/publication/328765418_A_New_Dynamic_Path_Planning_Approach_for_Unmanned_Aerial_Vehicles [accessed Nov 20 2018]

A polybenzimidazole/graphite oxide based three layer membrane for intermediate temperature polymer electrolyte membrane fuel cells

A three layer membrane (TLM) of polybenzimidazole/graphite oxide/polybenzimidazole (PBI/GO/PBI) has been fabricated as an electrolyte for intermediate temperature polymer exchange membrane fuel cells (IT-PEMFCs). The membrane is prepared by encapsulating a GO layer with two single PBI membranes via a layer-by-layer procedure and subsequently imbibed with phosphoric acid (PA). The TLM exhibits a lower swelling ratio than that of the pristine PBI membrane at the same PA loading time. The mechanical strength of the TLM could reach 28.6 MPa at 150 °C, significantly higher than that of a PBI membrane (12.2 MPa). The TLM is loaded with a PA amount of 2.23H3PO4 molecules per repeat unit (PRU), which provides a proton conductivity of 0.0138 S cm−1 at 150 °C. The three layer structure promotes a membrane for PEMFCs with lower PA leakage and material corrosion. The fuel cell performance based on TLM exhibits a peak power density of 210 mW cm−2 at 150 °C

Extremal oriented graphs avoiding 1-subdivision of an in-star

An oriented graph is a digraph obtained from an undirected graph by choosing an orientation for each edge. Given a positive integer $n$ and an oriented graph $F$, the oriented Tur$\acute{\rm a}$n number $ex_{ori}(n,F)$ is the maximum number of arcs in an $F$-free oriented graph of order $n$. In this paper, we investigate the oriented Tur$\acute{\rm a}$n number $ex_{ori}(n, \overrightarrow{S_{k,1}} )$, where $\overrightarrow{S_{k,1}}$ is the $1$-subdivision of the in-star of order $k+1$. We determine $ex_{ori}(n,\overrightarrow{S_{k,1}})$ for $k=2,3$ as well as the extremal oriented graphs. For $k\ge 4$, we establish a lower bound and an upper bound on $ex_{ori}(n,\overrightarrow{S_{k,1}})$