37,212 research outputs found
sj-docx-1-pac-10.1177_18344909231167533 - Supplemental material for Growth mindset predicts teachers’ life satisfaction when they are challenged to innovate their teaching
No full textSupplemental material, sj-docx-1-pac-10.1177_18344909231167533 for Growth mindset predicts teachers’ life satisfaction when they are challenged to innovate their teaching by Sau-Lai Lee, Hiu-Sze Chan, Yuk-Yue Tong and Chi-Yue Chiu in Journal of Pacific Rim Psychology</p
sj-docx-1-pac-10.1177_18344909231166106 - Supplemental material for Personal qualities are malleable <i>and</i> fixed: Ambivalent mindset, capability ranking reinforcement, and parent–child relationship among Hong Kong Chinese parents
No full textSupplemental material, sj-docx-1-pac-10.1177_18344909231166106 for Personal qualities are malleable and fixed: Ambivalent mindset, capability ranking reinforcement, and parent–child relationship among Hong Kong Chinese parents by Chi-Yue Chiu, Yuk-Yue Tong, Sau-Lai Lee and Hiu-Sze Chan in Journal of Pacific Rim Psychology</p
High Dimensional Consistent Digital Segments
No full textWe consider the problem of digitalizing Euclidean line segments from R^d to Z^d. Christ {et al.} (DCG, 2012) showed how to construct a set of {consistent digital segments} (CDS) for d=2: a collection of segments connecting any two points in Z^2 that satisfies the natural extension of the Euclidean axioms to Z^d. In this paper we study the construction of CDSs in higher dimensions.
We show that any total order can be used to create a set of {consistent digital rays} CDR in Z^d (a set of rays emanating from a fixed point p that satisfies the extension of the Euclidean axioms). We fully characterize for which total orders the construction holds and study their Hausdorff distance, which in particular positively answers the question posed by Christ {et al.}
Wave forces on large offshore structures using boundary element methods
No full textSIGLELD/D47899/82 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Use of expert system in consumer lending in Hong Kong.
Full text linkby Chiu Kwok-yuan, Edward & Man Kin-wah, Andy.Thesis (M.B.A.)--Chinese University of Hong Kong, 1988.Bibliography: leaves 107-108
Clustered layer solutions for singularly perturbed problems with general non-autonomous nonlinearities.
Full text linkChiu Ho Man Edward.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.Includes bibliographical references (leaves 36-39).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.4Chapter 2 --- Some Preliminary Analysis --- p.11Chapter 3 --- An Auxiliary Linear problem --- p.16Chapter 4 --- Construction of natural constraint --- p.22Chapter 5 --- Energy computation for reduced energy functional --- p.26Chapter 6 --- Proof of Theorem 1.1 --- p.29Bibliography --- p.3
sj-docx-1-pac-10.1177_18344909231166964 - Supplemental material for Improving the predictor-criterion consistency of mindset measures: Application of the correspondence principle
No full textSupplemental material, sj-docx-1-pac-10.1177_18344909231166964 for Improving the predictor-criterion consistency of mindset measures: Application of the correspondence principle by Hiu-Sze Chan, Chi-Yue Chiu, Sau-Lai Lee and
Yuk-Yue Tong, Iris Tsz-Ching Leung, Angel Hiu-Tung Chan in Journal of Pacific Rim Psychology</p
A Generalization of Self-Improving Algorithms
Full text linkAilon et al. [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances x₁,⋯,x_n follow some unknown product distribution. That is, x_i comes from a fixed unknown distribution _i, and the x_i’s are drawn independently. After spending O(n^{1+ε}) time in a learning phase, the subsequent expected running time is O((n+ H)/ε), where H ∈ {H_S,H_DT}, and H_S and H_DT are the entropies of the distributions of the sorting and DT output, respectively. In this paper, we allow dependence among the x_i’s under the group product distribution. There is a hidden partition of [1,n] into groups; the x_i’s in the k-th group are fixed unknown functions of the same hidden variable u_k; and the u_k’s are drawn from an unknown product distribution. We describe self-improving algorithms for sorting and DT under this model when the functions that map u_k to x_i’s are well-behaved. After an O(poly(n))-time training phase, we achieve O(n + H_S) and O(nα(n) + H_DT) expected running times for sorting and DT, respectively, where α(⋅) is the inverse Ackermann function
Computational Complexity of the α-Ham-Sandwich Problem
Full text linkThe classic Ham-Sandwich theorem states that for any d measurable sets in ℝ^d, there is a hyperplane that bisects them simultaneously. An extension by Bárány, Hubard, and Jerónimo [DCG 2008] states that if the sets are convex and well-separated, then for any given α₁, … , α_d ∈ [0, 1], there is a unique oriented hyperplane that cuts off a respective fraction α₁, … , α_d from each set. Steiger and Zhao [DCG 2010] proved a discrete analogue of this theorem, which we call the α-Ham-Sandwich theorem. They gave an algorithm to find the hyperplane in time O(n (log n)^{d-3}), where n is the total number of input points. The computational complexity of this search problem in high dimensions is open, quite unlike the complexity of the Ham-Sandwich problem, which is now known to be PPA-complete (Filos-Ratsikas and Goldberg [STOC 2019]).
Recently, Fearnley, Gordon, Mehta, and Savani [ICALP 2019] introduced a new sub-class of CLS (Continuous Local Search) called Unique End-of-Potential Line (UEOPL). This class captures problems in CLS that have unique solutions. We show that for the α-Ham-Sandwich theorem, the search problem of finding the dividing hyperplane lies in UEOPL. This gives the first non-trivial containment of the problem in a complexity class and places it in the company of classic search problems such as finding the fixed point of a contraction map, the unique sink orientation problem and the P-matrix linear complementarity problem
- …
