The Infinity Tree: Representing Infinities of Real Numbers with Countably Infinite Tree Structures

This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers is not countably infinite. Likewise, countably infinite tree structures could represent all real numbers, and all points in any number of dimensions in multi-dimensional spaces. The objective of this paper is not to overturn previous research based on Cantor’s argument, but to suggest that this situation may be treated as a definitional or axiomatic choice. This paper proposes a “non-Cantorian” branch of cardinality theory, representing all these infinities with countably infinite tree structures. This approach would be consistent with the Continuum Hypothesis.

An NC Algorithm for Sorting Real Numbers in <em>O</em>(nlogn/√<span style="font-size: 14px;font-weight: bold;margin-left:-2px;margin-right:2px;border-top:2px solid black;">loglogn</span>) Operations

We apply the recent important result of serial sorting of n real numbers in time to the design of a parallel algorithm for sorting real numbers in time and operations. This is the first NC algorithm known to take operations for sorting real numbers.

Origin of Sexy Prime Numbers, Origin of Cousin Prime Numbers, Equations from Supposedly Prime Numbers, Origin of the Mersenne Number, Origin of the Fermat Number

We have found through calculations that the differences between the closest supposed prime numbers other than 2 and 3 defined in the articles are: 2;4: and 6. For those whose difference is equal to 6, we showed their origin then we classified them into two categories according to their classes, we showed in which context two prime numbers which differ from 6 are called sexy and in what context they are said real sexy prime. For those whose difference is equal to 4, we showed their origin then we showed that two prime numbers which differ from 4, that is to say two cousin prime numbers, are successive. We made an observation on the supposed prime numbers then we established two pairs of equations from this observation and deduced the origin of the Mersenne number and that of the Fermat number.

Establishment of Real-Time Quantitative PCR Method for the Determination of Transposon Copy Number in Cronobacter sakazakii

[Objective] This study aimed to establish a Real-Time quantitative PCR method for the determination of transposon copy number in C. sakazakii. [ Method ] With single-copy housekeeping gene atpD as the reference gene, recombinant plasmid containing both single-copy housekeeping gene atpD and EZ-TN5 transposon was constructed; based on the established standard curves for real-time quantitative detection of atpD gene and EZ-TN5 transposon, copy number of atpD gene and EZ-TN5 transpason in three C. sakazakii mutants was detected and the ratio was calculated. [ Result] Correlation coefficients of the standard curves for real-time quantitative detection of atpD gene and EZ-TN5 transposon were 0. 999 and 0.998, respectively ; the ratios of copy number of atpD gene and EZ-TN5 transposon in three C. sakazakii mutants were 0.98, 1.17 and 0.91, respectively, which indicates that EZ-TN5 transpeson in C. sakakii mutants is a single-copy. [ Conclusion] Real-time quantitative PCR method established in this study had high availability and could replace the Southern blot method to detect the copy num- ber of EZ-TN5 transposon in different bacteria.

基于实数化的均匀圆阵矩阵重构方法

为了减小低快拍数和低信噪比下采样协方差矩阵误差,并降低其运算复杂度,提出了一种基于实数化的均匀圆阵采样协方差矩阵重构方法。针对均匀圆阵的特点,通过组建特殊的基向量,构成特殊的重构矩阵。通过将采样协方差矩阵实数化,进一步降低了重构矩阵的复杂度。考虑到多通道不一致性对重构矩阵的影响,引入0位校正算法,提高了重构方法的稳健性。最后应用重构后的协方差矩阵进行子空间类波达方向估计(direction of arrival,DOA)。实验仿真证明,该特殊重构矩阵在实数化下与原矩阵重构能力相同;当快拍数为100、信噪比为0 dB时,双信源分辨力较重构前由74%提高到95%以上;理论重构运算复杂度降低到原来的53.99%。

混合级联H桥逆变器的新型SHEPWM功率均衡控制策略

对于直流侧电压比为1∶1∶2的混合级联H桥逆变器,传统的指定谐波消除脉宽调制法(SHEPWM)存在各单元间输出功率不均衡问题,因此,提出一种双层功率均衡调制策略。首先,通过对消谐方程组中的基波幅值方程表达式进行等效拆分,使2个低压H桥单元的输出电压基波幅值之和与高压H桥单元的输出电压基波幅值相等,实现了高低压H桥单元间的功率均衡,即外层功率均衡。其次,利用逻辑运算的方法对低压单元的初始驱动信号进行逻辑重组,实现2个低压单元间的功率均衡,即内层功率均衡;然后使用改进的实数型遗传算法(IRCGA-2)求出消谐方程组的解,消除指定的谐波,得到高质量的输出电压。最后,通过仿真和实验证明了调制策略的正确性与有效性。

基于Si_(3)N_(4)微环混沌光频梳的Tbit/s并行实时物理随机数方案

本文结合片上Si_(3)N_(4)超高Q微环的混沌光频梳和高速现场可编程门阵列,提出并实验验证了一种超高速的并行实时物理随机数方案.结果表明,Si_(3)N_(4)超高Q微环实验得到的光频梳齿包含数百个信道,通过调节Si_(3)N_(4)微环的工作状态使其处于光学混沌态,从而成为性能优良的物理熵源.采用现场可编程门阵列(FPGA)板载的多位模数转换器,对滤波后频梳的光混沌信号进行离散采样量化,生成8位二进制比特流.对该比特流进行实时的自延迟异或处理,并保留4位最低有效位,实验最终实现了单信道实时速率达5 Gbits/s的合格物理随机比特流.结合实验中数目达294的混沌光频梳齿,本方案的并行实时随机数的吞吐量可望达到1.74 Tbits/s.这些结果可为实时物理随机数源提供集成、超高速的新可选方案.

转基因草莓植株cNHX1基因表达水平和拷贝数的Real Time PCR分析

分析了转cNHX1基因的草莓不同植株的外源基因表达水平和cNHX1基因的拷贝数。结果表明:不同转基因株系cNHX1基因表达水平存在差异,而且这种差异随盐胁迫时间的延长而更明显。在6个株系中,T6株系有最高和最稳定的cNHX1基因表达水平,而T2株系的表达水平最低。对转基因植株基因组cNHX1基因拷贝数的分析表明,T3、T6、T8和T14的含量相似,而与T2株系相差289%～310%,推测T3、T6、T8和T14株系为单拷贝植株,而T2株系为3拷贝株系。

结合遗传算法的水库汛限水位动态控制模型研究

针对水库汛限水位动态控制问题,提出一种新的自适应交叉变异遗传算法,解决了水库防洪效益与发电效益之间的矛盾问题,实现了水库水位的调整,缓解了防洪效益与发电效益的冲突。遗传算法使原始汛期水位提升了0.7m,蓄水量提升了2947m^(3),同时增加了发电量233.33×10^(4) kW·h。基于峡山水库实例试验的研究结果表明,结合遗传算法的水库汛限水位动态控制模型,不仅可对水位进行实时性调节,还能提升水库效益,研究结果可应用于各水库防洪系统。

基于MK的实数公理系统相容性和范畴性的Coq形式化

数学定理机器证明是人工智能基础理论的深刻体现.实数理论是数学分析的基础,实数公理系统是建立实数理论的重要方法.Morse-Kelley公理化集合论(MK)作为现代数学的基础,也为实数构建提供了严谨的数学框架和工具.本文使用定理证明器Coq,基于MK对实数公理系统进行了深入探索.在优化了MK形式化代码的基础上,形式化构建了完整的实数公理系统,并通过形式化Landau《分析基础》中的实数模型,证明其相对于MK相容,此外,还形式化证明了实数公理系统所有模型在同构意义下是唯一的,验证了实数公理系统的范畴性.本文全部定理无例外地给出Coq的机器证明代码,所有形式化过程已被Coq验证,并在计算机上运行通过,充分体现了基于Coq的数学定理机器证明具有可读性、交互性和智能性的特点,其证明过程规范、严谨、可靠.该系统可方便地应用于拓扑学和代数学理论的形式化构建.谨以此文庆祝我国著名控制系统专家秦化淑研究员九十华诞!

三种定义域下Bohr概周期函数与Bochner概周期函数等价性的证明

采用构造法与反证法,针对实数集、整数集,以及时标的不同特点,分别给出了三种定义域下,Bohr概周期函数与Bochner概周期函数等价性的证明。

基于C#语言的不动产附图二维码批量生成研究

为深入贯彻广东省“十四五”规划中“建设幸福广东”新目标,进一步促进广州智联汽车小镇“多测合一”服务项目落地,针对广州市不动产权附图中重要信息人工输入慢、耗时长等关键问题,利用C#编程语言设计实现了不动产附图二维码以及不动产单元号的批量生成程序,生产实践证明了程序能快速生成附图二维码和不动产单元号,提高了生产效率,具有较高的实用价值。

功能目的理论视角下饮食文化中实指和虚指数字的英译研究——以中华美食“八大菜系”为例

中国饮食文化极为繁荣,饮食在人们日常生活中占有重要的地位。该文在目的论视角下,以中华美食“八大菜系”为例,对饮食文化中实指和虚指数字的英译进行分析,探究“八大菜系”中数字翻译的准确性和可读性,避免实指和虚指数字英译的乱译现象。研究内容分为4部分:首先,对目的论和饮食文化中虚实数字英译的介绍;其次,把目的论三原则运用到饮食文化虚实数字的英译中;再次,尝试以“八大菜系”为例提出中文菜名数字英译的建议和方法;最后,总结翻译方法和技巧,即弄清楚这些数字背后的真正含义,以及区别菜名中的实指和虚指数字,以达地道翻译的目的。

北斗三号PPP-B2b信号精密单点定位服务可用性分析

针对北斗三号(BeiDou-3 Navigation Satellite System,BDS-3)PPP-B2b信号精密单点定位(precise point positioning,PPP)服务可用性,以改正参数的可用性比例、平均可用卫星数和改正参数匹配性为指标进行了系统分析.结果表明:在中国及周边地区,BDS-3 PPP-B2b信号改正参数的可用性在71%~95%,且在北京地区达到最大,GPS改正参数可用性在68.5%~88.6%,差于BDS-3.中国及周边地区用户缺少PPP-B2b信号改正参数的卫星观测弧段主要集中在低高度角时段,其改正参数的可用性随着截止高度角的增大而增大;BDS-3、GPS和BDS-3/GPS在中国及周边地区的改正数可用平均卫星数分别约为8颗、7颗和15颗,可以确保有效的实时PPP(real time PPP,RT-PPP)服务性能,但平均约有1颗BDS-3卫星和2颗GPS卫星因为缺少PPP-B2b信号改正参数而无法参与RT-PPP服务;对于赤道以南地区,单个系统基本无法提供有效的PPPB2b服务,其改正参数的平均可用性低于50%,但BDS-3/GPS双系统在部分低纬度地区可提供约7~11颗的可用卫星;由于轨道改正参数和钟差改正参数更新频率不一致,在钟差改正数版本号(IOD Corr)参数更新时,会出现短暂的改正参数不匹配情况.

转基因本氏烟草中CtDXR基因拷贝数及耐盐耐高温功能的初步分析

评估转基因本氏烟草中CtDXR基因的拷贝数,并初步分析其耐盐与耐高温能力。首先利用Southern Blot技术确定野生型本氏烟草中Actin基因的拷贝数,并以Actin基因为内参基因,以转CtDXR基因本氏烟草为材料,采用实时荧光定量PCR方法,检测转基因植株中CtDXR基因的拷贝数。最后,初步分析转基因植株的耐盐与耐高温能力。基于PCR方法,随机检测10株T1代转基因本氏烟草植株均能扩增出目的条带,表明它们均已成功转入目的基因CtDXR;Actin基因在本氏烟草基因组中为单拷贝基因;以Actin基因为内参基因,最终确定80%的转CtDXR基因植株为单拷贝或低拷贝株系;盐胁迫下,转CtDXR基因植株的株高(P<0.01)、侧根数(P<0.01)与鲜重(P<0.001)优于野生型植株,高温胁迫下,转CtDXR基因植株的株高(P<0.01)、叶片数(P<0.01)与鲜重优于野生型植株,表明转基因植株具有更强的耐盐和耐高温能力。利用研究建立的转基因本氏烟草外源基因拷贝数的检测方法,对转CtDXR基因植株完成外源基因拷贝数的鉴定,且初步鉴定了CtDXR基因具有耐盐与耐高温功能。

高层结构-混联Ⅱ型惯容阻尼耗能体系减震性分析

针对高层结构中设置混联Ⅱ型惯容阻尼器组成耗能体系的随机响应分析复杂的问题,提出了结构位移及阻尼器阻尼力响应的封闭解,并基于所获得的封闭解探究了实模态振型数对分析精度的影响和在原结构层间位移超限楼层设置阻尼器能有效减震的布置策略。首先,根据混联Ⅱ型惯容阻尼器力学构造图及设置方式,建立阻尼器阻尼力与结构节点水平位移的微分型本构关系进而重构耗能体系的地震动方程。其次,利用实模态解耦法获得高层结构简明等效的动力学参数,运用功率谱二次式分解法推导出结构节点相对于地面的绝对位移、竖向构件层间位移及阻尼器阻尼力等响应的功率谱精确二次式解进而推导出耗能体系基于双过滤白噪声激励下系列响应的0~2阶谱矩简明封闭解。最后,通过算例,验证了所提封闭解的正确性;研究了实模态振型数对系列响应谱矩分析精度的影响和阻尼器设置位置对结构减震效果的影响。研究表明:对于多自由度结构响应分析时,建议采用原结构自由振动分析时质量参与系数累计达100%时所对应的振型数,可获得稳定的精度和提高大型复杂结构设置混联Ⅱ型惯容阻尼器的响应的分析效率;通过在原结构层间位移超限楼层或连续多层层间位移超限的楼层中间隔一层设置参数合适的混联Ⅱ型惯容阻尼器可有效降低结构的地震动响应,所提惯容阻尼器设置策略具有较好的经济性。所提解析解和惯容系统在高层结构的设置策略可为混联Ⅱ型惯容阻尼器在实际工程应用中提供有益的参考价值。

考虑实时载客量的公交信号优先策略改进控制模型

传统的公交信号优先策略往往依据公交车到达交叉口时刻或公交车固定载客量,无法有效地反映公交车实际载客量影响。针对该问题,考虑公交车实时载客量,以通过交叉口所有乘客的人均延误最小为优化目标,建立了交叉口公交信号优先控制模型;将公交IC卡和GPS数据进行匹配,比对公交站点乘客上车数,推算公交站点乘客下车数,分析了公交车通过交叉口时的实时载客量;提出了公交信号优先改进策略,分析该策略下各相位延误,引入公交优先强度系数;构建了交叉口人均延误模型和公交信号优先控制模型,采用启发式搜索算法求解该模型。研究结果表明:与传统的公交信号优先策略相比,考虑实时载客量的改进绿灯延长、改进绿灯早启公交信号优先策略的周期人均延误分别降低了20.98%、18.11%。

Identification of chloroquine resistance Pfcrt-K76T and determination of Pfmdr1-N86Y copy number by SYBR Green I qPCR

Objective:To identify prevalence of chloroquine resistance point mutation at(Pfcrt,K76T)and(Pfindr1.N86Y) copy number variation.Methods:SYBR Green I based real time PCR was used.One hundred and thirty-three samples were analyzed for(Pfcrt,K76T) and(Pfmdr1.N86Y) copy number from dried blood spot.Parasite DNA was extracted using high pure DNA preparation kit.The amplification of DNA was done by using AccuPower 2* GreenStar '' qPCR Master mix.For quantification purpose a new primer pair was designed for 178 base pair template from complete genome sequence of Plasmodium falciparum strain 3D7 at NCBI.Absolute quantification method was used to determine the Pfmdr1-N86 Y copy number variations.Standard curve was built from strain3D7 gDNA since it has single copy of Pfindr1 per haploid genome.The known positive controls with single and multi-copy number of Pfindr1 gene were included in each experiment.The copy number ratio of the samples to the standard calibrator was made to obtain the fold difference among the samples with respect to copy number variation.Results:Out of 133 samples 73(54.89%) were confirmed as mutant(Pfcrt,76T) and the remaining 60(45.11%) were genotyped as wild type(Pfcrt,K76).The(Pfindr1.N86Y) copy number variation was determined for 133 clinical samples.Out of these samples 61(45.86%)had single copy and the remaining 72(54.14%) had multi-copy numbers higher than 1.5 copies per genome.Thirty-four(25.56%) multi-copies were between 1.5 and 2.5 copies per genome while 38(28.57%) were more than 2.5 copies per genome.The minimum and maximum copies per genome were 0.474 and 4.741.respectively.Conclusions:The study showed high prevalence level and fixation of Pfcrt.76 T mutation after chloroquine withdrawal.The prevalence of Pfindr1 copy number variant suggested that the presence of modulating factor for emergence of Plasmodium falciparum strains with higher copy numbers.However,the prevalence level was not statistically significant.

A New Algorithmic Approach for Detection and Identification of Vehicle Plate Numbers

This work proposes a method for the detection and identification of parked vehicles stationed. This technique composed many algorithms for the detection, localization, segmentation, extraction and recognition of number plates in images. It is acts of a technology of image processing used to identify the vehicles by their number plates. Knowing that we work on images whose level of gray is sampled with (120×180), resulting from a base of abundant data by PSA. We present two algorithms allowing the detection of the horizontal position of the vehicle: the classical method “horizontal gradients” and our approach “symmetrical method”. In fact, a car seen from the front presents a symmetry plan and by detecting its axis, that one finds its position in the image. A phase of localization is treated using the parameter MGD (Maximum Gradient Difference) which allows locating all the segments of text per horizontal scan. A specific technique of filtering, combining the method of symmetry and the localization by the MGD allows eliminating the blocks which don’t pass by the axis of symmetry and thus find the good block containing the number plate. Once we locate the plate, we use four algorithms that must be realized in order to allow our system to identify a license plate. The first algorithm is adjusting the intensity and the contrast of the image. The second algorithm is segmenting the characters on the plate using profile method. Then extracting and resizing the characters and finally recognizing them by means of optical character recogni-tion OCR. The efficiency of these algorithms is shown using a database of 350 images for the tests. We find a rate of lo-calization of 99.6% on a basis of 350 images with a rate of false alarms (wrong block text) of 0.88% by image.

有序规范实数对多相似度K最近邻分类算法

针对最近邻分类算法性能受到所采用的相似度或距离度量方法影响大,且难以选择最优的相似度或距离度量方法的问题,提出一种采用多相似度的基于有序规范实数对的K最近邻分类算法(OPNs-KNN)。首先,在机器学习领域中引入有序规范实数对(OPN)这一新的数学理论,利用多种相似度或距离度量方法将训练集和测试集中所有样本全部转换为OPN,使每个OPN均包含不同的相似度信息;然后再通过改进的最近邻算法对OPN进行分类,实现不同相似度或距离度量方法的结合与互补,从而提高分类性能。实验结果表明,在Iris、seeds等数据集上与距离加权K近邻规则(WKNN)等6种最近邻分类的改进算法相比,OPNs-KNN的分类准确率提高了0.29~15.28个百分点,验证了所提算法能大幅提升分类的性能。