Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 4 )

2019 ( 77 )

2018 ( 512 )

2017 ( 548 )

Custom range...

Search Results: 1 - 10 of 33975 matches for " Jie Han "
All listed articles are free for downloading (OA Articles)
Page 1 /33975
Display every page Item
Postmodern Strategies in Ian McEwan’s Major Novels  [PDF]
Jie Han, Zhenli Wang
Advances in Literary Study (ALS) , 2014, DOI: 10.4236/als.2014.24020
Abstract: Ian McEwan, together with Martin Amis is now the best-known and controversial contemporary British novelist. McEwan seems to be interested in the relationship between reality and imagina-tion, history and fabrication in the process of writing, which is generally considered as one of the themes related to postmodern metafiction writing. He also adopts the postmodern intertextuality in his writing practice. Those postmodern concerns and strategies confirm his position as a post-modernist.
The Experimental Techniques in Ian McEwan’s Atonement  [PDF]
Jie Han, Pei Wang
Open Journal of Social Sciences (JSS) , 2015, DOI: 10.4236/jss.2015.36024
Abstract: Ian McEwan, together with Martin Amis, is now the best-known and controversial contemporary British novelist. Atonement is regarded as the best of McEwan books and is shortlisted for the Booker Prize. It displays features of modernism and postmodernism, with the application of stream of consciousness, multiple voices, montage and flashbacks, becoming increasingly experimental in form.
A Literature Review on the Definition and Process of Project-Based Learning and Other Relative Studies  [PDF]
Xiaomei Du, Jie Han
Creative Education (CE) , 2016, DOI: 10.4236/ce.2016.77112
Abstract: Project-Based Learning (PBL) is a student-centered model that organizes learning and studying around projects. It has gained some popularity in second language education and exercised positive influence on educational practices. This paper gives a selective review of the researches on Project-Based Learning from different aspects, including the definition of PBL, the process of PBL and other relative studies, in the hope that this may, to some extent, render help to teachers who employ PBL in varying degrees.
A new integrating understanding of superconductivity and superfluidity
Jie Han
Physics , 2002,
Abstract: An integrating theoretical scenario of superconductivity and superfluidity has been built. It reduces to the special BCS superconductivity mechanism for conventional superconductor and to a new theory for high transition temperature superconductors, which can explain the recent angle-resolved photoemission experiments and the earlier nuclear spin-lattice relaxation rate experiments. Both experiments suggest the existence of pairing carriers and the normal state energy gap well above the transition temperature of superconductivity. A powerful and workable experiment designed to validate this scenario is also put forward for the experimenter.
Near Perfect Matchings in $k$-uniform Hypergraphs
Jie Han
Mathematics , 2014, DOI: 10.1017/S0963548314000613
Abstract: Let $H$ be a $k$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\lfloor n/k \rfloor$, then $H$ contains a matching with $\lfloor n/k\rfloor$ edges. This confirms a conjecture of R\"odl, Ruci\'nski and Szemer\'edi, who proved that the minimum $(k-1)$-degree $n/k+O(\log n)$ suffices. More generally, we show that $H$ contains a matching of size $d$ if its minimum codegree is $d
Perfect Matchings in Hypergraphs and the Erd?s matching conjecture
Jie Han
Mathematics , 2015,
Abstract: We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when $d
Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs
Jie Han
Mathematics , 2014,
Abstract: For any $\gamma>0$, Keevash, Knox and Mycroft constructed a polynomial-time algorithm to determine the existence of perfect matchings in any $n$-vertex $k$-uniform hypergraph whose minimum codegree is at least $n/k+\gamma n$. We prove a structure theorem that enables us to determine the existence of a perfect matching for any $k$-uniform hypergraph with minimum codegree at least $n/k$. This solves a problem of Karpi\'nski, Ruci\'nski and Szyma\'nska completely. Our proof uses a lattice-based absorbing method.
Near Perfect Matchings in $k$-uniform Hypergraphs II
Jie Han
Mathematics , 2015,
Abstract: Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author used recently to solve two other problems on matching and tilings for hypergraphs.
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Jinghang Liang, Jie Han
BMC Systems Biology , 2012, DOI: 10.1186/1752-0509-6-113
Abstract: This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN). An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n), where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model.Stochastic Boolean networks (SBNs) are proposed as an efficient approach to modelling gene regulatory networks (GRNs). The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been i
Study on the User-oriented Individualized Information Push Service
Jie Zhang,Haitao Han
Asian Social Science , 2009, DOI: 10.5539/ass.v4n12p123
Abstract: Individualized information service is the service which could fulfill user’s individual information demand, offer information service according to user’s definite demands, or forwardly offer probable needed information service through analysis of user individuality and using habits. Individualized information service could help to quickly and exactly acquire information for user and offer conveniences for user. Based on that, in this article, we will study the character, implementation mode and flow of information push mode, and develop the theory and method of individualized information push.
Page 1 /33975
Display every page Item

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