This paper proposes an adaptive multi-class support vector machine for simultaneous microarray classification and gene selection. By evaluating the gene ranking significance, the adaptive multi-class support vector ma...
详细信息
This paper proposes an adaptive multi-class support vector machine for simultaneous microarray classification and gene selection. By evaluating the gene ranking significance, the adaptive multi-class support vector machine is shown to encourage an adaptive grouping effect in the process of building classifiers, thus leading a sparse multi-classifiers with enhanced interpretability. Based on a reasonable correlation between the two regularization parameters, an efficient solution path algorithm is developed for solving the proposed support vector machine. Experiments performed on the leukaemia data set are provided to verify the obtained results.
In some soft real-time systems, real-time data or data streams are held in relational databases as history data. In that case, many challenges will stem from relational model, such as layout of timestamp, efficiency, ...
详细信息
In some soft real-time systems, real-time data or data streams are held in relational databases as history data. In that case, many challenges will stem from relational model, such as layout of timestamp, efficiency, etc. This paper investigates a novel soft real-time data model-Clock Model. With the novel model, real-time data can be expressed in a more reasonable approach. The efficiency of accessing data can also be improved.
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this...
详细信息
Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR （Scoped Bellman-Ford Routing）, for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed Bellman- Ford method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good sealability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scalability but also its practicality and simplicity.
In the field of ray-tracing based photo-realistic rendering, kd-tree is used as an important acceleration structure. This paper focuses on the effective construction of kd-tree, and proposes a novel and fast construct...
详细信息
In the field of ray-tracing based photo-realistic rendering, kd-tree is used as an important acceleration structure. This paper focuses on the effective construction of kd-tree, and proposes a novel and fast construction method which is based on the binning algorithm. The method is composed of two main steps. Firstly, by analyzing the SAH cost function, the method determines the most-likely sub-span which holds the splitting plane. Secondly, sub-sampling is used on the resulted span to get much better approximation to the optimal splitting plane. Moreover, the paper discusses the exiting schemes on binning termination condition, points out their problems, and proposes a more reasonable termination condition. The experimental results show that the novel approach is effective. Compared with the previous works, it decreases the construction overhead, improves the quality of generated kd-tree, and the construction procedure is more robust as well.
Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent syst...
详细信息
Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent systems are developed). In this paper, we propose the use of a guasi-classical temporal logic (QCTL) for supporting the verification of temporal properties of such systems even where the consistent model is not available. Our models are paraKripke structures (extended standard Kripke structures), in which both a formula and its negation are satisfied in a same state, and properties to be verified are expressed by QCTL with paraKripke structures semantics. We introduce a novel notion of paraKripke models, which grasps the paraconsistent character of the entailment relation of QCTL. Furthermore, we explore the methodology of model checking over QCTL, and describe the detailed algorithm of implementing QCTL model checker. In the sequel, a simple example is presented, showing how to exploit the proposed model checking technique to verify the temporal properties of inconsistent concurrent systems.
作者：
GUYuZHAOBaohuaDepartment of Computer Science
University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China
In this paper, we focus on the target tracking problem in sensor networks and propose an Powersaving target localization scheme (PSTL) based on a conjecture model that reflects the moving pattern of a target, and also...
详细信息
In this paper, we focus on the target tracking problem in sensor networks and propose an Powersaving target localization scheme (PSTL) based on a conjecture model that reflects the moving pattern of a target, and also a corresponding two-step communication protocol between Base station (BS) and sensors. BS executes a query mechanism to determine which sensors should be used for detailed information according to a limited amount of data received from sensors. This scheme reduces both energy consumption and communication bandwidth requirement, prolongs the lifetime of the wireless sensor networks. Simulation results indicate that it can achieve a high accuracy while saving a large amount of energy.
Security situational awareness has become a hot topic in the area of network security research in recent years, which attracts the interest of more and more domestic and foreign researchers. The existing security situ...
详细信息
Security situational awareness has become a hot topic in the area of network security research in recent years, which attracts the interest of more and more domestic and foreign researchers. The existing security situational awareness methods are analyzed and compared in detail. Considering the characteristics of multi-source information in network security research, a new network security situational awareness model based on information fusion is proposed. This model fuses multi-source information from a mass of logs by introducing the modified D-S evidence theory, gets the values of nodes security situational awareness by situational factors fusion using attacks threat and vulnerability information which network nodes have and successful attacks depend on, computes the value of network security situational awareness by nodes situation fusion using service information of the network nodes, and draws the security-situation-graph of network. Then, it analyzes the time series of the computing results by ARMA model to forecast the future threat in network security. Finally an example of actual network datasets is given to validate the network security situational awareness model and algorithm. The results show that this model and algorithm is more effective and accurate than the existing security situational awareness methods.
作者：
HUTianZHAOBaohuaDepartment of Computer Science
University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China
This paper focuses on the problem of constructing the minimum-energy broadcast trees in all-wireless networks. We proposed a greedy algorithm called Greedy maximum-branch replacement algorithm (GMBR) to decrease the t...
详细信息
This paper focuses on the problem of constructing the minimum-energy broadcast trees in all-wireless networks. We proposed a greedy algorithm called Greedy maximum-branch replacement algorithm (GMBR) to decrease the total power of the broadcast tree further. This algorithm can be developed to a distributed one easily. Compared with the previous algorithms, GMBR was proved to have better performance, especially when the propagation loss exponent and the network size become larger.
The hardware and software architectures of core service platforms for next-generation networks were analyzed to compute the minimum cost hardware configuration of a core service platform. This method gives a closed fo...
详细信息
The hardware and software architectures of core service platforms for next-generation networks were analyzed to compute the minimum cost hardware configuration of a core service platform. This method gives a closed form expression for the optimized hardware cost configuration based on the service requirements, the processing features of the computers running the core service platform software, and the processing capabilities of the common object request broker architecture middleware. Three simulation scenarios were used to evaluate the model. The input includes the number of servers for the protocol mapping （PM）, Parlay gateway （PG）, application sever （AS）, and communication handling （CH） functions. The simulation results show that the mean delay meets requirements. When the number of servers for PM, PG, AS, and CH functions were not properly selected, the mean delay was excessive. Simulation results show that the model is valid and can be used to optimize investments in core service platforms.
Quadratic Bézier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic Bézier curve may fail to fit arbit...
详细信息
Quadratic Bézier curves are important geometric entities in many applications. However, it was often ignored by the literature the fact that a single segment of a quadratic Bézier curve may fail to fit arbitrary endpoint unit tangent vectors. The purpose of this paper is to provide a solution to this problem, i.e., constructing G1 quadratic Bézier curves satisfying given endpoint (positions and arbitrary unit tangent vectors) conditions. Examples are given to illustrate the new solution and to perform comparison between the G1 quadratic Bézier cures and other curve schemes such as the composite geometric Hermite curves and the biarcs.
暂无评论