1,053 research outputs found

    On the “Work-Study Combination” mode, the Television Animation teaching reform based on project-oriented

    Get PDF
    AbstractOur animation design and production of professional reference from 2008 Korean animation success of vocational education institutions. Flash in earlier time did not do well in video manipulation. And try to take the school-enterprise cooperation business certification curriculum. In 2009 we joined Adobe Digital Arts Center, the introduction of relevant skills courses. Learn Korean animation school-enterprise cooperation of vocational education institutions work and study in the teaching mode, I was animation design and production professionals in accordance with the requirements of the school gradually adjusted from 08 to develop training objectives and teaching plans, a substantial transformation of the curriculum system, all of the professional basic courses and specialized courses trunk capacity requirements in accordance with job categories combined. We continue to improve research in the content, improve the TV movie based on project-oriented courses in engineering combined with reform of the teaching model for animation Vocational Training Program provides an important reference

    Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs

    Full text link
    Crowdsourcing platforms are now extensively used for conducting subjective pairwise comparison studies. In this setting, a pairwise comparison dataset is typically gathered via random sampling, either \emph{with} or \emph{without} replacement. In this paper, we use tools from random graph theory to analyze these two random sampling methods for the HodgeRank estimator. Using the Fiedler value of the graph as a measurement for estimator stability (informativeness), we provide a new estimate of the Fiedler value for these two random graph models. In the asymptotic limit as the number of vertices tends to infinity, we prove the validity of the estimate. Based on our findings, for a small number of items to be compared, we recommend a two-stage sampling strategy where a greedy sampling method is used initially and random sampling \emph{without} replacement is used in the second stage. When a large number of items is to be compared, we recommend random sampling with replacement as this is computationally inexpensive and trivially parallelizable. Experiments on synthetic and real-world datasets support our analysis

    From Common to Special: When Multi-Attribute Learning Meets Personalized Opinions

    Full text link
    Visual attributes, which refer to human-labeled semantic annotations, have gained increasing popularity in a wide range of real world applications. Generally, the existing attribute learning methods fall into two categories: one focuses on learning user-specific labels separately for different attributes, while the other one focuses on learning crowd-sourced global labels jointly for multiple attributes. However, both categories ignore the joint effect of the two mentioned factors: the personal diversity with respect to the global consensus; and the intrinsic correlation among multiple attributes. To overcome this challenge, we propose a novel model to learn user-specific predictors across multiple attributes. In our proposed model, the diversity of personalized opinions and the intrinsic relationship among multiple attributes are unified in a common-to-special manner. To this end, we adopt a three-component decomposition. Specifically, our model integrates a common cognition factor, an attribute-specific bias factor and a user-specific bias factor. Meanwhile Lasso and group Lasso penalties are adopted to leverage efficient feature selection. Furthermore, theoretical analysis is conducted to show that our proposed method could reach reasonable performance. Eventually, the empirical study carried out in this paper demonstrates the effectiveness of our proposed method

    HodgeRank with Information Maximization for Crowdsourced Pairwise Ranking Aggregation

    Full text link
    Recently, crowdsourcing has emerged as an effective paradigm for human-powered large scale problem solving in various domains. However, task requester usually has a limited amount of budget, thus it is desirable to have a policy to wisely allocate the budget to achieve better quality. In this paper, we study the principle of information maximization for active sampling strategies in the framework of HodgeRank, an approach based on Hodge Decomposition of pairwise ranking data with multiple workers. The principle exhibits two scenarios of active sampling: Fisher information maximization that leads to unsupervised sampling based on a sequential maximization of graph algebraic connectivity without considering labels; and Bayesian information maximization that selects samples with the largest information gain from prior to posterior, which gives a supervised sampling involving the labels collected. Experiments show that the proposed methods boost the sampling efficiency as compared to traditional sampling schemes and are thus valuable to practical crowdsourcing experiments.Comment: Accepted by AAAI201

    Robust Ordinal Embedding from Contaminated Relative Comparisons

    Full text link
    Existing ordinal embedding methods usually follow a two-stage routine: outlier detection is first employed to pick out the inconsistent comparisons; then an embedding is learned from the clean data. However, learning in a multi-stage manner is well-known to suffer from sub-optimal solutions. In this paper, we propose a unified framework to jointly identify the contaminated comparisons and derive reliable embeddings. The merits of our method are three-fold: (1) By virtue of the proposed unified framework, the sub-optimality of traditional methods is largely alleviated; (2) The proposed method is aware of global inconsistency by minimizing a corresponding cost, while traditional methods only involve local inconsistency; (3) Instead of considering the nuclear norm heuristics, we adopt an exact solution for rank equality constraint. Our studies are supported by experiments with both simulated examples and real-world data. The proposed framework provides us a promising tool for robust ordinal embedding from the contaminated comparisons.Comment: Accepted by AAAI 201

    Adsorption Properties of Typical Lung Cancer Breath Gases on Ni-SWCNTs through Density Functional Theory

    Get PDF
    A lot of useful information is contained in the human breath gases, which makes it an effective way to diagnose diseases by detecting the typical breath gases. This work investigated the adsorption of typical lung cancer breath gases: benzene, styrene, isoprene, and 1-hexene onto the surface of intrinsic and Ni-doped single wall carbon nanotubes through density functional theory. Calculation results show that the typical lung cancer breath gases adsorb on intrinsic single wall carbon nanotubes surface by weak physisorption. Besides, the density of states changes little before and after typical lung cancer breath gases adsorption. Compared with single wall carbon nanotubes adsorption, single Ni atom doping significantly improves its adsorption properties to typical lung cancer breath gases by decreasing adsorption distance and increasing adsorption energy and charge transfer. The density of states presents different degrees of variation during the typical lung cancer breath gases adsorption, resulting in the specific change of conductivity of gas sensing material. Based on the different adsorption properties of Ni-SWCNTs to typical lung cancer breath gases, it provides an effective way to build a portable noninvasive portable device used to evaluate and diagnose lung cancer at early stage in time
    • …
    corecore