A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Ins...A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Instead of the physical network hierarchy or the independent management hierarchy, the nodes are organized into a logically hieraxchical cluster according to the multimedia block they caches in the midderware layer. The process of a member joining/leaving or the structure adjustment cooperatively implemented by all members is concerned with decentralized maintenance of the logical cluster hierarchy. As the root of each logically hierarchical cluster is randomly mapped into the system, the logical structure of a multimedia block is dynamically expanded across some regions by the two replication policies in different load state respectively. The local load diversion is applied to fine-tune the load of nodes within a local region but belongs to different logical hierarchies. Guaranteed by the dynamic expansion of a logical structure and the load diversion of a local region, the users always select a closest idle node from the logical hierarchy under the condition of topology integration with resource management.展开更多
A new incremental clustering framework is presented, the basis of which is the induction as inverted deduction. Induction is inherently risky because it is not truth-preserving. If the clustering is considered as an i...A new incremental clustering framework is presented, the basis of which is the induction as inverted deduction. Induction is inherently risky because it is not truth-preserving. If the clustering is considered as an induction process, the key to build a valid clustering is to minimize the risk of clustering. From the viewpoint of modal logic, the clustering can be described as Kripke frames and Kripke models which are reflexive and symmetric. Based on the theory of modal logic, its properties can be described by system B in syntax. Thus, the risk of clustering can be calculated by the deduction relation of system B and proximity induction theorem described. Since the new proposed framework imposes no additional restrictive conditions of clustering algorithm, it is therefore a universal framework. An incremental clustering algorithm can be easily constructed by this framework from any given nonincremental clustering algorithm. The experiments show that the lower the a priori risk is, the more effective this framework is. It can be demonstrated that this framework is generally valid.展开更多
We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interactionwith non-uniform coupling constants.A time-dependent magnetic field is applied to control the time evolution of...We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interactionwith non-uniform coupling constants.A time-dependent magnetic field is applied to control the time evolution of thecluster.It is well known that for an odd number of sites a spin cluster qubit can be defined in terms of the ground statedoublet.The universal one-qubit logic gate can be constructed from the time evolution operator of the non-autonomousmany-body system,and the six basic one-qubit gates can be realized by adjusting the applied time-dependent magneticfield.展开更多
The recent growth of communication and sensor technology results in the enlargement of a new attractive and challenging area-wireless sensor networks (WSNs). A network comprising of several minute wireless sensor node...The recent growth of communication and sensor technology results in the enlargement of a new attractive and challenging area-wireless sensor networks (WSNs). A network comprising of several minute wireless sensor nodes which are organized in a dense manner is called as a Wireless Sensor Network (WSN). Every node estimates the state of its surroundings in this network. The estimated results are then converted into the signal form in order to determine the features related to this technique after the processing of the signals. It’s high computational environment with limited and controlled broadcast range, processing, as well as limited energy. The embedded soft computing approach in wireless sensor networks is suggested. This approach means a grouping of embedded fuzzy logic and neural networks models for information processing in complex environment with unsure, rough, fuzzy measuring data. It is generalization of soft computing concept for the embedded, distributed, adaptive systems.展开更多
随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先...随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先,采用FM进行特征组合,产生两类组合特征;其次,将一类特征组合作为聚类算法的输入进行聚类;最后,将另一类特征组合输入由聚类产生的分段GBDT+逻辑回归组合的模型中进行预测。在两个公开数据集中进行了多角度验证,结果表明与其他几类常用的点击预测算法相比,LRCS在点击预测上有一定的性能提升。展开更多
文摘A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Instead of the physical network hierarchy or the independent management hierarchy, the nodes are organized into a logically hieraxchical cluster according to the multimedia block they caches in the midderware layer. The process of a member joining/leaving or the structure adjustment cooperatively implemented by all members is concerned with decentralized maintenance of the logical cluster hierarchy. As the root of each logically hierarchical cluster is randomly mapped into the system, the logical structure of a multimedia block is dynamically expanded across some regions by the two replication policies in different load state respectively. The local load diversion is applied to fine-tune the load of nodes within a local region but belongs to different logical hierarchies. Guaranteed by the dynamic expansion of a logical structure and the load diversion of a local region, the users always select a closest idle node from the logical hierarchy under the condition of topology integration with resource management.
基金supported by the National High-Tech Research and Development Program of China(2006AA12A106).
文摘A new incremental clustering framework is presented, the basis of which is the induction as inverted deduction. Induction is inherently risky because it is not truth-preserving. If the clustering is considered as an induction process, the key to build a valid clustering is to minimize the risk of clustering. From the viewpoint of modal logic, the clustering can be described as Kripke frames and Kripke models which are reflexive and symmetric. Based on the theory of modal logic, its properties can be described by system B in syntax. Thus, the risk of clustering can be calculated by the deduction relation of system B and proximity induction theorem described. Since the new proposed framework imposes no additional restrictive conditions of clustering algorithm, it is therefore a universal framework. An incremental clustering algorithm can be easily constructed by this framework from any given nonincremental clustering algorithm. The experiments show that the lower the a priori risk is, the more effective this framework is. It can be demonstrated that this framework is generally valid.
文摘We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interactionwith non-uniform coupling constants.A time-dependent magnetic field is applied to control the time evolution of thecluster.It is well known that for an odd number of sites a spin cluster qubit can be defined in terms of the ground statedoublet.The universal one-qubit logic gate can be constructed from the time evolution operator of the non-autonomousmany-body system,and the six basic one-qubit gates can be realized by adjusting the applied time-dependent magneticfield.
文摘The recent growth of communication and sensor technology results in the enlargement of a new attractive and challenging area-wireless sensor networks (WSNs). A network comprising of several minute wireless sensor nodes which are organized in a dense manner is called as a Wireless Sensor Network (WSN). Every node estimates the state of its surroundings in this network. The estimated results are then converted into the signal form in order to determine the features related to this technique after the processing of the signals. It’s high computational environment with limited and controlled broadcast range, processing, as well as limited energy. The embedded soft computing approach in wireless sensor networks is suggested. This approach means a grouping of embedded fuzzy logic and neural networks models for information processing in complex environment with unsure, rough, fuzzy measuring data. It is generalization of soft computing concept for the embedded, distributed, adaptive systems.
文摘随着互联网和广告平台的飞速发展,面对海量的广告信息,为了提升用户点击率,提出一种改进的基于组合结构的逻辑回归点击预测算法LRCS(Logical Regression of Combination Structure)。该算法基于不同类别特征广告受众可能不同的特点,首先,采用FM进行特征组合,产生两类组合特征;其次,将一类特征组合作为聚类算法的输入进行聚类;最后,将另一类特征组合输入由聚类产生的分段GBDT+逻辑回归组合的模型中进行预测。在两个公开数据集中进行了多角度验证,结果表明与其他几类常用的点击预测算法相比,LRCS在点击预测上有一定的性能提升。
