2,149 research outputs found
Xiao shi fan ting wu yan shi xu chao: [8 juan, juan shou]. v.62
No full text翁方綱, [伍崇曜]輯.Date from preface.框13.1 x 9.1 cm., 9行21字, 黑口, 左右雙邊, 無魚尾, 版心中鐫分冊書名, 下鐫叢書名.Weng Fanggang, [Wu Chongyao] ji.Kuang 13.1 x 9.1 cm., 9 xing 21 zi, hei kou, zuo you shuang bian, wu yu wei, ban xin zhong juan fen ce shu ming, xia juan cong shu ming
White Jade Figure of Wu Meng
No full textSmall white jade carving of Wu Meng, one of the Twenty-Four Paragons of Filial Piety, crossing a turbulent river waving his feather fan, as winds hindered his progress. Wu Meng was a disciple of the magician Ting I. The milky white jade has areas of a reddish brown.Kangxi reignQing Dynast
White Jade Figure of Wu Meng
No full textSmall pale celadon/white jade carving of Wu Meng, one of the Twenty-Four Paragons of Filial Piety, holding his feather fan. Wu Meng was a disciple of the magician Ting I. The milky white jade has areas rust colored areasQianlong reignQing Dynast
sj-pdf-1-lup-10.1177_09612033221099766 – Supplemental Material for α-2,6-sialic acid/IgG anti-dsDNA ratios correlate with human lupus disease activity and possible mechanisms: A pilot study
No full textSupplemental Material, sj-pdf-1-lup-10.1177_09612033221099766 for α-2,6-sialic acid/IgG anti-dsDNA ratios correlate with human lupus disease activity and possible mechanisms: A pilot study by Lieh-bang Liou, Ting-yi Wang, I-Ju Liu, Han-Chung Wu, Po-Yuan Ke, Yao-Fan Fang and Yen-Fu Chen in Lupus</p
sj-docx-1-tej-10.1177_20417314241231452 – Supplemental material for Regulation of the immune microenvironment by pioglitazone-loaded polylactic glycolic acid nanosphere composite scaffolds to promote vascularization and bone regeneration
No full textSupplemental material, sj-docx-1-tej-10.1177_20417314241231452 for Regulation of the immune microenvironment by pioglitazone-loaded polylactic glycolic acid nanosphere composite scaffolds to promote vascularization and bone regeneration by Shijie Fan, Yadong Tan, Xiuchen Yuan, Chun Liu, Xiaoyu Wu, Ting Dai, Su Ni, Jiafeng Wang, Yiping Weng and Hongbin Zhao in Journal of Tissue Engineering</p
Recommended from our members
Orthogonal tuning of gene expression noise using CRISPR–Cas
Full text linkThe first version of this article inadvertently neglected to include Ting Gong as third author. This has now been corrected online. The authors regret the error
Extending graph homomorphism and simulation for real life graph matching
Full text linkAmong the vital problems in a variety of emerging applications is the graph matching problem, which is to determine whether two graphs are similar, and if so, find all the valid matches in one graph for the other, based on specified metrics. Traditional graph matching approaches are mostly based on graph homomorphism and isomorphism, falling short of capturing both structural and semantic similarity in real life applications. Moreover, it is preferable while difficult to find all matches with high accuracy over complex graphs. Worse still, the graph structures in real life applications constantly bear modifications. In response to these challenges, this thesis presents a series of approaches for ef?ciently solving graph matching problems, over both static and dynamic real life graphs.
Firstly, the thesis extends graph homomorphism and subgraph isomorphism, respectively, by mapping edges from one graph to paths in another, and by measuring the semantic similarity of nodes. The graph similarity is then measured by the metrics based on these extensions. Several optimization problems for graph matching based on the new metrics are studied, with approximation algorithms having provable guarantees on match quality developed.
Secondly, although being extended in the above work, graph matching is defined in terms of functions, which cannot capture more meaningful matches and is usually hard to compute. In response to this, the thesis proposes a class of graph patterns, in which an edge denotes the connectivity in a data graph within a predefined number of hops. In addition, the thesis defines graph pattern matching based on a notion of bounded simulation relation, an extension of graph simulation. With this revision, graph pattern matching is in cubic-time by providing such an algorithm, rather than intractable.
Thirdly, real life graphs often bear multiple edge types. In response to this, the thesis further extends and generalizes the proposed revisions of graph simulation to a more powerful case: a novel set of reachability queries and graph pattern queries, constrained by a subclass of regular path expressions. Several fundamental problems of the queries are studied: containment, equivalence and minimization. The enriched reachability query does not increase the complexity of the above problems, shown by the corresponding algorithms. Moreover, graph pattern queries can be evaluated in cubic time, where two such algorithms are proposed.
Finally, real life graphs are frequently updated with small changes. The thesis investigates incremental algorithms for graph pattern matching defined in terms of graph simulation, bounded simulation and subgraph isomorphism. Besides studying the results on the complexity bounds, the thesis provides the experimental study verifying that these incremental algorithms significantly outperform their batch counterparts in response to small changes, using real-life data and synthetic data
Wu che yun fu. , Wu che yun fu : juan 1 / Chen Jin mo ding ; Hu Shao ying zuan ; Fan Ting hu zi五車韻府 : 卷1 / 陳藎謨訂 ; 胡邵瑛纂 ; 范廷瑚梓
No full textAvec mode text
Probability Estimates for Multi-class Classification by Pairwise Coupling
No full textPairwise coupling is a popular multi-class classification method that combines all comparisons
for each pair of classes. This paper presents two approaches for obtaining class probabilities
- …
