81 research outputs found
Détresse et résistance des migrantes sous la plume de Sheng Keyi
No full textSheng Keyi, originaire d’un village vétuste de la province du Hunan, commence sa carrière d’écrivain au début des années 90. En tant que membre de la génération assistant aux influences de la politique de réforme et d’ouverture, elle prend les migrantes pour thème dans l’un de ses romans, Filles du Nord. Comme ce que le titre indique, ce sont des filles du Nord de la Chine à la poursuite d’une ascension sociale à Shenzhen, mais qui manquent de connaissances et se heurtent ainsi à un bon nombre de difficultés.A leurs dépens, elles découvrent qu’il existe autant de désirs que d’obstacles dans les grandes villes. Dans cet article, nous nous concentrerons sur la question suivante : « Les migrantes du Nord seront-elles dévoyées devant les défis semblant incontournables et les tentations matérielles innombrables ? » Au bout d’une analyse de ce chef-d’œuvre, nous constaterons que face à la corruption des mœurs et la discrimination sexiste et régionale, ces filles du Nord, pauvres mais tenaces et courageuses, persistent dans leurs propres principes et leurs belles qualités
SNP-based identification of QTLs for thousand-grain weight and related traits in wheat 8762/Keyi 5214 DH lines
No full textAs important yield-related traits, thousand-grain weight (TGW), grain number per spike (GNS) and grain weight per spike (GWS) are crucial components of wheat production. To dissect their underlying genetic basis, a double haploid (DH) population comprised of 198 lines derived from 8762/Keyi 5214 was constructed. We then used genechip to genotype the DH population and integrated the yield-related traits TGW, GNS and GWS for QTL mapping. Finally, we obtained a total of 18 942 polymorphic SNP markers and identified 41 crucial QTLs for these traits. Three stable QTLs for TGW were identified on chromosomes 2D (QTgw-2D.3 and QTgw-2D.4) and 6A (QTgw-6A.1), with additive alleles all from the parent 8762, explaining 4.81–18.67% of the phenotypic variations. Five stable QTLs for GNS on chromosomes 3D, 5B, 5D and 6A were identified. QGns-5D.1 was from parent 8762, while the other four QTLs were from parent Keyi 5214, explaining 5.89–7.08% of the GNS phenotypic variations. In addition, a stable GWS genetic locus QGws-4A.3 was detected from the parent 8762, which explained 6.08–6.14% of the phenotypic variations. To utilize the identified QTLs, we developed STARP markers for four important QTLs, Tgw2D.3-2, Tgw2D.4-1, Tgw6A.1 and Gns3D.1. Our results provide important basic resources and references for the identification and cloning of genes related to TGW, GNS and GWS in wheat
On Srivastava's problems and the properties of Hadamard matrices
No full textAbstractThe Hadamard matrix H2m of order 2m can be obtained by m−1 times of Kronercker products from the Hadamard matrix H2 of order 2. In this paper we first point out that the Srivastava's problems for positive integers t and m is equivalent to finding a submatrix A∗ consisting of N(t, m) rows of the H2m such that the number N(t, m) of rows in minimal and any t columns of A∗ are linearly independent. For 2 ⩽ t ⩽ 3 and 2m−1 ⩽ t ⩽ 2m, the minimum number N(t, m) of rows of A∗ is given and the method for constructing A∗ is presented. For 4 ⩽ t < 2m−1 we point out the upper bound on N(t, m) and conjecture that this upper bound is the minimum number of rows of A∗
On Kotzig's conjecture for graphs with a regular path-connectedness
No full textAbstractKotzig (see Bondy and Murty (1976)) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length k, k > 2. Here we prove this conjecture for k ⩾ 12
Joint State and Parameter Estimation in Particle Filtering and Stochastic Optimization
No full textNon
Optimal Liveness Petri Net Controllers with Minimal Structures for Automated Manufacturing Systems
No full text[[alternative]]The Pedagogical Grammar of the Chinese Modal Verb "Keyi"
No full text[[abstract]]本論文的目的在研究漢語能願動詞「可以」之教學語法。
第一章導論說明本論文研究緣起與研究目的。
第二、三章為理論分析部份，首先探討能願動詞「可以」的語義範圍與語義結構，整理出能願動詞「可以」可表達之語義有四：「表可能」、「表許可」、「表某種用途」、「表值得」，同時並與另一語義相近之能願動詞「能」做一比較，接著為「可以」整理出訂定教學語法規則時所應遵循的教學語法架構。
第四章為語料庫之分析，利用台灣師大「華語病句語料庫」之語料，整理分析華語學習者學習能願動詞「可以」各語義時的習得過程，並就學習者常犯錯誤做一分析。
第五章為教學語法部份，以上述各理論與分析為基礎與框架，嘗試提出「可以」的建議性教學排序與教學語法，並以整理之結果評比與檢視現有華語文教材對「可以」的處理方式。
第六章回顧所有論述，為總結與省思。
State Space-Based Hybrid Heuristic Search Algorithm for Scheduling Deadlock-Prone Automated Manufacturing Systems
No full textThis work addresses the scheduling problem of deadlock-prone automated manufacturing systems (AMSs) modeled by a class of Petri nets called systems of simple sequential processes with resources (S3PRs), and proposes a novel hybrid heuristic search (HHS) algorithm to minimize the makespan. First, based on place-timed Petri net models of AMSs, a timed state space (TSS) composed of timed states is defined. TSS-based breadth-first search and A∗ algorithms are developed, through which the optimal solutions for small-scale problems can be obtained. Then, in order to effectively solve the scheduling problems of AMSs with different scales, TSS is condensed, and HHS is designed to search the condensed state space (CSS). In HHS, a duplicate detection policy is proposed for ensuring that only one transition path is reserved for each state in CSS. A pruning policy is proposed for pruning unpromising states to achieve the goal of searching a small part of CSS only, and three different cost estimation functions are developed for evaluating states. A hybrid search strategy is defined to achieve high search efficiency and find better solutions. The integration of the proposed duplicate detection policy, pruning policy, and hybrid search strategy ensures the high optimization performance and computational efficiency of HHS. Experimental results on benchmark AMS instances demonstrate the superiority of the proposed algorithm over the existing ones. The applicability of HHS in solving different industrial problems and manufacturing scheduling problems is also verified. Note to Practitioners - Automated manufacturing systems (AMSs) are computer-controlled manufacturing systems. They exhibit a high degree of resources sharing and route flexibility and can be highly adaptable to various production plans. Solving their scheduling problems is of great significance to manufacturers. When designing a scheduling algorithm for such systems, engineers face two challenges: how to deal with deadlocks caused by jobs competing for limited resources, and how to maintain high solution ability when solving large-scale problems. Existing algorithms for scheduling deadlock-prone AMSs have to rely on specific deadlock handling strategies to ensure their feasibility, and are unable to find high-quality solutions for large-scale problems. This article presents a hybrid heuristic search (HHS) algorithm for minimizing the makespan of deadlock-prone AMSs, in which a duplicate detection policy, a pruning policy, and a hybrid search strategy are specially designed. The combination of these policies ensure that HHS can find a high-quality solution in a short computation time, even if no deadlock handling strategy is used in the algorithm. Experimental tests and comparisons show that HHS significantly outperforms existing algorithms. The proposed HHS can be applied to other AMS scheduling problems, and can be used as an online or real-time scheduling method due to its high computational efficiency
Maneuvering Target Tracking in Dense Clutter Based on Particle Filtering
No full textAbstractAn improved particle filtering (IPF) is presented to perform maneuvering target tracking in dense clutter. The proposed filter uses several efficient variance reduction methods to combat particle degeneracy, low mode prior probabilities and measurement-origin uncertainty. Within the framework of a hybrid state estimation, each particle samples a discrete mode from its posterior distribution and the continuous state variables are approximated by a multivariate Gaussian mixture that is updated by an unscented Kalman filtering (UKF). The uncertainty of measurement origin is solved by Monte Carlo probabilistic data association method where the distribution of interest is approximated by particle filtering and UKF. Correct data association and precise behavior mode detection are successfully achieved by the proposed method in the environment with heavy clutter and very low mode prior probability. The performance of the proposed filter is examined and compared by Monte Carlo simulation over typical target scenario for various clutter densities. The simulation results show the effectiveness of the proposed filter
Chenghai hua xu zhi dai ci "yi" de yu fa fen xi.
No full text文章討論了潮汕澄海話虛指的第三人稱"伊"的語法特點并進行澄海話、普通話和粤語蒙受結構的對比分析。第一部分描寫了澄海話三種虛指代詞"伊"的相關結構──"乞伊"結構、"佮伊"結構和"V伊R"結構的語法特點。"乞伊"結構和"佮伊"結構各可分為A、B兩類，兩種結構內部分別在動詞的選擇、"伊"的所指和"乞/佮"的隱現上表現出不同。兩種結構之間的主要差別則在於主語的題元角色及"乞/佮"的句法位置高低上。"V伊R"結構是"佮伊"結構的一種條件變體，主要用於表達祈使等語氣。文章第二部分分析了澄海話三種蒙受結構的生成機制。并進一步概括出"伊"的種類:從所指對象題元角色的角度可以分為兩類，一是施事或致事、二是蒙事；從所指對象位置的角度也可以分為兩類，一是所指在句中，二是所指在句外。以及"伊"的句法位置：一是，位於"中間層次"；二是，緊鄰輕動詞。文章第三部分嘗試以澄海話蒙受結構的分析方法為角度和基礎，分別分析普通話蒙受結構"V他O"和粤語蒙受結構"VR佢"。通過三種方言蒙受結構的對比分析，我們看到三種方言類型上的不同，也驗證了劉丹青（2001）、鄧思穎（2006）的分析：澄海閩南話是"最弱的SVO"，動詞傾向於留在原地；粤語是"最強的SVO"，動詞傾向於長距離移位；普通話是"溫和的SVO"，動詞移位但距離不長。This thesis discusses the syntax of the Chinese non-referential pronoun 伊 yi ‘it’ in Chenghai Southern Min in three different affective constructions: keyi 乞伊 construction, kaiyi 佮伊 construction and V伊R construction. After examining the syntactic and semantic properties of these three yi affective constructions, we figure out that firstly there are two types of keyi 乞伊 construction and two types kaiyi 佮伊 construction. Secondly keyi 乞伊 construction differs from kaiyi 佮伊 construction in theta-roles of the subject and the position of yi. Thirdly V伊R construction is a conditioned variant of keyi 乞伊 construction. The following part we explore the hierarchical order of these three yi affective constructions, and we employ high and middle applicatives to capture their syntactic and semantic idiosyncrasies. In this part yi is classified into two ways according to the property of the object it refers to. For example, in keyi 乞伊 construction, yi always refers to a causer or a agent, and in kaiyi 佮伊 construction, yi refers to an affectee. In both constructions, yi is situated in a middle position which close to light verbs. The last part of this paper compare the affective constructions of Chenghai Southern Min with affective constructions of Mandarin and Cantonese. The main differences among these three dialects match with the claim proposed by Liu(2001) and Tang(2006): Chenghai Southern Min is the weakest SVO construction in which verbs prefer to stay in situ; Cantonese is the strongest SVO construction in which verbs prefer to take long-distance movement; Mandarin is the moderate SVO construction in which verbs will move but won’t move far.Detailed summary in vernacular field only.Detailed summary in vernacular field only.Detailed summary in vernacular field only.金佳.Thesis (M.Phil.) Chinese University of Hong Kong, 2014.Includes bibliographical references (leaves 87-93).Abstracts in English and Chinese.Jin Jia
- …
