浅析数据挖掘与企业市场营销战略

数据挖掘是客户关系管理的重要组成部分,而客户关系管理的核心是营销管理。在高度信息化的社会的今天,数据挖掘在市场营销决策中起到越来越重要的作用,通过它可以实现对客户深度的把握,研究老客户,发现新客户,让企业实时把握住市场动态,及时地调整企业的营销策略,以在激烈的市场竞争中立于不败之地。     

The Photochemical Synthesis of Fine Chemicals with Sunlight

The light of the sun can be used directly for changing chemical structures photochemically. Any industrial application must conform to the limitations imposed by the spectral distribution of the photons from the sun, the interruptions to the radiation due to the day/night rhythm, and the weather. In this review, we describe the photochemical potential of the sun, give a fundamental treatment of the concept of photoreactors driven by sunlight (abbreviated to solar photoreactors), and give an account of the realization of this concept in the first pilot plant on the “Plataforma Solar de Almeria” in southern Spain and in other activities in this field. Based on experimental data from photochemical investigations on the pilot plant scale, possibilities, limitations, and the potential growth of solar photochemistry are described. Solar photochemistry, in our opinion, is a technique which could make a contribution to the chemistry of the future because of its photochemical synthesis potential, the avoidance of waste products, and the direct utilization of the sun, not only as a primary energy source, but also as a reaction partner.     

一种区间数的因子分析技术及其在证券市场中的应用

传统的因子分析技术能够有效地对高维变量空间进行降维处理,但它对于样本空间却缺乏行之有效的降维效果.为了解决这一问题,一种针对大量样本数据、新的因子分析技术———区间数因子分析技术(intervaldatafactoranalysis,IFA)被提出并得到了迅速的发展。IFA方法对传统的数据概念做了本质性的扩张,运用'数据打包'的理念,对海量原始数据在不破坏其原有内在逻辑关系的前提下,可以进行变量和样本点维度的双重降维。本文详细阐述了区间数因子分析技术的原理,并以中国股票市场为案例研究背景,结果表明IFA分析技术对大规模多维数据系统做综合简化是十分有效的。     

网上协作学习模式研究

主要针对网上协作学习的基本模式、实现方式和存在的问题进行了初步研究。     

适于复杂信息融合系统的近似联合概率数据关联算法

文中在B.Zhou提出的直接概率计算(DC)和近似概率计算(AC)算法基础上提出了一种新的近似多传感器多目标联合概率数据关联算法。近似概率法是以一个目标为中心的近似聚为构造互联事件的起点，并在计算中将DC和AC结合得到的一种全邻的点迹—航迹关联算法，它能有效地提高目标点迹—航迹的关联正确率，在计算时耗上较完全联合概率法快得多，能满足工程中实时性的要求。将其在杂波下目标密集、航迹复杂的数据融合系统中进行实验，对关联正确率，关联耗时等与最近邻法进行了比较，效果较好。     

非线性编辑系统在新闻节目制作中使用的优与劣

随着数字技术和计算机技术的发展,非线性编辑系统已经越来越广泛地应用在电视节目制作中.阐述了非线性编辑系统在电视新闻节目(包括新闻专题节目、以新闻消息为主的日播节目等)制作中具有的优势和存在的劣势.     

视频特技切换台的原理与功能

本文较系统、通俗地介绍了模拟视频特技切换台的矩阵输入、混合/效果放大器(M/E)、下游键、系统控制和同步发生器等电路单元,介绍了特技切换台的切换、混合、扫变、键控的基本原理和功能。     

智能同步光网络与多业务传送平台的应用

智能同步光网络(ASON)与多业务传送平台(MSTP)固其先进的智能性、可靠性、灵活性而得以发展和运用。本文根据智能光网络与多业务传送平台枝术的发展情况，结合北京通信传送网络的实际情况，探讨北京通信传送网的建设思路．     

Implementation and experimental study on fast object modeling based on multiple structured stripes

In this paper, a practical structured light-based system for fast object modeling and reconstruction is reported. The system consists of an off-the-shelf digital projector, a video camera and a turntable. The system calibration is implemented accurately and automatically by taking a single image of an illuminated calibration template. The multiple color light stripes emitted by the projector adopt only three colors and the color can be modified easily according to the surface texture of the object. This makes the system widely applicable in many situations, and the assumption about color neutrality, which is a limitation to other similar systems, can be largely relaxed. The registration and merging algorithm is greatly simplified by employing a turntable. The validity and high accuracy of the method are demonstrated by extensive real experiments.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.