情景感知驱动的移动对象多模式轨迹预测技术综述

如何利用多源异构时空数据进行准确的轨迹预测并且反映移动对象的移动特性是轨迹预测领域的核心问题.现有的大多数轨迹预测方法是长序列轨迹模式预测模型,根据历史轨迹的特点进行预测,或将当前移动对象的轨迹位置放入时空语义场景根据历史移动对象轨迹预测位置.综述当前常用的轨迹预测模型和算法,涉及不同的研究领域.首先,阐述了多模式轨迹预测的主流工作,轨迹预测的基本模型类;其次,对不同类的预测模型进行总结,包括数学统计类、机器学习类、滤波算法,以及上述领域具有代表性的算法;再次,对情景感知技术进行了介绍,描述了不同领域的学者对情景感知的定义,阐述了情景感知技术所包含的关键技术点,诸如情景感知计算、情景获取和情景推理的不同类模型,分析了情景感知的不同分类、过滤、存储和融合以及它们的实现方法等.详细介绍了情景感知驱动的轨迹预测模型技术路线及各阶段任务的工作原理.给出了情景感知技术在真实场景中的应用,包括位置推荐,兴趣点推荐等,通过与传统算法对比,分析情景感知技术在此类应用中的优劣.详细介绍了情景感知结合LSTM (long short-term memory)技术应用于行人轨迹预测领域的新方法.最后,总结了...     

Generation and interpretation of parsimonious predictive models for load forecasting in smart heating networks

Applied Intelligence - Forecasting future heat load in smart district heating networks is a key problem for utility companies that need such predictions for optimizing their operational activities....     

Recommendation of RILEM Technical Committee 250-CSM: Test method for Textile Reinforced Mortar to substrate bond characterization

Textile Reinforced Mortar (TRM), also known as Fabric Reinforced Mortar or Fabric Reinforced Cementitious Matrix, composites are an emerging technology for the external repair and strengthening of existing structures. For most applications, the effectiveness of the TRM reinforcement relies on its bond performance. This recommendation identifies the best practice to characterize the bond behaviour of TRM. A shear bond test method is proposed to determine the peak axial stress (associated with the maximum load that can be transferred from the structural member to the externally bonded TRM reinforcement), the stress–slip relationship and the failure mode that controls the TRM-to-substrate load transfer capacity. Guidelines on specimen manufacturing, experimental setup, test execution, and determination of test results are provided.     

Undivided and Indistinguishable Histories in Branching-Time Logics

In the tree-like representation of Time, two histories are undivided at a moment t whenever they share a common moment in the future of t. In the present paper, it will first be proved that Ockhamist and Peircean branching-time logics are unable to express some important sentences in which the notion of undividedness is involved. Then, a new semantics for branching-time logic will be presented. The new semantics is based on trees endowed with an indistinguishability function, a generalization of the notion of undividedness. It will be shown that Ockhamist and Peircean semantics can be viewed as limit cases of the semantics developed in this paper.     

Proteomics in chronic kidney disease: The issues clinical nephrologists need an answer for

A growing number of patients are recognised to have chronic kidney disease (CKD). However, only a minority will progress to end-stage renal disease requiring dialysis or transplantation. Currently available diagnostic and staging tools frequently fail to identify those at higher risk of progression or death. Furthermore within specific disease entities there are shortcomings in the prediction of the need for therapeutic interventions or the response to different forms of therapy. Kidney and urine proteomic biomarkers are considered as promising diagnostic tools to predict CKD progression early in diabetic nephropathy, facilitating timely and selective intervention that may reduce the related health-care expenditures. However, independent groups have not validated these findings and the technique is not currently available for routine clinical care. Furthermore, there are gaps in our understanding of predictors of progression or need for therapy in non-diabetic CKD. Presumably, a combination of tissue and urine biomarkers will be more informative than individual markers. This review identifies clinical questions in need of an answer, summarises current information on proteomic biomarkers and CKD, and describes the European Kidney and Urine Proteomics initiative that has been launched to carry out a clinical study aimed at identifying urinary proteomic biomarkers distinguishing between fast and slow progressors among patients with biopsy-proven primary glomerulopathies.     

On the 2-tuples based genetic tuning performance for fuzzy rule based classification systems in imbalanced data-sets

When performing a classification task, we may find some data-sets with a different class distribution among their patterns. This problem is known as classification with imbalanced data-sets and it appears in many real application areas. For this reason, it has recently become a relevant topic in the area of Machine Learning.The aim of this work is to improve the behaviour of fuzzy rule based classification systems (FRBCSs) in the framework of imbalanced data-sets by means of a tuning step. Specifically, we adapt the 2-tuples based genetic tuning approach to classification problems showing the good synergy between this method and some FRBCSs.Our empirical results show that the 2-tuples based genetic tuning increases the performance of FRBCSs in all types of imbalanced data. Furthermore, when the initial Rule Base, built by a fuzzy rule learning methodology, obtains a good behaviour in terms of accuracy, we achieve a higher improvement in performance for the whole model when applying the genetic 2-tuples post-processing step. This enhancement is also obtained in the case of cooperation with a preprocessing stage, proving the necessity of rebalancing the training set before the learning phase when dealing with imbalanced data.     

Shortcut fusion rules for the derivation of circular and higher-order programs

Functional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established.     

Addressing data complexity for imbalanced data sets: analysis of SMOTE-based oversampling and evolutionary undersampling

In the classification framework there are problems in which the number of examples per class is not equitably distributed, formerly known as imbalanced data sets. This situation is a handicap when trying to identify the minority classes, as the learning algorithms are not usually adapted to such characteristics. An usual approach to deal with the problem of imbalanced data sets is the use of a preprocessing step. In this paper we analyze the usefulness of the data complexity measures in order to evaluate the behavior of undersampling and oversampling methods. Two classical learning methods, C4.5 and PART, are considered over a wide range of imbalanced data sets built from real data. Specifically, oversampling techniques and an evolutionary undersampling one have been selected for the study. We extract behavior patterns from the results in the data complexity space defined by the measures, coding them as intervals. Then, we derive rules from the intervals that describe both good or bad behaviors of C4.5 and PART for the different preprocessing approaches, thus obtaining a complete characterization of the data sets and the differences between the oversampling and undersampling results.     

A non-intrusive estimation for high-quality Internet TV services

This paper presents a non-intrusive estimator for Internet TV services based on streaming technology. Analyzing the video packets received by the client application, the estimator is capable of selecting the most suitable encoding bitrate for the available bandwidth in the end-to-end path. The estimator has been integrated in a real client/server architecture and evaluated with different network traffic situations. The results of the performed evaluation have revealed the stability and adaptation speed as the best qualities of our proposal.