Search

In this paper, we introduce the notion of secure point-set domination in graphs. A point-set dominating D of graph G is called a secure point-set dominating set if for every vertex u E V -- D, there exists a vertex v E DnN(u) such that (D -- is also a point-set dominating set of G. The minimum cardinality of a secure point-set dominating set is called secure point-set domination number of graph G and will be denoted by γSpSd(G) (or simply γspsd). For any graph G of order n, γsPsd(G) > 1 and equality holds if and only if G = Kn. Also, for any graph G of order n, 'ySpsd(G') < n--1 and equality holds if and only if G = Here we characterize graphs G with q'spsd(G) = 2. We also establish a family J- of 11 graphs such that being F-free is necessary as well as sufficient for a graph G to satisfy γspsd(G) = n -- 2. [ABSTRACT FROM AUTHOR]

Based on the experience of other countries, in the current context of regional security, the enhanced relations with NATO, and the status of candidate country for EU membership, the Republic of Moldova has to pay increased attention to its security and defence. It includes not only increasing budget allocations for the defence sector, professionalizing the armed forces or participating with troops alongside other European countries in various theatres of operations, but also ensuring institutional transparency and rigorous implementation of EU standards of civilian democratic control over the armed forces. The effectiveness of democratic civilian control will contribute to enhancing national security and will bring the Republic of Moldova closer to the European community. This article briefly discusses the evolution of democratic civilian control over the armed forces of the Republic of Moldova from a theoretical and practical point of view and sets up some recommendations. [ABSTRACT FROM AUTHOR]

This study examines War's Inefficiency Puzzle in a resource bargaining model, where the nature of the resource (e.g., water or land) can influence resource division valuation. In the model, an embedded resource conflict or contest model equilibrium constitutes the disagreement point. We first show that the Puzzle holds across all winner-take-all conflict forms in a generalized family given a standard bargaining (in the shadow of conflict) framework. When introducing resource division discounts, we find conditions in which a bargaining solution does not exist such that conflict is chosen over settlement. Resource division discounts can cause conflict to be chosen over any settlement point in the feasible set, thus providing a solution to War's Inefficiency Puzzle. This solution does not assume that a resource cannot be divided. It only assumes that division may lead to division discounts. We then consider a generalization of a classic tragedy of the commons model and find that division of an innate commons leads to division discounts as an equilibrium outcome. [ABSTRACT FROM AUTHOR]

A B-spline function is a series of flexible elements that are managed by a set of control points to produce smooth curves. By using a variety of points, these functions make it possible to build and maintain complicated shapes. Any spline function of a certain degree can be expressed as a linear combination of the B-spline basis of that degree. The flexibility, symmetry and high-order accuracy of the B-spline functions make it possible to tackle the best solutions. In this study, extended cubic B-spline (ECBS) functions are utilized for the numerical solutions of the generalized nonlinear time-fractional Klein–Gordon Equation (TFKGE). Initially, the Caputo time-fractional derivative (CTFD) is approximated using standard finite difference techniques, and the space derivatives are discretized by utilizing ECBS functions. The stability and convergence analysis are discussed for the given numerical scheme. The presented technique is tested on a variety of problems, and the approximate results are compared with the existing computational schemes. [ABSTRACT FROM AUTHOR]

We explore the intermixed method for finding a common element of the intersection of the solution set of a mixed variational inequality and the fixed point set of a nonexpansive mapping. We point out that Khuangsatung and Kangtunyakarn's statement [J. Inequal. Appl. 2023:1, 2023] regarding the resolvent utilized in their paper is not correct. To resolve this gap, we employ the epigraphical projection and the product space approach. In particular, we obtain a strong convergence theorem with a weaker assumption. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative inertial simultaneous cyclic iterative algorithm designed to address a range of mathematical problems within the realm of split equality variational inequalities. Specifically, the algorithm accommodates finite families of split equality variational inequality problems, infinite families of split equality variational inclusion problems, and multiple-sets split equality fixed point problems involving demicontractive operators in infinite-dimensional Hilbert spaces. The algorithm integrates well-established methods, including the cyclic method, the inertial method, the viscosity approximation method, and the projection method. We establish the strong convergence of this proposed algorithm, demonstrating its applicability in various scenarios and unifying disparate findings from existing literature. Additionally, a numerical example is presented to validate the primary convergence theorem. [ABSTRACT FROM AUTHOR]

Due to the invariance properties of cross-ratio, Möbius transformations are often used to map a set of points or other geometric object into a symmetric position to simplify a problem studied. However, when the points are mapped under a Möbius transformation, the distortion of the Euclidean geometry is rarely considered. Here, we identify several cases where the distortion caused by this symmetrization can be measured in terms of the Lipschitz constant of the Möbius transformation in the Euclidean or the chordal metric. [ABSTRACT FROM AUTHOR]

We relate the Brasselet number of a complex analytic function-germ defined on a complex analytic set to the critical points of its real part on the regular locus of the link. Similarly we give a new characterization of the Euler obstruction in terms of the critical points on the regular part of the link of the projection on a generic real line. As a corollary, we obtain a new proof of the relation between the Euler obstruction and the Gauss–Bonnet measure, conjectured by Fu. [ABSTRACT FROM AUTHOR]

We prove that the integral points are potentially Zariski dense in the complement of a reduced effective singular anticanonical divisor in a smooth del Pezzo surface, with the exception of |${{\mathbb {P}}}^{2}$| minus three concurrent lines (for which potential density does not hold). This answers positively a question raised by Hassett and Tschinkel and, combined with previous results, completes the proof of the potential density of integral points for complements of anticanonical divisors in smooth del Pezzo surfaces. We then classify the complements that are simply connected and for these we prove that the set of integral points is potentially not thin, as predicted by a conjecture of Corvaja and Zannier. [ABSTRACT FROM AUTHOR]

Fuzzy set qualitative comparative analysis (fsQCA) is a new method to solve complex causal relationship analysis in social science, and data calibration is a core process of fsQCA. Ignoring data calibration will have an impact on the fsQCA consistency analysis, thereby undermining the rigor of the causal mechanism between fsQCA mining conditions and results. This study found that the distribution characteristics of the data did not have a significant impact on the final consistency and the corrected consistency, while the anchor point setting of the crosspoint had a significant impact on the sufficient conditional consistency of fsQCA. When the consistency study is carried out on the crosspoint anchor point setting and calibration transformation, it is found that the effect of crosspoint anchor point setting on consistency is more obvious than that of calibration transformation. The study of the consistency between fuzzy set data calibration and fsQCA can provide useful conclusions and calibration methods for the empirical analysis of fsQCA, reminding researchers that they should avoid using mechanical procedures to perform simple data calibration to obtain misleading results and standardize fuzzy set data. Calibration is beneficial to improve the transparency of fsQCA research and also provides an important reference for fsQCA practitioners to conduct robust analysis of different data-driven methods. [ABSTRACT FROM AUTHOR]

Let E denote the set of all unital entanglement breaking (UEB) linear maps defined on an operator system S ⊂ M d and, mapping into M n. As it turns out, the set E is not only convex in the classical sense but also in a quantum sense, namely it is C ⁎ -convex. The main objective of this article is to describe the C ⁎ -extreme points of this set E. By observing that every EB map defined on the operator system S dilates to a positive map with commutative range and also extends to an EB map on M d , we show that the C ⁎ -extreme points of the set E are precisely the UEB maps that are maximal in the sense of Arveson ([1] and [2]) and that they are also exactly the linear extreme points of the set E with commutative range. We also determine their explicit structure, thereby obtaining operator system generalizations of the analogous structure theorem and the Krein-Milman type theorem given in [8]. As a consequence, we show that C ⁎ -extreme (UEB) maps in E extend to C ⁎ -extreme UEB maps on the full algebra. Finally, we obtain an improved version of the main result in [8] , which contains various characterizations of C ⁎ -extreme UEB maps between the algebras M d and M n. [ABSTRACT FROM AUTHOR]

The need for precise radio telescope pointing has driven great attention to investigating the effect of antenna local deformation or irregularity, such as unevenness in the azimuth track. Although the track-alidade interaction model is commonly used to investigate the pointing effect of track unevenness (such as the works on DSN 34 m antennas and the Green Bank Telescope), few experiments have been done to test the effectiveness of this model independently from the overall pointing model. To address this issue, a method utilizing an optical pointing telescope (OPT) for determining the impact of track unevenness on pointing is proposed. This method uses a group of reference pointing data collected by an OPT mounted at the bottom of the antenna alidade to extract the twist effect of the alidade from the radio telescope pointing data, thus compared with the predicted twist by the track-alidade model. This method was applied to the 26 meter Nanshan Radio Telescope (NSRT 26 m), achieving good agreement with the model-predicted values. [ABSTRACT FROM AUTHOR]

This paper is the fourth in a series dedicated to the mathematically rigorous asymptotic analysis of gravitational radiation under astrophysically realistic set-ups. It provides an overview of the physical ideas involved in setting up the mathematical problem, the mathematical challenges that need to be overcome once the problem is posed, as well as the main new results we will obtain in upcoming work. From the physical perspective, this includes a discussion of how post-Newtonian theory provides a prediction on the gravitational radiation emitted by N infalling masses from the infinite past in the intermediate zone, i.e. up to some finite advanced time. From the mathematical perspective, we then take this prediction, together with the condition that there be no incoming radiation from I− , as a starting point to set up a scattering problem for the linearized Einstein vacuum equations around Schwarzschild and near spacelike infinity, and we outline how to solve this scattering problem and obtain the asymptotic properties of the scattering solution near i0 and I+. The full mathematical details will be presented in the sequel to this paper. This article is part of a discussion meeting issue 'At the interface of asymptotics, conformal methods and analysis in general relativity'. [ABSTRACT FROM AUTHOR]

Single‐visit surveys of plots are often used for estimating the abundance of species of conservation concern. Less‐than‐perfect availability and detection of individuals can bias estimates if not properly accounted for. We developed field methods and a Bayesian model that accounts for availability and detection bias during single‐visit visual plot surveys. We used simulated data to test the accuracy of the method under a realistic range of generating parameters and applied the method to Florida's east coast diamondback terrapin in the Indian River Lagoon system, where they were formerly common but have declined in recent decades. Simulations demonstrated that the method produces unbiased abundance estimates under a wide range of conditions that can be expected to occur in such surveys. Using terrapins as an example we show how to include covariates and random effects to improve estimates and learn about species‐habitat relationships. Our method requires only counting individuals during short replicate surveys rather than keeping track of individual identity and is simple to implement in a variety of point count settings when individuals may be temporarily unavailable for observation. We provide examples in R and JAGS for implementing the model and to simulate and evaluate data to validate the application of the method under other study conditions. [ABSTRACT FROM AUTHOR]

Vertical alignment reconstruction obtains alignment parameters by fitting geometric components to a set of measured points representing the profile of an existing road or railroad, which is essential in alignment consistency analysis and maintenance to ensure safety and comfort. The neural dynamics model of Adeli and Park is explored and improved for reconstructing vertical alignments with constraints. The structure of the dynamics model is modified to include three layers: parameter layer, intermediate layer, and energy layer. The number of nodes in the parameter or intermediate layers corresponds to the number of independent parameters defining a vertical alignment. The number of nodes in the energy layer is the sum of the number of deviations and the number of constraints in the alignment reconstruction problem. The coefficients connecting nodes between the parameter layer and the intermediate layer determine the integral operations, which define the Levenberg–Marquardt algorithm of the dynamics model (LMADM) and the steepest descent algorithm of the dynamics model (SDADM). Both the LMADM and SDADM methods satisfy the Lyapunov stability theorem, but the LMADM method outperforms the SDADM method in its objective function value and computation time. Experiment results demonstrate that there are multiple local optima for a vertical alignment reconstruction, and the solutions obtained by the LMADM method are the best obtained so far, compared with those reported in the literature, with 57.1% and 23.4% decreases of the mean squared error for the highway and the railroad examples, respectively. [ABSTRACT FROM AUTHOR]

Let P be an N-element point set in the plane. Consider N (pointlike) grasshoppers sitting at different points of P. In a "legal" move, any one of them can jump over another, and land on its other side at exactly the same distance. After a finite number of legal moves, can the grasshoppers end up at a point set, similar to, but larger than P? We present a linear algebraic approach to answer this question. In particular, we solve a problem of Brunck by showing that the answer is yes if P is the vertex set of a regular N-gon and N ≠ 3 , 4 , 6 . Some generalizations are also considered. [ABSTRACT FROM AUTHOR]

It is established existence of weak solutions for nonlocal elliptic problems driven by the fractional Laplacian where the nonlinearity is indefinite in sign. More specifically, we shall consider the following nonlocal elliptic problem: (−Δ)su+V(x)u=μa(x)|u|q−2u−λ|u|p−2uinRN,u∈Hs(RN),$$\begin{equation*} {\left\lbrace \def\eqcellsep{&}\begin{array}{rcl}(-\Delta)^s u +V(x)u & = & \mu a(x)|u|^{q-2}u-\lambda |u|^{p-2}u \mbox{ in }\, \mathbf {R}^N, \\[3pt] u\in H^s(\mathbf {R}^N),&&{} \end{array} \right.} \end{equation*}$$where s∈(0,1),s0$\mu , \lambda >0$. The potentials V,a:RN→R$V, a : \mathbf {R}^N \rightarrow \mathbf {R}$ satisfy some extra assumptions. The main feature is to find sharp parameters λ>0$\lambda > 0$ and μ>0$\mu > 0$ where the Nehari method can be applied. In order to do that, we employ the nonlinear Rayleigh quotient together a fine analysis on the fibering maps associated to the energy functional. It is important to mention also that for each parameters λ>0$\lambda > 0$ and μ>0$\mu > 0$, there exist degenerate points in the Nehari set that give serious difficulties. Furthermore, we consider nonlinearities that are superlinear at the origin and superlinear at infinity. In order to overcome these difficulties, we apply some estimates together with a carefully analysis on the fibering maps. Here, we also consider the asymptotic behavior of the weak solutions for our main problem when λ→0$\lambda \rightarrow 0$ or μ→∞$\mu \rightarrow \infty$. Furthermore, we consider a nonexistence result for our main problem under some appropriate conditions on the parameters λ>0$\lambda >0$ and μ>0$\mu > 0$. [ABSTRACT FROM AUTHOR]

Objective: To observe the efficacy of acupuncture for pollen allergy and compare the difference in efficacy between the special points/technique acupuncture group and the conventional points/technique acupuncture group. Methods: 1306 patients were randomly divided into two groups; one is the special points/technique acupuncture group (653 patients) and the other one is the conventional points/technique acupuncture group (653 patients). For the special points/technique acupuncture group, needles were inserted into ST7(xiaguan), to look for sphenopalatine foramen to stimulate sphenopalatineganglion, and we penetrate Mian Yan Xue to stimulate nasopalatine nerve. In addition to BL12 (feng men), BL13 (fei shu) and Mu Xue of the lung, spleen and kidney, three points were selected as BL58 (fei yang), BL10 (tian zhu) and DU14 (da zhui) to address three main symptoms of pollen allergy, i.e. stuffy nose, itchy eyes and asthma. For these points in particular, a special needling technique was used by insertion of two needles simultaneously into the same point, lifting and thrusting alternately. The conventional points/technique acupuncture group chose acupuncture points as LI4 (he gu), LI 11(qu chi), LI20 (ying xiang), DU29 (yin tang), GB20 (feng chi), BL12 (feng men), BL13 (feishu), DU23 (shangxing), EX-B1 (ding chuan) and EX-HN8 (shang ying xiang), etc. All these points were needled according to conventional tonification or dispersal technique. Patients in both groups were treated 2-3 times per week, 15 to 20 minutes per visit. Results: Both treatments are effective. However, the special points/technique acupuncture group's total efficiency is 95.7%. The conventional points/technique acupuncture group's total efficiency is 48.5%. The first group is more efficient and has much higher curable rate than the other group and the difference is statistically significant according to ANOVA. Conclusion: The treatment for pollen allergy with the special points/technique acupuncture group is significantly better than the conventional points/technique acupuncture group. Needling the sphenopalatine ganglion is fast effective and reliable. Stimulating the nasopalatine nerve is safe and simple. [ABSTRACT FROM AUTHOR]

We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality is derived, giving large and small deviation inequalities from a median, in terms of a modulus of regularity. Our methods are of independent interest, we find that log-affine sequences are the extreme points of the set of log-concave sequences belonging to a half-space slice of the simplex. We use this result as a tool to derive simple proofs of several convolution type inequalities for log-concave sequences, due to Walkup, Gurvits, and Klartag–Lehec. Further applications of our results are used to produce a discrete version of the Prékopa–Leindler inequality. [ABSTRACT FROM AUTHOR]

We study configurations of n points and n lines that form Θ (n 4 / 3) incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel lines or many families of concurrent lines. We show that the line slopes have multiplicative structure or that many sets of y-intercepts have additive structure. We introduce the first infinite family of configurations with Θ (n 4 / 3) incidences. We also derive a new variant of a different structural point–line result of Elekes. Our techniques are based on the concept of line energy. Recently, Rudnev and Shkredov introduced this energy and showed how it is connected to point–line incidences. We also prove that their bound is tight up to sub-polynomial factors. [ABSTRACT FROM AUTHOR]

Motivated from the surrounding property of a point set in R d introduced by Holmsen, Pach, and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the maximum transversal ratio of simplicial d-spheres, we provide two infinite constructions. The first construction gives infinitely many (d + 1) -dimensional simplicial polytopes with the transversal ratio exactly 2 / (d + 2) for every d ≥ 2 . In the case of d = 2 , this meets the previously well-known upper bound 1/2 tightly. The second gives infinitely many simplicial 3-spheres with the transversal ratio greater than 1/2. This was unexpected from what was previously known about the surrounding property. Moreover, we show that, for d ≥ 3 , the facet hypergraph F (K) of a d-dimensional simplicial sphere K has the chromatic number χ (F (K)) ∈ O (n (⌈ d / 2 ⌉ - 1) / d ) , where n is the number of vertices of K . This slightly improves the upper bound previously obtained by Heise, Panagiotou, Pikhurko, and Taraz. [ABSTRACT FROM AUTHOR]

For a graph whose vertex set is a finite set of points in the Euclidean d -space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect. Using the idea of halving lines, we show that (i) for any finite set of points in the plane, there exists a Hamiltonian cycle that is a Tverberg graph; (ii) for any n red and n blue points in the plane, there exists a perfect red-blue matching that is a Tverberg graph. Also, we prove that (iii) for any even set of points in the Euclidean d -space, there exists a perfect matching that is an open Tverberg graph; (iv) for any n red and n blue points in the Euclidean d -space, there exists a perfect red-blue matching that is a Tverberg graph. [ABSTRACT FROM AUTHOR]

This paper focuses on investigating the problem of finding a common element of the set of solutions of a generalized nonlinear implicit variational-like inclusion problem involving an $ (A,\eta) $ (A , η) -maximal m-relaxed monotone mapping in the sense of L.-G.-s.i.p. and the set of fixed points of a total asymptotically nonexpansive mapping. To achieve such a purpose, a new iterative algorithm is constructed. Applying the concepts of graph convergence and generalized resolvent operator associated with an $ (A,\eta) $ (A , η) -maximal m-relaxed monotone mapping in the sense of L.-G.-s.i.p. As an application of the obtained equivalence relationship, the strong convergence of the sequence generated by our proposed iterative algorithm to a point belonging to the intersection of the two sets mentioned above is proved. [ABSTRACT FROM AUTHOR]

We introduce the notion of limited consideration into a bilateral, infinite-horizon, alternating-offers bargaining game. Both agents have reference-dependent preferences, and their reference points are dynamically updated. An agent's current consideration set (or focus) is influenced by the last offer he rejected such that the most salient point in that consideration set becomes his current reference point. We provide an implicit characterization of stationary subgame perfect Nash equilibria in our model. Without resorting to asymmetric or incomplete information, we show that our bargaining game can produce delay and disagreement in equilibrium. In addition to analytical results on the disagreement conditions and the nature of agreements, we provide computational comparative statics on model parameters and study their impacts on delay. [ABSTRACT FROM AUTHOR]

Dynamic decision-making is the process of seeking optimal choice with multiple related attributes under the multi-time-point situation. Considering that the time-varying nature of decision information can have a specific impact on the psychology of decision makers, in this paper, a dynamic decision-making method based on the cumulative prospect theory is proposed. Combining this with infinite parameterization of fuzzy soft sets, a time series interval triangular fuzzy soft set is presented, which has characteristics of boundedness, monotonicity, and symmetry. Then, based on the new information priority principle, the exponential decay model is used to determine the time weight coefficient, and a static fuzzy soft matrix is obtained. Furthermore, a method of calculating psychological utility values is proposed, in which the threshold-reference point set is introduced to analyze the psychological "profit and loss" values. Simultaneously, the time probability of the decision-making scenario is transformed into the corresponding weight function. On the basis of prospect maximization theory and maximum entropy theory, an optimization model for determining the weight of decision parameters is established. The cumulative prospect values of the alternatives are given to achieve the best choice for the alternatives. Finally, an example showed the feasibility and effectiveness of this method. [ABSTRACT FROM AUTHOR]

The current paper proposes and tests algorithms for finding the diameter of a compact convex set and the farthest point in the set to another point. For these two nonconvex problems, I construct Frank–Wolfe and projected gradient ascent algorithms. Although these algorithms are guaranteed to go uphill, they can become trapped by local maxima. To avoid this defect, I investigate a homotopy method that gradually deforms a ball into the target set. Motivated by the Frank–Wolfe algorithm, I also find the support function of the intersection of a convex cone and a ball centered at the origin and elaborate a known bisection algorithm for calculating the support function of a convex sublevel set. The Frank–Wolfe and projected gradient algorithms are tested on five compact convex sets: (a) the box whose coordinates range between −1 and 1, (b) the intersection of the unit ball and the non-negative orthant, (c) the probability simplex, (d) the Manhattan-norm unit ball, and (e) a sublevel set of the elastic net penalty. Frank–Wolfe and projected gradient ascent are about equally fast on these test problems. Ignoring homotopy, the Frank–Wolfe algorithm is more reliable. However, homotopy allows projected gradient ascent to recover from its failures. [ABSTRACT FROM AUTHOR]

For a metric space , we prove existence of continuous maps associating to each compact set , a probability measure with in such a way that the set is dense in the space of probability measures on . [ABSTRACT FROM AUTHOR]

We define a Grothendieck ring of pairs of complex quasi-projective varieties (consisting of a variety and a subvariety). We describe -structures on this ring and a power structure over it. We show that the conjectual symmetric power of the projective line with several orbifold points described by A. Fonarev is consistent with the symmetric power of this line with the set of distinguished points as a pair of varieties. [ABSTRACT FROM AUTHOR]

For sets of n points, n even, in general position in the plane, we consider straight-line drawings of perfect matchings on them. It is well known that such sets admit at least C n / 2 different plane perfect matchings, where C n / 2 is the n/2-th Catalan number. Generalizing this result we are interested in the number of drawings of perfect matchings which have k crossings. We show the following results. (1) For every k ≤ 1 64 n 2 - 35 32 n n + 1225 64 n , any set with n points, n sufficiently large, admits a perfect matching with exactly k crossings. (2) There exist sets of n points where every perfect matching has at most 5 72 n 2 - n 4 crossings. (3) The number of perfect matchings with at most k crossings is superexponential in n if k is superlinear in n. (4) Point sets in convex position minimize the number of perfect matchings with at most k crossings for k = 0 , 1 , 2 , and maximize the number of perfect matchings with n / 2 2 crossings and with n / 2 2 - 1 crossings. [ABSTRACT FROM AUTHOR]

Purpose: Adequate position of the bone block during arthroscopic Latarjet procedure is critical for an optimal functional outcome. However, this procedure is complex with a long learning curve. Our aim was to compare the bone block position between a dedicated glenoid posterior instrumentation and suture button fixation versus an anterior screw fixation, on a postoperative computed tomography (CT) scan. Method: Seventy‐nine consecutive patients operated on for an anterior shoulder instability were included in this retrospective study. The same surgeon performed arthroscopically the Latarjet procedure either with an anterior drilling and screw fixation (Group A), or with a specific posterior glenoid guide pin, a posterior drilling, and a suture cortical button fixation (Group B). Evaluations were made by two independent observers. The position was evaluated by CT scan in the axial and sagittal planes. Learning curves with operative time, complications and clinical outcomes were assessed at a minimum of 2 years of follow‐up. Results: Thirty‐five patients were included in Group A and 44 in Group B. In Group A, 27 bone blocks were flush (87.1%) and 38 in Group B (92.7%) (p < 0.01). In Group A, 72% of the bone block height was below the equator and 76%, in Group B (ns). The mean operating time was 123 ± 32.5 min in Group A and 95 ± 34.1 min in Group B (p < 0.0001). At the final follow‐up, the mean aggregate Rowe score was respectively 94.6 ± 10.4 and 93.1 ± 9.8 points in Groups A and B. The mean aggregate Walch–Duplay score was respectively 94.2 ± 11.6 and 93.4 ± 10.6 points in Groups A and B. There were 11 complications (31.4%) in Group A and five complications (11.3%) in Group B (ns). Conclusion: The arthroscopic Latarjet procedure with a posterior drilling guided system and suture‐button fixation allows more precise positioning in the axial plane than with anterior drilling and screw fixation. This posterior‐guided procedure could reduce intraoperative and short‐term complications. Level of Evidence: Level IV. [ABSTRACT FROM AUTHOR]

This paper presents and discusses two sets of theories concerning trauma. The first involves a contemporary social theory of "cultural trauma" and the second refers to psychoanalytic theories on psychic trauma. We argue that these two groups of theories have some relevant elements in common, despite social theorists' critique of psychoanalytic understanding on the matter. In our view, the most important meeting points between these groups of theories concern (a) the possibility to think that trauma is not welded to events but has a formation process, one of attribution of meaning, (b) that this process has a temporality of its own, and (c) that the environment (the objects, actors, and agents that compose it) has a fundamental and determinant role in trauma formation. Further, we suggest that trauma is still an open concept in psychoanalysis. [ABSTRACT FROM AUTHOR]

For a nonlinear controlled system, a fixed-time approach problem is considered in which the target point location becomes known only at the start of motion. According to the proposed solution method, node resolving program controls corresponding to a finite collection of target points from the set of their admissible locations are computed in advance and a refined control for the target point given at the start of motion is determined via linear interpolation of the node controls. The procedure for designing such a resolving control is formulated in the form of two algorithms, one of which is run before the start of the motion, and the other is executed in real time while the system is moving. The error in the transfer of the system's state to the target point by applying these algorithms is estimated. As an example, we consider the approach problem for a modified Dubins car model and a target point about which only a compact set of its admissible locations is known before the start of motion. [ABSTRACT FROM AUTHOR]

Let X be a local dendrite and let $ f:X\to X $ f : X → X be a continuous map. Denote by $ P(f) $ P (f) and $ R(f) $ R (f) the sets of periodic and recurrent points of f, respectively. We say that f is relatively pointwise recurrent if $ \overline {R(f)}=X $ R (f) ¯ = X. We show that, if X is almost meshed (i.e the union of the interior of all free arcs is dense in X), then f is relatively pointwise recurrent if and only if either f is topologically conjugate to an irrational rotation on the circle or it has a dense set of periodic points. [ABSTRACT FROM AUTHOR]

In this paper, we define a generalized C ́ i r i c contraction with respect to ℸ and prove some coupled coincidence best proximity point results in the setting of complete metric spaces. We also obtain some coupled best proximity point results for such contractions. We provide an example for the validity of our main result. Our results are the generalization of many results existing in the literature. As an application, we find the solution of the differential equation. [ABSTRACT FROM AUTHOR]

Cells rely on the ability to sense and respond to small spatial differences in chemoattractant concentrations for survival. There is growing evidence that this is accomplished by setting the signaling system near the threshold for activation in an excitable system and using the spatial heterogeneities to alter the threshold, thereby biasing cell activity in the direction of the gradient. Here we consider a scheme by which the set point is adaptively set near the bifurcation point, but without explicit knowledge of this point. Through simulation, we show that the method would improve chemotactic efficiency of cells. The results of this paper are based on pioneering work by Eduardo Sontag and coworkers, to whom this paper is dedicated in honor of his 70th birthday. [ABSTRACT FROM AUTHOR]

In oral and maxillofacial surgery, computer-assisted navigation technologies have been widely used to achieve intraoperative positioning. The traditional methods mainly rely on the experience of doctors and the difference between the locations of key points in the surgical area and the preoperative planning, which have certain limitations. In this paper, a new intraoperative surgical navigation framework based on mobile laser scanner is proposed, which ensures that surgery is performed accurately according to the preoperative planning. The framework mainly includes two parts. First, the real-time surface reconstruction of the anatomy should be realized during the operation. Second, the acquired image is matched to the planned image in real time. Although the most common method of surface reconstruction is to render the volume directly from raw data or render the surface from the segmented data using computed tomography/magnetic resonance (CT/MR) data, this method is too complicated for performing the real-time operation during surgery. Furthermore, a new surface registration technique is proposed for image-guided oral and maxillofacial surgery based on the point sets. To improve the registration accuracy and robustness, the point sets are modeled by Mixed Student's t-Distribution model. In the experiments, the point sets of CT data are from 10 patients with craniomaxillofacial diseases and the surface point set is from the LRS. The TRE of 10 data was less than 1 mm. Compared with the paired-point registration method and Iterative Closest Point algorithm, the results demonstrated better performance of the proposed method, the surgical situation can be displayed in real time during the surgical process, and any differences from the surgical plan can also be reflected. [ABSTRACT FROM AUTHOR]

The notion of spectrum for first-order properties introduced by J. Spencer for Erdős–Rényi random graph is considered in relation to random uniform hypergraphs. In this work we study the set of limit points of the spectrum for first-order formulae with bounded quantifier depth and obtain bounds for its maximum value. Moreover, we prove zero–one k -laws for the random uniform hypergraph and improve the bounds for the maximum value of the spectrum for first-order formulae with bounded quantifier depth. We obtain that the maximum value of the spectrum belongs to some two-element set. [ABSTRACT FROM AUTHOR]

This article examines Wigner's view on the unreasonable effectiveness of mathematics in the natural sciences, which was based on Cantor's claim that 'mathematics is a free creation of the human mind'. It is contended that Cantor's claim is not relevant to physics because it was based on his power set construction, which does not preserve neighborhoods of geometrical points. It is pointed out that the physical notion of Einstein causality can be defined on a countably infinite point set M with no predefined mathematical structure on it, and this definition endows M with a Tychonoff topology. Under Shirota's theorem, M can therefore be embedded as a closed subspace of R J for some J. While this suggests that the differentiable structure of R J may follow from the principle of causality, the argument is constrained by the fact that the completion processes (analyzed here in some detail) required for the passage from Q J to R J remain empirically untestable. [ABSTRACT FROM AUTHOR]

The study determined the effect of an online educational webinar on young Filipino’s expectations toward aging. Students from social sciences-related programs and engineering/business programs of a state university in the Philippines were recruited to join an intervention group and a passive control group, respectively. Data was obtained in two time points for both groups through the Expectations Toward Aging Questionnaire (ERA-12). Results showed that the intervention group’s baseline scores improved significantly compared to the control group. Consistent with the previous studies, our data suggests that affordable and short online educational interventions may be effective in reducing ageism among young university students. The study highlights the importance of further research on ageism and strategies to promote age-friendly environments in the Philippines. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to advance the concept of region reaching control for a single robot to the study of region reaching consistency for uncertain fully‐actuated multi‐robot systems formulated by Lagrange dynamics. By introducing a directed network communication topology and utilizing the pinning‐like control methods, a distributed region reaching consensus control strategy is proposed. The desired region shape can be specified by selecting an appropriate potential objective function. A feature of the developed region reaching consensus algorithm is fully distributed, which is also an important generalization of pinning‐like set point tracking scheme based on the typical proportion‐integration‐differentiation control scheme. More importantly, the scope of consistency in this paper can be explicitly defined, which is different from traditional consistency control algorithms. Subsequently, numerical examples are presented to illustrate the performance of the designed controllers. [ABSTRACT FROM AUTHOR]

In this paper, given a fixed reference point and a fixed intersection of finitely many equal radii balls, we consider the problem of finding a point in the said set which is the most distant, under Euclidean distance, to the said reference point. This proble is NP-complete in the general setting. We give sufficient conditions for the existence of an algorithm of polynomial complexity which can solve the problem, in a particular setting. Our algorithm requires that any point in the said intersection to be no closer to the given reference point than the radius of the intersecting balls. Checking this requirement is a convex optimization problem hence one can decide if running the proposed algorithm enjoys the presented theoretical guarantees. We also consider the problem where a fixed initial reference point and a fixed polytope are given and we want to find the farthest point in the polytope to the given reference point. For this problem we give sufficient conditions in which the solution can be found by solving a linear program. Both these problems are known to be NP-complete in the general setup, i.e the existence of an algorithm which solves any of the above problem without restrictions on the given reference point and search set is undecided so far. [ABSTRACT FROM AUTHOR]

In the present article we describe and discuss a framework for applying different topological data analysis (TDA) techniques to a music fragment given as a score in traditional Western notation. We first consider different sets of points in Euclidean spaces of different dimensions that correspond to musical events in the score, and obtain their persistent homology features. Then we introduce two families of simplicial complexes that can be associated with chord sequences, and leverage homology to compute their salient features. Finally, we show the results of applying the described methods to the analysis and stylistic comparison of fragments from three Brandenburg Concertos by J.S. Bach and two pieces from the Graffiti series by Mexican composer Armando Luna. [ABSTRACT FROM AUTHOR]

The possible tendency of subjects to decrease, hide, or omit symptomatic aspects of their mental functioning is one of the main problems in forensic psychological and psychiatric evaluations. We aimed at verifying the possible existence of significant differences in the Millon Clinical Multiaxial Inventory-III (MCMI-III) scales scores between a sample of dissimulators (n  = 40) and their non-dissimulator counterpart matched by age, sex, and diagnosis. Cases and comparisons were retrieved from the archive of a single university forensic psychiatric centre between 2013 and 2022. Results showed statistically significant higher scores in the sample of dissimulators in the Desirability, Histrionic, Narcissistic, and Compulsive MCMI-III scales than in the comparison sample. Point biserial correlation test disclosed a strong positive correlation between the Desirability, Histrionic, Narcissistic, and Compulsive scales of the MCMI-III and being in the dissimulator group of subjects while a negative correlation emerged for all the other scales except drug dependence. Key points The forensic setting can affect a subject's behaviour. Dissimulation is a mechanism of minimization or concealment of a psycho-pathological condition. The MCMI-III can be a useful tool for a forensic psychiatrist or forensic psychologist in assessing dissimulation. [ABSTRACT FROM AUTHOR]

Let S be a finite set of integer points in R d , which we assume has many symmetries, and let P ∈ R d be a fixed point. We calculate the distances from P to the points in S and compare the results. In some of the most common cases, we find that they lead to unexpected conclusions if the dimension is sufficiently large. For example, if S is the set of vertices of a hypercube in R d and P is any point inside, then almost all triangles PAB with A , B ∈ S are almost equilateral. Or, if P is close to the center of the cube, then almost all triangles PAB with A ∈ S and B anywhere in the hypercube are almost right triangles. [ABSTRACT FROM AUTHOR]

Copyright of Iraqi Journal of Chemical & Petroleum Engineering is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) 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.)

Motivated by the fact that the fuzzy quasi-normed space provides a suitable framework for complexity analysis and has important roles in discussing some questions in theoretical computer science, this paper aims to study the nearest point problems in fuzzy quasi-normed spaces. First, by using the theory of dual space and the separation theorem of convex sets, the properties of the fuzzy distance from a point to a set in a fuzzy quasi-normed space are studied comprehensively. Second, more properties of the nearest point are given, and the existence, uniqueness, characterizations, and qualitative properties of the nearest points are obtained. The results obtained in this paper are of great significance for expanding the application fields of optimization theory. [ABSTRACT FROM AUTHOR]

Copyright of Przegląd Elektrotechniczny is the property of Przeglad Elektrotechniczny 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.)

It has recently been shown that an interferometric approach can be used to obtain Auger lifetimes in molecules in certain point groups. Here, we extend this concept to those molecular states for which Auger decay is energetically forbidden and which exhibit initial quasi-exponential decay followed by quantum revivals. We demonstrate that this allows us to extract the quasi-exponential decay rate and the revival timescale. We solve analytically a model containing a state coupled to the idealized Bixon–Jortner quasicontinuum, and we obtain an interferometric signature of revival, which can be easily generalized to realistic systems. Moreover, we analyze how this revival signature is influenced by the system parameters, and we suggest optimal conditions for its observation. We, therefore, show that our new approach allows population revivals of a molecular state to be detected interferometrically. [ABSTRACT FROM AUTHOR]