基础软件技术的发展趋势

从分析基础软件的基本概念和特性出发,对基础软件的内容、需求、技术、产品等方面进行了系统论述。探讨了现有的主流开发技术及未来的发展趋势。通过分析现有部分国产软件系统在一些典型领域的应用,揭示我国基础软件发展的现状和难题,为现有国产基础软件产业的发展提供决策参考。     

Conceptual equivalence for contrast mining in classification learning

Learning often occurs through comparing. In classification learning, in order to compare data groups, most existing methods compare either raw instances or learned classification rules against each other. This paper takes a different approach, namely conceptual equivalence, that is, groups are equivalent if their underlying concepts are equivalent while their instance spaces do not necessarily overlap and their rule sets do not necessarily present the same appearance. A new methodology of comparing is proposed that learns a representation of each group’s underlying concept and respectively cross-exams one group’s instances by the other group’s concept representation. The innovation is fivefold. First, it is able to quantify the degree of conceptual equivalence between two groups. Second, it is able to retrace the source of discrepancy at two levels: an abstract level of underlying concepts and a specific level of instances. Third, it applies to numeric data as well as categorical data. Fourth, it circumvents direct comparisons between (possibly a large number of) rules that demand substantial effort. Fifth, it reduces dependency on the accuracy of employed classification algorithms. Empirical evidence suggests that this new methodology is effective and yet simple to use in scenarios such as noise cleansing and concept-change learning.     

家纺产品分销管理系统的设计与实现

根据家纺产品分销的业务范围和操作流程,结合基于组件的多层应用开发技术,提出了适合家纺产品分销管理的系统解决方案,较好地实现了家纺产品分销中的一些业务流程。该文详细阐述了家纺分销管理系统的设计与实现。     

基于复杂网络的非正式团体知识交互网络分析

针对知识在非正式团体中的传播特征,结合复杂网络理论,为了企业知识不断创新,提出了一种非正式团体知识交互网络模型.通过仿真得出,在小世界网络模型下知识的传播速度和平均知识水平比其他网络模型有明显优势,进而在非正式团体知识交互网络的描述与分析中提出利用"小世界"的平均路径长度和聚类系数来表征IFG知识交互网络中的交互频繁度和交互聚集度的思想,为进一步研究IFG组织及管理与其内部知识创新的内在联系提供了数量分析基础.     

基于Web的建筑业信息搜索引擎的设计与实现

随着Web信息的急剧增长使搜索引擎专用化成为发展趋势.根据当前的需求提出了实现建筑业信息搜索引擎设计方法.重点论述主题搜索引擎的信息采集策略,并给出了一种比较理想的建筑业信息搜索引擎设计方案.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92     

电气类专业群双创人才培养的探索与实践

针对科技产业发展人才需求和专创融合教育改革中存在的问题,本文从构建双创型人才培养模式、完善实践教学体系、深化校企合作和建立特色创新创业工作室四个方面,对厦门理工学院电气类专业群创新创业人才培养进行探索与实践。实施效果表明,已取得积极成效,具有一定推广价值。     

Aqueous solution of Oxone as new oxidizing agent for multi-walled carbon nanotube functionalization

In this work, multi-wall carbon nanotube (MWCNT) was successfully modified using aqueous solution of Oxone as a new oxidant. The effect of oxidation temperature on various characteristics of the treated MWCNTs was also investigated. FTIR and titration analysis proved the formation of carboxyl, carbonyl and epoxide groups at the surface of MWCNTs. The concentration of the functional groups increased as the modification temperature increased. The presence of such oxygen containing groups at the surface of MWCNTs justified the long time stability of the treated MWCNTs suspensions in water and methanol. The modified MWCNTs showed higher entanglement compared to row MWCNT due to the cross-links adjacent effect of pendant functional groups. Finally, it was concluded that Oxone oxidation process destroys the structure of the MWCNTs, but not severe enough to unzip the MWCNTs.     

A Phase‐Separation Route to Synthesize Porous CNTs with Excellent Stability for Na+ Storage

Porous carbon nanotubes (CNTs) are obtained by removing MoO₂ nanoparticles from MoO₂@C core@shell nanofibers which are synthesized by phase‐segregation via a single‐needle electrospinning method. The specific surface area of porous CNTs is 502.9 m² g^?1, and many oxygen‐containing functional groups (C? OH, C?O) are present. As anodes for sodium‐ion batteries, the porous CNT electrode displays excellent rate performance and cycling stability (110 mA h g^?1 after 1200 cycles at 5 A g^?1). Those high properties can be attributed to the porous structure and surface modification to steadily store Na⁺ with high capacity. The work provides a facile and broadly applicable way to fabricate the porous CNTs and their composites for batteries, catalysts, and fuel cells.     

Optimal Deep Learning Model Enabled Secure UAV Classification forIndustry 4.0

Emerging technologies such as edge computing, Internet of Things (IoT), 5G networks, big data, Artificial Intelligence (AI), and Unmanned Aerial Vehicles (UAVs) empower, Industry 4.0, with a progressive production methodology that shows attention to the interaction between machine and human beings. In the literature, various authors have focused on resolving security problems in UAV communication to provide safety for vital applications. The current research article presents a Circle Search Optimization with Deep Learning Enabled Secure UAV Classification (CSODL-SUAVC) model for Industry 4.0 environment. The suggested CSODL-SUAVC methodology is aimed at accomplishing two core objectives such as secure communication via image steganography and image classification. Primarily, the proposed CSODL-SUAVC method involves the following methods such as Multi-Level Discrete Wavelet Transformation (ML-DWT), CSO-related Optimal Pixel Selection (CSO-OPS), and signcryption-based encryption. The proposed model deploys the CSO-OPS technique to select the optimal pixel points in cover images. The secret images, encrypted by signcryption technique, are embedded into cover images. Besides, the image classification process includes three components namely, Super-Resolution using Convolution Neural Network (SRCNN), Adam optimizer, and softmax classifier. The integration of the CSO-OPS algorithm and Adam optimizer helps in achieving the maximum performance upon UAV communication. The proposed CSODL-SUAVC model was experimentally validated using benchmark datasets and the outcomes were evaluated under distinct aspects. The simulation outcomes established the supreme better performance of the CSODL-SUAVC model over recent approaches.