نتایج جستجو برای: phan
تعداد نتایج: 451 فیلتر نتایج به سال:
For n ≥ 2 let ∆ be a Dynkin diagram of rank n and let I = {1, . . . , n} be the set of labels of ∆. A group G admits a weak Phan system of type ∆ over C if G is generated by subgroups Ui, i ∈ I , which are central quotients of simply connected compact semisimple Lie groups of rank one, and contains subgroups Ui,j = 〈Ui, Uj〉, i 6= j ∈ I , which are central quotients of simply connected compact s...
The aim of this study was to determine the prevalence of anemia and evaluate the relationship of malaria and helminth infections on anemia status in Phan Tien village, a mountainous ethnic minority community in southern Vietnam. This longitudinal study was performed from April 1997 to 2000 by measuring the hemoglobin concentration of 2,767 people who participated in six annual surveys at the en...
This article is a (slightly) modified and shortened version of Grün and Hornik (2011), published in the Journal of Statistical Software. Topic models allow the probabilistic modeling of term frequency occurrences in documents. The fitted model can be used to estimate the similarity between documents as well as between a set of specified keywords using an additional layer of latent variables whi...
This paper presents a first example of secure identity based encryption scheme (IBE) without redundancy in the sense of Phan and Pointcheval. This modification of the Boneh-Franklin IBE is an hybrid construction that is proved to be secure (using proof techniques borrowed from those for KEM-DEM constructions) in the random oracle model under a slightly stronger assumption than the original IBE ...
We propose a new approach to fault tolerance that we call bounded-time recovery (BTR). BTR is intended for systems that need strong timeliness guarantees during normal operation but can tolerate short outages in an emergency, e.g., when they are under attack. We argue that BTR could be a good fit for many cyber-physical systems. We also sketch a technical approach to providing BTR, and we discu...
Cross realm client-to-client password authenticated key exchange (C2C-PAKE) schemes are designed to enable two clients in different realms to agree on a common session key using different passwords. In 2006, Yin-Bao presented the first provably secure cross-realm C2C-PAKE, which security is proven rigorously within a formally defined security model and based on the hardness of some computationa...
This paper provides the first data on myriapods in Truong Sa archipelago (Vietnam). A total of 292 myriapod specimens identified 9 species 7 genera, 6 families, 5 orders two classes Chilopoda and Diplopoda were collected from 10 islands Spratly Khanh Hoa province Vietnam including Southwest Cay (Song Tu Tay), Sand (Son Ca), Namyit island (Nam Yet), Grierson Reef (Sinh Ton Dong), Sin Cowe Ton), ...
This work presents new semi-analytical solutions for the combined fully developed electro-osmotic pressure-driven flow in microchannels of viscoelastic fluids, described by generalised Phan-Thien–Tanner model (gPTT) recently proposed Ferrás et al. (Journal Non-Newtonian Fluid Mechanics, 269:88–99, 2019). version PTT a function trace stress tensor—the Mittag–Leffler function—where one or two fit...
One common point of debate in the study of emotion is whether the basic, irreducible elements of emotional life are discrete emotion categories, such as anger, fear, sadness, and so on, or dimensions such as approach and avoidance. Resolving this debate will identify the basic building blocks of emotional life that are the most appropriate targets of scientific inquiry. In this paper, we briefl...
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm (AAR). In the case of convex feasibility, firm nonexpansiveness of projection mappings is a global property that yields global convergence of MAP and for consi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید