Effects of Complex Parameters on t→ch^0 in Supersymmetric QCD

We investigate the leading SUSY-QCD contributions to the branch ratio (BR) oft→ch~0 within the context of the minimal supersymmetric standard model (MSSM) with complex parameters,assuming more generally that there is a misalignment between the squark and quark that leads to a flavor non-diagonal squark mass matrix.We introduce complex phases only in μ and At,namely φ_μ and φ_(Aq),for simplicity,and study the dependence of the BR of t→ch~0 on these phase parameters.Our calculations show that these CP-violation phases and the flavor mixing parameter λ influence the BR oft→ch~0 considerably,and the effect induced by φ_(At) is much larger than that by φ_μ and φ_(Ac(?)u.For different values of the complex parameters μ and A_t that are set in this paper,the BR of t -+ ch~ is in the range of 10~(-7)～10~(-6),depending mainly on the value of the trilinear coupling A_t.

Detection of macular ganglion cell complex loss and correlation with choroidal thickness in chronic and recurrent central serous chorioretinopathy

AIM:To investigate the association of ganglion cell complex thickness(GCCt),global loss volume percentage(GLV%),and focal loss volume percentage(FLV%)with structural and functional findings among patients with chronic central serous chorioretinopathy(CCSC)and recurrent central serous chorioretinopathy(RCSC)by optical coherence tomography(OCT).METHODS:Among 29 patients with monocular affected central serous chorioretinopathy(CSC),15 had CCSC,and 14 had RCSC.The GCCt,FLV%,GLV%,and subfoveal choroidal thickness(SFCT)and sublesional choroidal thickness(SLCT)values were determined using OCT,and the association of these characteristics with neural structure parameters,choroidal morphology,features and functional alterations were estimated for the CCSC and RCSC patients.RESULTS:In CCSC,the affected eyes had significantly lower GCCt values than the fellow eyes in the macular regions(all P<0.05),with the highest GCCt observed in the inferior area.A significant association was found between the GCCt in different regions and the change in best corrected visual acuity(BCVA;r=-0.696;-0.695;-0.694,P<0.05)in CCSC patients.A statistically significant moderate negative correlation indicated that long-term CCSC was associated with greater differences in the GCCt in different regions between affected and fellow eyes(r=-0.562;r=-0.556;r=0.525,P<0.05).Additionally,observation of thickened SFCT was associated with a worse FLV%(r=0.599;r=0.546,P<0.05)in both groups.Similarly,thickened SLCT was associated with FLV%in RCSC patients(r=0.544,P<0.05).CONCLUSION:The distribution and GCCt are associated with the duration and visual outcomes of CCSC,whereas there is no correlation among RCSC patients.FLV%may be instrumental in differentiating the various outer choroidal vessels(pachyvessels)in long-term CSC.These results suggest that neural structure parameters may aid in estimating and predicting the recovery of altered morphology and function in CCSC and RCSC patients.

Software Metric Analysis of Open-Source Business Software

Over the past decade, open-source software use has grown. Today, many companies including Google, Microsoft, Meta, RedHat, MongoDB, and Apache are major participants of open-source contributions. With the increased use of open-source software or integration of open-source software into custom-developed software, the quality of this software component increases in importance. This study examined a sample of open-source applications from GitHub. Static software analytics were conducted, and each application was classified for its risk level. In the analyzed applications, it was found that 90% of the applications were classified as low risk or moderate low risk indicating a high level of quality for open-source applications.

Z-scan analysis of high-order nonlinear refraction effect induced by using elliptic Gaussian beam

The irradiance of an elliptic Gaussian beam that is high enough to excite high-order nonlinear refraction effect is used to calculate the normalized on-axis transmittance function in the z-scan technique by introducing complex beam parameters which make the calculation simpler. The transmittance formula is applied to the first-, first two-, and first three-order nonlinearities. Numerical evaluation shows that the symmetry no longer holds when using an elliptic Gaussian beam instead of a circular Gaussian beam. A distortion is observed in the central part of the curve, which decreases as ellipticity increases. Moreover, the variation of the normalized peak-valley difference decreases as ellipticity decreases.

Software Analytics of Open Source Business Software

This paper applies software analytics to open source code. Open-source software gives both individuals and businesses the flexibility to work with different parts of available code to modify it or incorporate it into their own project. The open source software market is growing. Major companies such as AWS, Facebook, Google, IBM, Microsoft, Netflix, SAP, Cisco, Intel, and Tesla have joined the open source software community. In this study, a sample of 40 open source applications was selected. Traditional McCabe software metrics including cyclomatic and essential complexities were examined. An analytical comparison of this set of metrics and derived metrics for high risk software was utilized as a basis for addressing risk management in the adoption and integration decisions of open source software. From this comparison, refinements were added, and contemporary concepts of design and data metrics derived from cyclomatic complexity were integrated into a classification scheme for software quality. It was found that 84% of the sample open source applications were classified as moderate low risk or low risk indicating that open source software exhibits low risk characteristics. The 40 open source applications were the base data for the model resulting in a technique which is applicable to any open source code regardless of functionality, language, or size.

HSS METHOD WITH A COMPLEX PARAMETER FOR THE SOLUTION OF COMPLEX LINEAR SYSTEM

In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

The constrained minimum vertex cover problem on bipartite graphs （the Min-CVCB problem） is an important NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the technique of chain implication. For any given constant ε〉 0, if an instance of the Min-CVCB problem has a minimum vertex cover of size （ku, kl）, our algorithm constructs a vertex cover of size （ku^＊, kl^＊）, satisfying max{ku^＊/ku, kl^＊/kl} ≤ 1 ＋ ε.

Parameter Ecology for Feedback Vertex Set

This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance,the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SET for a wide range of parameters.We survey known results and present several new complexity classifications. For example, we prove that FEEDBACK VERTEX SET is fixed-parameter tractable parameterized by the vertex-deletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertex-deletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP coNP=poly and the polynomial-time hierarchy collapses.