oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 68 )

2018 ( 1750 )

2017 ( 1652 )

2016 ( 1597 )

Custom range...

Search Results: 1 - 10 of 103816 matches for " Juyong Zhang "
All listed articles are free for downloading (OA Articles)
Page 1 /103816
Display every page Item
ivljenje v spreminjajo i se kitajski urbani pokrajini: tudija mesta Dalian
Juyong Zhang,Nico Kotze,Minghui Yu
Urbani Izziv , 2012,
Abstract: Dalian je drugo najpomembnej e mesto na jugu province Liaoning na severovzhodu Kitajske. Neko je tam stalo naselje Qingniwa, ki so ga med letoma 1858 in 1950 drug za drugim zasedli Britanci, Japonci in Rusi. Vsak osvajalec je v mestu uvedel svoj arhitekturni slog. Rusi so mesto med drugo svetovno vojno odvzeli Japoncem, leta 1950 pa so ga kon no vrnili Kitajski. Po letu 1950 je bila ve ina stavb in obmo ij iz asa ruskega imperija poru ena zaradi prenove, ki je potekala v mestu. Najve je spremembe so se zgodile po letu 1984, ko so mesto razglasili za posebno gospodarsko obmo je, zlasti pa v 90. letih 20. stoletja, ko je postal upan Bo Xilai, ki je v mestu uredil parke, avtoceste in kro i a. Tradicionalno grajeno okolje je skoraj izginilo; danes je to sodobno mesto, v katerem se gradijo obse na stanovanjska naselja. V njem prevladujejo stanovanjske stolpnice, v katerih ivi 5,72 milijona prebivalcev. Leta 2011 je bila med 400 prebivalci opravljena anketa, v kateri so morali ti izraziti svoje mnenje o ivljenju v Dalianu in na njegovem ureditvenem obmo ju ter oceniti svoje ivljenjske pogoje in stopnjo zadovoljstva s stanovanji. Rezultati ankete so jasno razkrili negotovost ve ine anketirancev glede spremenljivk, povezanih s kakovostjo stanovanj ter z naravo, s kakovostjo in z dostopnostjo razpolo ljivih storitev. Kljub temu je najve anketirancev navedlo, da imajo javni promet, odprte prostore, parke in rekreativne povr ine na voljo blizu doma.
Living in a changing Chinese urban landscape: The Dalian case study
Juyong Zhang,Nico Kotze,Minghui Yu
Urbani Izziv , 2012,
Abstract: Dalian is the second–most important city in the southern part of Liaoning Province in northeast China. The city can trace its history back to the Qingniwa settlement. This settlement was occupied from 1858 until 1950 in succession by the British, Japanese and Russian Empires, with each imposing its own building styles on the city. However, from 1950, when the city was finally returned to China by the Russians, who had captured it from the Japanese during the Second World War, most of the imperial buildings and sites were lost to redevelopment within the city. The most dramatic changes have taken place since 1984, when the city was declared a Special Economic Zone, and particularly during the 1990s, when Bo Xilai became the mayor and introduced parks, extensive motorways and many traffic circles. At present, having lost most of its traditional built environment, Dalian is a modern city marked by dramatic housing developments and dominated by multi-family high-rise buildings to accommodate its population of 5.72 million. In 2011, a survey was conducted among 400 inhabitants of the city to ascertain their perceptions concerning life in Dalian and the Dalian Development Zone, their living conditions and their level of satisfaction with their housing. From the survey, it was clear that the majority of the interviewees were uncertain about the variables concerning the structural quality of their housing units and the nature, quality and accessibility of the services provided. However, most of them indicated that public transport, open spaces, parks and recreational facilities were within easy reach of their housing units.
On Minimum Violations Ranking in Paired Comparisons
Juyong Park
Physics , 2005,
Abstract: Ranking a set of objects from the most dominant one to the least, based on the results of paired comparisons, proves to be useful in many contexts. Using the rankings of teams or individuals players in sports to seed tournaments is an example. The quality of a ranking is often evaluated by the number of violations, cases in which an object is ranked lower than another that it has dominated in a comparison, that it contains. A minimum violations ranking (MVR) method, as its name suggests, searches specifically for rankings that have the minimum possible number of violations which may or may not be zero. In this paper, we present a method based on statistical physics that overcomes conceptual and practical difficulties faced by earlier studies of the problem.
Hidden Information Revealed by Optimal Community Structure from a Protein-Complex Bipartite Network Improves Protein Function Prediction
Juyong Lee, Jooyoung Lee
PLOS ONE , 2013, DOI: 10.1371/journal.pone.0060372
Abstract: The task of extracting the maximal amount of information from a biological network has drawn much attention from researchers, for example, predicting the function of a protein from a protein-protein interaction (PPI) network. It is well known that biological networks consist of modules/communities, a set of nodes that are more densely inter-connected among themselves than with the rest of the network. However, practical applications of utilizing the community information have been rather limited. For protein function prediction on a network, it has been shown that none of the existing community-based protein function prediction methods outperform a simple neighbor-based method. Recently, we have shown that proper utilization of a highly optimal modularity community structure for protein function prediction can outperform neighbor-assisted methods. In this study, we propose two function prediction approaches on bipartite networks that consider the community structure information as well as the neighbor information from the network: 1) a simple screening method and 2) a random forest based method. We demonstrate that our community-assisted methods outperform neighbor-assisted methods and the random forest method yields the best performance. In addition, we show that using the optimal community structure information is essential for more accurate function prediction for the protein-complex bipartite network of Saccharomyces cerevisiae. Community detection can be carried out either using a modified modularity for dealing with the original bipartite network or first projecting the network into a single-mode network (i.e., PPI network) and then applying community detection to the reduced network. We find that the projection leads to the loss of information in a significant way. Since our prediction methods rely only on the network topology, they can be applied to various fields where an efficient network-based analysis is required.
Entropically-Stabilized Self-Compactification in Model Colloidal Systems
Juyong Park,Alexei V. Tkachenko
Physics , 2003,
Abstract: We discuss the phenomenon of spontaneous self-compactification in a model colloidal system, proposed in a recent work on DNA-mediated self-assembly. We focus on the effect of thermal fluctuations on the stability of membrane-like self-assembled phase with in-plane square order. Surprisingly, the fluctuations are shown to enhance the stability of this quasi-2D phase with respect to transition to alternative 3D structures.
Community-Based Network Study of Protein-Carbohydrate Interactions in Plant Lectins Using Glycan Array Data
Adeel Malik, Juyong Lee, Jooyoung Lee
PLOS ONE , 2014, DOI: 10.1371/journal.pone.0095480
Abstract: Lectins play major roles in biological processes such as immune recognition and regulation, inflammatory responses, cytokine signaling, and cell adhesion. Recently, glycan microarrays have shown to play key roles in understanding glycobiology, allowing us to study the relationship between the specificities of glycan binding proteins and their natural ligands at the omics scale. However, one of the drawbacks in utilizing glycan microarray data is the lack of systematic analysis tools to extract information. In this work, we attempt to group various lectins and their interacting carbohydrates by using community-based analysis of a lectin-carbohydrate network. The network consists of 1119 nodes and 16769 edges and we have identified 3 lectins having large degrees of connectivity playing the roles of hubs. The community based network analysis provides an easy way to obtain a general picture of the lectin-glycan interaction and many statistically significant functional groups.
Solution of the 2-star model of a network
Juyong Park,M. E. J. Newman
Physics , 2004, DOI: 10.1103/PhysRevE.70.066146
Abstract: The p-star model or exponential random graph is among the oldest and best-known of network models. Here we give an analytic solution for the particular case of the 2-star model, which is one of the most fundamental of exponential random graphs. We derive expressions for a number of quantities of interest in the model and show that the degenerate region of the parameter space observed in computer simulations is a spontaneously symmetry broken phase separated from the normal phase of the model by a conventional continuous phase transition.
The statistical mechanics of networks
Juyong Park,M. E. J. Newman
Physics , 2004, DOI: 10.1103/PhysRevE.70.066117
Abstract: We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the same role in the study of networks as is played by the Boltzmann distribution in classical statistical mechanics; they offer the best prediction of network properties subject to the constraints imposed by a given set of observations. We give exact solutions of models within this class that incorporate arbitrary degree distributions and arbitrary but independent edge probabilities. We also discuss some more complex examples with correlated edges that can be solved approximately or exactly by adapting various familiar methods, including mean-field theory, perturbation theory, and saddle-point expansions.
A network-based ranking system for American college football
Juyong Park,M. E. J. Newman
Physics , 2005, DOI: 10.1088/1742-5468/2005/10/P10014
Abstract: American college football faces a conflict created by the desire to stage national championship games between the best teams of a season when there is no conventional playoff system to decide which those teams are. Instead, ranking of teams is based on their record of wins and losses during the season, but each team plays only a small fraction of eligible opponents, making the system underdetermined or contradictory or both. It is an interesting challenge to create a ranking system that at once is mathematically well-founded, gives results in general accord with received wisdom concerning the relative strengths of the teams, and is based upon intuitive principles, allowing it to be accepted readily by fans and experts alike. Here we introduce a one-parameter ranking method that satisfies all of these requirements and is based on a network representation of college football schedules.
The origin of degree correlations in the Internet and other networks
Juyong Park,M. E. J. Newman
Physics , 2003, DOI: 10.1103/PhysRevE.68.026112
Abstract: It has been argued that the observed anticorrelation between the degrees of adjacent vertices in the network representation of the Internet has its origin in the restriction that no two vertices have more than one edge connecting them. Here we introduce a formalism for modeling ensembles of graphs with single edges only and derive values for the exponents and correlation coefficients characterizing them. Our results confirm that the conjectured mechanism does indeed give rise to correlations of the kind seen in the Internet, although only a part of the measured correlation can be accounted for in this way.
Page 1 /103816
Display every page Item


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