Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.     

An automated patient monitoring using discrete‐time wireless sensor networks

In recent years, Internet of Things (IoT) devices are used for remote health monitoring. For remotely monitoring a patient, only the health information at different time points are not sufficient; predicted values of biomarkers (for some future time points) are also important. In this article, we propose a powerful statistical model for an efficient dynamic patient monitoring using wireless sensor nodes through Bayesian Learning (BL). We consider the setting where a set of correlated biomarkers are measured from a patient through wireless sensors, but the sensors only report the ordinal outcomes (say, good, fair, high, or very high) to the sink based on some prefixed thresholds. The challenge is to use the ordinal outcomes for monitoring and predicting the health status of the patient under consideration. We propose a linear mixed model where interbiomarker correlations and intrabiomarker dependence are modeled simultaneously. The estimated and the predicted values of the biomarkers are transferred over the internet so that health care providers and the family members of the patient can remotely monitor the patient. Extensive simulation studies are performed to assess practical usefulness of our proposed joint model, and the performance of the proposed joint model is compared to that of some other traditional models used in the literature.     

Elitist clonal selection algorithm for optimal choice of free knots in B-spline data fitting

Data fitting with B-splines is a challenging problem in reverse engineering for CAD/CAM, virtual reality, data visualization, and many other fields. It is well-known that the fitting improves greatly if knots are considered as free variables. This leads, however, to a very difficult multimodal and multivariate continuous nonlinear optimization problem, the so-called knot adjustment problem. In this context, the present paper introduces an adapted elitist clonal selection algorithm for automatic knot adjustment of B-spline curves. Given a set of noisy data points, our method determines the number and location of knots automatically in order to obtain an extremely accurate fitting of data. In addition, our method minimizes the number of parameters required for this task. Our approach performs very well and in a fully automatic way even for the cases of underlying functions requiring identical multiple knots, such as functions with discontinuities and cusps. To evaluate its performance, it has been applied to three challenging test functions, and results have been compared with those from other alternative methods based on AIS and genetic algorithms. Our experimental results show that our proposal outperforms previous approaches in terms of accuracy and flexibility. Some other issues such as the parameter tuning, the complexity of the algorithm, and the CPU runtime are also discussed.     

Controlling the slides: Does clicking help adults learn?

When utilizing screen media as an educational platform, maintaining control over one's experience may lead to more successful learning outcomes. In the current work, adults learned four new action sequences, each via a different slideshow type. The computer advanced slides automatically, but each version had a different pausing mechanism: (1) free pause (viewers could click the mouse at any point to pause the show), (2) subgoal pause (show paused after subgoals, viewer clicked to continue), (3) timed pause (show paused every 20 slides, viewer clicked to continue), and (4) no pause (no viewer interaction). Participants completed a written memory test, live performance test, cognitive load measures, and satisfaction measures. Results indicated that memory recall was significantly lower in the no pause version when compared to the versions with pause capability. Also, over half of participants reported that the no pause version was their least favorite format to learn from. Conversely, over half of participants selected the free pause as their favorite slideshow format, and participants reported that they felt most in control of the free pause version. These reports occurred in spite of only one-quarter of all participants actually using the click-to-pause feature in the free pause slideshow. Perhaps the mindset of being in control, rather than the pausing itself, increased likeability of the program. This research has implications for program design and education, pointing to flexible pacing features being helpful in enhancing users' enjoyment of the program and ability to extract novel information.     

Multiple Empirical Kernel Learning with Majority Projection for imbalanced problems

Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound.     

减少手术创伤始终是妇科肿瘤手术快速康复的决定性因素

减少手术创伤始终是快速康复的决定性因素,这一点在目前的加速康复外科研究尤其是复杂手术,如妇科肿瘤手术中尚未得到充分重视。尊重学习曲线、全面规划手术方案、总结失利经验、开展前瞻性研究是解决此问题的主要方案。本文着重讨论妇科肿瘤手术创伤对术后加速康复的影响及可能的改进措施。     

两阶段领域自适应学习

针对领域自适应问题中源域和目标域的联合分布差异最小化问题,提出两阶段领域自适应学习方法.在第一阶段考虑样本标签和数据结构的判别信息,通过学习一个共享投影变换,使投影后的共享空间中边缘分布的差异最小.第二阶段利用源域标记数据和目标域非标记数据学习一个带结构风险的自适应分类器,不仅能最小化源域和目标域条件分布差异,还能进一步保持源域和目标域边缘分布的流形一致性.在3个基准数据集上的实验表明,文中方法在平均分类准确率和Kappa系数两项评价指标上均表现较优.     

Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time

We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions.     

Deep Integration of Innovation and Entrepreneurship (InE) Education in Chinese University Classrooms

Recently, InE has been regarded as a popular education strategy in Chinese universities. However, problems have been exposed in the adoption of InE, for example, in InE courses and competitions. The purpose of this paper is to provide a possible solution to the problems, which is to organize effective InE courses by integrating InE with Inter-Course-level Problem-Based Learning (ICPBL). A detailed case is demonstrated by an ICPBL elective course design with deep integration of InE in the teaching, learning, and assessments. This paper contributes to a new curriculum design for promoting InE education in practically for Chinese universities.     

Models for solar radiation prediction based on different measurement sites

The modeling of solar radiation for forecasting its availability is a key tool for managing photovoltaic (PV) plants and, hence, is of primary importance for energy production in a smart grid scenario. However, the variability of the weather phenomena is an unavoidable obstacle in the prediction of the energy produced by the solar radiation conversion. The use of the data collected in the past can be useful to capture the daily and seasonal variability, while measurement of the recent past can be exploited to provide a short term prediction. It is well known that a good measurement of the solar radiation requires not only a high class radiometer, but also a correct management of the instrument. In order to reduce the cost related to the management of the monitoring apparatus, a solution could be to evaluate the PV plant performance using data collected by public weather station installed near the plant. In this paper, two experiments are conducted. In the first, the plausibility of the short term prediction of the solar radiation, based on data collected in the near past on the same site is investigated. In the second experiment, the same prediction is operated using data collected by a public weather station located at ten kilometers from the solar plant. Several prediction techniques belonging from both computational intelligence and statistical fields have been challenged in this task. In particular, Support Vector Machine for Regression, Extreme Learning Machine and Autoregressive models have been used and compared with the persistence and the k-NN predictors. The prediction accuracy achieved in the two experimental conditions are then compared and the results are discussed.