SCA波形组件的可视化装配与部署

针对软件通信结构(SCA)规范中XML配置文件在可视化表示波形组件描述和波形应用装配与部署方面的不足,提出SCA波形组件的可视化装配与部署,为SCA兼容系统的架构设计者和系统开发者提供了一种图形化的装配逻辑和部署关系表示方式,减少了系统设计和开发过程中可能出现的错误。并对SCA规范中的组件间端口连接方式进行了归纳和总结,给出在不同应用场景下选择端口连接方式的原则,介绍了一种基于Eclipse体系框架的SCA波形集成开发环境。     

基于SCA的无线通信技术研究

介绍了一种新的无线通信系统设计思想,即基于SCA规范进行无线通信系统的设计和开发,给出了该系统的软硬件体系结构,通过定义核心框架服务详细规定了波形应用组件以及设备的自动装配、智能化管理和控制等接口,为各种波形间的互通提供了统一的运行环境,保证了波形应用组件实现的独立性。最后对基于SCA的无线通信系统中所涉及的一些关键技术进行了探讨。     

面向构件就是面向服务——普元加入SCA/SDO标准组织并将推出支持该标准的构件平台

SCA/SDO是SOA实施的重要编程规范,普元作为构件厂商的加入使得“面向构件就是面向服务的实现”得到了进一步验证。     

基于SCA的服务模型研究

在深入研究SOA思想和SCA核心技术的基础上,划分出SOA体系架构层并且对每一层的关键特性进行分析。然后按照SCA规范来实现每一层,建立一种基于SCA规范的服务模型。基于SCA的服务模型可以提高服务复用度,实现不同技术的快速集成。     

一种用于软件通信体系结构的构件模型

软件通信体系结构(SoftwareCommunicationsArchitecture,简称SCA)已被软件无线电(SoftwareDefinedRadio,简称SDR)论坛采纳为嵌入式系统的标准通信软件结构。SCA提供了一种支持通信软件和硬件可移植、可配置、可扩充和可重用的软件平台,但作为构件框架时仍显不足,主要是缺乏明确的构件模型。在研究CORBA构件模型(CORBAComponentModel,简称CCM)基础上,提出了适用于SCA的轻量级(Lightweight,简称Lw)CORBA构件模型———LwCCM。     

基于SCA的SHP组件动态部署方案

在软件通信体系结构(SCA)中,调制解调级硬件抽象层(MHAL)规范不支持专用硬件处理器(SHP)中组件的动态部署。为此,提出一种基于SCA的SHP组件动态部署方案。介绍MHAL通信机制,设计硬件装配描述文件和硬件组件描述文件,在此基础上实现动态部署。分析结果表明,该方案能实现波形开发和部署阶段软件与硬件的分离,增强SCA对SHP的兼容性。     

基于XML的虚拟仪器语言技术研究

针对可重构的测试系统对虚拟仪器系统提出的在线升级和功能调整要求,提出了基于XML的虚拟仪器描述语言规范(XVIML,XML based virtual instrument markup language)的可装配重构的虚拟仪器系统。通过定义可重构虚拟仪器系统的描述规范和基于XVIML的芯片构件和连接关系描述,采用基于XVIML的动态解析器模型和基于构件的装配模型,实现了虚拟仪器系统的动态解析、构件的查找和装配;形成了一个测试功能可以根据测试任务快速重组的测试系统;解决了可重构测试系统对虚拟仪器提出的快速和在线重构要求。     

虚拟装配通用性的研究与应用

虚拟装配是虚拟设计和虚拟制造中的一个重要组成部分,通过它可以验证产品的可装配性以及获取正确的装配序列。介绍软件复用的思想以及构件技术的概念,设计并开发一个基于Vega Prime的通用的虚拟装配的构件,同时介绍构件中几个重要功能的实现。最后将该构件应用于某方向舵虚拟仿真系统中。     

软件无线通信系统模块化体系结构的研究

基于全新无线通信系统设计理念,该文介绍了软件通信体系结构(SCA)规范,提出了基于SCA的无线通信系统设计思想,分析了采用面向对象设计的硬件模块属性、用于实现通信功能的资源、以及对应用程序接口的设计要求。     

基于SCA的无线通信计算机系统研究

针对目前战术通信设备品种繁多,技术体制各异,互连互通困难,通用性差,模块化程度较低,软件可编程能力差。本文参考美军联合战术无线电系统(JTRS)及其核心SCA规范,采用开放式的体系结构和模块化设计思想,提出了基于SCA规范的无线通信计算机系统,给出了硬件体系结构和软件体系结构设计,并予以实现,在项目中得到了应用,验证了它的可用性和实用性。     

SCA中间件技术浅析

针对软件通信体系结构规范(SCA),研究了SCA中间件技术.以SCA软件体系结构为基础,描述了公共对象请求代理(CORGBA)中间件技术在SCA中的作用和优势,探讨了SCA体系中中间件对硬件平台模块化的技术支持,分析了为确保SCA架构下软硬件独立性对硬件组件进行抽象所采用的硬件抽象层(HAL)和实时C0RBA技术方法,...     

Mechanical assembly planning using ant colony optimization

In mechanical assembly planning research, many intelligent methods have already been reported over the past two decades. However, those methods mainly focus on the optimal assembly solution search while another important problem, the generation of solution space, has received little attention. This paper proposes a new methodology for the assembly planning problem. On the basis of a disassembly information model which has been developed to represent all theoretical assembly/disassembly sequences, two decoupled problems, generating the solution space and searching for the best result, are integrated into one computation framework. In this framework, using an ant colony optimization algorithm, the solution space of disassembly plans can be generated synchronously during the search process for best solutions. Finally, the new method’s validity is verified by a case study.     

A branch-and-bound algorithm for assembly line worker assignment and balancing problems

In this paper, we studied the assembly line worker assignment and balancing problem, which is an extension of the classical assembly line balancing problem in which an optimal partition of the assembly work among the stations is sought along with the assignment of the operators to the stations. The relationship between this problem and several other well-studied problems is explored, and new lower bounds are derived. Additionally, an exact enumeration algorithm, which makes use of the lower bounds, is developed to solve the problem. The algorithm is tested by using a standard benchmark set of instances. The results show that the algorithm improves upon the best-performing methods from the literature in terms of solution quality, and verifies more optimal solutions than the other available exact methods.     

An improved Opposition-Based Sine Cosine Algorithm for global optimization

Real life optimization problems require techniques that properly explore the search spaces to obtain the best solutions. In this sense, it is common that traditional optimization algorithms fail in local optimal values. The Sine Cosine Algorithms (SCA) has been recently proposed; it is a global optimization approach based on two trigonometric functions. SCA uses the sine and cosine functions to modify a set of candidate solutions; such operators create a balance between exploration and exploitation of the search space. However, like other similar approaches, SCA tends to be stuck into sub-optimal regions that it is reflected in the computational effort required to find the best values. This situation occurs due that the operators used for exploration do not work well to analyze the search space. This paper presents an improved version of SCA that considers the opposition based learning (OBL) as a mechanism for a better exploration of the search space generating more accurate solutions. OBL is a machine learning strategy commonly used to increase the performance of metaheuristic algorithms. OBL considers the opposite position of a solution in the search space. Based on the objective function value, the OBL selects the best element between the original solution and its opposite position; this task increases the accuracy of the optimization process. The hybridization of concepts from different fields is crucial in intelligent and expert systems; it helps to combine the advantages of algorithms to generate more efficient approaches. The proposed method is an example of this combination; it has been tested over several benchmark functions and engineering problems. Such results support the efficacy of the proposed approach to find the optimal solutions in complex search spaces.     

The Specification of Assemblers

The problem of applying formal techniques of program specification and verification to large complex programs is considered. It is argued that a practical solution requires a variety of techniques, including both procedural and nonprocedural specifications, hierarchical program organization, and the use of program transformations. In particular, a case is made for flexible problem-oriented choice of specification techniques and languages. These ideas are expanded by specifying a load-and-go assembler in three parts: a transduction grammar describing the correspondence between concrete and abstract syntax for assembly language programs; a set of transformations of the abstract form; and a nonconstructive axiomatic specification of the result of core assembly and loading of transformed abstract programs.     

Two-sided assembly line balancing considering the relationships between tasks

Previous studies of the two-sided assembly line balancing problem assumed equal relationships between each two tasks assignable to a side of the line. In practice, however, this relationship may be related to such factors as the distance between the implementation place and the tools required for implementation. We know that the more relationships exist between the tasks assigned to each station, the more efficient will be the assembly line. In this paper, we suggest an index for calculating the value of the relationship between each two tasks, and define a performance criterion called ‘assembly line tasks consistency’ for calculating the average relationship between the tasks assigned to the stations of each solution. We propose a simulated annealing algorithm for solving the two-sided assembly line balancing problem considering the three performance criteria of number of stations, number of mated-stations, and assembly line tasks consistency. Also, the simulated annealing algorithm is modified for solving the two-sided assembly line balancing problem without considering the relationships between tasks. This modification finds five new best solutions for the number of stations performance criterion and ten new best solutions for the number of mated-stations performance criterion for benchmark instances.     

基于SCA的无线通信计算机系统研究

针对目前战术通信设备品种繁多，技术体制各异，互连互通困难，通用性差，模块化程度较低，软件可编程能力差。本文参考美军联合战术无线电系统（JTRS）及其核心SCA规范，采用开放式的体系结构和模块化设计思想，提出了基于SCA规范的无线通信计算机系统，给出了硬件体系结构和软件体系结构设计，并予以实现，在项目中得到了应用，验证了它的可用性和实用性。