Fabrication of alumina ceramics with functional gradient structures by digital light processing 3D printing technology

Alumina ceramics with different unit numbers and gradient modes were prepared by digital light processing (DLP) 3D printing technology. The side length of each functional gradient structure was 10 mm, the porosity ratio was controlled to 70%, and the number of units were (1 × 1 × 1 unit) and (2 × 2 × 2 unit) respectively. The different gradient modes were named FCC, GFCC-1, GFCC-2 and GFCC-3. SEM, XRD, and other characterization methods proved that these gradient structures of alumina ceramics had only α-Al2O3 phase and good surface morphology. The mechanical properties and energy absorption properties of alumina ceramics with different functional gradient structures were studied by compression test. The results show that the gradient structure with 1 × 1 × 1 unit has better mechanical properties and energy absorption properties when the number of units is different. When the number of units is the same, GFCC-2 and GFCC-3 gradient structures have better compressive performance and energy absorption potential than FCC structures. The GFCC-2 gradient structure with 1 × 1 × 1 unit has a maximum compressive strength of 19.62 MPa and a maximum energy absorption value of 2.72 × 105 J/m3. The good performance of such functional gradient structures can provide new ideas for the design of lightweight and compressive energy absorption structures in the future.     

建筑工业化发展的多群体演化博弈与仿真研究

新型建筑工业化具有高质量、低消耗、可循环发展等特征，其推广已上升到国家战略层面。利用演化博弈方法，建立“政府-开发商-银行” 的三方动态演化博弈模型，进行各博弈主体策略的演化稳定性分析，并针对初始状态、奖惩力度、借贷风险和开发成本等对演化结果的影响进行动态仿真。在此基础上， 考虑开发商群体的网络拓扑特征对演化真实性的影响，引入复杂网络理论， 以无标度网络为载体描述开发商个体的连接偏好和决策机制，构建政府监管下的建筑工业化扩散模型，并通过仿真深入研究相关因素对扩散深度的影响作用，最后结合仿真结果给出相应对策建议。     

Evolving an Accurate Decision Tree-Based Model for Predicting Carbon Dioxide Solubility in Polymers

Solubility is one of the most indispensable physicochemical properties determining the compatibility of components of a blending system. Research has been focused on the solubility of carbon dioxide in polymers as a significant application of green chemistry. To replace costly and time-consuming experiments, a novel solubility prediction model based on a decision tree, called the stochastic gradient boosting algorithm, was proposed to predict CO₂ solubility in 13 different polymers, based on 515 published experimental data lines. The results indicate that the proposed ensemble model is an effective method for predicting the CO₂ solubility in various polymers, with highly satisfactory performance and high efficiency. It produces more accurate outputs than other methods such as machine learning schemes and an equation of state approach.     

A synergistic strategy for combining thesaurus-based and corpus-based approaches in building ontology for multilingual search engines

In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

SINA: Semantic interpretation of user queries for question answering on interlinked data

The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。