oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 1 )

2019 ( 102 )

2018 ( 713 )

2017 ( 593 )

Custom range...

Search Results: 1 - 10 of 43976 matches for " Yezhou Wu "
All listed articles are free for downloading (OA Articles)
Page 1 /43976
Display every page Item
Terrorist Networks, Network Energy and Node Removal: A New Measure of Centrality Based on Laplacian Energy  [PDF]
Xingqin Qi, Robert D. Duval, Kyle Christensen, Edgar Fuller, Arian Spahiu, Qin Wu, Yezhou Wu, Wenliang Tang, Cunquan Zhang
Social Networking (SN) , 2013, DOI: 10.4236/sn.2013.21003
Abstract: In this work we propose a centrality measure for networks, which we refer to as Laplacian centrality, that provides a general framework for the centrality of a vertex based on the idea that the importance (or centrality) of a vertex is related to the ability of the network to respond to the deactivation or removal of that vertex from the network. In particular, the Laplacian centrality of a vertex is defined as the relative drop of Laplacian energy caused by the deactivation of this vertex. The Laplacian energy of network G with n vertices is defined as \"\", where \"\" is the eigenvalue of the Laplacian matrix of G. Other dynamics based measures such as that of Masuda and Kori and PageRank compute the importance of a node by analyzing the way paths pass through a node while our measure captures this information as well as the way these paths are redistributed when the node is deleted. The validity and robustness of this new measure are illustrated on two different terrorist social network data sets and 84 networks in James Moodys Add Health in school friendship nomination data, and is compared with other standard centrality measures.
Growth of entire solutions of algebraic differential equations
Wenjun Yuan,Yezhou Li,Jianming Lin
Electronic Journal of Differential Equations , 2012,
Abstract: In this article, by means of the normal family theory, we estimate the growth order of entire solutions of some algebraic differential equations and extend the result by Qi et al [14]. We also give some examples to show that our results occur in some special cases.
The General Traveling Wave Solutions of the Fisher Equation with Degree Three
Wenjun Yuan,Qiuhui Chen,Jianming Qi,Yezhou Li
Advances in Mathematical Physics , 2013, DOI: 10.1155/2013/657918
Abstract: We employ the complex method to research the integrality of the Fisher equations with degree three. We obtain the sufficient and necessary condition of the integrable of the Fisher equations with degree three and the general meromorphic solutions of the integrable Fisher equations with degree three, which improves the corresponding results obtained by Feng and Li (2006), Guo and Chen (1991), and A??rseven and ?zi? (2010). Moreover, all are new general meromorphic solutions of the Fisher equations with degree three for . Our results show that the complex method provides a powerful mathematical tool for solving a large number of nonlinear partial differential equations in mathematical physics. 1. Introduction and Main Result Consider the Fisher equation which is a nonlinear diffusion equation as a model for the propagation of a mutant gene with an advantageous selection intensity . It was suggested by Fisher as a deterministic version of a stochastic model for the spatial spread of a favored gene in a population in 1936. Set and and drop the primes; (1) becomes Substituting the traveling wave transform , into (2), it gives a nonlinear ordinary differential equation where is a constant. Finding solutions of nonlinear models is a difficult and challenging task. In 2005 and 2009, Feng et al. [1, 2] proposed an analytic method to construct explicitly exact and approximate solutions for nonlinear evolution equations. By using this method, some new traveling wave solutions of the Kuramoto-Sivashinsky equation and the Benny equation were obtained explicitly. These solutions included solitary wave solutions, singular traveling wave solutions, and periodical wave solutions. These results indicated that in some cases their analytic approach is an effective method to obtain traveling solitary wave solutions of various nonlinear evolution equations. It can also be applied to some related nonlinear dynamical systems. In 2010 and 2011, Demina et al. [3–5] studied the meromorphic solutions of autonomous nonlinear ordinary differential equations. An algorithm for constructing meromorphic solutions in explicit form was presented. General expressions for meromorphic solutions (including rational, periodic, elliptic) were found for a wide class of autonomous nonlinear ordinary differential equations. Recently, the complex method was introduced by Yuan et al. [6–8]. Very recently, Yuan et al. [9] employed the complex method to obtain the general solutions of (3). In order to state our results, we need some concepts and notations. A meromorphic function means that is
Bounds on the Number of Huffman and Binary-Ternary Trees
Angeline Rao,Ying Liu,Yezhou Feng,Jian Shen
Mathematics , 2013,
Abstract: Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An $n$-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either $n$ "children" vertices connecting to it, or 0 children. Vertices with 0 children are called \textit{leaves}. We let $h_n(q)$ represent the total number of $n$-ary Huffman trees with $q$ leaves. In this paper, we use a recursive method to generate upper and lower bounds on $h_n(q)$ and get $h_2(q) \approx (0.1418532)(1.7941471)^q+(0.0612410)(1.2795491)^q$ for $n=2$. This matches the best results achieved by Elsholtz, Heuberger, and Prodinger in August 2011. Our approach reveals patterns in Huffman trees that we used in our analysis of the Binary-Ternary (BT) trees we created. Our research opens a completely new door in data compression by extending the study of Huffman trees to BT trees. Our study of BT trees paves the way for designing data-specific trees, minimizing possible wasted storage space from Huffman coding. We prove a recursive formula for the number of BT trees with $q$ leaves. Furthermore, we provide analysis and further proofs to reach numeric bounds. Our discoveries have broad applications in computer data compression. These results also improve graphical representations of protein sequences that facilitate in-depth genome analysis used in researching evolutionary patterns.
Neural Self Talk: Image Understanding via Continuous Questioning and Answering
Yezhou Yang,Yi Li,Cornelia Fermuller,Yiannis Aloimonos
Computer Science , 2015,
Abstract: In this paper we consider the problem of continuously discovering image contents by actively asking image based questions and subsequently answering the questions being asked. The key components include a Visual Question Generation (VQG) module and a Visual Question Answering module, in which Recurrent Neural Networks (RNN) and Convolutional Neural Network (CNN) are used. Given a dataset that contains images, questions and their answers, both modules are trained at the same time, with the difference being VQG uses the images as input and the corresponding questions as output, while VQA uses images and questions as input and the corresponding answers as output. We evaluate the self talk process subjectively using Amazon Mechanical Turk, which show effectiveness of the proposed method.
Learning the Semantics of Manipulation Action
Yezhou Yang,Yiannis Aloimonos,Cornelia Fermuller,Eren Erdal Aksoy
Computer Science , 2015,
Abstract: In this paper we present a formal computational framework for modeling manipulation actions. The introduced formalism leads to semantics of manipulation action and has applications to both observing and understanding human manipulation actions as well as executing them with a robotic mechanism (e.g. a humanoid robot). It is based on a Combinatory Categorial Grammar. The goal of the introduced framework is to: (1) represent manipulation actions with both syntax and semantic parts, where the semantic part employs $\lambda$-calculus; (2) enable a probabilistic semantic parsing schema to learn the $\lambda$-calculus representation of manipulation action from an annotated action corpus of videos; (3) use (1) and (2) to develop a system that visually observes manipulation actions and understands their meaning while it can reason beyond observations using propositional logic and axiom schemata. The experiments conducted on a public available large manipulation action dataset validate the theoretical framework and our implementation.
From Images to Sentences through Scene Description Graphs using Commonsense Reasoning and Knowledge
Somak Aditya,Yezhou Yang,Chitta Baral,Cornelia Fermuller,Yiannis Aloimonos
Computer Science , 2015,
Abstract: In this paper we propose the construction of linguistic descriptions of images. This is achieved through the extraction of scene description graphs (SDGs) from visual scenes using an automatically constructed knowledge base. SDGs are constructed using both vision and reasoning. Specifically, commonsense reasoning is applied on (a) detections obtained from existing perception methods on given images, (b) a "commonsense" knowledge base constructed using natural language processing of image annotations and (c) lexical ontological knowledge from resources such as WordNet. Amazon Mechanical Turk(AMT)-based evaluations on Flickr8k, Flickr30k and MS-COCO datasets show that in most cases, sentences auto-constructed from SDGs obtained by our method give a more relevant and thorough description of an image than a recent state-of-the-art image caption based approach. Our Image-Sentence Alignment Evaluation results are also comparable to that of the recent state-of-the art approaches.
Mapping XML Data to Relational Data: A DOM-Based Approach
Mustafa Atay,Yezhou Sun,Dapeng Liu,Shiyong Lu,Farshad Fotouhi
Computer Science , 2010,
Abstract: XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the full power of this new technology. Several researchers have proposed to use relational databases to store and query XML data. While several algorithms of schema mapping and query mapping have been proposed, the problem of mapping XML data to relational data, i.e., mapping an XML INSERT statement to a sequence of SQL INSERT statements, has not been addressed thoroughly in the literature. In this paper, we propose an efficient linear algorithm for mapping XML data to relational data. This algorithm is based on our previous proposed inlining algorithm for mapping DTDs to relational schemas and can be easily adapted to other inlining algorithms.
Efficient subtraction of insect rRNA prior to transcriptome analysis of Wolbachia-Drosophila lateral gene transfer
Nikhil Kumar, Todd Creasy, Yezhou Sun, Melissa Flowers, Luke J Tallon, Julie C Dunning Hotopp
BMC Research Notes , 2012, DOI: 10.1186/1756-0500-5-230
Abstract: A method is described that efficiently removes >95% of insect rRNA from total RNA samples, as determined by microfluidics and transcriptome sequencing. This subtraction yielded a 6.2-fold increase in mRNA abundance. Such a host rRNA-depletion strategy, in combination with bacterial rRNA depletion, is necessary to analyze transcription of obligate intracellular bacteria. Here, transcripts were identified that arise from a lateral gene transfer of an entire Wolbachia bacterial genome into a Drosophila ananassae chromosome. In this case, an rRNA depletion strategy is preferred over polyA-based enrichment since transcripts arising from bacteria-to-animal lateral gene transfer may not be poly-adenylated.This enrichment method yields a significant increase in mRNA abundance when poly-A selection is not suitable. It can be used in combination with bacterial rRNA subtraction to enable experiments to simultaneously measure bacteria and insect mRNA in vector and endosymbiont biology experiments.Many interesting bacteria form intimate, obligate relationships with eukaryotes. These bacteria include endosymbionts and obligate intracellular pathogens. These microbes can be difficult to research as they cannot be cultured, easily manipulated, or genetically transformed. Therefore, genomics techniques have significantly advanced the study of these organisms. Because of the obvious potential health impacts, many techniques and tools have been developed to research such bacteria that interact with humans. For example, the Ribo-Zero rRNA removal kit for human/mouse/rat (Epicentre, Madison, WI, USA) can facilitate transcriptome analysis of intracellular pathogens of humans. However, for non-mammalian systems including bacteria/vector systems, a void still exists. Previously, the MICROBEnrich insect/C. elegans module (Ambion, Austin, TX, USA) was used for this purpose, but it is no longer available. Therefore, we sought to investigate if Epicentre’s Ribo-Zero rRNA removal kit designed f
IRAK-M Expression Limits Dendritic Cell Activation and Proinflammatory Cytokine Production in Response to Helicobacter pylori
Jessica Shiu, Steven J. Czinn, Koichi S. Kobayashi, Yezhou Sun, Thomas G. Blanchard
PLOS ONE , 2013, DOI: 10.1371/journal.pone.0066914
Abstract: Helicobacter pylori (H. pylori) infects the gastric mucosa and persists for the life of the host. Bacterial persistence may be due to the induction of regulatory T cells (Tregs) whichmay have protective effects against other diseases such as asthma. It has been shown that H. pylori modulates the T cell response through dendritic cell reprogramming but the molecular pathways involved are relatively unknown. The goal of this study was to identify critical elements of dendritic cell (DC) activation and evaluate potential influence on immune activation. Microarray analysis was used to demonstrate limited gene expression changes in H. pylori stimulated bone marrow derived DCs (BMDCs) compared to the BMDCs stimulated with E. coli. IRAK-M, a negative regulator of TLR signaling, was upregulated and we selectedit for investigation of its role in modulating the DC and T cell responses. IRAK-M?/? and wild type BMDC were compared for their response to H. pylori. Cells lacking IRAK-M produced significantly greater amounts of proinflammatory MIP-2 and reduced amounts of immunomodulatory IL-10 than wild type BMDC. IRAK-M?/? cells also demonstrated increased MHC II expression upon activation. However, IRAK-M?/? BMDCs were comparable to wild type BMDCs in inducing T-helper 17 (TH17) and Treg responses as demonstrated in vitro using BMDC CD4+ T cells co-culture assays,and in vivo though the adoptive transfer of CD4+ FoxP3-GFP T cells into H. pylori infected IRAK-M?/? mice. These results suggest that H. pylori infection leads to the upregulation of anti-inflammatory molecules like IRAK-M and that IRAK-M has a direct impact on innate functions in DCs such as cytokine and costimulation molecule upregulation but may not affect T cell skewing.
Page 1 /43976
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.