Clinical study on improving the diagnostic accuracy of adult elbow joint cartilage injury by multisequence magnetic resonance imaging

BACKGROUND Due to frequent and high-risk sports activities,the elbow joint is susceptible to injury,especially to cartilage tissue,which can cause pain,limited movement and even loss of joint function.AIM To evaluate magnetic resonance imaging(MRI)multisequence imaging for improving the diagnostic accuracy of adult elbow cartilage injury.METHODS A total of 60 patients diagnosed with elbow cartilage injury in our hospital from January 2020 to December 2021 were enrolled in this retrospective study.We analyzed the accuracy of conventional MRI sequences(T1-weighted imaging,T2-weighted imaging,proton density weighted imaging,and T2 star weighted image)and Three-Dimensional Coronary Imaging by Spiral Scanning(3D-CISS)in the diagnosis of elbow cartilage injury.Arthroscopy was used as the gold standard to evaluate the diagnostic effect of single and combination sequences in different injury degrees and the consistency with arthroscopy.RESULTS The diagnostic accuracy of 3D-CISS sequence was 89.34%±4.98%,the sensitivity was 90%,and the specificity was 88.33%,which showed the best performance among all sequences(P<0.05).The combined application of the whole sequence had the highest accuracy in all sequence combinations,the accuracy of mild injury was 91.30%,the accuracy of moderate injury was 96.15%,and the accuracy of severe injury was 93.33%(P<0.05).Compared with arthroscopy,the combination of all MRI sequences had the highest consistency of 91.67%,and the kappa value reached 0.890(P<0.001).CONCLUSION Combination of 3D-CISS and each sequence had significant advantages in improving MRI diagnostic accuracy of elbow cartilage injuries in adults.Multisequence MRI is recommended to ensure the best diagnosis and treatment.

Monotonic and nonmonotonic gentzen deduction systems for L_(3)-valued propositional logic

A sequent is a pair(Г,△),which is true under an as-signment if either some formula inГis false,or some formula in △ is true.In L3-valued propositional logic,a mulisequent is a triple △|Θ|Г,which is true under an assignment if either some formula in △ has truth-value t,or some formula in Θ has truth-value m,or some formula in Г has truth-value￡.Corre-spondingly there is a sound and complete Gentzen deduction system G for multisequents which is monotonic.Dually,a CO-multisequent is a triple △:Θ:Г,which is valid if there is an assignment v in which each formula in△has truth-value≠t,each formula in Θ has truth-value≠m,and each formula in Г has truth-value≠￡.Correspondingly there is a sound and com-plete Gentzen deduction system G-for co-multisequents which is nonmonotonic.

F[x]-lattice basis reduction algorithm and multisequence synthesis

By means of F[x]-lattice basis reduction algorithm, a new algorithm is presented for synthesizing minimum length linear feedback shift registers (or minimal polynomials) for the given mul-tiple sequences over a field F. Its computational complexity is O(N2) operations in F where N is the length of each sequence. A necessary and sufficient condition for the uniqueness of minimal polynomi-als is given. The set and exact number of all minimal polynomials are also described when F is a finite field.

Computing the k-error joint linear complexity of binary periodic multisequences

Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.