反射张量在射线追踪法中的应用

针对射线追踪法(shooting and bouncing ray, SBR)中反射路径计算,提出了采用反射张量表示单次和多次反射作用的方法,并进行了详细推导。对于同一反射路径,射线方向、极化方向的变化可以用同一个张量与原方向的点积表示。通过分析张量的运算,研究了单站情形不同极化下射线追踪法计算结果。算例表明,反射张量表示方法用于射线追踪法正确、有效,可方便地对各种构型的散射目标进行分析研究。     

一种基于复杂性测度的干扰样式识别方法

提出了一种基于复杂性测度的干扰样式识别方法．该方法首先分析接收信号的分形维数和LZ复杂度．通过使用一定数量样本,获得每种干扰样式分形维数和Lz复杂度分布的均值中心和方差．然后采用指数距离计算待识别样本与每种干扰的均值中心和方差的距离,按最小距离原则来对干扰样式进行识别．最后给出了仿真结果及结论．     

Performance Prediction for Performance-Sensitive Queries Based on Algorithmic Complexity

Performance predictions for database queries allow service providers to determine what resources are needed to ensure their performance. Cost-based or rule-based approaches have been proposed to optimize database query execution plans. However, Virtual Machine （VM）-based database services have little or no sharing of resources or interactions between applications hosted on shared infrastructures. Neither providers nor users have the right combination of visibility/access/expertise to perform proper tuning and provisioning. This paper presents a performance prediction model for query execution time estimates based on the query complexity for various data sizes. The user query execution time is a combination of five basic operator complexities： O（1）, O（log（n））, O（n）, O（nlog（n））, and O（n2）. Moreover, tests indicate that not all queries are equally important for performance prediction. As such, this paper illustrates a performance-sensitive query locating process on three benchmarks： RUBiS, RUBBoS, and TPC-W. A key observation is that performance-sensitive queries are only a small proportion （20%） of the application query set. Evaluation of the performance model on the TPC-W benchmark shows that the query complexity in a real life scenario has an average prediction error rate of less than 10% which demonstrates the effectiveness of this predictive model.     

基数排序的一种优化应用

基数排序算法常用于字符串的排序,但对于长度相差较大的字符串,普通的基数排序算法会有较大的时间浪费,本文中优化后的算法可降低算法的时间复杂度.     

基于信息融合的大飞艇自适应姿态解算算法

现有计算大飞艇姿态角的平衡滤波算法虽然融合了加速度和角速度信息,但其未对加速度的适用条件进行分析,从而导致了积累误差和动态解算准确性问题.针对该算法的不足,提出了根据飞艇的不同运动状态来调整姿态解算算法的融合加速度和角速度数据的自适应姿态解算算法,并通过Matlab实验验证了算法的有效性.实验结果表明,该算法有效地解决了平衡滤波算法的不足,通过引入SMV(signalmagnitudevector,信号量向量),使大飞艇的运动状态得到了准确判断,从而使积累误差问题得到了有效改善,同时提高了大飞艇的动态解算准确性.     

准双曲面齿轮螺旋变性半展成法加工调整方法

针对大轮和小轮加工刀盘轴线不平行造成接触区成对角接触及调整修正复杂的问题,提出了一种新的加工方法——螺旋变性半展成法,研究了螺旋变性半展成法的加工原理、切齿方法和曲率修正方法,建立了准双曲面齿轮副的切齿模型．给出了机床调整关系式．最后利用齿面接触分析对实例进行了验证,结果表明：采用螺旋变性半展成法加工准双曲面齿轮副时,大轮和小轮刀盘轴线互相平行,从本质上避免了接触区出现对角接触的现象,降低了调整修正过程的复杂程度．     

文化系统论要略——兼谈文化复杂性(二)

文化是人类社会的一种分系统,具有复杂巨系统的所有共性:开放性,巨型性,内在异质性,非线性,动态性,不确定性,以及这些特性整合起来所涌现的复杂性。文化的特点又在于它并非物质性的存在,而是信息性、意识性的存在,即观念形态的存在,具有观念形态特有的复杂性。本文以系统论的观点对文化作一纲要式的论述,同时考察文化系统的特殊复杂性。     

Complicated phenomena of the Beichuan-Yingxiu surface fracture zone during Wenchuan <Emphasis Type="Italic">M</Emphasis>s8.0 earthquake in Sichuan Province,China

After Wenchuan Ms8.0 earthquake, the surface fractures have been investigated in Beichuan City and Yingxiu Town. It was found that the Beichuan-Yingxiu earthquake fracture zone trends northeastward, dipping to northwest. The earthquake fracture zone is mainly characterized by thrust faulting with small amounts of strike-slip movement, and demonstrating various complexities for different areas. The phenomena related to dextral strike-slip displacement are found in Beichuan City and those related to left-lateral strike-slip movement in Yingxiu Town. The compressive shortening of the two surface fracture zones in Beichuan City is 2.8-3.9 m and the left-lateral strike-slip displacement of the surface fractures in Yingxiu Town is 0.52 m.     

三维随机矩阵置乱变换的周期及其应用

 为了适合数字多媒体特性,实施多媒体加密与信息隐藏,生成充分大的密钥空间,使用了数论、近世代数、算法分析等工具,对高维随机矩阵置乱变换的精确周期进行了研究。给出三维随机整数矩阵A决定的置乱变换在任意模N下,其周期T(A,N)的精确表达式及上界估计,构造了求周期的快速算法,仅耗费O(log₂ N)² 次模N乘法便可得到T(A,N)。大量的算例和应用范例与理论结果相吻合。结论可用于建立数字多媒体的新型密码体制,实施高效率的加密。     

On <Emphasis Type="Italic">k</Emphasis>-error linear complexity of some explicit nonlinear pseudorandom sequences

Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol＇s, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.