11,171 research outputs found
[[alternative]]Study on genetic structure of Sibataniozephyrus kuafui Hsu & Lin and phylogenetic relationship among Sibataniozephyrus species
No full text[[abstract]]Sibataniozephyrus kuafui was a recently described lycaenid butterfly ( Hsu & Lin，1994 )，which utilites Fagus hayatae as the sole larval host. The first aim of the research is to investigate the population structure of this rare butterfly in Taiwan.
The second issue to be explored here is the possibility of presence of coevolutionary pattern as Sibataniozephyrus is the only lycaenid genus that is specialized on the beech trees, with each described species use a different beech species as its larval host.
A seguence of 405 bp of COI gene was analyzed to investigate the genetic differentiations of S. kuafui. It turned out the population at Tongshan, Ilan is well differentiated from that of the N. Chatienshan (Fst=0.51),with the former possessing one unique haplotype and the latter two. After studying a sequence of 1068 bp of COI, tRNA and COII gene, it was found that S. kuafui shares a synapomorphy with S. fujisanus by a deletion of an amino acid code AAT in compared with the Sibataniozephyrus taxa in the Asiatic mainland. The phylogenetic pattern derived from the research did not support the coevolution model between Sibataniozephyrus lycaenids and their hosts. Alternatively, the data suggests after gaining the ability of using beech as larval host, Sibataniozephyrus horizontally shifted larval host usage, and speciated by the other evolutionary causes, independent of the diversification of the beeches.
Political Challenges and Democratic Institutions: International and Taiwan’s Perspectives
No full textCharacteristic Investigation of 2D Photonic Crystals with Full Material Anisotropy under Out-of-Plane Propagation and Liquid-Crystal-Filled Photonic-Band-Gap-Fiber Applications Using Finite Element Methods
No full textEvaluation of antifungal properties of octyl gallate and its synergy with cinnamaldehyde
No full textXinjiang (China), folk dancing of Uyghurs
No full textFolk-dance of UighursImage is part of research conducted by Chang Chih-Yi for the article: Land Utilization and Settlement Possibilities in Sinkiang
Author(s): Chang Chih-Yi
Source: Geographical Review, Vol. 39, No. 1 (Jan., 1949), pp. 57-75
Published by: American Geographical Society
Stable URL: http://www.jstor.org/stable/211157http://www.jstor.org/stable/211157Grayscal
Piezoresistive response induced by piezoelectric charges in n-type GaAs mesa resistors for application in stress transducers
No full textEarthquake Swarm Recorded by an Ocean Bottom Seismic Array in Southwest Offshore of Taiwan in October, 2005
No full textFIGURES 33–36 in Descriptions of two new notodontid species from the relic Fagus forests in northeastern Taiwan (Lepidoptera, Notodontidae)
No full textFIGURES 33–36. Life photos of Syntypistis and Pheosiopsis species. 33, 35. S. taipingshanensis Wu & Hsu sp. n.; 34, 36. P. seni Wu & Hsu sp. n.; 33. Male; 34. Female; 35, 36. Final instar larva on Fagus hayatae. Photo by Shipher Wu (33, 34); Chia- Lung Huang (35, 36).Published as part of Wu, Shipher, Chang, Wei-Chun, Wang, Li-Hao, Huang, Chia-Lung & Hsu, Yu Feng, 2016, Descriptions of two new notodontid species from the relic Fagus forests in northeastern Taiwan (Lepidoptera, Notodontidae), pp. 291-300 in Zootaxa 4066 (3) on page 300, DOI: 10.11646/zootaxa.4066.3.5, http://zenodo.org/record/25848
Piezo-resistive Response Induced by Piezo-electric charge in n-type GaAs Mesa Resistor for Application in Stress Transducer
No full textInterconnection networks for parallel and distributed computing
No full textParallel computers are generally either shared-memory machines or distributed- memory machines. There are currently technological limitations on shared-memory architectures and so parallel computers utilizing a large number of processors tend tube distributed-memory machines. We are concerned solely with distributed-memory multiprocessors. In such machines, the dominant factor inhibiting faster global computations is inter-processor communication. Communication is dependent upon the topology of the interconnection network, the routing mechanism, the flow control policy, and the method of switching. We are concerned with issues relating to the topology of the interconnection network. The choice of how we connect processors in a distributed-memory multiprocessor is a fundamental design decision. There are numerous, often conflicting, considerations to bear in mind. However, there does not exist an interconnection network that is optimal on all counts and trade-offs have to be made. A multitude of interconnection networks have been proposed with each of these networks having some good (topological) properties and some not so good. Existing noteworthy networks include trees, fat-trees, meshes, cube-connected cycles, butterflies, Möbius cubes, hypercubes, augmented cubes, k-ary n-cubes, twisted cubes, n-star graphs, (n, k)-star graphs, alternating group graphs, de Bruijn networks, and bubble-sort graphs, to name but a few. We will mainly focus on k-ary n-cubes and (n, k)-star graphs in this thesis. Meanwhile, we propose a new interconnection network called augmented k-ary n- cubes. The following results are given in the thesis.1. Let k ≥ 4 be even and let n ≥ 2. Consider a faulty k-ary n-cube Q(^k_n) in which the number of node faults f(_n) and the number of link faults f(_e) are such that f(_n) + f(_e) ≤ 2n - 2. We prove that given any two healthy nodes s and e of Q(^k_n), there is a path from s to e of length at least k(^n) - 2f(_n) - 1 (resp. k(^n) - 2f(_n) - 2) if the nodes s and e have different (resp. the same) parities (the parity of a node Q(^k_n) in is the sum modulo 2 of the elements in the n-tuple over 0, 1, ∙∙∙ , k - 1 representing the node). Our result is optimal in the sense that there are pairs of nodes and fault configurations for which these bounds cannot be improved, and it answers questions recently posed by Yang, Tan and Hsu, and by Fu. Furthermore, we extend known results, obtained by Kim and Park, for the case when n = 2.2. We give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q(^k_n) is bi-panconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Q(^k_n) is m-panconnected, for m = (^n(k - 1) + 2k - 6’ / ‘_2), and (k -1) pancyclic (these bounds are optimal). We introduce a path-shortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Q(^k_n) even in the presence of a faulty processor.3. We define an interconnection network AQ(^k_n) which we call the augmented k-ary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube Q(^k_n) has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n-cube Q(^k_n) - is a Cayley graph (and so is vertex-symmetric); has connectivity 4n - 2, and is such that we can build a set of 4n - 2 mutually disjoint paths joining any two distinct vertices so that the path of maximal length has length at most max{{n- l)k- (n-2), k + 7}; has diameter [(^k) / (_3)] + [(^k - 1) /( _3)], when n = 2; and has diameter at most (^k) / (_4) (n+ 1), for n ≥ 3 and k even, and at most [(^k)/ (_4) (n + 1) + (^n) / (_4), for n ^, for n ≥ 3 and k odd.4. We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph S(_n,k) where all nodes are distinct, builds a collection of n - 1 node-disjoint paths, one from each target node to the source. The collection of paths output from the algorithm is such that each path has length at most 6k - 7, and the algorithm has time complexity O(k(^3)n(^4))
- …
