Optimal design of skeletal structures via the charged system search algorithm

A new meta-heuristic optimization algorithm is presented for design of skeletal structures. The algorithm is inspired by the Coulomb and Gauss’s laws of electrostatics in physics, and it is called charged system search (CSS). CSS utilizes a number of charged particle (CP) which affects each other based on their fitness values and separation distances considering the governing laws of Coulomb and Gauss from electrical physics and the governing laws of motion from the Newtonian mechanics. Some truss and frame structures are optimized with the CSS algorithm. Comparison of the results of the CSS with those of other meta-heuristic algorithms shows the robustness of the new algorithm.     

Optimal design of large-scale frames with an advanced charged system search algorithm using box-shaped sections

In the present article, an advanced charged system search (ACSS) algorithm is designed for optimizing the large-scale frame structures using box-shaped sections for columns. The proposed ACSS is an extended version of the charged system search (CSS) which is a metaheuristic algorithm that uses the electrostatics and Newtonian laws of mechanics under the conditions of the Coulomb law. Two large-scale 3D frames with 1026 and 1935 components are optimized using AISC-LRFD to show the efficiency of using the box-shaped sections. Overall performance of the ACSS algorithm with box-shaped sections is compared to those of the upper bound strategy for integrated versions of the standard Big Bang Big Church algorithm and two of its newly developed variants. The results show the successful performance of using steel box-shaped columns in comparison to the frames with I-shaped sections. The numerical results show that the ACSS is efficient and robust compared to its standard version.

     

An anti-collision algorithm for localization of multiple chirp-spread-spectrum nodes

This paper develops an anti-collision algorithm for localization of multiple chirp-spread-spectrum (CSS) tag nodes. The CSS is a physical layer defined in IEEE 802.15.4a, and can be used for ranging between two CSS nodes. This ranging operation involves measuring the time-of-flight of the chirp-modulated signal. If anchor CSS nodes are installed at the known positions, a tag CSS node can calculate its coordinate based on the distances between these nodes. When there are multiple tag nodes, however, the tag nodes can fail to calculate their locations because their ranging signals collide with each other. Although the CSMA/CA is adopted for the medium access control protocol of IEEE 802.15.4a, it is not suitable for localization because a tag node must measure at least three successive distances for two-dimensional localization. The proposed algorithm uses a back-off time to prevent collisions, and all tag nodes compete to acquire the authority to use a channel. The proposed algorithm uses two special packets to synchronize the tag nodes for localization. For a theoretical evaluation of the proposed algorithm, the probability of the channel occupation of each tag node is analyzed. Through experiments, the performance of the anti-collision algorithm is verified.     

基于带电粒子搜索的无人潜航器航路规划方法

针对无人潜航器（UUV）在复杂环境、多约束条件下航路规划过程耗时长、占用空间大等问题,提出了基于带电粒子搜索（CSS）的航路规划方法。首先,建立UUV航路规划问题模型,设计代价函数;然后,给出了基于CSS的航路规划方法,带电粒子在搜索空间中会受到其他带电粒子电场力的作用进而迭代寻优;另外,提出了一种非线性调整速度与加速度参数的方法,通过该方法有效地平衡全局搜索与局部搜索过程,避免算法的早熟收敛。最后,通过对比实验从规划航路的质量和算法耗时两个角度将所提方法与A^*算法、蚁群算法、粒子群航路规划方法进行对比。实验结果表明该方法在保证规划出的航路质量的同时,具有更快的收敛速度、更低的时间复杂度。     

改进的曲率尺度空间角点检测

在曲率尺度空间（CSS）角点检测中,通常采用高斯滤波对图像进行去噪处理。但该方法很大程度上降低了角点检测的准确性和精确性,因此,提出了利用双边滤波来改进的CSS角点检测算法,可以在很好去噪的同时又保证角点检测的高精度。实验结果也充分验证了该算法较其他算法具有的高效性和准确性。     

基于曲率尺度空间的VOP形状编码算法

首先对曲率尺度空间（CSS）算法进行改进，并用改进的CSS算法对任意形状物体的形状信息进行特征点的分层提取；其次，用自适应算术编码算法对固定长度的八分圆编码算法进行改进，并对所提取的特征点进行算术编码，实验结果表明，这种新的基于特征点提取的形状编码方法比MPEG-4校验模型中基于上下文的算术形状编码算法，在Dn相同的条件下，主观质量更好，且压缩比更高。     

2D affine-invariant contour matching using B-spline model

This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the non-uniqueness of B-Spline in curve matching. This method first smoothes the B-Spline curve by increasing the degree of the curve. It is followed by a reduction of the curve degree using the Least Square Error (LSE) approach to construct the Curvature Scale Space (CSS) image. CSS matching is then carried out. Our method combines the advantages of B-Spline that are continuous curve representation and the robustness of CSS matching with respect to noise and affine transformation. It avoids the need for other matching algorithms that have to use the re-sampled points on the curve. Thus, the curve matching error is reduced. The proposed algorithm has been tested by matching similar shapes from a prototype database. The experimental results showed the robustness and accuracy of the proposed method in B-Spline curve matching.     

一种新的故障树定性分析方法

提出基于割序集的分析方法以研究故障树顶事件发生时基本事件的动态行为。利用顺序失效符表示事件的顺序失效关系,并将静态门和动态门转化为顺序失效表达式来描述故障树中各种门的动态行为,利用顺序失效表达式构建故障树的割序集。结合实例阐述故障树割序集生成算法的流程。该算法将失效行为表示为长度小于系统中部件个数的有序部件序列,为研究故障树提供了一种新的定性分析方法。     

Silhouette-based isolated object recognition through curvaturescale space

A complete, fast and practical isolated object recognition system has been developed which is very robust with respect to scale, position and orientation changes of the objects as well as noise and local deformations of shape (due to perspective projection, segmentation errors and non-rigid material used in some objects). The system has been tested on a wide variety of three-dimensional objects with different shapes and material and surface properties. A light-box setup is used to obtain silhouette images which are segmented to obtain the physical boundaries of the objects which are classified as either convex or concave. Convex curves are recognized using their four high-scale curvature extrema points. Curvature scale space (CSS) representations are computed for concave curves. The CSS representation is a multi-scale organization of the natural, invariant features of a curve (curvature zero-crossings or extrema) and useful for very reliable recognition of the correct model since it places no constraints on the shape of objects. A three-stage, coarse-to-fine matching algorithm prunes the search space in stage one by applying the CSS aspect ratio test. The maxima of contours in CSS representations of the surviving models are used for fast CSS matching in stage two. Finally, stage three verifies the best match and resolves any ambiguities by determining the distance between the image and model curves. Transformation parameter optimization is then used to find the best fit of the input object to the correct model     

嵌入式浏览器中CSS技术的研究与实现

CSS技术为网页设计提供了更丰富、更美观的表现方式。首先简要分析了CSS技术的特点和在嵌入式浏览器中实现CSS技术所面临的问题,然后提出了一种在嵌入式系统中实现CSS技术的解决方案,最后论述了关键算法及关键数据结构的设计与实现。     

一种新的并行文化微粒群优化算法

为了避免微粒群优化算法在解决复杂优化问题时陷入局部最优,提高算法种群的多样性。将微粒群优化算法纳入文化算法框架,提出了一种新的基于文化算法框架的并行微粒群优化算法。在文化算法框架中,由微粒群组成的群体空间和信念空间各自独立并行演化,并相互影响,有效地提高了种群的多样性,降低了陷入局部极值的可能性。通过对不同测试函数的仿真实验表明,新提出的并行文化微粒群优化算法比标准微粒群优化算法更容易找到全局最优解,提高了微粒群优化算法的全局寻优能力。     

基于UIC556标准的列车通信网络UIC初运行算法的研究

鉴于UIC初运行所具有的特性及在动车通信网络中的重要作用,依据UIC556协议规范,详细地分析UIC初运行的算法和工作原理,以此为基础,首先利用CSS(Configuration Service Station)软件配置网关中对应车辆的静态属性、车辆类型,车辆支持的功能等重要信息并生成NSDB数据库,其次利用UIC Train Diagnostic Station软件将数据库下载到半实物仿真平台的网关中,查看CSS中UIC初运行情况。仿真结果表明实现了UIC初运行。     

An enhanced charged system search for configuration optimization using the concept of fields of forces

The concept of the “fields of forces” is utilized as a general model of meta-heuristic algorithms from physics. This model is capable of representing the properties of different meta-heuristics and in this paper, it is used to enhance the recently developed meta-heuristic, the Charged System Search (CSS). The enhanced CSS is then applied to determine the configuration optimum design of structures. Comparison of the results for some examples, illustrates the efficiency of the enhanced CSS algorithm.     

Scale-Space Behavior of Planar-Curve Corners

The curvature scale-space (CSS) technique is suitable for extracting curvature features from objects with noisy boundaries. To detect corner points in a multiscale framework, Rattarangsi and Chin investigated the scale-space behavior of planar-curve corners. Unfortunately, their investigation was based on an incorrect assumption, viz., that planar curves have no shrinkage under evolution. In the present paper, this mistake is corrected. First, it is demonstrated that a planar curve may shrink nonuniformly as it evolves across increasing scales. Then, by taking into account the shrinkage effect of evolved curves, the CSS trajectory maps of various corner models are investigated and their properties are summarized. The scale-space trajectory of a corner may either persist, vanish, merge with a neighboring trajectory, or split into several trajectories. The scale-space trajectories of adjacent corners may attract each other when the corners have the same concavity, or repel each other when the corners have opposite concavities. Finally, we present a standard curvature measure for computing the CSS maps of digital curves, with which it is shown that planar-curve corners have consistent scale-space behavior in the digital case as in the continuous case.     

基于CSS的网页分割算法

在页面变换,信息抽取,信息过滤等应用中,首先需要将原始页面分割成为若干合适的信息块以便于后续的处理.本文提出了一种基于CSS的网页分割算法,通过对网页进行解析和布局处理,提取出其中的CSS信息,并且使用重复模式检测和聚类的方法对生成的CSS树进行分割.试验证明该方法能够有效地分割网页,并且不依赖于特定的浏览器,适合嵌入式系统使用.     

基于分组的动态时隙ALOHA算法

详细介绍了基本ALOHA算法、时隙ALOHA算法、帧时隙ALOHA算法和动态帧时隙ALOHA算法基本原理和系统效能, 分析了上述4种算法各自特点. 提出了基于分组的动态帧时隙ALOHA算法, 该算法根据标签数量对标签进行分组, 并动态匹配最佳帧长. 仿真结果表明, 改进后算法系统具有吞吐率高、不受标签数量限制、节约帧时隙等优势.     

Collaborative service system design for music content creation

This article presents a novel collaborative service system (CSS) design methodology supporting the work of multiple participating users and collaborative services processes. The CSS application of music content creation paradigm called DesignStorming as it pertains to CSS modeling and developing. CSS is an interactive service system that can be systematic service innovation and automatic semi-automated value co-creation between service providers and customers to enhance service productivity. The objectives of this research are threefold─to propose a novel design methodology for CSS, to incorporate simple service machine (SSM) and intelligent service machine (ISM) for CSS, and to demonstrate a CSS application of music content creation. SSM is a road map that can be used to define the salient attribute elements for CSS design. According to the predefined SSM, ISM conducts modeling the cognitive process of service exchanges and service provision, their knowledge representations, and value co-production process for a computerized CSS. DesignStorming demonstrates how a CSS can be automated the interactive communications and problem solving processes during the music content creation work. The CSS application involves the three system components: 1) Ontology Developer, 2) SFGA Partnership Matcher, and 3) Co-created Value Appraiser. In addition, a service evaluation model is described and evaluated, so that some of their important characteristics can be identified. Such a comprehensive design methodology can provide the foundation for building future more diversified and innovative collaborative service system.     

The use of phase in complex spectrum subtraction for robust speech recognition

In this paper we propose a new method for utilising phase information by complementing it with traditional magnitude-only spectral subtraction speech enhancement through complex spectrum subtraction (CSS). The proposed approach has the following advantages over traditional magnitude-only spectral subtraction: (a) it introduces complementary information to the enhancement algorithm; (b) it reduces the total number of algorithmic parameters; and (c) is designed for improving clean speech magnitude spectra and is therefore suitable for both automatic speech recognition (ASR) and speech perception applications. Oracle-based ASR experiments verify this approach, showing an average of 20% relative word accuracy improvements when accurate estimates of the phase spectrum are available. Based on sinusoidal analysis and assuming stationarity between observations (which is shown to be better approximated as the frame rate is increased), this paper also proposes a novel method for acquiring the phase information called Phase Estimation via Delay Projection (PEDEP). Further oracle ASR experiments validate the potential for the proposed PEDEP technique in ideal conditions. Realistic implementation of CSS with PEDEP shows performance comparable to state of the art spectral subtraction techniques in a range of 15–20 dB signal-to-noise ratio environments. These results clearly demonstrate the potential for using phase spectra in spectral subtractive enhancement applications, and at the same time highlight the need for deriving more accurate phase estimates in a wider range of noise conditions.     

基于语义相关的视频关键帧提取算法

视频关键帧提取是视频摘要的重要组成部分,关键帧提取的质量直接影响人们对视频的认识。传统的关键帧提取算法大多都是基于视觉相关的提取算法,即单纯提取底层信息计算其相似度,忽略语义相关性,容易引起误差,同时也造成了一定的冗余。对此提出了一种基于语义的视频关键帧提取算法。该算法首先使用层次聚类算法对视频关键帧进行初步提取;然后结合语义相关算法对初步提取的关键帧进行直方图对比,去掉冗余帧,确定视频的关键帧;最后与其他算法比较,所提算法提取的关键帧冗余度相对较小。