Well-posedness of dual-phase-lagging heat conduction equation: higher dimensions

The dual-phase-lagging heat conduction equation is shown to be of one unique solution for a finite region of dimension n (n?2) under Dirichlet, Neumann or Robin boundary conditions. The solution is also found to be stable with respect to initial conditions. The work is of fundamental importance in applying the dual-phase-lagging model for the microscale heat conduction of high-rate heat flux.     

中国民航信息系统现状及发展展望

介绍了中国民航信息系统的现状和与实际业务需求的差距,接着从系统设计理念、核心系统、新系统新功能和信息系统整合等多个方面详细阐述了民航信息系统的发展思路,最后强调了建立新一代民航信息系统的紧迫性,具备很强的指导意义。     

甬江感潮河流上下游码头群对河道行洪的联合影响

为分析甬江上下游码头群对河道行洪的联合影响,基于Delft3D数学模型开展了典型潮洪条件下甬江上下游不同码头群对河道水流特性的影响研究,结果表明:单段码头群位置距河口越远,或码头分布越密集,引起的水位壅高程度越大;在不同码头群共同产生壅水影响的区域,全河段码头群引起的河道洪水位变化比各码头群单独影响时增大,在不同码头群产生水位壅高和降低影响的河段,全河段码头群作用下水位影响部分相抵,但由于降低幅度小于壅高幅度,河道洪水位变化仍呈增大状态;码头群工程局部流速减少区域和外侧河道流速增加区域均呈带状分布,全河段码头群联合作用加剧了单段码头群引起的河道流速的变化且流速减小程度较流速增加程度大。     

Granular Rough Theory: A representation semantics oriented theory of roughness

The present work is an archival paper for a series of contributions proposed in last few years on building a theory of roughness over pure mereological relations among information granules. There are five major efforts taken in the present paper: (1) emphasizing on the representational semantics of theory of roughness: to approximately represent a class of entities characterized by some aspects in terms of entity collections described at other aspects; (2) defining a representation model Granular Representation Calculus (GrRC) to synthesize complex information systems from information granules; (3) establishing notion of Granular Rough Theory (GrRT) over information granules operated in terms of GrRC; (4) extending GrRC/GrRT to various computational environments such as multi-agent systems and ontological computing environments; (5) exploring pragmatic aspects of GrRC/GrRT in implementing prototypes with data model and object programming orientations, and proposing an Ontology-Driven Web Information System as a granular-rough computational Web intelligence framework over GrRC/GrRT.     

Feature selection and parameter optimization for support vector machines: A new approach based on genetic algorithm with feature chromosomes

Support vector machines (SVM) are an emerging data classification technique with many diverse applications. The feature subset selection, along with the parameter setting in the SVM training procedure significantly influences the classification accuracy. In this paper, the asymptotic behaviors of support vector machines are fused with genetic algorithm (GA) and the feature chromosomes are generated, which thereby directs the search of genetic algorithm to the straight line of optimal generalization error in the superparameter space. On this basis, a new approach based on genetic algorithm with feature chromosomes, termed GA with feature chromosomes, is proposed to simultaneously optimize the feature subset and the parameters for SVM.To evaluate the proposed approach, the experiment adopts several real world datasets from the UCI database and from the Benchmark database. Compared with the GA without feature chromosomes, the grid search, and other approaches, the proposed approach not only has higher classification accuracy and smaller feature subsets, but also has fewer processing time.     

安全中间件——公共安全编程接口的设计和实现

公共安全编程接口(CSPI)是安全中间件与用户之间的接口，通过使用公共安全编程接口用户可以透明地利用安全中间件完成安全服务。该文介绍了安全中间件的体系结构，给出了公共安全编程接口的设计和实现。     

感潮河道桥梁和码头工程群对行洪累积影响

以宁波甬江流域感潮河段所建工程群为研究对象,基于Delft3 D数学模型开展了典型洪潮条件下桥梁和码头群对河道行洪的累积影响研究,对比分析单类工程群和两类工程群对河道洪水位和流速的影响.结果表明:桥梁和码头群对河道行洪存在累积影响,位置集中在宁波大学上游的甬江、奉化江和姚江河段;在两类工程群单独作用下均存在水位(流速)...     

由VTRR算法为DiffServ提供QoS的一种方法

DiffServ是解决宽带Internet QoS控制的一种可行方案,它在边界节点将不同的QoS要求映射成PHB.对每类具有相同PHB的IP业务流,应用VTRR公平调度算法.VTRR算法允许在竞争带宽的业务流中公平共享分配的带宽.将VTRR与RSVP结合使用,能为DiffServ提供QoS保证.     

一种优化的直接匿名证言协议方案

DAA(direct anonymous attestation)既解决了隐私CA(certificate authority)的瓶颈问题,又实现了对TPM(trusted platform module)芯片的认证和匿名,是当前可信计算平台身份证明最好的理论解决方案之一.但是该协议基于强RSA困难假设,实现过程中不仅涉及到多个实体,而且涉及大量的耗时运算.突出的性能问题制约了该协议的广泛应用.基于普通椭圆曲线离散对数的困难性假设,提出了一种较为优化的直接匿名证明方案TMZ-DAA.该方案仅依赖普通椭圆曲线离散对数的困难性假设,涉及到的主要运算是椭圆曲线的点加和标量乘,复杂性大大降低,不仅密钥长度和签名长度方案较短,而且在总性能方面得到较大提高,降低了Join协议、Sign协议以及Verify算法中TPM,Host,Issuer以及Verifier等各个参与实体的计算量,为基于椭圆曲线的TPM提供了可行的隐私性保护解决方案.利用理想系统/现实系统模型对该方案的安全性进行分析和证明.结果表明,该方案满足不可伪造性、可变匿名性和不可关联性.