PRiME HLB前处理技术联合超高效液相色谱-三重四极杆质谱系统检测水产品中17种磺胺类药物残留

使用通过型固相萃取小柱PRi ME HLB处理水产品样品,建立了一种水产品中17种磺胺类药物的简单、快速的筛选分析方法。水产品样品经80%乙腈水溶液(含0.2%甲酸)提取,过PRi ME HLB固相萃取柱净化,浓缩后经C_(18)色谱柱梯度洗脱分离,超高效液相色谱-三重四极杆质谱系统进行定量分析。结果表明,17种磺胺类药物在1.0~50.0 ng·mL^(-1)线性关系良好,相关系数R^(2)>0.99;该方法检出限为2μg·kg^(-1);添加浓度为10μg·kg^(-1)时方法回收率在71.3%~118.4%,RSD值均小于20%。

A Note on the Commutativity of Prime Near-rings

Let N be a prime near-ring. We show two main results on the commutativity of N： （1） If there exist k, l ∈ N such that N admits a generalized derivation D satisfying either D（[x,y]） = xk[x,y]xl for all x,y ∈ N or D（[x,y]） = -xk[x,y]xI for all x,y ∈ N, then N is a commutative ring. （2） If there exist k, l ∈ N such that N admits a generalized derivation D satisfying either D（x o y） = xk（x o y）xl for all x, y ∈ N or D（x o y） = -xk（x o y）xl for all x, y ∈ N, then N is a commutative ring. Moreover, some interesting relations between the prime graph and zero-divisor graph of N are studied.

An Introduction to the Theory of Matrix Near-Rings

Matrix rings are prominent in abstract algebra. In this paper we give an overview of the theory of matrix near-rings. A near-ring differs from a ring in that it does not need to be abelian and one of the distributive laws does not hold in general. We introduce two ways in which matrix near-rings can be defined and discuss the structure of each. One is as given by Beildeman and the other is as defined by Meldrum. Beildeman defined his matrix near-rings as normal arrays under the operation of matrix multiplication and addition. He showed that we have a matrix near-ring over a near-ring if, and only if, it is a ring. In this case it is not possible to obtain a matrix near-ring from a proper near-ring. Later, in 1986, Meldrum and van der Walt defined matrix near-rings over a near-ring as mappings from the direct sum of n copies of the additive group of the near-ring to itself. In this case it can be shown that a proper near-ring is obtained. We prove several properties, introduce some special matrices and show that a matrix notation can be introduced to make calculations easier, provided that n is small.

Origin of Sexy Prime Numbers, Origin of Cousin Prime Numbers, Equations from Supposedly Prime Numbers, Origin of the Mersenne Number, Origin of the Fermat Number

We have found through calculations that the differences between the closest supposed prime numbers other than 2 and 3 defined in the articles are: 2;4: and 6. For those whose difference is equal to 6, we showed their origin then we classified them into two categories according to their classes, we showed in which context two prime numbers which differ from 6 are called sexy and in what context they are said real sexy prime. For those whose difference is equal to 4, we showed their origin then we showed that two prime numbers which differ from 4, that is to say two cousin prime numbers, are successive. We made an observation on the supposed prime numbers then we established two pairs of equations from this observation and deduced the origin of the Mersenne number and that of the Fermat number.

How Prime Numbers Are Interconnected and Built with Two Equations: Addition and Subtraction Rules the Function (6µ)

Are all prime numbers linked by four simple functions? Can we predict when a prime will appear in a sequence of primes? If we classify primes into two groups, Group 1 for all primes that appear before ζ (such that , for instance 5, ), an even number divisible by 3 and 2, and Group 2 for all primes that are after ζ (such that , for instance 7), then we find a simple function: for each prime in each group, , where n is any natural number. If we start a sequence of primes with 5 for Group 1 and 7 for Group 2, we can attribute a μ value for each prime. The μ value can be attributed to every prime greater than 7. Thus for Group 1, and . Using this formula, all the primes appear for , where μ is any natural number.

Preliminary Identification of a Prime Number Other Than 2 and 3, the Origin of Twin Prime Numbers, the Structure of the Chain of Prime Numbers and the Set of Prime Numbers Less Than a Given Integer

The application of the Euclidean division theorem for the positive integers allowed us to establish a set which contains all the prime numbers and this set we called it set of supposedly prime numbers and we noted it Esp. We subsequently established from the previous set the set of non-prime numbers (the set of numbers belonging to this set and which are not prime) denoted Enp. We then extracted from the set of supposedly prime numbers the numbers which are not prime and the set of remaining number constitutes the set of prime numbers denoted Ep. We have deduced from the previous set, the set of prime numbers between two natural numbers. We have explained during our demonstrations the origin of the twin prime numbers and the structure of the chain of prime numbers.

The Periodic Table of Primes

Over millennia, nobody has been able to predict where prime numbers sprout or how they spread. This study establishes the Periodic Table of Primes (PTP) using four prime numbers 2, 3, 5, and 7. We identify 48 integers out of a period 2×3×5×7=210 to be the roots of all primes as well as composites without factors of 2, 3, 5, and 7. Each prime, twin primes, or composite without factors of 2, 3, 5, and 7 is an offspring of the 48 integers uniquely allocated on the PTP. Three major establishments made in the article are the Formula of Primes, the Periodic Table of Primes, and the Counting Functions of Primes and Twin Primes.

On the Number of Primes in the Interval (x, 2x) by an Elementary Method

An elementary formula to know the number of primes in the interval (x, 2x) close to the exact figure for a fixed x is given here. A new elementary equation is derived (a relation between prime numbers and composite numbers distributed in the interval [1, 2x]). An elementary method to know the number of primes in a given magnitude is suitably placed in the form of a general formula, and we have proved it. The general formula is applied to the terms of the equation, and a tactical simplification of the terms gives rise to an expression whose verification envisages scope for its further studies.

Distribution and Relation of Primes with Tesla Numbers 3, 6, and 9

This work presents a different approach to twin primes, an approach from the perspective of the Tesla numbers and gives a refresh and new observation of twin primes that could lead us to an answer to the Twin Prime Conjecture problem. We expose a peculiar relation between twin primes and the generation of prime numbers with Tesla numbers. Tesla numbers seem to be present in so many domains like time, vibration and frequency [1], and the space between twin primes is not the exception. Let us say that twin primes are more than just prime numbers plus 2 or minus 2, and Tesla numbers are more involved with twin primes than we think, and hopefully, this approach give us a better understanding of the distribution of the twin pairs.

Primetime Fashion Beijing hosts China Fashion Week A/W 2024

The China Fashion Week A/W 2024,hosted by the China Fashion Designers Association,took place in Beijing from March 23 to 31.Themed“Fu”(Empower),this season’s fashion week continued to focus on Chinese aesthetics,innovation in intangible cultural heritage,fusion of Chinese trends.

基于Vega Prime的无人直升机飞行模拟系统

以某型无人直升机为仿真对象设计了一款飞行模拟系统,该系统由飞行仿真模块、座舱仿真模块、视景仿真模块和控制台模块4部分组成。飞行仿真模块对旋翼、尾桨、机身、平尾、垂尾等各部件进行动力学建模,并使用S函数编写了Simulink模块;座舱仿真模块使用GL Studio软件设计了照片级的飞行仪表用于实时显示飞行数据;视景仿真模块是基于Vega Prime仿真平台二次开发的;采用基于MFC(microsoft foundation classes)的多线程方法搭建了基本的仿真框架并设计了控制台模块界面,可以用于和用户的实时交互。最后仿真验证了系统的可行性。

Redefined generalized fuzzy ideals of near-rings

With a new idea, we redefine generalized fuzzy subnear-rings （ideals） of a near- ring and investigate some of its related properties. Some new characterizations are given. In particular, we introduce the concepts of strong prime （or semiprime） （∈, ∈∨ q）-fuzzy ideals of near-rings, and discuss the relationship between strong prime （or semiprime） （∈, ∈∨ q）-fuzzy ideals and prime （or semiprime） （∈, ∈∨ q）-fuzzy ideals of near-rings.

Generalized fuzzy ideals of near-rings

The concept of（∈,∈∨q）-fuzzy subnear-rings（ideals） of a near-ring is introduced and some of its related properties are investigated.In particular,the relationships among ordinary fuzzy subnear-rings（ideals）,（∈,∈∨ q）-fuzzy subnear-rings（ideals） and（∈,∈∨q）-fuzzy subnear-rings（ideals） of near-rings are described.Finally,some characterization of [μ]t is given by means of（∈,∈∨ q）-fuzzy ideals.

The Integral of the Inverse of the Primes

The present paper gives the proof of the set of primes as continuum and evaluates the analytical formula for the integral of the inverse of the primes over the distance. First it starts with the density of the primes, shortly recapitulates the prime-number-formula and the complete-prime-number-formula, the proof of the set of primes as continuum. The theoretical evaluation is followed in annexes by numerical evaluation of the theoretical results and of different constants, which represent inherent properties of the set of primes.

Corresponding Prime Number Distribution Equation

The conjecture of twin prime numbers is a mathematical problem. Proving the twin prime conjecture using traditional modern number theory is extremely profound and complex. We propose an elementary research method for corresponding prime number, proved that the conjecture of twin prime numbers and obtain the corresponding prime distribution equation. According to the distribution rate of corresponding prime numbers, the distribution pattern of twin prime numbers was proved the distribution rate theorem. This is the distribution rate of prime numbers corresponding to composite numbers, which approaches the distribution rate of prime numbers corresponding to integers. Based on the corresponding prime distribution equation, obtain the twin prime inequality function. Then, the formula for calculating twin prime numbers was discussed. There is also the Hardy Littlewood conjecture. This provides a practical and feasible approach for studying the distribution of twin prime numbers.

Primed Expression of Defense-Related Genes by Streptomyces cameroonensis-Based Bioformulation (SCaB) on Cocoa Seedlings in a Nursery Challenged with Phytophthora megakarya

A Streptomyces cameroonensis based bioformulation (SCaB) has been developed and shown to be stable and effective in controlling the early proliferation of P. megakarya and promoting the growth of cocoa seedlings in nursery. This study was carried out to explore the molecular mechanisms associated with the interaction of SCaB, cocoa seedlings, and the pathogen during the early stages of seedling growth in the nursery. For this purpose, seedling treatment with 10% W/W SCaB under greenhouse conditions evaluated SCaB’s capacity to stimulate the defense mechanisms in cocoa. Agronomic growth parameters and the level of induction of defense-associated compounds were analyzed. Real-time (rt) PCR was used to assess the level of expression of defense genes. Here, we showed that the application of SCaB as a seedling treatment enhanced the growth of cocoa seedlings in the nursery by an average of 15.6% after 30 days of growth and led to an average reduction in disease severity of 64% when challenged with P. megakarya. The latter led to an increased synthesis of total phenolic compounds, flavonoids, chitinases, peroxidases, and β-1,3-glucanases and an induced up-regulation of TcChiB, TcGlu-1, TcPer-1, and TcMYBPA genes. This research provides a basis for the optimization of beneficial microorganisms as a viable alternative to chemical fungicides used in disease suppression.

PRiME HLB固相萃取-高效液相色谱-串联质谱法测定化妆品中的双酚A

建立了PRiME HLB固相萃取-高效液相色谱-串联质谱测定水状、膏霜状和精油状化妆品中的双酚A残留量的方法。化妆品基质采用5%氨水乙腈溶液提取,使用PRiME HLB固相萃取柱净化后,以Waters ACQUITY UPLC BEH C18(100 mm×Φ2.0 mm, 1.7μm)为色谱柱,甲醇-0.1%氟化铵水溶液为流动相,梯度洗脱。电喷雾离子源负离子扫描模式,多反应监测(MRM)进行检测。结果表明,双酚A在本方法下响应较好,在2~50 ng/mL范围内线性良好,相关系数大于0.99,各基质的平均加标回收率为92.5%~101.2%,相对标准偏差小于3.2%。该方法前处理快捷简便,定量准确可靠,能很好地检测化妆品中双酚A的残留量。

On the Expression of Composite Natural Numbers as Tensorial Products of Prime Natural Powers Vectors

This study describes how one can construct sets of composite natural numbers as tensorial products of the vectors created with the natural powers of prime numbers.

The Primes and Their Subsets as Continuum like the Integers

The present paper gives the proof of the set of primes as a continuum. It starts with the density of the primes, and shortly recapitulates the prime-number-formula and the complete-prime-number-formula. Reflecting the series of the primes over any prime gives the double density of occupation of integer positions by the union of the series of multiples of the primes. The remaining free positions render it possible to prove Goldbach’s conjecture and the set of primes as a continuum. The theoretical evaluation is followed in annexes by numerical evaluation, demonstrating the theoretical results. The numerical evaluation results in different constants and relations, which represent inherent properties of the set of primes.

On Prime Numbers between kn and (k + 1) n

In this paper along with the previous studies on analyzing the binomial coefficients, we will complete the proof of a theorem. The theorem states that for two positive integers n and k, when n ≥ k - 1, there always exists at least a prime number p such that kn p ≤ (k +1)n. The Bertrand-Chebyshev’s theorem is a special case of this theorem when k = 1. In the field of prime number distribution, just as the prime number theorem provides the approximate number of prime numbers relative to natural numbers, while the new theory indicates that prime numbers exist in the specific intervals between natural numbers, that is, the new theorem provides the approximate positions of prime numbers among natural numbers.