18928608
An Improved Particle Swarm Optimizer for Truss Structure Optimization
This paper presents an improved particle swarm optimizer (IPSO) for solving truss structure optimization problems. The algorithm is based on the particle swarm optimizer with passive congregation (PSOPC) and a harmony search (HS) scheme. It handles the problem-specified constraints using a 'fly-back mechanism' method and the variables' constraints using the harmony search scheme. The IPSO is tested on a planar truss structure optimization problem and is compared with the PSO and the PSOPC algorithm respectively. The result shows that the IPSO method presented in this paper is able to accelerate the convergence rate effectively and has the fastest convergence rate among these three other algorithms
9882029
The Group Search Optimizer and its Application on Truss Structure Design
This paper introduces a novel optimization algorithm, group search optimization (GSO) algorithm and its implementation method is presented in detail. The GSO is used to investigate the planar and space truss structures with continuous variables and is tested by two truss optimization problems. The optimization results are compared with that of the particle swarm optimization (PSO) algorithm, the particle swarm optimization with passive congregation (PSOPC) and the heuristic particle swarm optimizer (HPSO) algorithm. Results from the two tested cases illustrate the ability of the GSO algorithm to find the optimal results, which are better than that of the PSO and PSOPC, while are at the same level of that of HPSO optimization method. Meanwhile, the results also show that the GSO algorithm maintains a preferable convergence accuracy among these four algorithms.
14281509
A Quick Group Search Optimizer with Passive Congregation and its Convergence Analysis
This paper presents a quick group search optimizer with passive congregation (QGSOPC) for optimum design of pin connected structure. The algorithm is based on the quick group search optimizer (QGSO). The QGSOPC algorithm is verified and compared with the HPSO, GSO and QGSO algorithm used for the designs of two planar and spatial truss structures. The results show that the QGSOPC algorithm not only has preferable convergence rate and accuracy, but also it has the best stability of convergence rate and accuracy. It is desired for QGSOPC to be used more effectively for practical structural optimal design problems.
13252008
Anode-ALM: An Aggregation-Based Application Level Multicast for Media Streaming
Building application level multicast (ALM) for media streaming, we had better keep the invariability of source to-end delay (S2EDelay) of any node on the tree, so as to avoid delay jitter problem. In this paper, we proposed an aggregation-based ALM architecture, which aggregates the unstable nodes within a local area into a relative stable aggregation node Anode, and then builds tree by Anodes. Anode shields node’s dynamicity inside and behaves as a stable one outside. To build the architecture, we first proposed an Anode structure by n-dimension anti-cube, and proposed a distributed algorithm to bind the logic view and physical view of an Anode dynamically by the differentiation and assimilation operations, which maintain the integrality of the logic view while the physical view changes dynamically. Experiment results indicate that our algorithm can keep theS2EDelay invariability of the built ALM tree effectively.
16996391
WIP: Web Service Initiation Protocol for Multimedia and Voice Communication over IP
In this paper, we present WIP - Web service initiation protocol for multimedia and voice communication over IP. WIP is an entirely Web service based communication protocol, consisting of a set of Web service operations for initiating and establishing converged (e.g. multimedia, IM, voice, etc.) communication services over IP. It inherits the principle of separation signaling and media transmission of SIP (session initiation protocol); but it relies on a single Web service stack to provide a full featured communication signaling protocol. WIP opens a new paradigm of Web service based VoIP communication, which is extensible and can be easily integrated in end-to-end SOA solutions. The generic Web service approach used in WIP overcomes many limitations which would be otherwise difficult to achieve in non-Web service based communication methods used today. WIP is based on two-way, full duplex Web service interaction. The communication signaling establishment in WIP is through Web service interactions, and the media negotiation in WIP is modeled as a special Web service "event" subscription, which is fully extensible for various media needs. The signaling messages of WIP are encoded in the standard based SOAP message envelops which can be carried by multiple transport protocols, including HTTP. WIP supports both P2P (peer-to-peer) and B2B (back-to-back) broker mode communication services. A prototype research system has been implemented, and the results indicate that WIP, as a full Web service based communication protocol, is both feasible and advantageous
45720537
Bayesian Network Structure Ensemble Learning
Bayesian networks (BNs) have been widely used for learning model structures of a domain in the area of data mining and knowledge discovery. This paper incorporates ensemble learning into BN structure learning algorithms and presents a novel ensemble BN structure learning approach. Based on the Markov condition and the faithfulness condition of BN structure learning, our ensemble approach proposes a novel sample decomposition technique and a components integration technique. The experimental results reveal that our ensemble BN structure learning approach can achieve an improved result compared with individual BN structure learning approach in terms of accuracy.
22925595
A Novel Chase Based Multiuser Detector for MIMO-CDMA Systems
This paper proposes a new chase based multiuser detection scheme for MIMO-CDMA systems. The proposed approach provides performance gain by concentrating on improving the detection accuracy of the weakest symbol. Compared to the layered space-time multiuser detector (LAST-MUD), the proposed scheme can achieve substantial performance improvement, especially, when the number of transmit antennas is equal to the number of receive antennas. The comparison between our scheme and another chase based scheme, the B-Chase detector, which was originally proposed for improving the performance of the vertical Bell Laboratories layered space-time (V-BLAST) system, is also presented. The problem existing in the B-Chase detector is the criterion for selecting the weakest symbol. In our scheme, a more reasonable selection criterion is proposed. We show that the proposed scheme has less complexity than the B-Chase detector but with the tendency of achieving better performance at high SNR.
29468800
SceBoost Learning Algorithm for Feature Selection
This paper proposes an improved boost learning algorithm, the SceBoost algorithm, and its application in developing fast and robust features for citrus canker detection by machine vision. The algorithm use symmetric cross entropy to eliminate redundancy among selected features using AdaBoost algorithm. Selected features are subjected to recognize citrus canker symptoms on given pictures of citrus foliage. Compared with related feature selection algorithm our method can get improvements in classification accuracy and significantly reduce computation time when reach the same requirements.