固定效应部分线性变系数面板模型的快速有效估计

本文将最小二乘支持向量机(LSSVM) 和二次推断函数法(QIF) 相结合，为个体内具有相关结构的固定效应部分线性变系数面板模型提供了一种新的快速估计方法；在一定的正则条件下，论证了参数估计量的渐近正态性和非参数估计量的收敛速度；采用Monte Carlo模拟考察了估计方法在有限样本下的表现并将估计技术应用于现实数据分析。该方法不仅保证了估计的有效性和统计推断力，而且程序运行速度得到较大幅度提升。     

信息时代的翻译工具

我们正处于一个多语言网络的信息时代,如何有效地使用现代化手段来突破人们之间的语言障碍,成为了全人类面临的共同问题.翻译是克服语言障碍的有利手段.信息时代的翻译工具有:机器翻译系统、因特网上的语言翻译资源、CD-ROM上的语言翻译资源、计算机辅助术语管理系统、双语对应语料库、翻译记忆软件和本土化软件工具、机助翻译系统.掌握了信息时代的这些翻译工具,就可以大大地提高翻译的效率,满足信息时代对翻译的迫切需要.     

实践性教学模式在机械制造技术基础课程中的应用

机械制造技术基础课程是重要的专业基础课程。结合课程理论教学和实践应用特点,从现场实践、项目促进、毕业实习和毕业设计等环节,探索了该课程的实践性教学模式,做到现场实践促进理论学习,科研促进教学,极大地激发了学生学习的积极性和主动性,使学生能深入理解、掌握和运用基本知识和基本技能,丰富了学生的专业知识,培养了学生独立思考和解决问题的能力,教师完成了教学任务及部分科研工作,实现了实践、科研及综合运用促进本科生教学的新模式。     

关于科学发现机器的研究

本文阐述了科学发现的两个判据,在知识存贮有劣性原理的基础上,提出了知识存贮不完全性原理,指出存在一类逻辑上具有非放大性,但认识论上具有放大性的演绎发现机器。在休谟问题逻辑学范围内不可解原理的基础上,论证了不存在通用的归纳发现机器,但建立局部合理的、有效的、完备的归纳发现机器是可行的。最后,本文描述了科学发现机器的结构,并在文献的基础上,描述了一种同时具有发生与评价功能的归纳发现机器并论证了它的合理性。     

Public relations and artificial intelligence: It’s not (just) about robots

Organizations of all kinds, as well as their in-house or agency public relations teams, increasingly co-opt Artificial Intelligence (AI) to enhance their capabilities. This paper examines a relatively new topic that has received little scholarly attention: the growing relationship between AI and public relations. It outlines several key roles that AI may play in future, based on trends in other industries, and considers the implications for public relations practitioners, their clients and employers. It therefore launches a dialogue about the diversity and extent of AI’s uses in public relations practice. The paper argues that, to date, commentators have placed too much emphasis on AI’s potential for task automation; AI’s broader technological, economic and societal implications for public relations warrant greater critical attention. This does not imply that practitioners need become expert technologists; rather, they should develop a sufficient understanding of AI’s present and potential uses to be able to offer informed counsel.     

Varieties of political support in emerging democracies: A cross-national analysis

Political support is a multidimensional construct encompassing evaluations of political leaders and institutions (specific support) as well as adherence to basic regime principles (diffuse support). Scholars have traditionally assumed that diffuse and specific support are driven by different forces and evolve largely independently. Prior empirical work, however, has struggled to untangle the two support dimensions and focused predominantly on cross-national differences, ignoring their dynamics. This paper develops an analytical and empirical approach to examine the levels and dynamic interplay of both support dimensions and estimate their determinants, applying it to South American democracies between 1996 and 2015. Contrary to received wisdom, we show that both dimensions are quite volatile and closely linked in this region. In particular, negative economic shocks not only undermine support for government actors, but also fuel democratic disenchantment. Nonetheless, while regime support is rather fickle in South America, it can be ultimately resistant to performance fluctuations.     

Semi-online scheduling with “end of sequence” information

We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing time. Moreover, the last job is marked, and thus it is known for every new job whether it is the final job of the sequence. We explore this model on two uniformly related machines, that is, two machines with possibly different speeds. Two objectives are considered, maximizing the minimum completion time and minimizing the maximum completion time (makespan). Let s be the speed ratio between the two machines, we consider the competitive ratios which are possible to achieve for the two problems as functions of s. We present algorithms for different values of s and lower bounds on the competitive ratio. The proposed algorithms are best possible for a wide range of values of s. For the overall competitive ratio, we show tight bounds of ϕ + 1 ≈ 2.618 for the first problem, and upper and lower bounds of 1.5 and 1.46557 for the second problem. The authors would like to dedicate this paper to the memory of our colleague and friend Yong He who passed away in August 2005 after struggling with illness. D. Ye: Research was supported in part by NSFC (10601048).     

Newsvendor Problems with Demand Shocks and Unknown Demand Distributions

In today's competitive market, demand volume and even the underlying demand distribution can change quickly for a newsvendor seller. We refer to sudden changes in demand distribution as demand shocks. When a newsvendor seller has limited demand distribution information and also experiences underlying demand shocks, the majority of existing methods for newsvendor problems may not work well since they either require demand distribution information or assume stationary demand distribution. We present a new, robust, and effective machine learning algorithm for newsvendor problems with demand shocks but without any demand distribution information. The algorithm needs only an approximate estimate of the lower and upper bounds of demand range; no other knowledge such as demand mean, variance, or distribution type is necessary. We establish the theoretical bounds that determine this machine learning algorithm's performance in handling demand shocks. Computational experiments show that this algorithm outperforms the traditional approaches in a variety of situations including large and frequent shocks of the demand mean. The method can also be used as a meta‐algorithm by incorporating other traditional approaches as experts. Working together, the original algorithm and the extended meta‐algorithm can help manufacturers and retailers better adapt their production and inventory control decisions in dynamic environments where demand information is limited and demand shocks are frequent      

基于矩阵打分值和化学位移值预测酶蛋白质中β-发夹模体

酶是一类具有催化功能的蛋白质,对其结构和功能的研究是非常有必要的。特殊模体β-发夹是一种简单的超二级结构,它们包含了丰富的折叠信息,对酶中β-发夹的预测有助于酶结构和功能的预测。本文建立了非冗余的β-发夹模体数据集,包含1080条酶蛋白质链,2818个β-发夹模体,1098个非β-发夹。提取位点亲疏水组分及位点亲疏水紧邻关联组分作为参数,运用矩阵打分算法得到的预测结果不理想。将位点亲疏水、位点亲疏水紧邻关联组分为参数得到的打分值和平均化学位移值共同作为特征参数,输入支持向量机算法对模体进行预测,5交叉检验预测总精度是81.8%,相关系数达到了0.636。     

Feature selection and machine learning with mass spectrometry data for distinguishing cancer and non-cancer samples

This is a comparative study of various clustering and classification algorithms as applied to differentiate cancer and non-cancer protein samples using mass spectrometry data. Our study demonstrates the usefulness of a feature selection step prior to applying a machine learning tool. A natural and common choice of a feature selection tool is the collection of marginal p-values obtained from t-tests for testing the intensity differences at each m/z ratio in the cancer versus non-cancer samples. We study the effect of selecting a cutoff in terms of the overall Type 1 error rate control on the performance of the clustering and classification algorithms using the significant features. For the classification problem, we also considered m/z selection using the importance measures computed by the Random Forest algorithm of Breiman. Using a data set of proteomic analysis of serum from ovarian cancer patients and serum from cancer-free individuals in the Food and Drug Administration and National Cancer Institute Clinical Proteomics Database, we undertake a comparative study of the net effect of the machine learning algorithm–feature selection tool–cutoff criteria combination on the performance as measured by an appropriate error rate measure.