An analysis for more equitable revenue and expenditure allocations within Lingnan College

From the triennial 1995-98, the funds allocated from University Grants Committee to universities have decreased. In order to use the limited resources effectively, and to manage their revenue and costs efficiently, universities have to set up a better budgeting system. Therefore, the eight universities in Hong Kong are proposing the Revenue Center Management (RCM) instead of the current budgeting system. The purposes of this project focuses on the analyses of the current budgeting system adopted at Lingnan College, and the proposed RCM budgeting system

Steering between Bloch oscillation and dipole oscillation in parabolic optical waveguide arrays

We study the optical oscillations of supermodes in planar optical waveguide arrays with parabolically graded propagation constant in individual waveguide interacting through nearest neighbor couplings. In these arrays, we have identified a transition between a symmetric dipole oscillation (DO) and a symmetry-breaking Bloch oscillation (BO) under appropriate conditions. There exist obvious correspondences between gradon localization and various optical oscillations. By virtue of an analogue between the oscillation of optical system and that of a plane pendulum, we propose a shift of the graded profile to cause a transition from BO to DO. We confirm the optical transition by means of Hamiltonian optics, as well as by the field evolution of the supermodes. The results offer great potential applications in optical switching, which can be applied to design suitable optical devices.Comment: Submitted to JOSA B for publication

Refusing Treatment Prior to Becoming Incapacitated: Supported Decision-making as an Approach in Advance Directives

This document is the Accepted Manuscript version of a Published Work that appeared in final form in European Journal of Health Law, after peer review and technical editing by the publisher. Under embargo until 19 February 2019. To access the final edited and published work see: https://doi.org/10.1163/15718093-12460332.Advance directives (ADs) provide people with the opportunity to express their wishes about treatment preferences prior to becoming incapacitated. While the normative logic behind ADs remain straightforward, as instruments of law they are not always effective because of questions about their validity and applicability. It is on this basis that this article attempts to resolve the legal intricacies on ADs refusing treatment prior to becoming incapacitated. The author advances a thesis in support of a modification of an approach known as supported decision-making to facilitate people in making ADs. This approach pre-empts most of the doubts about an AD’s validity. The argument is founded on the presumption that an AD made using the supported decision-making approach provides a higher degree of assurance about the circumstances surrounding the making of ADs, rendering it more likely to be binding on healthcare professionals.Peer reviewe

Telescoper: de novo assembly of highly repetitive regions.

MotivationWith advances in sequencing technology, it has become faster and cheaper to obtain short-read data from which to assemble genomes. Although there has been considerable progress in the field of genome assembly, producing high-quality de novo assemblies from short-reads remains challenging, primarily because of the complex repeat structures found in the genomes of most higher organisms. The telomeric regions of many genomes are particularly difficult to assemble, though much could be gained from the study of these regions, as their evolution has not been fully characterized and they have been linked to aging.ResultsIn this article, we tackle the problem of assembling highly repetitive regions by developing a novel algorithm that iteratively extends long paths through a series of read-overlap graphs and evaluates them based on a statistical framework. Our algorithm, Telescoper, uses short- and long-insert libraries in an integrated way throughout the assembly process. Results on real and simulated data demonstrate that our approach can effectively resolve much of the complex repeat structures found in the telomeres of yeast genomes, especially when longer long-insert libraries are used.AvailabilityTelescoper is publicly available for download at sourceforge.net/p/[email protected] informationSupplementary data are available at Bioinformatics online

Minimal Flavor Violation with Axion-like Particles

We revisit the flavor-changing processes involving an axion-like particle (ALP) in the context of generic ALP effective lagrangian with a discussion of possible UV completions providing the origin of the relevant bare ALP couplings. We focus on the minimal scenario that ALP has flavor-conserving couplings at tree level, and the leading flavor-changing couplings arise from the loops involving the Yukawa couplings of the Standard Model fermions. We note that such radiatively generated flavor-changing ALP couplings can be easily suppressed in field theoretic ALP models with sensible UV completion. We discuss also the implication of our result for string theoretic ALP originating from higher-dimensional $p$-form gauge fields, for instance for ALP in large volume string compactification scenario.Comment: 41 pages, 3 figures; v3: a discussion on general extended Higgs sector added in sec. 2, version published in JHE

Two-Locus Likelihoods under Variable Population Size and Fine-Scale Recombination Rate Estimation

Two-locus sampling probabilities have played a central role in devising an efficient composite likelihood method for estimating fine-scale recombination rates. Due to mathematical and computational challenges, these sampling probabilities are typically computed under the unrealistic assumption of a constant population size, and simulation studies have shown that resulting recombination rate estimates can be severely biased in certain cases of historical population size changes. To alleviate this problem, we develop here new methods to compute the sampling probability for variable population size functions that are piecewise constant. Our main theoretical result, implemented in a new software package called LDpop, is a novel formula for the sampling probability that can be evaluated by numerically exponentiating a large but sparse matrix. This formula can handle moderate sample sizes ($n \leq 50$) and demographic size histories with a large number of epochs ($\mathcal{D} \geq 64$). In addition, LDpop implements an approximate formula for the sampling probability that is reasonably accurate and scales to hundreds in sample size ($n \geq 256$). Finally, LDpop includes an importance sampler for the posterior distribution of two-locus genealogies, based on a new result for the optimal proposal distribution in the variable-size setting. Using our methods, we study how a sharp population bottleneck followed by rapid growth affects the correlation between partially linked sites. Then, through an extensive simulation study, we show that accounting for population size changes under such a demographic model leads to substantial improvements in fine-scale recombination rate estimation. LDpop is freely available for download at https://github.com/popgenmethods/ldpopComment: 32 pages, 13 figure

Generalized Hybrid Evolutionary Algorithm Framework with a Mutation Operator Requiring no Adaptation

This paper presents a generalized hybrid evolutionary optimization structure that not only combines both nondeterministic and deterministic algorithms on their individual merits and distinct advantages, but also offers behaviors of the three originating classes of evolutionary algorithms (EAs). In addition, a robust mutation operator is developed in place of the necessity of mutation adaptation, based on the mutation properties of binary-coded individuals in a genetic algorithm. The behaviour of this mutation operator is examined in full and its performance is compared with adaptive mutations. The results show that the new mutation operator outperforms adaptive mutation operators while reducing complications of extra adaptive parameters in an EA representation

Stray Example Sheltering by Loss Regularized SVM and k NN Preprocessor

[[abstract]]This paper presents a new model developed by merging a non-parametric k-nearest-neighbor (kNN) preprocessor into an underlying support vector machine (SVM) to provide shelters for meaningful training examples, especially for stray examples scattered around their counterpart examples with different class labels. Motivated by the method of adding heavier penalty to the stray example to attain a stricter loss function for optimization, the model acts to shelter stray examples. The model consists of a filtering kNN emphasizer stage and a classical classification stage. First, the filtering kNN emphasizer stage was employed to collect information from the training examples and to produce arbitrary weights for stray examples. Then, an underlying SVM with parameterized real-valued class labels was employed to carry those weights, representing various emphasized levels of the examples, in the classification. The emphasized weights given as heavier penalties changed the regularization in the quadratic programming of the SVM, and brought the resultant decision function into a higher training accuracy. The novel idea of real-valued class labels for conveying the emphasized weights provides an effective way to pursue the solution of the classification inspired by the additional information. The adoption of the kNN preprocessor as a filtering stage is effective since it is independent of SVM in the classification stage. Due to its property of estimating density locally, the kNN method has the advantage of distinguishing stray examples from regular examples by merely considering their circumstances in the input space. In this paper, detailed experimental results and a simulated application are given to address the corresponding properties. The results show that the model is promising in terms of its original expectations.[[booktype]]紙本[[booktype]]電子