Time allocated to mathematics in post-primary schools in Ireland: are we in double trouble?

Mathematics educators and legislators worldwide have begun placing a greater emphasis on teaching mathematics for understanding and through the use of real-life applications. Revised curricula have led to the time allocated to mathematics in effected countries being scrutinised. This has resulted in policy-makers and educationalists worldwide calling for the inclusion of double class periods on the mathematics timetable. Research from the United States suggests that the introduction of double or block periods allow for the objectives of revised curricula to be realized. The aim of this study, which is set in the school context, is first to ascertain if schools in Ireland are scheduling double periods for mathematics at both lower post-primary level (Junior Cycle) and upper post-primary level (Senior Cycle). It also seeks to determine if there is a link between teachers’ levels of satisfaction with the time allocated to mathematics and the provision of double periods and to get insights from teachers in relation to their opinions on what can be achieved through the introduction of such classes. Questionnaires were sent to 400 post-primary schools (approximately 1600 teachers) which were selected using stratified sampling techniques. It was found that 8.7% of mathematics teachers reported the provision of double periods at Junior Cycle while 55% reported that double periods were included on their timetable at Senior Cycle. The study also identified a link between teachers’ levels of satisfaction with the time allocated to mathematics and the provision of double periods. Finally, teachers felt that double periods allowed for new teaching methodologies, which were promoted by the revised curricula, to be implemented and teaching for understanding was also more feasible. In essence, it was found that double periods have an influence on the mathematical experience of post-primary students as well as the teaching approaches employed.     

Application of deuterated THENA for assigning the absolute configuration of chiral secondary alcohols

The structure of a constrained bicyclic chiral derivatizing agent (CDA), 1,2,3,4-tetrahydro-1,4-epoxynaphthalene-1-carboxylic acid, THENA 1, was modified by replacing both exo-methylene protons with deuterium atoms. The modified CDA, THENA-d₂2, could be used to assign the absolute configuration of chiral secondary alcohols with good reliability. Compared with THENA, the multiplicity of the methylene proton signals in the ¹H NMR spectra of THENA-d₂ derivatives is less complicated and the new CDA thus offers simpler NMR spectra for data interpretation.     

区域集群下板材订单配置模型及算法研究

针对集群企业板材资源滞留、无法共享、加工旺季材料短缺等问题,依据区域板材特性和区域企业集群地理相关优势,建立以减少需求方板材订单采购费用最小化为目标的板材订单分配模型,采用以粒子群、免疫算法相结合的混合调度算法。计算过程中,将订单分配对应企业编号作为免疫系统的抗体基因,通过比较适应度函数解与订单预算成本的关系,将抗体群区分为支配解与非支配解,提高算法对抗原的免疫能力和最优解的选择概率。最后以板材订单分配实例进行试验仿真,分别采用PSO算法与IA-PSO算法进行试验对比,对平台上6家订单发布企业寻找合适地理位置相近和价格相对低廉的供应商。试验结果表明,IA-PSO算法能够有效地解决区域集群内板材订单的匹配问题,并且在寻找价格更低和位置更合适的供应商上更有优势。     

Capital allocation for portfolios with non-linear risk aggregation

Existing risk capital allocation methods, such as the Euler rule, work under the explicit assumption that portfolios are formed as linear combinations of random loss/profit variables, with the firm being able to choose the portfolio weights. This assumption is unrealistic in an insurance context, where arbitrary scaling of risks is generally not possible. Here, we model risks as being partially generated by Lévy processes, capturing the non-linear aggregation of risk. The model leads to non-homogeneous fuzzy games, for which the Euler rule is not applicable. For such games, we seek capital allocations that are in the core, that is, do not provide incentives for splitting portfolios. We show that the Euler rule of an auxiliary linearised fuzzy game (non-uniquely) satisfies the core property and, thus, provides a plausible and easily implemented capital allocation. In contrast, the Aumann–Shapley allocation does not generally belong to the core. For the non-homogeneous fuzzy games studied, Tasche’s (1999) criterion of suitability for performance measurement is adapted and it is shown that the proposed allocation method gives appropriate signals for improving the portfolio underwriting profit.     

How Fast Is the Bandit?

Abstract

In this article we investigate the rate of convergence of the so-called two-armed bandit algorithm. The behavior of the algorithm turns out to be highly non standard: no central limit theorem, possible occurrence of two different rates of convergence with positive probability.     

Spectrum efficient power allocation schemes for OFDM cognitive radio with statistical interference constraints

In this paper, we study the power allocation problem for an orthogonal frequency division multiplexing (OFDM)-based cognitive radio (CR) system. In a departure from the conventional power allocation schemes available in the literature for OFDM-based CR, we propose power allocation schemes that are augmented with spectral shaping. Active interference cancellation (AIC) is an effective spectral shaping technique for OFDM-based systems. Therefore, in particular, we propose AIC-based optimal and suboptimal power allocation schemes that aim to maximize the downlink transmission capacity of an OFDM-based CR system operating opportunistically within the licensed primary users (PUs) radio spectrum in an overlay approach. Since the CR transmitter may not have the perfect knowledge about the instantaneous channel quality between itself and the active PUs, the interference constraints imposed by each of the PUs are met in a statistical sense. We also study an optimal power allocation scheme that is augmented with raised cosine (RC) windowing-based spectral shaping. For a given power budget at the CR transmitter and the prescribed statistical interference constraints by the PUs, we demonstrate that although the on-the-run computational complexity of the proposed AIC-based optimal power allocation scheme is relatively higher, it may yield better transmission rate for the CR user compared to the RC windowing-based power allocation scheme. Further, the AIC-based suboptimal scheme has the least on-the-run computational complexity, and still may deliver performance that is comparable to that of the RC windowing-based power allocation scheme. The presented simulation results also show that both the AIC-based as well as the RC windowing-based power allocation schemes lead to significantly higher transmission rates for the CR user compared to the conventional (without any spectral shaping) optimal power allocation scheme.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

A possible human counterpart of the principle of increasing entropy

It is well-known that the principle of increasing entropy holds for isolated natural systems that contain non-adaptive molecules. Here we present, for the first time, an experimental evidence for a possible human counterpart of the principle in an isolated social system that involves adaptive humans. Our work shows that the human counterpart is valid even though interactions among humans in social systems are distinctly different from those among molecules in natural systems. Thus, it becomes possible to understand social systems from this natural principle, at least to some extent.     

Sequential resource allocation with constraints: Two-customer case

We study a two-customer sequential resource allocation problem with equity constraint, which is reflected by a max–min objective. For finite discrete demand distribution, we give a sufficient and necessary condition under which the optimal solution has monotonicity property. However, this property never holds with unbounded discrete distribution.