德国联邦法院于2016年3月针对斯洛伐克共和国与荷兰保险公司Achmea BV.之间的投资仲裁案件a请求欧洲联盟法院(Court of Justice of European Union,CJEU)作出先行裁决。CJEU于2018年3月6日公布裁决结果,指出荷兰--斯洛伐克双边投资协定(...德国联邦法院于2016年3月针对斯洛伐克共和国与荷兰保险公司Achmea BV.之间的投资仲裁案件a请求欧洲联盟法院(Court of Justice of European Union,CJEU)作出先行裁决。CJEU于2018年3月6日公布裁决结果,指出荷兰--斯洛伐克双边投资协定(BIT)及欧盟内部成员国间包含投资仲裁条款的BITs与欧盟法不相容。该案最终导致欧盟各成员国于2019年1月发表声明,将把2019年12月6日作为终止欧盟内部成员国之间所有BITs的最后期限。因此,成员国间投资争端将无法受多边投资仲裁庭的管辖,这无疑对双边投资保护协定促进ISDS(Investor-State Dispute Settlement)机制的良性发展带来挑战。欧盟法院的态度是否会影响中国与欧盟成员国已经签订的BITs,又是否会影响正在进行的中欧BIT谈判的争端解决机制,都是值得我们研究的问题。展开更多
The aim of this paper is to get the decomposition of distributional derivatives of functions with bounded variation in the framework of Carnot-Caratheodory spaces (C-C spaces in brievity) in which the vector fields ar...The aim of this paper is to get the decomposition of distributional derivatives of functions with bounded variation in the framework of Carnot-Caratheodory spaces (C-C spaces in brievity) in which the vector fields are of Carnot type. For this purpose the approximate continuity of BV functions is discussed first, then approximate differentials of L1 functions are defined in the case that vector fields are of Carnot type and finally the decomposition Xu = (?)u ·Ln + X2 u is proved, where u ∈ BVx(?) and (Ω)u denotes the approximate differential of u.展开更多
In order to suppress the multiple access interference (MAI) in 3G, which limits the capacity of a CDMA communication system, a fast relevance vector machine (FRVM) is employed in the multiuser detection (MUD) scheme. ...In order to suppress the multiple access interference (MAI) in 3G, which limits the capacity of a CDMA communication system, a fast relevance vector machine (FRVM) is employed in the multiuser detection (MUD) scheme. This method aims to overcome the shortcomings of many ordinary support vector machine (SVM) based MUD schemes, such as the long training time and the inaccuracy of the decision data, and enhance the performance of a CDMA communication system. Computer simulation results demonstrate that the proposed FRVM based multiuser detection has lower bit error rate, costs short training time, needs fewer kernel functions and possesses better near-far resistance.展开更多
Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curs...Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.展开更多
文摘德国联邦法院于2016年3月针对斯洛伐克共和国与荷兰保险公司Achmea BV.之间的投资仲裁案件a请求欧洲联盟法院(Court of Justice of European Union,CJEU)作出先行裁决。CJEU于2018年3月6日公布裁决结果,指出荷兰--斯洛伐克双边投资协定(BIT)及欧盟内部成员国间包含投资仲裁条款的BITs与欧盟法不相容。该案最终导致欧盟各成员国于2019年1月发表声明,将把2019年12月6日作为终止欧盟内部成员国之间所有BITs的最后期限。因此,成员国间投资争端将无法受多边投资仲裁庭的管辖,这无疑对双边投资保护协定促进ISDS(Investor-State Dispute Settlement)机制的良性发展带来挑战。欧盟法院的态度是否会影响中国与欧盟成员国已经签订的BITs,又是否会影响正在进行的中欧BIT谈判的争端解决机制,都是值得我们研究的问题。
文摘The aim of this paper is to get the decomposition of distributional derivatives of functions with bounded variation in the framework of Carnot-Caratheodory spaces (C-C spaces in brievity) in which the vector fields are of Carnot type. For this purpose the approximate continuity of BV functions is discussed first, then approximate differentials of L1 functions are defined in the case that vector fields are of Carnot type and finally the decomposition Xu = (?)u ·Ln + X2 u is proved, where u ∈ BVx(?) and (Ω)u denotes the approximate differential of u.
文摘In order to suppress the multiple access interference (MAI) in 3G, which limits the capacity of a CDMA communication system, a fast relevance vector machine (FRVM) is employed in the multiuser detection (MUD) scheme. This method aims to overcome the shortcomings of many ordinary support vector machine (SVM) based MUD schemes, such as the long training time and the inaccuracy of the decision data, and enhance the performance of a CDMA communication system. Computer simulation results demonstrate that the proposed FRVM based multiuser detection has lower bit error rate, costs short training time, needs fewer kernel functions and possesses better near-far resistance.
基金Project (No. [2005]555) supported by the Hi-Tech Research and De-velopment Program (863) of China
文摘Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.
