The problem of "life and death" has been a confusing proposition of philosophy since long ago,for which philosophers both at home and abroad take great pains to pursue the answer.The problem of"life and...The problem of "life and death" has been a confusing proposition of philosophy since long ago,for which philosophers both at home and abroad take great pains to pursue the answer.The problem of"life and death"is also attractive for litterateurs.This paper attempts to scrutinize the works of Franz Kafka and based on comments of different critics,simply analyzing the theory of survival and the theory of death and exploring the aesthetic value.Through analysis,the author of this paper concludes that the theory of survival in the works of Kafka tends to express hating of not being favored by chances and the fright and anxiety of the time;on the contrary,the theory of death in his works tends to express worship and belief.Both life and death are expressed vividly in his works,showing the brave pursuit of senior artistic forms of Kafka and the essence of its aesthetic value.展开更多
This paper investigates methods of value-at-risk (VaR) estimation using extreme value theory (EVT). It compares two different estimation methods, 'two-step subsample bootstrap' based on moment estimation and m...This paper investigates methods of value-at-risk (VaR) estimation using extreme value theory (EVT). It compares two different estimation methods, 'two-step subsample bootstrap' based on moment estimation and maximum likelihood estimation (MLE), according to their theoretical bases and computation procedures. Then, the estimation results are analyzed together with those of normal method and empirical method. The empirical research of foreign exchange data shows that the EVT methods have good characters in estimating VaR under extreme conditions and 'two-step subsample bootstrap' method is preferable to MLE.展开更多
A combination method of optimization of the back-ground value and optimization of the initial item is proposed. The sequences of the unbiased exponential distribution are simulated and predicted through the optimizati...A combination method of optimization of the back-ground value and optimization of the initial item is proposed. The sequences of the unbiased exponential distribution are simulated and predicted through the optimization of the background value in grey differential equations. The principle of the new information priority in the grey system theory and the rationality of the initial item in the original GM（1,1） model are ful y expressed through the improvement of the initial item in the proposed time response function. A numerical example is employed to il ustrate that the proposed method is able to simulate and predict sequences of raw data with the unbiased exponential distribution and has better simulation performance and prediction precision than the original GM（1,1） model relatively.展开更多
为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇...为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇类密度、簇类间距以及簇类强度,同时又考虑到数据样本的偶然性,对离群点进行合理分配,ACK-Means算法可实现自适应确定聚类中心C和类别K值。基于实际交通拥堵信息构建数据集,Python编程实现高速公路拥堵路段ACK-Means聚类,巧妙解决了高速公路拥堵路段聚类数目K和聚类中心C设定问题。聚类结果表明,ACK-Means算法实现高速公路拥堵路段无监督聚类,聚类结果完全基于实际的高速公路交通拥堵信息,具有更高的实用性。展开更多
The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of me...The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.展开更多
针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别...针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。展开更多
Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real proc...Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real processes, the available data set is usually obtained with missing values. To overcome the shortcomings of global modeling and missing data values, a new modeling method is proposed. Firstly, an incomplete data set with missing values is partitioned into several clusters by a K-means with soft constraints （KSC） algorithm, which incorporates soft constraints to enable clustering with missing values. Then a local model based on each group is developed by using SVR algorithm, which adopts a missing value insensitive （MVI） kernel to investigate the missing value estimation problem. For each local model, its valid area is gotten as well. Simulation results prove the effectiveness of the current local model and the estimation algorithm.展开更多
文摘The problem of "life and death" has been a confusing proposition of philosophy since long ago,for which philosophers both at home and abroad take great pains to pursue the answer.The problem of"life and death"is also attractive for litterateurs.This paper attempts to scrutinize the works of Franz Kafka and based on comments of different critics,simply analyzing the theory of survival and the theory of death and exploring the aesthetic value.Through analysis,the author of this paper concludes that the theory of survival in the works of Kafka tends to express hating of not being favored by chances and the fright and anxiety of the time;on the contrary,the theory of death in his works tends to express worship and belief.Both life and death are expressed vividly in his works,showing the brave pursuit of senior artistic forms of Kafka and the essence of its aesthetic value.
基金the National Natural Science Foundation of China (No. 79970041).
文摘This paper investigates methods of value-at-risk (VaR) estimation using extreme value theory (EVT). It compares two different estimation methods, 'two-step subsample bootstrap' based on moment estimation and maximum likelihood estimation (MLE), according to their theoretical bases and computation procedures. Then, the estimation results are analyzed together with those of normal method and empirical method. The empirical research of foreign exchange data shows that the EVT methods have good characters in estimating VaR under extreme conditions and 'two-step subsample bootstrap' method is preferable to MLE.
基金supported by the Key Project of National Social Science Foundation(12AZD111)the National Project for Education Science Planning(EFA110351)+2 种基金the Humanities and Social Science Foundation of Ministry of Education of China(12YJCZH207)the Key Project for Jiangsu Province Social Science Foundation(12DDA011)the Jiangsu College of Humanities and Social Sciences outside Campus Research Base:Chinese Development of Strategic Research Base for Internet of Things
文摘A combination method of optimization of the back-ground value and optimization of the initial item is proposed. The sequences of the unbiased exponential distribution are simulated and predicted through the optimization of the background value in grey differential equations. The principle of the new information priority in the grey system theory and the rationality of the initial item in the original GM（1,1） model are ful y expressed through the improvement of the initial item in the proposed time response function. A numerical example is employed to il ustrate that the proposed method is able to simulate and predict sequences of raw data with the unbiased exponential distribution and has better simulation performance and prediction precision than the original GM（1,1） model relatively.
文摘为了充分利用实际高速公路路段交通拥堵信息,更合理地聚类交通拥堵的内在规律和特征变化,提出自适应确定聚类中心C和类别K值(adaptive center and K-means value,ACK-Means)的聚类算法,进行高速公路拥堵路段聚类。ACK-Means算法借助簇类密度、簇类间距以及簇类强度,同时又考虑到数据样本的偶然性,对离群点进行合理分配,ACK-Means算法可实现自适应确定聚类中心C和类别K值。基于实际交通拥堵信息构建数据集,Python编程实现高速公路拥堵路段ACK-Means聚类,巧妙解决了高速公路拥堵路段聚类数目K和聚类中心C设定问题。聚类结果表明,ACK-Means算法实现高速公路拥堵路段无监督聚类,聚类结果完全基于实际的高速公路交通拥堵信息,具有更高的实用性。
基金the National Natural Science Foundation of China (50275113).
文摘The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.
文摘针对通信中软扩频信号伪码序列盲估计困难的问题,提出一种奇异值分解(singular value decomposition,SVD)和K-means聚类相结合的方法。该方法先对接收信号按照一倍伪码周期进行不重叠分段构造数据矩阵。其次对数据矩阵和相似性矩阵分别进行SVD完成对伪码序列集合规模数的估计、数据降噪、粗分类以及初始聚类中心的选取。最后通过K-means算法优化分类结果,得到伪码序列的估计值。该算法在聚类之前事先确定聚类数目,大大减少了迭代次数。同时实验结果表明,该算法在信息码元分组小于5 bit,信噪比大于-10 dB时可以准确估计出软扩频信号的伪码序列,性能较同类算法有所提升。
基金supported by Key Discipline Construction Program of Beijing Municipal Commission of Education (XK10008043)
文摘Most real application processes belong to a complex nonlinear system with incomplete information. It is difficult to estimate a model by assuming that the data set is governed by a global model. Moreover, in real processes, the available data set is usually obtained with missing values. To overcome the shortcomings of global modeling and missing data values, a new modeling method is proposed. Firstly, an incomplete data set with missing values is partitioned into several clusters by a K-means with soft constraints （KSC） algorithm, which incorporates soft constraints to enable clustering with missing values. Then a local model based on each group is developed by using SVR algorithm, which adopts a missing value insensitive （MVI） kernel to investigate the missing value estimation problem. For each local model, its valid area is gotten as well. Simulation results prove the effectiveness of the current local model and the estimation algorithm.
