arXiv subjects

Rabia Hameed

Publications and source records attributed to Rabia Hameed.

8 recordsLinked to original sources

arXiv2026

A Three-Parameter Binary Subdivision Scheme for Shape-Controlled Curve Design

Shape-controlled curve design plays a fundamental role in computer-aided geometric design, computer graphics, and engineering applications. In this paper, we present a novel three-parameter 9-point binary approximating subdivision scheme constructed by a weighted combination of the refinement rules of the 7-point Lagrange and 7-point B-spline subdivision schemes. The proposed construction employs displacement vectors between the corresponding refinement points of the parent schemes and constructs resultant vectors by combining neighbouring displacement vectors through three independent design-control parameters. These resultant vectors are subsequently used to derive the refinement rules, thereby yielding a unified family of binary subdivision schemes with adjustable geometric characteristics while preserving the approximating nature of the refinement process. Two representative sub-schemes are derived as special cases by imposing suitable constraints on the design-control parameters. Theoretical investigations establish the support, continuity, endpoint rules for open polygons, and Gibbs oscillation behavior of the proposed family, while graphical examples demonstrate the influence of the design-control parameters on the generated limit curves. Owing to its flexible geometric construction, intuitive parameterization, and favorable mathematical properties, the proposed subdivision framework provides a flexible and effective framework for design-controlled curve design and a valuable tool for computer-aided geometric design and related engineering applications.

cs.GR↗

arXiv2026

Search potential for direct slepton pair production at the CEPC with $\sqrt{s}$ = 360 GeV

The Circular Electron Positron Collider (CEPC) is designed to operate at the key center-of-mass energies: 91.2 GeV as a Z factory for precision Z boson studies,$\approx$ 160 GeV at the threshold for W boson pair production, and 240 GeV as a Higgs factory for copious Higgs boson production. It can be upgraded to 360 GeV (CEPC-360GeV) for enabling top quark-antiquark ($t\bar{t}$) pair production. Beyond enabling high-precision measurements of the Standard Model (SM), CEPC-360GeV is uniquely position to perform searches for new physics beyond the SM (BSM) physics, serving as a valuable complement to hadron colliders. This paper presents a sensitivity study on the direct pair production of staus and smuons at the CEPC with $\sqrt{s}$ = 360 GeV, conducted via full Monte Carlo (MC) simulation. Under the assumptions of integrated luminosity 1.0 ab^{-1} and a flat 5% systematic uncertainty, CEPC-360GeV could potentially discover the combined production of left-handed and right-handed staus up to a mass of 170 GeV (if they exist), or up to 169 GeV for pure left-handed staus and 162 GeV for pure right-handed staus. For direct smuon production, the discovery potential reaches up to 178 GeV under the same conditions.

hep-ex↗

arXiv2025

New Physics Search at the CEPC: a General Perspective

The Circular Electron-Positron Collider (CEPC), a proposed next-generation Higgs factory, provides new opportunities to explore physics beyond the Standard Model (SM). With its clean electron-positron collision environment and the ability to collect large samples of Higgs, W, and Z bosons, the CEPC enables precision measurements and searches for new physics. This white paper outlines the CEPC's discovery potential, including studies of exotic decays of the Higgs, Z, and top quarks, dark matter and dark sector phenomena, long-lived particles, supersymmetry, and neutrino-related signatures. Advanced detector technologies and reconstruction techniques, such as one-to-one correspondence reconstruction and jet origin identification, significantly improve sensitivity to rare and weakly interacting processes. The CEPC is particularly well suited to probe the electroweak phase transition and test models of electroweak baryogenesis and dark sector interactions. In addition, global fit analyses highlight the CEPC's complementary role in constraining a wide range of new physics scenarios. These features position the CEPC as a powerful tool for exploring the next frontier in fundamental particle physics in the post-Higgs discovery era.

hep-ex↗

arXiv2024

Single and Double Diffractive Production of Dilepton and Photon at LHC

We have investigated the single and double diffractive production of dileptons and photons in ultra-peripheral collisions at the Large Hadron Collider (LHC). Utilizing advanced theoretical models that integrate quantum electrodynamics (QED) and Quantum Chromodynamics (QCD) frameworks, we analyze the differential cross sections of these processes, with particular emphasis on the role of the Pomeron and resolved Pomeron structures, as well as resolved photon structures. Our research employs diffractive production mechanisms to predict dilepton and photon production rates under various LHC energy scenarios. Our results demonstrate distinct production patterns for single and double diffractive processes, highlighting their potential as probes for studying the electromagnetic structure of heavy ions and the dynamics of soft interactions in high-energy collisions. This paper provides new insights into the photon-mediated and Pomeron-mediated production mechanisms and sets the stage for future experimental investigations at collider facilities.

hep-ph↗

arXiv2023

Relationship between the 2n-points binary and (3n-1)-points quaternary approximating subdivision schemes

Geometric objects are primarily represented using curves and surfaces and the subdivision schemes are the basic tools for these representations. This study is based on a new thought that there is a special relation between the binary and some kinds of the quaternary subdivision schemes. Due to the defined relation the quaternary subdivision schemes can also be formulated by the binary subdivision schemes. This study presents the generalized formula in compact form that contains the subdivision rules of (3n-1)-point quaternary approximating subdivision scheme which are based on the predefined 2n-points binary approximating subdivision scheme. Firstly, we derive a relation between the quaternary approximating subdivision scheme and the even-point binary approximating subdivision scheme. By using this relation, we next derive two types of generalized quaternary approximating subdivision scheme that are based on the even and odd values of n. Then we apply these generalized formulas on the known binary schemes for specific values of $n$. This gives us the corresponding quaternary approximating subdivision schemes. We also analyze some of the well-known features of binary and its corresponding quaternary approximating subdivision schemes. These results are equally applicable on parametric and non-parametric subdivision schemes.

math.GM↗

arXiv2019

Variations in 2D and 3D models by a new family of subdivision schemes and algorithms for its analysis

A new family of combined subdivision schemes with one tension parameter is proposed by the interpolatory and approximating subdivision schemes. The displacement vectors between the points of interpolatory and approximating subdivision schemes provide the flexibility in designing the limit curves and surfaces. Therefore, the limit curves generated by the proposed subdivision schemes variate in between or around the approximating and interpolatory curves. We also design few analytical algorithms to study the properties of the proposed schemes theoretically. The efficiency of these algorithms are analyzed by calculating their time complexity. The graphical representations and graphical properties of the proposed schemes are also analyzed.

math.NA↗

arXiv2019

Recursive process for constructing the refinement rules of new combined subdivision schemes and its extended form

In this article, we present a new method to construct a family of (2N+2)-point binary subdivision schemes with one tension parameter where N is a non-negative integer. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors. Therefore, the refinement rules of a (2N+2)-point scheme for N=M are recursively obtained from the refinement rules of the (2N+2)-point schemes for N=0,1,2,...,M-1. The complexity, polynomial reproduction and polynomial generation of these schemes are increased by two for the successive values of $N$. Furthermore, we modify this family of schemes to a family of (2N+3)-point schemes with two tension parameters. Moreover, a family of interproximate subdivision schemes with tension parameters is also introduced, which allows a different tension value for each edge and vertex of the initial control polygon. Interproximate schemes generate curves and surfaces such that some initial control points are interpolated and others are approximated.

math.NA↗

arXiv2017

Families of non-linear subdivision schemes for scattered data fitting and their non-tensor product extensions

In this article, families of non-linear subdivision schemes are presented that are based on univariate polynomials up to degree three. Theses families of schemes are constructed by using dynamic iterative re-weighed least squares method. These schemes are suitable for fitting scattered data with noise and outliers. Although these schemes are non-interpolatory, but have the ability to preserve the shape of the initial polygon in case of non-noisy initial data. The numerical examples illustrate that the schemes constructed by non-linear polynomials give better performance than the schemes that are constructed by linear polynomials (Computer-Aided Design, 58, 189-199). Moreover, the numerical examples show that these schemes have the ability to reproduce polynomials and do not cause over and under fitting of the data. Furthermore, families of non-linear bivariate subdivision schemes are also presented that are based on linear and non-linear bivariate polynomials.

math.NA↗