Distributed constraint optimization with MULBS: A case study on collaborative meeting scheduling

This paper introduces MULBS, a new DCOP (distributed constraint optimization problem) algorithm and also presents a DCOP formulation for scheduling of distributed meetings in collaborative environments. Scheduling in CSCWD can be seen as a DCOP where variables represent time slots and values are resources of a production system (machines, raw-materials, hardware components, etc.) or management system (meetings, project tasks, human resources, money, etc). Therefore, a DCOP algorithm must find a set of variable assignments that maximize an objective function taking constraints into account. However, it is well known that such problems are NP-complete and that more research must be done to obtain feasible and reliable computational approaches. Thus, DCOP emerges as a very promising technique: the search space is decomposed into smaller spaces and agents solve local problems, collaborating in order to achieve a global solution. We show with empirical experiments that MULBS outperforms some of the state-of-the-art algorithms for DCOP, guaranteeing high quality solutions using less computational resources for the distributed meeting scheduling task.     

Mining the change of customer behavior in fuzzy time-interval sequential patterns

Comprehending changes of customer behavior is an essential problem that must be faced for survival in a fast-changing business environment. Particularly in the management of electronic commerce (EC), many companies have developed on-line shopping stores to serve customers and immediately collect buying logs in databases. This trend has led to the development of data-mining applications. Fuzzy time-interval sequential pattern mining is one type of serviceable data-mining technique that discovers customer behavioral patterns over time. To take a shopping example, (Bread, Short, Milk, Long, Jam), means that Bread is bought before Milk in a Short period, and Jam is bought after Milk in a Long period, where Short and Long are predetermined linguistic terms given by managers. This information shown in this example reveals more general and concise knowledge for managers, allowing them to make quick-response decisions, especially in business. However, no studies, to our knowledge, have yet to address the issue of changes in fuzzy time-interval sequential patterns. The fuzzy time-interval sequential pattern, (Bread, Short, Milk, Long, Jam), became available in last year; however, is not a trend this year, and has been substituted by (Bread, Short, Yogurt, Short, Jam). Without updating this knowledge, managers might map out inappropriate marketing plans for products or services and dated inventory strategies with respect to time-intervals. To deal with this problem, we propose a novel change mining model, MineFuzzChange, to detect the change in fuzzy time-interval sequential patterns. Using a brick-and-mortar transactional dataset collected from a retail chain in Taiwan and a B2C EC dataset, experiments are carried out to evaluate the proposed model. We empirically demonstrate how the model helps managers to understand the changing behaviors of their customers and to formulate timely marketing and inventory strategies.     

基于数据挖掘的复杂装备维修辅助决策研究

文章通过某装备维修信息框架分析,维修数据预处理,然后以维修记录为例,挖掘出了维修件之间关联规则,并采用决策树分类方法对维修件进行了分类,这些规则和分类结果可以为维修计划制定、器材采购、视情维修等方面提供决策依据。     

偏最小二乘回归在气温预测中的研究与应用

气温的预测要考虑多重气象因子,然而各气象因子间的多重相关性导致普通的多元回归模型失真,预测精度降低。为了解决以上问题,本研究采用偏最小二乘回归(Partial Least Squares Regression,简称PLS)建模,根据实际建模需要对算法进行改进。为了验证该模型,本研究以成都市10月份气温场为预报场,并结合成都市13个自动站气温数据,提取预报所需主要因子,进行PLS回归建模。实验表明该模型有较好的预测能力。     

选择性集成算法分类与比较

选择性集成是当前机器学习领域的研究热点之一。由于选择性集成属于NP"难"问题,人们多利用启发式方法将选择性集成转化为其他问题来求得近似最优解,因为各种算法的出发点和描述角度各不相同,现有的大量选择性集成算法显得繁杂而没有规律。为便于研究人员迅速了解和应用本领域的最新进展,本文根据选择过程中核心策略的特征将选择性集成算法分为四类,即迭代优化法、排名法、分簇法、模式挖掘法;然后利用UCI数据库的20个常用数据集,从预测性能、选择时间、结果集成分类器大小三个方面对这些典型算法进行了实验比较;最后总结了各类方法的优缺点,并展望了选择性集成的未来研究重点。     

人工神经网络技术在电工产品可靠性实验中的应用(理论部分)

本文简要介绍了人工神经网络，BP神经网络的结构、训练和学习规则以及人工神经网络非线性时间序列预测的应用概况。     

A Novel Artificially Humanized Anti-Cripto-1 Antibody Suppressing Cancer Cell Growth

Cripto-1 is a member of the EGF-CFC/FRL1/Cryptic family and is involved in embryonic development and carcinogenesis. We designed a novel anti-Cripto-1 artificial antibody and assessed the recognition to the antigen and the potential to suppress the growth of cancer stem cells. First, single chain antibody clones were isolated by bio-panning with the affinity to recombinant Cripto-1 protein from our original phage-display library. Then, the variable regions of heavy chain VH and light chain VL in each clone were fused to constant regions of heavy chain CH and light chain CL regions respectively. These fused genes were expressed in ExpiCHO-S cells to produce artificial humanized antibodies against Cripto-1. After evaluation of the expression levels, one clone was selected and the anti-Cripto-1 antibody was produced and purified. The purified antibody showed affinity to recombinant Cripto-1 at 1.1 pmol and immunoreactivity to cancer tissues and cell lines. The antibody was available to detect the immunoreactivity in tissue microarrays of malignant tumors as well as in Cripto-1 overexpressing cells. Simultaneously, the antibody exhibited the potential to suppress the growth of human colon cancer derived GEO cells overexpressing Cripto-1 with IC₅₀ at approximately 110 nM. The artificially humanized antibody is proposed to be a good candidate to target cancer cells overexpressing Cripto-1.     

基于数据挖掘的底水油藏开发预测新方法

底水油藏开发过程中受强底水、油柱高度低、地层原油黏度大、隔夹层分布复杂等因素影响,导致单井开发效果差异大。为解决目前常规方法所存在的多因素数据分析量大、应用局限性大等缺点,提出基于BP神经网络数据挖掘算法的底水油藏水平井可采储量预测新方法,通过数模机理模型分析了该方法的可靠性。针对底水油藏静动态资料,充分挖掘隐含其中的有效信息,在完成基础数据集建立的基础上,构建了基于数据驱动的底水油藏可采储量预测模型。实际应用结果表明,该方法实现了底水油藏水平井开发的影响因素和技术参数界限的定量分析,可采储量预测最大误差低于8%,拟合效果较好,可进一步应用于底水油藏水平井生产动态、开发界限、井位设计等方面。     

敏捷化AIOps框架及运维数据质量评估方法

敏捷化智能运维(AIOps)框架将模型构建提前至测试阶段,利用该阶段产生的监控数据代替线上采集的数据以训练AIOps模型,进而实现智能运维的早开发与早使用. 运维数据质量评估方法通过最大均值差异度量方式,分别在健康评估与故障诊断运维场景下对训练数据分别进行趋势性、阶段性、可检测性及可诊断性评估,以预估数据对模型的适用性. 基于华为技术有限公司提供的测试环境设置测试用例并构建实验数据集,在该数据集上的实验结果验证了敏捷化AIOps框架的可行性及数据质量评估方法的有效性.     

强度传输方程和神经网络融合的三维重构算法

针对原有强度传输方程法所恢复的相位精度不够精确的缺点,提出强度传输方程和神经网络融合的三维重构算法. 利用强度传输方程求解出物体不同角度的初始相位,利用神经网络算法进行优化,根据不同角度的最终恢复相位结合乘法技术重构出三维体信息. 该算法具有精度高的特点,可以为三维成像技术的应用提供参考. 对于实验中的示例图像,该算法将强度传输方程得到的相位误差从21.40%降低为5.26%,重构三维物体与模拟真实物体的相关程度为显著相关.