The densest <Emphasis Type="Italic">k</Emphasis>-subgraph problem on clique graphs

The Densest k-Subgraph (DkS) problem asks for a k-vertex subgraph of a given graph with the maximum number of edges. The problem is strongly NP-hard, as a generalization of the well known Clique problem and we also know that it does not admit a Polynomial Time Approximation Scheme (PTAS). In this paper we focus on special cases of the problem, with respect to the class of the input graph. Especially, towards the elucidation of the open questions concerning the complexity of the problem for interval graphs as well as its approximability for chordal graphs, we consider graphs having special clique graphs. We present a PTAS for stars of cliques and a dynamic programming algorithm for trees of cliques. M.L. is co-financed within Op. Education by the ESF (European Social Fund) and National Resources. V.Z. is partially supported by the Special Research Grants Account of the University of Athens under Grant 70/4/5821.     

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with wild cards. A maximal motif is such a representative motif that is not properly contained in any larger motifs with the same location lists. Although the enumeration problem for maximal motifs with wild cards has been studied in Parida et al. (2001), Pisanti et al. (2003) and Pelfrêne et al. (2003), its output-polynomial time computability has been still open. The main result of this paper is a polynomial space polynomial delay algorithm for the maximal motif enumeration problem for the repeated motifs with wild cards. This algorithm enumerates all maximal motifs in an input string of length n in O(n ³) time per motif with O(n) space, in particular O(n ³) delay. The key of the algorithm is depth-first search on a tree-shaped search route over all maximal motifs based on a technique called prefix-preserving closure extension. We also show an exponential lower bound and a succinctness result on the number of maximal motifs, which indicate the limit of a straightforward approach. The results of the computational experiments show that our algorithm can be applicable to huge string data such as genome data in practice, and does not take large additional computational cost compared to usual frequent motif mining algorithms. This work is done during the Hiroki Arimura’s visit in LIRIS, University Claude-Bernard Lyon 1, France.     

抽象集的一组结论

以集论与空间为基点，导出证明有关铀象集的一组结论。     

非单调二元非线性算子方程组的迭代求解

利用锥与半序理论和混合单调算子理论 ,讨论 Banach空间中非单调二元非线性算子方程组解的存在性与唯一性 ,并给出收敛于方程组解的迭代序列和误差估计 ,改进和推广了混合单调算子方程和一元算子方程的某些相应结果 .     

利用Teager-Kaiser算子的多径信号抑制

为了解决多径干扰对无线定位精度的影响,该文在传统的窄带相关技术的基础上,利用TK算子对其进行改进。改进后的技术在不过多地增加计算负担的情况下,不仅保持了窄带相关技术对于长时延多径信号抑制的功能,而且还改善了其对短时延多径信号抑制效果不佳的缺陷。仿真结果证明,该算法对于无线信道的多径信号抑制起到了一定的改善作用,从而提高了无线定位精度。所以,该研究对于无线定位技术的工程应用和理论研究具有一定的参考价值。     

一类高阶正则左定问题的谱

通过分析左定与右定问题的关系，应用谱曲线和高阶右定问题的谱，研究了一类高阶左定问题谱的特性及谱对给定参数的可微性．     

凝聚随机算子的一个不动点定理

利用拓扑度的基本性质，给出了凝聚随机算子的一个不动点定理，由此推广了Altman定理，为进一步研究随机算子方程解的存在唯一性及解的近似方法提供了一个有力的工具。     

控股股东与经营者一体化存在的问题及其治理

文章通过对控股股东与高层管理者的关联性描述,指出了控股股东与经营者的一体化趋势;然后从产权理论、交易费用理论和控制权收益三个角度对这种趋势进行原因分析;最后针对一体化带来的负面影响提出相应的对策。     

电信运营商移动互联网运营模式研究

移动互联网是全球电信运营商未来重要的发展方向，论文从产业价值链角度对电信运营商发展移动互联网的运营模式进行研究，了解各种运营模式的特点，从收益角度分析各种模式的利弊，提出渠道模式将成为主流的运营模式，希冀对电信运营商发展移动互联网带来启示作用。     

AN ALGORITHMIC APPROACH TO BAYESIAN LINEAR MODEL CALCULATIONS

A framework is described for organizing and understanding the computations necessary to obtain the posterior mean of a vector of linear effects in a normal linear model, conditional on the parameters that determine covariance structure. The approach has two major uses; firstly, as a pedagogical tool in the derivation of formulae, and secondly, as a practical tool for developing computational strategies without needing complicated matrix formulae that are often unwieldy in complex hierarchical models. The proposed technique is based upon symbolic application of the sweep operator SWP to an appropriate tableau of means and covariances. The method is illustrated with standard linear model specifications, including the so-called mixed model, with both fixed and random effects.