Maximin share and minimax envy in fair-division problems

For fair-division or cake-cutting problems with value functions which are normalized positive measures (i.e., the values are probability measures) maximin-share and minimax-envy inequalities are derived for both continuous and discrete measures. The tools used include classical and recent basic convexity results, as well as ad hoc constructions. Examples are given to show that the envy-minimizing criterion is not Pareto optimal, even if the values are mutually absolutely continuous. In the discrete measure case, sufficient conditions are obtained to guarantee the existence of envy-free partitions.     

Sub-bundles of the complexified tangent bundle

We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.

     

Prefiltration technique via aggregation for constructing low‐density high‐quality factorized sparse approximate inverse preconditionings

This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd.     

马科维兹资产组合选择模型的旋转算法

提出线性不等式组的一种旋转算法，并用其求解马科维兹资产组合选择模型，此算法每次迭代约需n^2次乘法和加法，其中n是模型中变量的数目，在微机上运行Delphi程序的实验结果表明，从上海和深圳股市1072支股票70期周末收盘价计算出20个最优投资组合仅需314次迭代和45s。     

磁AB效应及其理论解释

本文介绍磁AB效应及其两种理论解释 ,进而说明经典电动力学具有局限性 ,量子力学是更高层次的物理理论     

基于Gibbs模型的提高图像分辨率方法

在提高图像分辨率过程中,选择合适的成像模型是获得高分辨率图像的一个关键因素。提出一种基于最大后验概率、采用Gibbs成像模型,并利用多帧序列图像重构高分辨率图像的方法,充分利用序列图像之间的累加信息,从而快速地获得较其他方法更优的高分辨率图像。     

支持向量机在交通量预测中的应用

交通量预测对于区域交通规划有重要意义。提出一种基于支持向量机理论的交通量预测方法。该方法以统计学习理论为基础，通过和BP神经网络进行比较的实验，证明其在交通量预测中的有效性。     

Threshold‐Based Camera Motion Characterization of MPEG Video

We propose an efficient scheme for camera motion characterization in MPEG‐compressed video. The proposed scheme detects six types of basic camera motions through threshold‐based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.     

一种求解混合多目标规划问题的功效函数法

逻辑生长函数相对于龚珀兹生长函数具有拐点高和对称性的特点,采用逻辑生长函数形式的功效函数法求解混合多目标规划问题具有形式简单、计算量小、符合实际的优点。证明了用这种方法求出的最优解是有效解。讨论了满意值对有效解的影响。逻辑生长函数还可以应用于多维变量评价的功效系数法中。     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)