Looking ahead: Joint small group detection and tracking in crowd scenes

Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes.     

Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.     

信息安全风险评估的模糊多准则决策方法

基于ISO/IEC17799标准建立了一个综合的信息系统风险分析框架,并运用模糊多准则决策(FMCDM)方法计算信息安全风险,根据风险等级矩阵(RLM)对信息资产风险进行级别划分,最终建立评估信息资产相关风险的完整模型。     

分类挖掘技术在高校人事管理中的应用

探讨分类挖掘技术在高校实际工作中的应用方式与应用领域。以高校人事管理为模型，应用数据挖掘中决策树算法，对高校人力资源数据源中的信息进行分析，发现其中有价值的数据模式，寻找其中存在的关系和规则，对高校人才规划提供比较客观的决策支持。     

两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

基于粗糙集信息观的决策表属性约简方法

粗糙集理论是近年来发展起来的一种有效的处理不精确、不确定、含糊信息的数学理论方法，它被广泛应用于相容和不相容决策表的属性约简和核属性计算。利用反例指出目前基于粗糙集信息观[2、6]的决策表属性约简和核属性计算方法的局限性。对决策表的性质作了深入的研究，研究发现文献[2、6]方法的不足原因是：它们没有考虑U／ind（C）中等价类的相客性。给出了基于U／ind（C）中等价类相客性的属性约简定义和核属性定义，并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。讨论了该方法同文献[2、6]方法的区别。最后用相同实例验证了该方法的有效性。     

静脉滴注的临床决策

提出了静脉滴注的动力学一般模型，讨论了模型的性质，在给药剂量确定的条件下，探讨了调整滴注速率使治疗效果达到最佳的临床决策方法。     

中低速率语音波形编码

提出了一种波形编码的新方法，阐述了其编码原理。该编码算法简单，恢复的语音质量较好。由于利用了矢量量化技术，所以该编码速率较低。     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002