CFSA-Net:Efficient Large-Scale Point Cloud Semantic Segmentation Based on Cross-Fusion Self-Attention

Traditional models for semantic segmentation in point clouds primarily focus on smaller scales.However,in real-world applications,point clouds often exhibit larger scales,leading to heavy computational and memory requirements.The key to handling large-scale point clouds lies in leveraging random sampling,which offers higher computational efficiency and lower memory consumption compared to other sampling methods.Nevertheless,the use of random sampling can potentially result in the loss of crucial points during the encoding stage.To address these issues,this paper proposes cross-fusion self-attention network(CFSA-Net),a lightweight and efficient network architecture specifically designed for directly processing large-scale point clouds.At the core of this network is the incorporation of random sampling alongside a local feature extraction module based on cross-fusion self-attention(CFSA).This module effectively integrates long-range contextual dependencies between points by employing hierarchical position encoding(HPC).Furthermore,it enhances the interaction between each point’s coordinates and feature information through cross-fusion self-attention pooling,enabling the acquisition of more comprehensive geometric information.Finally,a residual optimization(RO)structure is introduced to extend the receptive field of individual points by stacking hierarchical position encoding and cross-fusion self-attention pooling,thereby reducing the impact of information loss caused by random sampling.Experimental results on the Stanford Large-Scale 3D Indoor Spaces(S3DIS),Semantic3D,and SemanticKITTI datasets demonstrate the superiority of this algorithm over advanced approaches such as RandLA-Net and KPConv.These findings underscore the excellent performance of CFSA-Net in large-scale 3D semantic segmentation.

Semi-supervised Affinity Propagation Clustering Based on Subtractive Clustering for Large-Scale Data Sets

In the face of a growing number of large-scale data sets, affinity propagation clustering algorithm to calculate the process required to build the similarity matrix, will bring huge storage and computation. Therefore, this paper proposes an improved affinity propagation clustering algorithm. First, add the subtraction clustering, using the density value of the data points to obtain the point of initial clusters. Then, calculate the similarity distance between the initial cluster points, and reference the idea of semi-supervised clustering, adding pairs restriction information, structure sparse similarity matrix. Finally, the cluster representative points conduct AP clustering until a suitable cluster division.Experimental results show that the algorithm allows the calculation is greatly reduced, the similarity matrix storage capacity is also reduced, and better than the original algorithm on the clustering effect and processing speed.

浮针结合SET技术治疗腰背肌筋膜炎临床观察

目的:观察浮针结合SET技术(悬吊运动)治疗腰背肌筋膜炎疗效并探究其作用机理。方法:选取腰背肌筋膜炎患者90例,应用随机数字表法随机分为治疗组和对照组(各45例),治疗组应用浮针结合SET技术进行治疗;对照组单纯采用浮针治疗,于治疗前、后,采用简化McGill量表和功能障碍评价量表(Roland-Morris)对两组进行评定比较,并于1月后回访患者统计复发率。结果:治疗2周后,两组的疼痛及功能障碍评分较治疗前均有改善(P<0.05),且治疗组优于对照组(P<0.05);治疗组和对照组的有效率分别为93.33%和88.89%,治疗组优于对照组;整个研究期间,90例患者均未出现不良反应。结论:浮针结合SET技术可显著改善腰背肌筋膜炎患者的疼痛及功能障碍,疗效优于对照组,并可显著降低本病的复发率。

A Correntropy-based Affine Iterative Closest Point Algorithm for Robust Point Set Registration

The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.

INVOLUTIONS WITH FIXED POINT SET RP(2m)∪P(2m, 2n + 1)

Let （M, T） be a smooth closed manifold with a smooth involution T whose fixed point set is a disjoint union of an even-dimensional real projective space and a Dold manifold. In some cases, the equivariant bordism classes of （M, T） are determined.

Environmental Risk Factors for Stomach Cancer in an African Setting about 193 Cases at the CHU Point G in Bamako/Mali

CHU (University Hospital Center) Point G: The department of surgery B is a surgical department of CHU Point G. The department is par excellence a reference department for cases of visceral surgery, cancer surgery, cardiovascular surgery, plastic and endocrinology surgery. As a reminder, the CHU Point G is the largest 3rd level referral hospital in Mali. Aim: To study the environmental risk factors of stomach cancer in the B surgery department of the Point G University Hospital in Bamako. Patients and Methods: We performed a cross-sectional study with retrospective collection from January 2008 to June 2018 (126 months). Results: We have identified 380 cases of digestive cancer, including 193 cases of stomach cancer or 50.79% of digestive cancers. The mean age of the patients was 57.21 ± 13 years. Male sex represented 55% (n = 106). Eating habits were dominated by the consumption of tô with potash (cereal paste) with 64.76% (n = 185). The main methods of preserving meat and fish were curing and smoking with 57.51% (n = 111). Chronic smoking was found in 24.35% (n = 47), alcohol + tobacco consumption in 2.59% (n = 5). The low socio-economic class represented 126 cases or 65.38%. Housewives and cultivators were respectively 37.82% (n = 73) and 227.97% (n = 54). 20.20% (n = 39) had a history of epigastric pain. Epigastralgia was the most common functional sign with 84.5% of cases (n = 169). An epigastric mass was found in 72 patients or 37.3%. Adenocarcinoma represented 97.4% (n = 188). Palliative surgery concerned the majority of our patients with 64.8% of patients (n = 79). The postoperative consequences were simple in 28.57% of cases (n = 28), the postoperative morbidity and mortality were respectively 33.61% (n = 41), and 23.77% (n = 29). The overall survival rate after surgery was 10.81% at 2 years and 2.94% at 5 years. This rate was 58.83% at 2 years and 28.50% at 5 years after curative surgery. Conclusion: The risk factors for stomach cancer are many and varied. Some are particularly present in Africa. Delay in diagnosis due to a belief in traditional healers is common in our community.

m-degree Center-connecting Line of Finite Points Set and Its Properties

In this paper, we first give the concept of m-degree center-connecting line in n-dimensional Euclidean space Enand investigate its several properties, then we obtain the length of m-degree center-connecting line formula in finite points set. As its application,we extend the Leibniz formula and length of medians formula in n-dimensional simplex to polytope.

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

在完全的公制的空格，为类型收缩的序列的普通的固定的点定理珍视集合的 mappings 被建立，并且为珍视集合的 mappings 的相应的随机的普通的固定的点定理也被获得。

A level set based segmentation approach for point-sampled surfaces

Segmenting a complex 3D surface model into some visually meaningful sub-parts is one of the fundamental problems in digital geometry processing. In this paper, a novel segmentation approach of point-sampled surfaces is proposed, which is based on the level set evolution scheme. To segment the model so as to align the patch boundaries with high curvature zones, the driven speed function for the zero level set inside narrow band is defined by the extended curvature field, which approaches zero speed as the propagating front approaches high curvature zone. The effectiveness of the proposed approach is demonstrated by our ex- perimental results. Furthermore, two applications of model segmentation are illustrated, such as piecewise parameterization and local editing for point-sampled geometry.

Finite Type Transcendental Entire Functions Whose Buried Points Set Contains Unbounded Positive Real Interval

Let fμ(z)=z·ep(z)+μ with p(z) being real coefficient polynomial and it's leading coefficient be positive, μ∈R+, when p(z) and μ satisfy two certain conditions, buried point set of fμ(z) contains unbounded positive real interval.

Some Results on the Upper Convex Densities of the Self-Similar Sets at the Contracting-Similarity Fixed Points

In this paper, some results on the upper convex densities of self-similar sets at the contracting-similarity fixed points are discussed. Firstly, a characterization of the upper convex densities of self-similar sets at the contracting-similarity fixed points is given. Next, under the strong separation open set condition, the existence of the best shape for the upper convex densities of self-similar sets at the contracting-similarity fixed points is proven. As consequences, an open problem and a conjecture, which were posed by Zhou and Xu, are answered.

Solving Fixed Point Problems in More General Nonconvex Sets Via an Interior Point Homotopy Method

In this paper,we are mainly devoted to solving fixed point problems in more general nonconvex sets via an interior point homotopy method.Under suitable conditions,a constructive proof is given to prove the existence of fixed points,which can lead to an implementable globally convergent algorithm.

Use of Rough Sets Theory in Point Cluster and River Network Selection

In this paper, we applied the rough sets to the point cluster and river network selection. In order to meet the requirements of rough sets, first, we structuralize and quantify the spatial information of objects by convex hull, triangulated irregular network (TIN), Voronoi diagram, etc.;second, we manually assign decisional attributes to the information table according to conditional attributes. In doing so, the spatial information and attribute information are integrated together to evaluate the importance of points and rivers by rough sets theory. Finally, we select the point cluster and the river network in a progressive manner. The experimental results show that our method is valid and effective. In comparison with previous work, our method has the advantage to adaptively consider the spatial and attribute information at the same time without any a priori knowledge.

Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation

In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.

Algorithm for Extracting All Relative-Attribute Reducts in Decision System of Large-Scale Records

A new algorithm based on rough core was proposed to extract all relative-attribute reducts in decision information systems of large-scale records. In the algorithm, the rough core of the decision-making information system is first calculated. Then, an approach based on a top-down strategy is adopted to select the non-core condition attributes and generate candidate relative-attribute reducts. Finally, the set of all relative-attribute reducts is obtained by pruning the candidate relative-attribute reducts. Experimental results show that the proposed algorithm is superior to the other methods such as the algorithm without computing core, the exhaustive method and the discernibility matrix method in extracting all relative-attribute reducts for large-scale data sets.

L_p(1≤p≤∞) APPROXIMATION BY AN n-DIMENSIONAL SUBSPACE ON A SET OF n+1 POINTS

Some new characterizations and immediate explicit expressions of best L(1≤p≤∞) approximation and their deviations by an n-dimensional subspace on a set of n+1 points are given.

EXISTENCE OF POSITIVE FIXED POINTS FOR SEMIDIFFERENTIABLE SEMICOMPACT 1-SET-CONTRACTIONS

This paper obtains some fixed point theorems of semidifferentiable semicompact 1-set-contraction maps, which extend some known results in [1, 2, 4, 5, 7].

CAS 132-2006 Standard for Flat Panel Display TV Set Installation Service Formulating and Enforcing Main Point Explanation and Analysis

CAS 132-2006 formulation background and work courses Flat panel display technology is maturing alongside the development of science and technology. The prices of flat panel display TV sets are becoming lower and lower. Flat panel display TV sets have begun entering the mainstream and are now the first choice of some consumers when making new TV purchases.Display TV Set Installation Service Point Explanation and AnalysisRepair, Retreat and Change Duty Stipulations. Peculiar use conditions, usage environments, and the practical circumstances of user consumption service requirements, etc., were also taken into account on the basis of extensive investigation, testing, and verification.……

Set-point Filter Design for a Two-degree-of-freedom Fractional Control System

This paper focuses on a new approach to design(possibly fractional) set-point filters for fractional control systems.After designing a smooth and monotonic desired output signal,the necessary command signal is obtained via fractional input-output inversion.Then,a set-point filter is determined based on the synthesized command signal.The filter is computed by minimizing the 2-norm of the difference between the command signal and the filter step response.The proposed methodology allows the designer to synthesize both integer and fractional setpoint filters.The pros and cons of both solutions are discussed in details.This approach is suitable for the design of two degreeof-freedom controllers capable to make the set-point tracking performance almost independent from the feedback part of the controller.Simulation results show the effectiveness of the proposed methodology.