The Story of a Blind Wolf

The Story of a Blind Wolf; is a 3D animated graduate thesis film, whose length is five minutes forty seconds. It was screened in the School of Animation at Rochester Institute of Technology. The film is in a realistic style and made by CG (computer graphics). The story takes place in a small puppet theater. While a piper is playing a flute for his audience, a wolf interrupted his performance. The wolf asks the piper to help him escape the hunt. The piper has sympathy for the wolf, so he helps him, lies to the hunter, and saved the wolf. They became friends, dancing and celebrating in the forest. While celebrating, the wolf sees through the tree behind the piper a dangerous snake that is going to hurt the piper. The piper doesn’t notice the snake behind him. So, when the wolf attacks the snake to save the piper’s life, the piper thinks the wolf is going to hurt him after he saved his life. The piper misunderstands the wolf and runs away. Then he met the hunter, in the hunter’s abetted, the piper using hoe beat the wolf to die. In this film, I want to propose that when confronting things, we are easily interfered by the outside world and give up the ability of thinking independently, which gives rise to unnecessary misunderstandings among people and eventually leads to tragedies

Wind Tunnel Testing of Novel Wing Configurations for Design and Customisation in an Industry 4.0 Environment

Industry 4.0 calls for validated simulations for rapid customization and through-life designs. Wind tunnel experiments are widely used in validating flow-field simulations for aircraft design and manufacture. In this paper, we develop testing for simulating the NACA0015 model wings in various shapes and Angles of Attacks (AoA) through an anatomy wind tunnel. Particle traces are recorded during the tests and then analyzed with PIVlab and Tecplot for validating streamlines and vorticity distributions. The experimental results show that the wing shape with a relatively large angle of sweepback and an AoA ranging from +10to +15deg possess good aerodynamic behaviors for an aircraft. We discuss future prospects of aircraft simulations in an Industry 4.0 context

GAMENet: Graph Augmented MEmory Networks for Recommending Medication Combination

Recent progress in deep learning is revolutionizing the healthcare domain including providing solutions to medication recommendations, especially recommending medication combination for patients with complex health conditions. Existing approaches either do not customize based on patient health history, or ignore existing knowledge on drug-drug interactions (DDI) that might lead to adverse outcomes. To fill this gap, we propose the Graph Augmented Memory Networks (GAMENet), which integrates the drug-drug interactions knowledge graph by a memory module implemented as a graph convolutional networks, and models longitudinal patient records as the query. It is trained end-to-end to provide safe and personalized recommendation of medication combination. We demonstrate the effectiveness and safety of GAMENet by comparing with several state-of-the-art methods on real EHR data. GAMENet outperformed all baselines in all effectiveness measures, and also achieved 3.60% DDI rate reduction from existing EHR data.Comment: AAAI 2019; change the template and fix some typo

Microstructure evolution and elemental diffusion behavior near the interface of Cr2AlC and single crystal superalloy DD5 at elevated temperatures

As one of the promising MAX phase materials for high-temperature applications, Cr2AlC is considered as a potential substitution bond coat material in thermal barrier coating systems. In this paper, the microstructure evolution and elemental diffusion behavior near the interface of the diffusion couple composed of Cr2AlC and single crystal superalloy DD5 were investigated at 1100 °C, 1150 °C, and 1200 °C. Elemental interdiffusion between Cr2AlC and DD5 occurs significantly, resulting in the formation of a thick layer of Kirkendall holes after 20 h heat treatment at 1100 °C and higher temperatures. The outward diffusion of Ni into Cr2AlC and the inward diffusion of Al into DD5 alloy causes the formation of β-NiAl matrix embedded with dispersed Cr7C3 phase. Simultaneously, the precipitation of σ-TCP phase and degradation of the γ/γ′ matrix occurs in the alloy. Additionally, TaC, M2C (where M = Ta, W, Cr), and M23C6 (M = Cr, Re, W) compounds are formed near the interface along with the dissolution of σ-TCP phases. It is further found that Al in Cr2AlC exhibits the highest average effective diffusion coefficient among the four dominant diffusing elements. It also displays the lowest diffusion activation energy which is due to its relatively weak Cr-Al and Al-Al bonds

MIMOSA: Multi-constraint Molecule Sampling for Molecule Optimization

Molecule optimization is a fundamental task for accelerating drug discovery, with the goal of generating new valid molecules that maximize multiple drug properties while maintaining similarity to the input molecule. Existing generative models and reinforcement learning approaches made initial success, but still face difficulties in simultaneously optimizing multiple drug properties. To address such challenges, we propose the MultI-constraint MOlecule SAmpling (MIMOSA) approach, a sampling framework to use input molecule as an initial guess and sample molecules from the target distribution. MIMOSA first pretrains two property agnostic graph neural networks (GNNs) for molecule topology and substructure-type prediction, where a substructure can be either atom or single ring. For each iteration, MIMOSA uses the GNNs' prediction and employs three basic substructure operations (add, replace, delete) to generate new molecules and associated weights. The weights can encode multiple constraints including similarity and drug property constraints, upon which we select promising molecules for next iteration. MIMOSA enables flexible encoding of multiple property- and similarity-constraints and can efficiently generate new molecules that satisfy various property constraints and achieved up to 49.6% relative improvement over the best baseline in terms of success rate.Comment: Accepted by AAAI 202

Comparative and phylogenomic studies on the mitochondrial genomes of Pentatomomorpha (Insecta: Hemiptera: Heteroptera)

<p>Abstract</p> <p>Background</p> <p>Nucleotide sequences and the gene arrangements of mitochondrial genomes are effective tools for resolving phylogenetic problems. Hemipteroid insects are known to possess highly reorganized mitochondrial genomes, but in the suborder Heteroptera (Insecta: Hemiptera), there was only one complete mitochondrial genome sequenced without gene rearrangement and the phylogeny of infraorder Pentatomomorpha in Heteroptera was still uncertain.</p> <p>Results</p> <p>Fifteen mitochondrial genomes of the suborder Heteroptera were sequenced. Gene rearrangements were found as follows: 1) <it>tRNA-I </it>and <it>tRNA-Q </it>switched positions in Aradidae, 2) <it>tRNA-T </it>and <it>tRNA-P </it>switched positions in Largidae and Pyrrhocoridae. Two recombination events were found in Alydidae and Malcidae. The other mt-genomes were organized in the same way as observed in <it>Drosophila yakuba</it>. The phylogenetic analyses of infraorder Pentatomomorpha based on the nucleotide sequence raised the hypothesis of (Aradoidea + (Pentatomoidea + (Pyrrhocoroidea + (Lygaeoidea + Coreoidea)))). The rearrangement of <it>tRNA-T </it>and <it>tRNA-P </it>also linked Largidae and Pyrrhocoridae together. Furthermore, the conserved sequence block in the unusual intergenic spacers between <it>tRNA-H </it>and <it>ND4 </it>favored the monophyly of Lygaeoidea. Tetranucleotide ATCA was inferred to be the initiation codon of <it>ND2 </it>in Cydnidae. No correlation was found between the rates of nucleotide substitution and gene rearrangement. CG content was significantly correlated with the nucleotide substitution rate of each gene. For ND1, there was a positive correlation (<it>P </it>< 0.01) between amino acids variations and hydrophobicity, but a negative correlation (<it>P </it>< 0.01) for ND6. No conserved sequence was found among the control regions and these regions were not always the most AT-rich region of the mt-genome.</p> <p>Conclusion</p> <p>Heteropteran insects are extremely complex groups worthy of further study because of the unusual tetranucleotide initiation codon and their great mt-genomic diversity, including gene rearrangements and recombinations. The mt-genome is a powerful molecular marker for resolving phylogeny at the level of the superfamily and family. Gene rearrangements were not correlated with nucleotide substitution rates. CG content variation caused the different evolutionary patterns among genes. For ND1, in many polar or nonpolar regions the specific identity of the amino acid residues might be more important than maintaining the polarity of these regions, while the opposite is true for ND6. Most sequences of the control regions did not appear to be important for regulatory functions. Finally, we suggest that the term "AT-rich regions" should not be used.</p

Phylogenetic analysis of the true water bugs (Insecta: Hemiptera: Heteroptera: Nepomorpha): evidence from mitochondrial genomes

<p>Abstract</p> <p>Background</p> <p>The true water bugs are grouped in infraorder Nepomorpha (Insecta: Hemiptera: Heteroptera) and are of great economic importance. The phylogenetic relationships within Nepomorpha and the taxonomic hierarchies of Pleoidea and Aphelocheiroidea are uncertain. Most of the previous studies were based on morphological characters without algorithmic assessment. In the latest study, the molecular markers employed in phylogenetic analyses were partial sequences of 16S rDNA and 18S rDNA with a total length about 1 kb. Up to now, no mitochondrial genome of the true water bugs has been sequenced, which is one of the largest data sets that could be compared across animal taxa. In this study we analyzed the unresolved problems in Nepomorpha using evidence from mitochondrial genomes.</p> <p>Results</p> <p>Nine mitochondrial genomes of Nepomorpha and five of other hemipterans were sequenced. These mitochondrial genomes contain the commonly found 37 genes without gene rearrangements. Based on the nucleotide sequences of mt-genomes, Pleoidea is not a member of the Nepomorpha and Aphelocheiroidea should be grouped back into Naucoroidea. Phylogenetic relationships among the superfamilies of Nepomorpha were resolved robustly.</p> <p>Conclusion</p> <p>The mt-genome is an effective data source for resolving intraordinal phylogenetic problems at the superfamily level within Heteroptera. The mitochondrial genomes of the true water bugs are typical insect mt-genomes. Based on the nucleotide sequences of the mt-genomes, we propose the Pleoidea to be a separate heteropteran infraorder. The infraorder Nepomorpha consists of five superfamilies with the relationships (Corixoidea + ((Naucoroidea + Notonectoidea) + (Ochteroidea + Nepoidea))).</p

A computation method on time-dependent accessibility of urban rail transit networks for the last service

Urban rail transit networks seldom provide 24-hour service. The last train is the latest chance for passengers. If passengers arrive too late to catch the last train, the path becomes inaccessible. The network accessibility thus varies depending on the departure time of passenger trips. This paper focuses on the computation method on the time-dependent accessibility of urban rail transit networks in order to facilitate the itinerary planning of passengers. A label setting algorithm is first designed to calculate the latest possible times for Origin–Destination (O–D) pairs, which is the latest departure times of passengers from the origins such that the destinations can be reach successfully. A searching approach is then developed to find the shortest accessible path at any possible departure times. The method is applied in a real-world metro network. The results show that the method is a powerful tool in solving the service accessibility problem. It has the ability to allow passengers to plan an optimal itinerary. Comparison analysis indicates that the proposed method can provide exact solutions in much shorter time, compared with a path enumeration method. Extensive tests on a set of random networks indicate that the method is efficient enough in practical applications. The execution time for an O–D pair on a personal computer with 2.8 GHZ CPU and 4GB of RAM is only 1.2 s for urban rail transit networks with 100 transfer stations