本原李超代数和李超代数的主因子

本文首先引入了本原李超代数,研究了三种类型本原李超代数及其相关的结构性质.接着引入了李超代数主因子,利用第三种类型的本原李超代数性质给出了李超代数的主因子之间存在的L-连接关系.最后,介绍了李超代数的CAP-子代数,证明了若李超代数L的所有极大阶化子代数都是CAP-子代数,那么L是可解的.     

Finsler子流形中的陈联络与基本方程

该文研究了Finsler子流形中诱导的两种陈联络.通过利用活动标架法,利用诱导的陈联络D建立了Finsler子流形的基本方程,并给出了D与诱导度量的陈联络∇之间的关系.这些研究完善和充实了已有文献的相关结果.     

基于模糊分类的多维定性数据的统计分析

在多维定性数据处理的问题中,不仅要研究变量之间的关系、样本之间的关系,还需研究样本与变量之间的关系,从而对潜在样本群子结构水平及其类型特征进行分析。本文采用对偶标度统计方法利用设计矩阵变换将原始多维定性数据进行类型特征分析,并在此基础上建立了基于模糊分类的直方图,表现出了潜在样本群的特征及其子结构之间的差异与联系。文章以分析儿童主体品质发展规律为例,说明此方法的有效性。     

心理契约在组织支持感和员工忠诚度之间传导机制的实证研究

组织支持感的主体是员工,员工忠诚度的主体是组织.在管理实践中,如何把不同主体的二者有机统一起来,是学界和企业管理者长期探索的问题.在企业层面把组织支持感、心理契约和员工忠诚度三者结合起来进行研究,使用比较成熟的量表,收集不同类型企业有效问卷223份,运用SPSS16.0和AMOS17.0对数据进行分析,验证相关假设.研究结果表明:组织支持感和员工忠诚度之间不存在相关关系;组织支持感的三个维度(工作支持、价值认同和利益关心)与员工忠诚度呈弱相关;心理契约不是中介变量,但在组织支持感和员工忠诚度之间具有传导作用.最后,对研究的结论和启示进行了分析和讨论,并指出有待进一步研究的问题.     

城镇登记失业率影响因素的探讨

就城镇登记失业率的相关问题进行了研究.利用格兰杰因果关系检验解决了确定影响因素的问题;建立了主成分分析模型和基于序列相关性的误差修正模型,解决了各影响因素和城镇登记失业率之间关联的问题;并利用所建模型对未来我国的就业前景作出仿真预测,得出了相应结论.     

集群企业间关系强度对合作技术创新的影响——基于企业类型和创新类型的视角

集群企业之间的关系强度对合作技术创新具有何种影响,一直存在争论。为了进一步分析该问题,文章借鉴相关研究成果,将集群企业分为核心企业和配套企业,将技术创新分为探索式创新和利用式创新,在此基础上建立了合作创新的博弈论模型。文章研究得出:核心企业之间的弱关系有利于探索式创新,核心企业与配套企业之间的强关系有利于利用式创新;探索式创新和利用式创新是相互促进、相互补充的。     

随机弦长矩与弦幂积分

本文研究了凸体的五种类型的随机弦长分布.利用限弦投影原理和运动测度积分的方法,揭示了凸体的弦幂积分与随机弦长的矩之间的本质联系.     

极小I-开集（英文）

本文在理想拓扑空间中研究了极小I-开集.利用一般拓扑学的理论,获得了极小I-开集的一些刻画和性质,同时研究了极小I-开集和其他类型开集之间的关系.     

强拟闭集与强拟连续

利用半闭集引入强拟闭集概念,研究了半开集、强拟开集、强拟闭集概念之间的关系,得到了强拟闭集是连续闭映射下的不变量及其相关性质;最后给出强拟连续概念并得到其等价刻画.     

相关系数矩阵的逆矩阵与行列式的内涵分析

相关系数矩阵是用于表现变量之间相关关系的统计分析工具.然而,多元变量之间的相关关系极易受各种复杂因素的影响,因此并不能仅仅依据该矩阵中的数值来解释变量间的关系.而利用偏相关系数可以进一步地反映变量间的本质联系.系统研究了相关系数矩阵的逆矩阵与行列式中的深刻内涵,一方面讨论了相关系数矩阵的逆矩阵与偏相关系数之间的数量联系;另一方面,从数学上证明了相关系数矩阵的行列式与变量间各阶次偏相关系数的等式关系.此外,还进一步指出这些研究结论在多元线性回归建模中的指导意义.     

条件价值法中支付意愿的影响因素分析

结合一次针对三江平原湿地非使用价值进行的问卷调查,对条件价值法中支付意愿与问卷各问题之间的相关关系进行分析.对无序变量采用了χ²检验方法,对定序变量采用了Kendall系数检验.最终认为,受访者的社会情况与对湿地的认识问题相比较,受访者的社会情况对支付意愿有着更强烈的影响.     

Accomplishing Accomplishment

The concepts of knowledge and accomplishment are duals. There are many parallels between them. In this paper I discuss the "AA" thesis, which is dual to the well known KK thesis. The KK thesis claims that if someone knows something, then she knows that she knows it. This is generally thought to be false, and there are powerful reasons for rejecting it. The AA thesis claims that if someone accomplishes something, then she accomplishes that she accomplishes it. I argue that this, too, is false, and that the reasons it is false parallel reasons for the falsity of the KK thesis.     

Transfer distance between partitions and search of dense zones in graphs

This text summarizes the Ph.D. thesis defended by the author in November 2006 under the supervision of Olivier Hudry, at the Université Paris 1. The thesis is written in French and can be obtained from the author upon request. The first part of the thesis is mainly devoted to the study of distances between partitions, and more precisely to the transfer distance. In the second part, we design a method for overlapping clustering and we apply it to protein interactions networks.     

Frege on Identity as a Relation of Names

This essay offers a detailed philosophical criticism of Frege’s popular thesis that identity is a relation of names. I consider Frege’s position as articulated both in ‘On Sense and Reference’, and in the Grundgesetze, where he appears to take an objectual view of identity, arguing that in both cases Frege is clearly committed to the proposition that identity is a relation holding between names, on the grounds that two different things can never be identical. A counterexample to Frege’s thesis is considered, and a positive thesis is developed according to which, in contradistinction to the Fregean position, identity is a reflexive, symmetric, and transitive relation holding only between a thing and itself which can be expressed as a relation between names.     

A framework for robust and flexible optimisation using metaheuristics

This is a summary of the most important results presented in the authors PhD thesis. This thesis, written in English, was defended on 13 June 2003 and supervised by Johan Springael and Gerrit K. Janssens. A copy is available from the author upon request. This PhD thesis focuses on stochastic problems and develops a framework to find robust and flexible solutions of such problems. The framework is applied to several well-known problems in the realm of supply chain design. Besides this framework, the thesis contains several other important contributions. A new type of robustness and flexibility is proposed, that expresses the need for solutions to remain approximately the same when changes occur in the problem data. Several distance measures are developed to calculate the distance (or similarity) between solutions of different permutation type problems. A new type of genetic algorithm is also proposed, that uses a distance measure to maintain a diverse population of high-quality solutions.Received: June 2003     

New models and algorithms for the cyclic inventory routing problem

This is a summary of the author’s PhD thesis supervised by El-Houssaine Aghezzaf and defended on 4 December 2006 at the Universiteit Gent. The thesis is written in English and is electronically available from http://ir18.ugent.be/birger.raa/. This work studies the problem of finding optimal three-way cost trade-offs between vehicle fleet costs, distribution costs and holding costs in the cyclic replenishment of a set of customers with constant demand rates from a single depot.      

决策依赖不确定条件下基于复合实物期权估值的工程系统投资决策研究

不确定性是复杂工程系统的内在属性,在决策依赖不确定条件下对工程系统的投资决策需考虑不确定性与决策过程之间的交互作用,使得投资决策问题的求解非常困难.提出了决策依赖不确定条件下复合实物期权估值的最小二乘模拟算法,方法较好地解决了在决策依赖不确定条件下由于不同期权价值相互耦合所带来的计算复杂性,进一步拓展了最小二乘模拟算法在期权估值中的应用,基于该方法,可以比较方便地解决决策依赖不确定条件下工程系统投资决策问题.     

Solving scheduling problems from high-level models

This is the summary of the author??s PhD thesis supervised by Yves Deville and Pascal Van Hentenryck, and defended on 25 May 2010?at the Université catholique de Louvain in Louvain-la-Neuve. The thesis is written in English and is available from the author, or downloadable from http://becool.info.ucl.ac.be/files2/thesis-monette.pdf. This work is about the gap between high-level modelling of scheduling problems and its efficient resolution. We propose to automatically classify models of scheduling problems, and to apply an appropriate search algorithm. Thanks to the strong separation between model and search, we propose also a simple way to create hybrid algorithms. A second part of the thesis deals with Constraint Programming approaches for two scheduling problems: The one-machine non-preemptive problem and the Just-In-Time Job-Shop problem. All parts are accompanied by experimental results showing their practicality.     

Simulation and optimisation of intermodal barge transport networks

This is a summary of the author??s PhD thesis supervised by Gerrit Janssens and Cathy Macharis and defended on 7 May 2010?at the Hasselt University, Belgium. The thesis is written in English and is available from the author upon request. This work deals with two key aspects in the competitiveness of intermodal transport making use of inland navigation. The first part of the thesis studies bundling of freight in intermodal barge transport networks. Alternative bundling strategies for container barge transport are compared by means of discrete event simulation. Cooperation between inland barge terminals to bundle freight flows is modelled as a service network design problem. The second part relates to the initial and final journey by road in the intermodal barge transport chain. Pre- and end-haulage by road is modelled as a Full Truckload Pickup and Delivery Problem with Time Windows. A local search algorithm and deterministic annealing algorithm are proposed to find near-optimal solutions.