WEAK SEQUENCE-COVERING MAPPING AND CS-NETWORK

A mapping f: X→Y is called weak sequence-covering if whenever {ya} is a sequence in Y converging to y ∈ Y, there exist a subsequence {ynk} and xk∈f^-1(ynk)(k∈N) ,x∈f^-1 (y) such that xk→x. The main results are: (1) Y is a sequential, Frechet, strongly Frechet space iff every weak sepuence-covering mapping onto Y is quotient, pseudo-open, countably bi-quotient respectively, (2) weak sequence-covering mapping preserves cs-network and certain k-(cs-)networks, thus some new mapping theorems on k-(cs-)notworks are proved.

The Review of Land Use/Land Cover Mapping AI Methodology and Application in the Era of Remote Sensing Big Data

With the increasing number of remote sensing satellites,the diversification of observation modals,and the continuous advancement of artificial intelligence algorithms,historically opportunities have been brought to the applications of earth observation and information retrieval,including climate change monitoring,natural resource investigation,ecological environment protection,and territorial space planning.Over the past decade,artificial intelligence technology represented by deep learning has made significant contributions to the field of Earth observation.Therefore,this review will focus on the bottlenecks and development process of using deep learning methods for land use/land cover mapping of the Earth’s surface.Firstly,it introduces the basic framework of semantic segmentation network models for land use/land cover mapping.Then,we summarize the development of semantic segmentation models in geographical field,focusing on spatial and semantic feature extraction,context relationship perception,multi-scale effects modelling,and the transferability of models under geographical differences.Then,the application of semantic segmentation models in agricultural management,building boundary extraction,single tree segmentation and inter-species classification are reviewed.Finally,we discuss the future development prospects of deep learning technology in the context of remote sensing big data.

The Sequence-covering Compact Images of Paracompact Locally Compact Spaces

This paper gives internal characterizations of some sequence covering compact images and compact covering compact images of paracompact locally compact spaces, which improve some results on compact images of locally compact metric spaces.

磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值

目的探讨磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值。方法选取2020年1月至2022年11月在我院治疗的110例膝关节早期软骨退变患者(观察组),按照疾病严重程度分为轻度退变组及重度退变组,另选取同期在我院进行体检的64例健康者为对照组,受试者均行磁共振T1rho序列、T2 mapping技术扫描,测量受试者T2值及T1ρ值,探讨磁共振T1rho序列、T2 mapping技术在膝关节早期软骨退变早期诊断中的评估价值。结果观察组股骨外侧面、股骨内侧面、胫骨外侧面、胫骨内侧面、髋骨面T2值均明显高于对照组(P<0.05),重度退变亚组患者股骨外侧面、股骨内侧面、胫骨外侧面、胫骨内侧面、髋骨面T2值显著高于轻度退变者(P<0.05);观察组股骨内踝负重区、股骨内踝非负重区、股骨外踝负重区、股骨外踝非负重区、胫骨外侧平台区、胫骨内侧平台区、髌后软骨区磁共振T1ρ值明显高于对照组(P<0.05),重度退变亚组患者股骨内踝负重区、股骨内踝非负重区、股骨外踝负重区、股骨外踝非负重区、胫骨外侧平台区、胫骨内侧平台区、髌后软骨区磁共振T1ρ值明显高于轻度退变亚组患者(P<0.05);磁共振T1rho序列在膝关节早期软骨退变中早期诊断及严重程度评估中的的诊断ROC值及特异度明显高于T2 mapping技术(P<0.05),但后者具有更高的敏感度(P<0.05)。结论磁共振T1rho序列、T2 mapping技术均能有效反映膝关节早期软骨退变中软骨组织学成分变化情况,还可为膝关节软骨退变严重程度评估提供客观依据,二者具有一定互补价值。

CONVERGENT PROBLEM OF ITERATIVE SEQUENCES FOR NONLINEAR MAPPINGS WITH ERROR MEMBERS IN BANACH SPACES

In this paper,the approximation problems of Ishikawa iteration with errors of fixed points for asymptotically nonexpansive mappings and asymptotically pseudocontractive mappings in arbitrary real Banach spaces are investigated.Some necessary condition and sufficient condition for the convergence of iterative sequences are given respectively.The results thus extend and improve some recent corresponding results.

Mapping a Rice Glabrous Gene Using Simple Sequence Repeat Markers

Inheritance analysis and gene mapping of the glabrous trait were conducted using the crosses between a pubescent rice material Chuanxiang 29B （an aromatic elite maintainer line of hybrid rice）, and two glabrous rice materials, Lemont and R2 （R2 is a new restorer line of hybrid rice）. All F1 plants from the two crosses had pubescent leaves, confirming that the pubescence trait in Chuanxiang 29B is dominant over the glabrous trait. In F2 individuals, the segregation ratio of three pubescent to one glabrous plant suggests that a single glabrous gene was present in Lemont and R2. Using the bulked segregant analysis, the linkage analysis of the simple sequence repeat markers showed that the glabrous gene, gl-1, was flanked by GL311 and GL8 with the genetic distances of 0.19 and 0.92 cM on chromosome 5, respectively.

ON THE SHARP GROWTH,COVERING THEOREMS FOR NORMALIZED BIHOLOMORPHIC MAPPINGS IN C^n

In this article, a normalized biholomorphic mapping f defined on bounded starlike circular domain in Cn is considered, where z = 0 is a zero of order k ＋ 1 of f（z） - z. The sharp growth, covering theorems for almost starlike mappings of order α and starlike mappings of order α are established. Meanwhile, the construction of the above mappings on bounded starlike circular domain in Cn is also discussed, it provides the extremal mappings for the growth, covering theorems of the above mappings.

Construction of SNP genetic maps based on targeted next-generation sequencing and QTL mapping of vital agronomic traits in faba bean(Vicia faba L.)

Owing to the limitation of a large genome size(~13 Gb),the genetic and gene mapping studies on faba bean(Vicia faba L.)are lagging far behind those for other legumes.In this study,we selected three purified faba bean lines(Yundou 8137,H0003712,and H000572)as parents and constructed two F2 populations.These two F2 populations,namely 167 F2 plants in Pop1(Yundou 8137×H0003712)and 204 F2 plants in Pop2(H000572×Yundou 8137),were genotyped using a targeted next-generation sequencing(TNGS)genotyping platform,and two high-density single nucleotide polymorphisms(SNP)genetic linkage maps of faba bean were constructed.The map constructed from Pop1 contained 5103 SNPs with a length of 1333.31 cM and an average marker density of 0.26 cM.The map constructed from Pop2 contained 1904 SNPs with a greater length of 1610.61 cM.In these two F2 populations,QTL mapping identified 98 QTLs for 14 agronomic traits related to the flowers,pods,plant types and grains.The two maps were then merged into an integrated genetic linkage map containing 6895 SNPs,with a length of 3324.48 cM.These results not only lay the foundation for fine mapping and map-based cloning of related genes,but can also accelerate the molecular marker-assisted breeding of faba bean.

CONVERGENCE OF ISHIKAWA TYPE ITERATIVE SEQUENCE WITH ERRORS FOR QUASI-CONTRACTIVE MAPPINGS IN CONVEX METRIC SPACES

Some convergence theorems of Ishikawa type iterative sequence with errors for nonlinear general quasi-contractive mapping in convex metric spaces are proved. The results not only extend and improve the corresponding results of L. B. Ciric, Q. H. Liu, H. E. Rhoades and H. K. Xu, et al., but also give an affirmative answer to the open question of Rhoades-Naimpally- Singh in convex metric spaces.

Common Fixed Point Theorems for Sequences of φ-type Contraction Set-valued Mappings

In complete metric spaces, the common fixed point theorems for sequences of φ-type contraction set-valued mappings are established, and the corresponding random com- mon fixed point theorems for set-valued mappings are also obtained.

On Growth and Covering Theorem for Almost Spiallike Mapping of Type β with Order α

Let f（x） be an almost spirallike mapping of type β with order B on unit ball B of complex Banach space X. In this paper, we consider the growth and covering theorems for f（x）, we also prove that the estimation is precise when β=0 and still give growth upper bound and distortion upper bound for subordinate mapping. This result include some results known.

On Growth and Covering Theorem for Spiallike Mapping of Type β with Order α

In this paper, we consider growth and covering theorem for f（x）, where f（x） is spiallike mapping of type β with order α defined on unit ball B of complex Banach space, and x=0 is zero of order k＋1 for f（x）-x. We also dicate that the estimation is precise when β=0 and still give growth upper bound and distortion upper bound for subordinate mapping. This result include some results known.

Variant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences

Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.

Rapid Texture Mapping from Image Sequences for Building Geometry Model

An effective approach, mapping the texture for building model based on the digital photogrammetric theory, is proposed. The easily-acquired image sequences from digital video camera on helicopter are used as texture resource, and the correspondence between the space edge in building geometry model and its line feature in image sequences is determined semi-automatically. The experimental results in production of three-dimensional data for car navigation show us an attractive future both in efficiency and effect.

2D Conjugate Maps of DNA Sequences

Random sequences play an important role in wider security applications, such as mobile communication and network security. Due to DNA sequences owning natural randomness, in order to show DNA’s characteristics intuitively, this paper proposes a method to present DNA sequences as conjugate maps. The method includes two core models: measuring models to transfer DNA data into measurements, and visual models to test random sequences as distribution maps to show DNA’s characteristics. The spatial relations between sample DNA and CA random sequences are illustrated and compared in the end. The results show that the distribution of DNA sequences and CA random sequences has significant differences and similarities. It can provide a reference for in-depth visualization study of DNA sequences on their measurement maps.

SOME CONVERGENCE PROBLEM OF ITERATIVE SEQUENCESFOR ACCRETIVE AND PSEUDO-CONTRACTIVETYPE MAPPING IN BANACH SPACES

Some necessary and sufficient conditions for convergence of Ishikawa Mann and steepest descent iterative sequence for accretive and pseudo-contractive type mapping in Banach spaces were obtained. The results improve, extend and include some recent results.

On the Judgement of Full-Period Sequences and a Novel Congruential Map with Double Modulus on Z(p^n)

This paper studies the judgement problem of full-period maps on Z(p^n) and proposes a novel congruential map with double modulus on Z(p^n). The full-period properties of the sequences generated by the novel map are studied completely. We prove some theorems including full-period judgement theorem on Z(p^n) and validate them by some numerical experiments. In the experiments, full-period sequences are generated by a full-period map on Z(p^n). By the binarization, full-period sequences are transformed into binary sequences. Then, we test the binary sequences with the NIST SP 800-22 software package and make the poker test. The passing rates of the statistical tests are high in NIST test and the sequences pass the poker test. So the randomness and statistic characteristics of the binary sequences are good. The analysis and experiments show that these full-period maps can be applied in the pseudo-random number generation(PRNG), cryptography, spread spectrum communications and so on.

Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.

INJECTIVE MAPS ON PRIMITIVE SEQUENCES OVER Z/(p^e)

Let Z/（p^e） be the integer residue ring modulo p^e with p an odd prime and integer e ≥ 3. For a sequence a over Z/（p^e）, there is a unique p-adic decomposition a- = a-0 ＋a-1 .p ＋… ＋ a-e-l .p^e-1 where each a-i can be regarded as a sequence over Z/（p）, 0 ≤ i ≤ e - 1. Let f（x） be a primitive polynomial over Z/（p^e） and G＇（f（x）,p^e） the set of all primitive sequences generated by f（x） over Z/（p^e）. For μ（x） ∈ Z/（p）[x] with deg（μ（x）） ≥ 2 and gad（1 ＋ deg（μ（x））,p- 1） = 1, setφe-1 （x0, x1,… , xe-1） = xe-1. [μ（xe-2） ＋ ηe-3（x0, X1,…, xe-3）] ＋ ηe-2（x0, X1,…, xe-2） which is a function of e variables over Z/（p）. Then the compressing mapφe-1 ： G＇（f（x）,p^e） → （Z/（p））^∞ ,a-→φe-1（a-0,a-1, … ,a-e-1） is injective. That is, for a-,b-∈ G＇（f（x）,p^e）, a- = b- if and only if φe-1 （a-0,a-1, … ,a-e-1） = φe-1（b-0, b-1,… ,b-e-1）. As for the case of e = 2, similar result is also given. Furthermore, if functions φe-1 and ψe-1 over Z/（p） are both of the above form and satisfy φe-1（a-0,a-1,…,a-e-1）=ψe-1（b-0, b-1,… ,b-e-1） for a-,b-∈G＇（f（x）,p^e）, the relations between a- and b-, φe-1 and ψe-1 are discussed

Strong and Weak Convergence Theorems of the Sequence of Ishikawa Iterates for Demicontractive Mappings

ＳｔｒｏｎｇａｎｄＷｅａｋＣｏｎｖｅｒｇｅｎｃｅＴｈｅｏｒｅｍｓｏｆｔｈｅＳｅｑｕｅｎｃｅｏｆＩｓｈｉｋａｗａｉｔｅｒａｔｅｓｆｏｒＤｅｍｉｃｏｎｔｒａｃｔｉｖｅＭａｐｐｉｎｇｓＬｉｕＱｉｈｏｕ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｂｅｉ...