Search

When using deep learning networks for dynamic feature rejection in SLAM systems, problems such as a priori static object motion leading to disturbed build quality and accuracy and slow system runtime are prone to occur. In this paper, based on the ORB-SLAM2 system, we propose a method based on improved YOLOv5 networks combined with geometric constraint methods for SLAM map building in dynamic environments. First, this paper uses ShuffleNetV2 to lighten the YOLOv5 network, which increases the improved network's operation speed without reducing the accuracy. At the same time, a pyramidal scene parsing network segmentation head is added to the head part of the YOLOv5 network to achieve semantic extraction in the environment, so that the improved YOLOv5 network has both target detection and semantic segmentation functions. In order to eliminate the objects with low dynamic features in the environment, this paper adopts the method of geometric constraints to extract and eliminate the dynamic features of the low dynamic objects. By combining the improved YOLOv5 network with the geometric constraint method, the robustness of the system is improved and the interference of dynamic targets in the construction of the SLAM system map is eliminated. The test results on the TUM dataset show that, when constructing a map in a dynamic environment, compared with the traditional ORB-SLAM2 algorithm, the accuracy of map construction in a dynamic environment is significantly improved. The absolute trajectory error is reduced by 97.7% compared with ORB-SLAM2, and the relative position error is reduced by 59.7% compared with ORB-SLAM2. Compared with DynaSLAM for dynamic scenes of the same type, the accuracy of map construction is slightly improved, but the maximum increase in keyframe processing time is 94.7%. [ABSTRACT FROM AUTHOR]

The star sensor is the most accurate measurement instrument in the spacecraft attitude measurement system, and the accurate centroid of the star point is the basis for ensuring the performance of the star sensor. Currently, the centroid of the gray method is the most widely used centroid extraction method in practice. Systematic errors caused by the centroid of the gray method and random noise in the detector imaging process are the main factors contributing to the deviation of the star centroiding coordinates. Considering the relationship between the point spread function and the pixel gray value, this paper proposes a centroiding method to reduce the star point centroiding error by fusing a priori information and energy distribution. The star charts are first preprocessed using a curvature filter and Gaussian blur to reduce the random noise. Then the complexity of the point spread function is considered, and the pixel gray values are corrected based on a priori information and gray value fuzzy processing. Finally, the symmetry of the one-dimensional energy distribution is used to quickly determine the sub-pixel deviation to get the star centroid coordinates. Through simulation and physical simulation experiments, the method was verified to be effective, and the extraction accuracy met the requirements of high-precision star sensors. The night sky observation test results demonstrate that the method in this paper can improve the measurement accuracy of the star sensors. [ABSTRACT FROM AUTHOR]

This paper argues that 'dirty hands' (DH) scenarios, where an agent is forced to do wrong in order to do right, are conceptually coherent. The charge of incoherence is a widespread and common criticism made by deontologists and consequentialists alike. They argue that DH theorists erroneously assume the existence of real moral dilemmas and then compound this error by claiming that it is possible to engage in justified moral wrongdoing. However, such critics argue that there are only prima facie moral dilemmas and hence it is not only irrational and obtuse to argue for DH scenarios, but also undermines our search for sound moral judgments in very difficult situations. Given the gravity of these charges, surprisingly little has been written in defence of DH as a coherent and necessary part of our moral vocabulary. If there can be no successful defence of the possibility of DH, then all talk of such scenarios become futile. This paper responds to two influential and what initially appear to be strongly plausible arguments used by critics of DH. I call these the 'Arguments from Deontic Logic' and the 'All-Things-Considered Argument'. I present three responses which seek to raise serious doubts about their efficacy. I then support the possibility of DH by exploring what we can learn about our moral reality from the moral emotion of 'tragic remorse'. This approach endorses the role of emotions in determining moral knowledge. It also rejects the view that ethical theories ought to dismiss DH experiences as incoherent in favour of questionable theoretical a priori assumptions, which seek a reductionist account of our moral reality. [ABSTRACT FROM AUTHOR]

In this paper, the contributions to the account of meta-induction (Schurz 2019) collected in this volume are critically discussed and thereby, new insights are developed. How broad and expandable the program of meta-induction is can be learned from Ortner's contribution. New insights about the transition from the a priori justification of meta-induction to the a posteriori justification of object-induction emerge from the reflection of Shogenji's paper. How meta-induction may be applied also to religious prophecies and that their meta-inductive justification does not fail for a priori reasons but because of missing evidence for predictive success is learned from the discussion of Pitts' contribution. That meta-induction does not rely on a particular prior distribution, while the no free lunch theorem depends implicitly on a uniform prior, is the major conclusion drawn from the discussion of Wolpert's article. How the problem of induction is treated in different versions of the Bayesian account is learned from the discussion of Willliamson's paper. That meta-induction can also be employed for abduction, and that abductive theory-revision can offer meta-inductive aggregation methods is a new insight emerging from the reflection of Aliseda's contribution. [ABSTRACT FROM AUTHOR]

With the continuous development of virtual reality, digital image applications, the required complex scene video proliferates. For this reason, portrait matting has become a popular topic. In this paper, a new matting algorithm with improved portrait details for images with complex backgrounds (MORLIPO) is proposed. This work combines the background restoration module (BRM) and the fine-grained matting module (FGMatting) to achieve high-detail matting for images with complex backgrounds. We recover the background by inputting a single image or video, which serves as a priori and aids in generating a more accurate alpha matte. The main framework uses the image matting model MODNet, the MobileNetV2 lightweight network, and the background restoration module, which can both preserve the background information of the current image and provide a more accurate prediction of the alpha matte of the current frame for the video image. It also provides the background prior of the previous frame to predict the alpha matte of the current frame more accurately. The fine-grained matting module is designed to extract fine-grained details of the foreground and retain the features, while combining with the semantic module to achieve more accurate matting. Our design allows training on a single NVIDIA 3090 GPU in an end-to-end manner and experiments on publicly available data sets. Experimental validation shows that our method performs well on both visual effects and objective evaluation metrics. [ABSTRACT FROM AUTHOR]

This paper considers the double diffusive Brinkman flow in a semi-infinite pipe. By establishing a priori estimates of the solutions and setting an appropriate "energy" function, we not only obtain the continuous dependence and convergence of the solution on the Soret coefficient but also prove that the solutions decay exponentially with the distance from the finite end of the cylinder. [ABSTRACT FROM AUTHOR]

This paper presents an approach to evaluate the failure of arbitrarily inclined interfaces using FE models with structured spatial discretization, providing accurate prediction of crack propagation along paths known a priori that are not constrained to the element boundaries. The combination of algorithms for the generation of structured discretization of representative polycrystalline microstructures with novel cohesive element formulations allow modelling the failure of complex topologies along rasterised boundaries, with noticeably higher computational efficiency and comparable accuracy. Two formulations of raster cohesive elements are presented, adopting either elastic-brittle or Tvergaard–Hutchinson traction separation laws. The formulations proposed are first validated comparing the failure of the interface within bi-crystal structures discretised using hexahedral elements either within a structured mesh (i.e. with rasterised boundaries) or an unstructured mesh (i.e. with planar boundary). Subsequently, the effectiveness of the formulations is demonstrated comparing the inter-granular crack propagation within complex polycrystalline microstructures. The behaviour of the novel cohesive element formulation in structured meshes consisting of regular hexahedral elements is in excellent agreement with the deformation and failure of classic cohesive element formulations placed along the planar boundaries of unstructured meshes consisting of tetrahedral elements. The higher computational cost of the raster cohesive elements is more than compensated by the increase in computational efficiency of structured meshes when compared to unstructured meshes, leading to a reduction of the simulation time of up to over 200 times for the simulations presented in the paper, thus allowing the simulation of large domains. [ABSTRACT FROM AUTHOR]

In this paper, we propose the idea for combining several iteration functions in order to construct new families of iterative methods with both high-order of convergence and high computational efficiency. As an illustration, combining the most famous iteration functions with two or three arbitrary iteration functions, we obtain three new families of high-order iterative methods for the simultaneous computation of simple or multiple polynomial zeros. To demonstrate the influence of the different corrections and to show how one can manage the convergence order and the efficiency when constructing particular methods, we prove a local convergence theorem with a priori and a posteriori error estimates and an estimate of the asymptotic error constant about one of the proposed general families called Schröder-like methods with two corrections. [ABSTRACT FROM AUTHOR]

Hybrid estimation architectures make it possible to combine the widespread availability of conventional SCADA data with the improved accuracy and higher sampling rates of synchronized phasor measurements. A particularly appealing hybrid scheme is the so-called APSI architecture, which comprises two sequential estimation stages: a conventional SCADA-based state estimator, whose outcome is then treated as a priori information by a second stage, where available phasor measurements are cumulatively processed. As desirable features, this architecture preserves existing SCADA-based estimators and waives PMU-observability requirements. On the other hand, bad data processing for APSI estimators is a topic that still deserves additional research efforts. In this paper, we set out to improve the resilience of APSI estimators against bad data occurring both within synchrophasor measurements and SCADA data. The proposed strategy comprises two distinct actions: (a) replacing conventional algorithms in the second APSI stage by a more robust one, capable of automatic suppressing outliers in both data classes, and (b) adopting a method for tracing down SCADA gross measurements from a priori data previously identified as erroneous. The performance of the proposed methodology is assessed through tests conducted on the IEEE 14-bus, 57-bus and 118-bus test systems. [ABSTRACT FROM AUTHOR]

The split delivery vehicle routing problem (SDVRP) is a relaxed variant of the capacitated vehicle routing problem (CVRP) where the restriction that each customer is visited precisely once is removed. Compared with CVRP, the SDVRP allows a reduction in the total cost of the routes traveled by vehicles. The exact methods to solve the SDVRP are computationally expensive. Moreover, the complexity and difficult implementation of the state-of-the-art heuristic approaches hinder their application in real-life scenarios of the SDVRP. In this paper, we propose an easily understandable and effective approach to solve the SDVPR based on an a priori adaptive splitting algorithm (AASA) that improves the existing state of the art on a priori split strategy in terms of both solution accuracy and time complexity. In this approach, the demand of the customers is split into smaller demand values using a splitting rule in advance. Consequently, the original SDVRP instance is converted to a CVRP instance which is solved using an existing CVRP solver. While the proposed a priori splitting rule in the literature is fixed for all customers regardless of their demand and location, we suggest an adaptive splitting rule that takes into account the distance of the customers to the depot and their demand values. Our experiments show that AASA can generate solutions comparable to the state of the art, but much faster. [ABSTRACT FROM AUTHOR]

In this paper, we considered the global well-posedness of strong solutions to the Cauchy problem of three-dimensional (3D) nonhomogeneous incompressible micropolar fluids with density-dependent viscosity and vacuum. Based on the energy method, some key a priori exponential decay-in-time rates of strong solutions are obtained. As a result, the existence and large-time asymptotic behavior of strong solutions in the whole space R3 are established, provided that the initial mass is sufficiently small. Note that this result is proven without any compatibility conditions. [ABSTRACT FROM AUTHOR]

Safety signal detection is an integral component of Pharmacovigilance (PhV), which is defined by the World Health Organization as "science and activities relating to the detection, assessment, understanding, and prevention of adverse effects or any other possible drug related problems". The purpose of safety signal detection is to identify new or known adverse events (AEs) resulting from the use of pharmacotherapeutic products. While post-marketing spontaneous reports from different sources are commonly utilized as a data source for detecting these signals, there are underlying challenges arising from data complexity. This paper investigates the implementation of the Apriori algorithm, a popular method in association rule mining, to identify frequently co-occurring drugs and AEs within safety data. We discuss previous applications of the Apriori algorithm for safety signal detection and conduct a detailed study of an improved method specifically tailored for this purpose. This enhanced approach refines the classical Apriori method to effectively reveal potential associations between drugs/vaccines and AEs from post-marketing safety monitoring datasets, especially when AEs are rare. Detailed comparative simulation studies across varied settings coupled with the application of the method to vaccine safety data from the Vaccine Adverse Event Reporting System (VAERS) demonstrate the efficacy of the improved approach. In conclusion, the improved Apriori algorithm is shown to be a useful screening tool for detecting rarely occurring potential safety signals from the use of drugs/vaccines using post-marketing safety data. [ABSTRACT FROM AUTHOR]

Guaranteed lower Dirichlet eigenvalue bounds (GLB) can be computed for the m-th Laplace operator with a recently introduced extra-stabilized nonconforming Crouzeix–Raviart ( m = 1 ) or Morley ( m = 2 ) finite element eigensolver. Striking numerical evidence for the superiority of a new adaptive eigensolver motivates the convergence analysis in this paper with a proof of optimal convergence rates of the GLB towards a simple eigenvalue. The proof is based on (a generalization of) known abstract arguments entitled as the axioms of adaptivity. Beyond the known a priori convergence rates, a medius analysis is enfolded in this paper for the proof of best-approximation results. This and subordinated L 2 error estimates for locally refined triangulations appear of independent interest. The analysis of optimal convergence rates of an adaptive mesh-refining algorithm is performed in 3D and highlights a new version of discrete reliability. [ABSTRACT FROM AUTHOR]

While frameworks to systematically assess bias in systematic reviews and meta-analyses (SRMAs) and frameworks on causal inference are well established, they are less frequently integrated beyond the data analysis stages. This paper proposes the use of Directed Acyclic Graphs (DAGs) in the design stage of SRMAs. We hypothesize that DAGs created and registered a priori can offer a useful approach to more effective and efficient evidence synthesis. DAGs provide a visual representation of the complex assumed relationships between variables within and beyond individual studies prior to data analysis, facilitating discussion among researchers, guiding data analysis, and may lead to more targeted inclusion criteria or set of data extraction items. We illustrate this argument through both experimental and observational case examples. [ABSTRACT FROM AUTHOR]

This paper argues that no form of meaningful development can be discussed without an incursion into the realm of consciousness, from which ideas emanate. This paper demonstrates that human civilization is driven by notions such as ideas, imaginations, concepts, plans, and projects which are germane to social development. An examination of Kant’s theory of concept formation reveals that though objects are given to us by means of sensibility, it is through the understanding that concepts arise. The mind therefore becomes the ‘breeding’ ground from which our ideas are generated and organized. In Kant’s analysis of the faculty of understanding, he noted that there are a priori pure intuitions and sets of categories such as Quality, Relation, Modality that organize particular sensations into unified objects of experience. This capacity of the mind enables it to produce or generate ideas within its own operations. Ideas generated are used to recreate our world. This paper provides a conceptual framework to explicate the foundation of development. Using the method of analysis, this essay concludes that the basis of development – social, economic, and cultural – is hinged on the nature and role of the mind. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this paper is to further the scholarly discussion of information experience as an object of study, including how this research area fits into library and information studies more broadly. Design/methodology/approach: A conceptual discussion of certain issues raised in Yu and Liu's recent paper in this journal. Findings: While Yu and Liu seem to suggest that only a priori information experience research belong in library and information science (LIS), this paper suggests that a priori and a posteriori research have a synergistic relationship and both have a home in LIS. Originality/value: This paper clarifies how the two conceptualizations of information experience as an object of study relate to each other, as well as how these relate to information experience as a research approach, and how all this fits within the metadisciplinary field of LIS. [ABSTRACT FROM AUTHOR]

This paper presents new results to fractional boundary value problems of the Caputo type with focal boundary conditions. This fractional derivative is used extensively in modelling real world applications. The main aim of this paper is to present results for the existence of solutions to ensure the usefulness in the context of modelling and providing a priori bounds on all possible solutions subject to a single versatile differential inequality. These results vastly expand the scope of problems which are applicable since it allows the fractional differential equation to have unrestricted growth and be nonlinear. [ABSTRACT FROM AUTHOR]

Copyright of Veritas: Journal of Philosophy & Theology is the property of Saint Rafael Pontifical Major Seminary and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we prove the two-weighted boundedness of maximal operator, singular integral operators and their commutators in weighted global Morrey-type spaces GMp,θ,ω,φ(Rn). Furthermore, we give weighted global Morrey-type a priori estimates and a priori estimates for non-divergent elliptic equations in GMp,θ,ω,φ(Rn) spaces as applications. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a reflected backward stochastic differential equation (RBSDE) with jumps, focusing on cases where the mean reflection is nonlinear. Unlike traditional RBSDEs, this particular type of RBSDE imposes a constraint defined by the mean of a loss function that does not follow the continuous condition. We start by deriving an a priori estimate of the solution, followed by establishing the uniqueness and existence of the solution. Theoretical results are illustrated by way of an example of the application of super‐hedging to the reinsurance and investment problem under a risk constraint. [ABSTRACT FROM AUTHOR]

While Plato acknowledged the fact of role playing vividly bestowed on the different sexes of the human kind by nature, he did not in any way place any gender (male or female) above other. Igbo culture seems to also place definite roles for male and woman without a priori making the human a slave of sort. History has shown the woman as actively involved in political, social and juridical activities in Igboland. The famous Aba women riot is one of the numerous lucid examples. This paper takes an in-depth look into Plato's and Igbo concepts of the women, with specific emphasis on the possibility of using their similarities as a recipe for the solution of national development and problems playing Nigeria. [ABSTRACT FROM AUTHOR]

This paper is concerned with nonlocal fractional p-Laplacian Schrödinger–Hardy-type equations involving concave–convex nonlinearities. The first aim is to demonstrate the L ∞ -bound for any possible weak solution to our problem. As far as we know, the global a priori bound for weak solutions to nonlinear elliptic problems involving a singular nonlinear term such as Hardy potentials has not been studied extensively. To overcome this, we utilize a truncated energy technique and the De Giorgi iteration method. As its application, we demonstrate that the problem above has at least two distinct nontrivial solutions by exploiting a variant of Ekeland's variational principle and the classical mountain pass theorem as the key tools. Furthermore, we prove the existence of a sequence of infinitely many weak solutions that converges to zero in the L ∞ -norm. To derive this result, we employ the modified functional method and the dual fountain theorem. [ABSTRACT FROM AUTHOR]

In this paper, we consider a fractional Nernst-Planck-Poisson-Navier-Stokes system in ℝ³. First, we obtain a priori estimates by using energy estimates. Then, we construct an iterative solution sequence by solving the approximate problem and obtaining the local existence and uniqueness of the classical solution. Finally, combining the local existence with a priori estimates, the global existence and uniqueness of the classical solution with small initial data are obtained. [ABSTRACT FROM AUTHOR]

This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with convergence rates under additional smoothness assumptions. This duality holds for general polyhedral meshes and arbitrary polynomial degrees of the discretization. A novel postprocessing is proposed and allows for a posteriori error estimates on regular triangulations into simplices using primal-dual techniques. This motivates an adaptive mesh-refining algorithm, which performs better compared to uniform mesh refinements. [ABSTRACT FROM AUTHOR]

Copyright of Con-textos Kantianos: International Journal of Philosophy is the property of Con-Textos Kantianos (CTK) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The higher-order guaranteed lower eigenvalue bounds of the Laplacian in the recent work by Carstensen et al. (Numer Math 149(2):273–304, 2021) require a parameter C st , 1 that is found not robust as the polynomial degree p increases. This is related to the H 1 stability bound of the L 2 projection onto polynomials of degree at most p and its growth C st, 1 ∝ (p + 1) 1 / 2 as p → ∞ . A similar estimate for the Galerkin projection holds with a p-robust constant C st , 2 and C st , 2 ≤ 2 for right-isosceles triangles. This paper utilizes the new inequality with the constant C st , 2 to design a modified hybrid high-order eigensolver that directly computes guaranteed lower eigenvalue bounds under the idealized hypothesis of exact solve of the generalized algebraic eigenvalue problem and a mild explicit condition on the maximal mesh-size in the simplicial mesh. A key advance is a p-robust parameter selection. The analysis of the new method with a different fine-tuned volume stabilization allows for a priori quasi-best approximation and improved L 2 error estimates as well as a stabilization-free reliable and efficient a posteriori error control. The associated adaptive mesh-refining algorithm performs superior in computer benchmarks with striking numerical evidence for optimal higher empirical convergence rates. [ABSTRACT FROM AUTHOR]

In this paper, a high-accuracy conservative implicit algorithm for computing the space fractional coupled Schrödinger–Boussinesq system is constructed. Meanwhile, the conservative nature, a priori boundedness, and solvability of the numerical solution are presented. Then, the proposed algorithm is proved to be second-order convergence in temporal and fourth-order spatial convergence using the discrete energy method. Finally, some numerical experiments validate the effectiveness of the conservative algorithm and confirm the accuracy of the theoretical results for different choices of the fractional-order α. [ABSTRACT FROM AUTHOR]

This paper defends a constructive interpretation of the Critique of Pure Reason, which is built in analogy with an experimental construction that Kant believes to characteristic of chemistry. I also argue for a way to reconcile the methodological perspective of the constructivist method with that of transcendental reflection. I therefore provide a constructive explanation for what Kant describes as being pure reason and the argument of the transcendental deduction. I propose to frame the different perspectives in such a way that the experimental construction is the ratio cognoscendi of pure reason, while pure reason is the ratio essendi of the experimental construction. O'Neill (1989, 2015) is one of the most important scholars that have argued for a constructivist reading of the Critique of pure reason (CPR). In this paper I develop and explore new aspects of this line of interpretation. One of the main criticisms raised against constructivist readings of Kant's philosophy is an alleged commitment to subjectivism or voluntarism (cf. Kleingeld & Willaschek 2019). This concern led some scholars to rename their position as constitutivist instead (Korsgaard 2009; Sensen 2013, 2017; Formosa 2011). Constitutivism, is intended to be a sort of constructivism capable of avoiding voluntarism. However, it becomes difficult, sometimes, to differentiate between the constitutivist and foundationalist positions, which are based on transcendental reflection and imply a sort of realist perspective on reason. The same preoccupation applies to the constructivist interpretation of the CPR. In order to deal with this issue, the following questions must be addressed: how can constructivism justify the necessity and universality of transcendental principles of pure reason without compromising the normative and procedural aspects of the construction? How to reconcile arguments based on the analysis of representations and faculties with a constructivist procedure? Or even, how may transcendental reflection, as a view of the possibility of a priori cognition, be rendered compatible with a constructive procedure? This paper is divided into three sections, followed by brief final remarks. The first section outlines the main characteristics of constructivism and relates them to Kant's positions about the nature of philosophy and its method. The second part argues for a type of experimental constructivism that might serve as a guiding analogy to understand the method underlying the CPR. Thirdly, I will show how the transcendental subject and pure reason are derived from this experimental construction. The conclusion briefly points out some advantages of this position. [ABSTRACT FROM AUTHOR]

Motivated to bypass the twin basins of absolute relativism and dogmatic absolutism, an antinomic polarity into which thought tendentially falls, this paper offers various conceptual frameworks for overcoming antinomies in philosophical thought, and ultimately asserts that this overcoming occurs at a philosophical system's purported source: its active site of real genesis. The author traces a constellation of thinkers who all invoke this suspended thirdness in their own disciplinary and conceptual registers, from Jean Cavaillès to Gilles Châtelet, C.S. Peirce to Cécile Malaspina, ultimately and speculatively suggesting that this third space, the (abductive) hinge of real genesis, might precede and activate a priori the consequent diremptions into the polarities of the transcendental and the historical, the mathematical and the physical, the global and the local, the continuous and the discrete, the rational and the empirical, and so on. Such a genetic realism, then, places a radical exigency on philosophical thinking: to grasp its real genetic conditions, that is, without a previously given criterion or method. Ultimately, the paper is most interested in suggesting ways to reconfigure the conceptual landscape around this genetic tension or originating hinge, to encourage thought towards the genetic real and away from disciplinary stagnation, towards generative models for systematic thought itself. [ABSTRACT FROM AUTHOR]

With the complexity and variability of data structures and dimensions, traditional clustering algorithms face various challenges. The integration of network science and clustering has become a popular field of exploration. One of the main challenges is how to handle large-scale and complex high-dimensional data effectively. Hypergraphs can accurately represent multidimensional heterogeneous data, making them important for improving clustering performance. In this paper, we propose a hypergraph-clustering method dubbed the "high-dimensional data clustering method" based on hypergraph partitioning using an improved Apriori algorithm (HDHPA). First, the method constructs a hypergraph based on the improved Apriori association rule algorithm, where frequent itemsets existing in high-dimensional data are treated as hyperedges. Then, different frequent itemsets are mined in parallel to obtain hyperedges with corresponding ranks, avoiding the generation of redundant rules and improving mining efficiency. Next, we use the dense subgraph partition (DSP) algorithm to divide the hypergraph into multiple subclusters. Finally, we merge the subclusters through dense sub-hypergraphs to obtain the clustering results. The advantage of this method lies in its use of the hypergraph model to discretize the association between data in space, which further enhances the effectiveness and accuracy of clustering. We comprehensively compare the proposed HDHPA method with several advanced hypergraph-clustering methods using seven different types of high-dimensional datasets and then compare their running times. The results show that the clustering evaluation index values of the HDHPA method are generally superior to all other methods. The maximum ARI value can reach 0.834, an increase of 42%, and the average running time is lower than other methods. All in all, HDHPA exhibits an excellent comparable performance on multiple real networks. The research results of this paper provide an effective solution for processing and analyzing large-scale network datasets and are also conducive to broadening the application range of clustering techniques. [ABSTRACT FROM AUTHOR]

Waveform engineering is an important topic in imaging and detection systems. Waveform design for the optimal Signal-to-Noise Ratio (SNR) under energy and duration constraints can be modelled as an eigenproblem of a Fredholm integral equation of the second kind. SNR gains can be achieved using this approach. However, calculating the waveform for optimal SNR requires precise knowledge of the functional form of the absorber, as well as solving a Fredholm integral eigenproblem which can be difficult. In this paper, we address both those difficulties by proposing a Fourier series expansion method to convert the integral eigenproblem to a small matrix eigenproblem which is both easy to compute and gives a heuristic view of the effects of different absorber kernels on the eigenproblem. Another important result of this paper is to provide an alternate waveform, the Discrete Prolate Spheroidal Sequences (DPSS), as the input waveform to obtain near optimal SNR that does not require the exact form of the absorber to be known apriori. [ABSTRACT FROM AUTHOR]

The lowest-order nonconforming virtual element extends the Morley triangular element to polygons for the approximation of the weak solution u ∊ V := H2 0 (\Omega) to the biharmonic equation. The abstract framework allows (even a mixture of) two examples of the local discrete spaces Vh(P) and a smoother allows rough source terms F ∊ V* =H-20(Ω). The a priori and a posteriori error analysis in this paper circumvents any trace of second derivatives by some computable conforming companion operator J: Vh → V from the nonconforming virtual element space Vh. The operator J is a right-inverse of the interpolation operator and leads to optimal error estimates in piecewise Sobolev norms without any additional regularity assumptions on u ∊ V. As a smoother the companion operator modifies the discrete right-hand side and then allows a quasi-best approximation. An explicit residual-based a posteriori error estimator is reliable and efficient up to data oscillations. Numerical examples display the predicted empirical convergence rates for uniform and optimal convergence rates for adaptive mesh-refinement. [ABSTRACT FROM AUTHOR]

Copyright of Studies about Language / Kalbu Studijos is the property of Studies about Language / Kalbu Studijos and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Convolutional neural network based methods have been proposed to address blind deblurring. Aiming at the difficulty of reconstructing high-frequency features of images with existing network models, this paper proposes a two-stage convolution-based encoder-decoder for fusing high-frequency a prior. In the first stage, both blurred and high-frequency images are input, and the image features extracted by the network and the high-frequency features are fused. In the second stage, the fused features are further refined and recovered as potentially clear images, and the reconstruction ability of the model for high-frequency features is enhanced. In addition, this paper proposes a deep feature reorganization module that integrates multi-layer semantic information in the encoder-decoder and targets the encoder semantics to further enhance the feature characterization capability of the model. Comprehensive experimental results show that our method achieves 0.9085 structural similarity index (SSIM) and 30.66db peak signal-to-noise ratio (PSNR) on the GoPro dataset. Meanwhile, our method achieves 0.8514 SSIM and 27.39db PSNR on the Lai dataset. [ABSTRACT FROM AUTHOR]

This paper deals with the computation of the Lerch transcendent by means of the Gauss-Laguerre formula. An a priori estimate of the quadrature error, that allows to compute the number of quadrature nodes necessary to achieve an arbitrary precision, is derived. Exploiting the properties of the Gauss-Laguerre rule and the error estimate, a truncated approach is also considered. The algorithm used and its Matlab implementation are reported. The numerical examples confirm the reliability of this approach. [ABSTRACT FROM AUTHOR]

Copyright of Studies in Hispanic & Lusophone Linguistics is the property of De Gruyter and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper investigates a novel C 0 nonconforming virtual element method (VEM) for solving the Kirchhoff plate obstacle problem, which is described by a fourth-order variational inequality (VI) of the first kind. In our study, we distinguish our approach by introducing new internal degrees of freedom to the traditional lowest-order C 0 nonconforming VEM, which originally lacked such degrees. This addition not only facilitates error estimation but also enhances its intuitiveness. Importantly, our novel C 0 nonconforming VEM naturally satisfies the constraints of the obstacle problem. We then establish an a priori error estimate for our novel C 0 nonconforming VEM, with the result indicating that the lowest order of our method achieves optimal convergence. Finally, we present a numerical example to validate the theoretical result. [ABSTRACT FROM AUTHOR]

Few-shot classification is one of the most daunting challenges in deep learning. The complexities of this task arise from the fact that category targets are often embedded within intricate and diverse background pixels, resulting in inconspicuous category features. Moreover, obtaining common category characteristics from a limited number of samples is difficult. Compounding the issue, models encounters categories that they have never seen before, rendering the prior guarantee of interclass variance infeasible. To address these dilemmas, this paper leverages the apriori conditioned information of few-shot tasks and introduces a Conditioned Feature Reconstruction Network (CFRN). The CFRN employs prototype reconstruction to minimize the prototype similarity among different classes and query reconstruction to maximize the similarity of (query, prototype) feature pairs. This approach increases the interclass variance while decreasing the intraclass variance, thereby enhancing separability and improving the saliency of the target features. An experimental validation demonstrates the effectiveness of the CFRN, which obtains state-of-the-art results on the mini-ImageNet, tiered-ImageNet, and CUB datasets. [ABSTRACT FROM AUTHOR]

This research explores the pos tag sequences that shape the transition from upper intermediate (B2 cefr) to near-native proficiency (C2 cefr) in a corpus of essays (n=32,410) from the Cambridge Learner Corpus. Gilquin (2018) and others have shown that pos tag sequences offer a holistic approach to extracting the most commonly used patterns without a starting point of an a priori set of words and word sequences. Using corpus linguistics informed by usage-based theories of language learning, this paper examines the frequency and distribution of 4-slot pos-tag sequences in L2 English writing, drawing on the taxonomy of pattern grammar (Francis et al., 1996, 1998; and Hunston and Francis, 2000). Findings point to the presence of both core and emergent pos-tag sequences in learner language in the two proficiency levels analysed. These sequences point to the presence of dynamic language restructuring processes as learners become more proficient and re-evaluate their understanding of frequency and distribution in English. This paper shows evidence of how language competence increases with proficiency. The research offers new evidence in our understanding of the development of L2 writing in efl contexts. [ABSTRACT FROM AUTHOR]

This paper focused on approximating a second-order nonlinear hyperbolic optimal control problem. By introducing a new variable, the hyperbolic equation was converted into two parabolic equations. A second-order fully discrete scheme was obtained by combining the Crank-Nicolson formula with the finite element method. The error estimation for this scheme was derived utilizing the second-order sufficient optimality condition and auxiliary problems. To validate the effectiveness of the fully discrete scheme, a numerical example was presented. [ABSTRACT FROM AUTHOR]

The chemist Jeremias Benjamin Richter (1762–1807) coined the term "stoichiometry" and proposed the "law of definite proportions." He is also commonly acknowledged as having been a student of Immanuel Kant (1724–1804). This paper demonstrates how Kant's philosophy positively shaped Richter's approach to chemistry in the Anfangsgründe der Stöchiometrie (1792–1794) and outlines two ways in which Richter attempted to represent the chemical force in "pure intuition": (1) "reductionistic forces," in which qualitative features scale with the quantity of matter; and (2) generalized "abstracted forces," in which a plurality of dissolution- and bonding-properties are latent within the chemical in the manifold of space-time. [ABSTRACT FROM AUTHOR]

In the present paper, we prove the a priori bounds and existence of smooth solutions to a Minkowski type problem for the log-concave measure e − f (| x | 2) d x in warped product space forms with zero sectional curvature. Our proof is based on the method of continuity. The crucial factor of the analysis is the a priori bounds of an auxiliary Monge-Ampère equation on S n . The main result of the present paper extends the Minkowski type problem of log-concave measures to the space forms and it may be an attempt to get some new analysis for the log-concave measures. [ABSTRACT FROM AUTHOR]

The New Confucian philosopher Mou Zongsan once compared the ethics of Mengzi to that of Kant, claiming that Mengzi's ethics shares the same fundamental features with Kant's and can therefore be better understood through a Kantian lens. This paper aims to argue against Mou by elaborating on two important but hitherto insufficiently addressed differences between Kant's and Mengzi's ethics. First, the paper shows that, as opposed to what Mou suggests, passages 6A1 to 6A3 of the Mengzi demonstrate Mengzi's adoption of an a posteriori approach to ethics that stands in direct contrast to Kant's a priori approach. Second, the paper argues that even if we read Kant's ethics in a non-rigorous way that works in favor of Mou's interpretation, ren (humaneness), yi (optimal appropriateness), li (observance of rites), and zhi (wisdom), as the core concepts of Mengzi's ethics, can still hardly be regarded as Kantian moral laws. [ABSTRACT FROM AUTHOR]

This paper aims to shed light on the characteristics of Heidegger's later thinking on language, which we can illuminate by examining his interpretation of Hölderlin's poetry. Poetic language differs from everyday language, such as statements (Aussagen). It speaks of imageless thinking. With the help of a priori understanding of its beingness (Seiendheit), we routinely state a being (Seiende) as something. However, the appearing of a being or an appearing being cannot be determined through a statement of "S is p." An appearing being indeed does exist; however, it disappears once the beingness of a being is given. Hölderlin's "The Rhine" is a poem that says the appearing of a being. In this regard, the poem is a language of the ineffable, which cannot be said in ordinary language. Therefore, the interpretation of Hölderlin's poetry presented by Heidegger is an elucidation of a language of the ineffable. It is the task of this paper to uncover this fact. [ABSTRACT FROM AUTHOR]