Human motion retrieval based on freehand sketch

In this paper, we present an integrated framework of human motion retrieval based on freehand sketch. With some simple rules, the user can acquire a desired motion by sketching several key postures. To retrieve efficiently and accurately by sketch, the 3D postures are projected onto several 2D planes. The limb direction feature is proposed to represent the input sketch and the projected-postures. Furthermore, a novel index structure based on k-d tree is constructed to index the motions in the database, which speeds up the retrieval process. With our posture-by-posture retrieval algorithm, a continuous motion can be got directly or generated by using a pre-computed graph structure. What's more, our system provides an intuitive user interface. The experimental results demonstrate the effectiveness of our method. © 2014 John Wiley & Sons, Ltd

Credit-based Pricing for Multi-user Class Transportation Facilities

This paper proposes an innovative arc-based credit (ABC) congestion pricing scheme to improve the system performance in a transportation network. By associating each arc with apositive or negative credit rate, the strategy can accomplish multiple planning goals, such as efficiency, fairness, and public acceptance simultaneously. We first demonstrate that on a one-origin or one-destination network, a pareto-improving, system-optimal and revenue-neutral credit scheme always exists and can be obtained by solving a set of linear equations. Recognizing that such a credit scheme may not exist in a multi-origin network, we then define the maximum-revenue problem with pareto-improving constrains (MRPI): find the maximum possible revenue collected by the credit scheme with optimal arc flows and non-increasing origin-destination (OD) travel costs. We discover that the dual of MRPI is equivalent to a typical Transportation Problem which, therefore, provides a simple way to calculate the revenue by just examining the dual problem. At the end of the paper, a numerical example with a small synthetic network is provided for the comparison of the credit scheme with other existing toll schemes in terms of OD travel disutilities

Transcriptome analysis reveals the time of the fourth round of genome duplication in common carp (Cyprinus carpio)

<p>Abstract</p> <p>Background</p> <p>Common carp (<it>Cyprinus carpio</it>) is thought to have undergone one extra round of genome duplication compared to zebrafish. Transcriptome analysis has been used to study the existence and timing of genome duplication in species for which genome sequences are incomplete. Large-scale transcriptome data for the common carp genome should help reveal the timing of the additional duplication event.</p> <p>Results</p> <p>We have sequenced the transcriptome of common carp using 454 pyrosequencing. After assembling the 454 contigs and the published common carp sequences together, we obtained 49,669 contigs and identified genes using homology searches and an ab initio method. We identified 4,651 orthologous pairs between common carp and zebrafish and found 129,984 paralogous pairs within the common carp. An estimation of the synonymous substitution rate in the orthologous pairs indicated that common carp and zebrafish diverged 120 million years ago (MYA). We identified one round of genome duplication in common carp and estimated that it had occurred 5.6 to 11.3 MYA. In zebrafish, no genome duplication event after speciation was observed, suggesting that, compared to zebrafish, common carp had undergone an additional genome duplication event. We annotated the common carp contigs with Gene Ontology terms and KEGG pathways. Compared with zebrafish gene annotations, we found that a set of biological processes and pathways were enriched in common carp.</p> <p>Conclusions</p> <p>The assembled contigs helped us to estimate the time of the fourth-round of genome duplication in common carp. The resource that we have built as part of this study will help advance functional genomics and genome annotation studies in the future.</p