Multivariate optimization and comparison between conventional extraction (CE) and ultrasonic-assisted extraction (UAE) of carotenoid extraction from cashew apple

Carotenoids are an essential component of cashew and can be used in pharmaceuticals, cosmetics, natural pigment, food additives, among other applications. The present work focuses on optimizing and comparing conventional and ultrasound-assisted extraction methods. Every optimization step took place with a 1:1 (w:w) mixture of yellow and red cashew apples lyophilized and ground in a cryogenic mill. A Simplex-centroid design was applied for both methods, and the solvents acetone, methanol, ethanol, and petroleum ether were evaluated. After choosing the extractor solvent, a central composite design was applied to optimize the sample mass (59–201 mg) and extraction time (6–34 min). The optimum conditions for the extractor solvent were 38% acetone, 30% ethanol, and 32% petroleum ether for CE and a mixture of 44% acetone and 56% methanol for UAE. The best experimental conditions for UAE were a sonication time of 19 min and a sample mass of 153 mg, while the CE was 23 min and 136 mg. Comparing red and yellow cashews, red cashews showed a higher carotenoid content in both methodologies. The UAE methodology was ca. 21% faster, presented a more straightforward composition of extracting solution, showed an average yield of superior carotenoid content in all samples compared to CE. Therefore, UAE has demonstrated a simple, efficient, fast, low-cost adjustment methodology and a reliable alternative for other applications involving these bioactive compounds in the studied or similar matrix.     

Hamiltonian and long paths in bipartite graphs with connectivity

Let G be a graph, $\nu (G)$ the order of G, $\kappa (G)$ the connectivity of G and k a positive integer such that $k\le (\nu (G)?2)/2$. Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets $V_1$ and $V_2$ is defined to be Hamiltonian-laceable if such that $|V_1|=|V_2|$ and for every pair of vertices $p\in V_1$ and $q\in V_2$, there exists a Hamiltonian path in G with endpoints p and q, or $|V_1|=|V_2|+1$ and for every pair of vertices $p,q\in V_1,p\ne q$, there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition $(X,Y)$. Define $bn(G)$ to be a maximum integer such that $0\le bn(G)<min\{|X|,|Y|\}$ and (1) for each non-empty subset S of X, if $|S|\le |X|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|X|?bn(G)<|S|\le |X|$, then $N(S)=Y$; and (2) for each non-empty subset S of Y, if $|S|\le |Y|?bn(G)$, then $|N(S)|\ge |S|+bn(G)$, and if $|Y|?bn(G)<|S|\le |Y|$, then $N(S)=X$; and (3) $bn(G)=0$ if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition $(X,Y)$ such that $|X|=|Y|$ and $bn(G)>0$. In this paper, we show that if $\nu (G)\le 2\kappa (G)+4bn(G)?4$, then G is Hamiltonian-laceable; or if $\nu (G)>6bn(G)?2$, then for every pair of vertices $x\in X$ and $y\in Y$, there is an $(x,y)$-path P in G with $|V(P)|\ge 6bn(G)?2$. We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs.     

在对比情境中走进真实的化学科学*——高一化学绪言课教学

绪言课的教学效果对于学生后续学习起着举足轻重的作用,基于对高一化学绪言课教学意蕴的分析,选取了历史与现代、生活与科研、国内与国外等多种情境素材,并设计成对比的教学情境,竭力将学生带进真实的化学科学,引领高中化学学习的方向,打开学生的国际视野,培养学生的家国情怀。并结合问卷调查对本节课教学效果进行了反思。     

微流控纸芯片的加工及其分析应用的实验设计*

设计了一个使用喷墨打印法加工微流控纸芯片的实验,在经烷基烯酮二聚体(AKD)的正己烷溶液浸泡过的滤纸上,以三乙醇胺溶液为打印墨水,用喷墨打印机打印出设计好的芯片图案。滤纸加热后,打印区域呈现亲水性,非打印区域为疏水性,从而制备出纸芯片,用该纸芯片通过数字比色法实现了亚硝酸根离子的定量测定。该实验不使用昂贵仪器设备,易普及。通过实验,促使学生了解微流控芯片这一前沿科学技术,锻炼学生细致、灵巧的动手能力,激发学生科技创新活力。     

Pure tetrahedral quadruple systems with index two

An oriented tetrahedron defined on four vertices is a set of four cyclic triples with the property that any ordered pair of vertices is contained in exactly one of the cyclic triples. A tetrahedral quadruple system of order $n$ with index $\lambda$, denoted by ${\text{TQS}}_{\lambda }\left(n\right)$, is a pair $\left(X,\mathrm{?}\right)$, where $X$ is an $n$‐set and $\mathrm{?}$ is a set of oriented tetrahedra (blocks) such that every cyclic triple on $X$ is contained in exactly $\lambda$ members of $\mathrm{?}$. A ${\text{TQS}}_{\lambda }\left(n\right)$ is pure if there do not exist two blocks with the same vertex set. When $\lambda =1$, the spectrum of a pure TQS $\left(n\right)$ has been completely determined by Ji. In this paper, we show that there exists a pure ${\text{TQS}}_2\left(n\right)$ if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$. A corollary is that a simple ${\text{QS}}_4\left(n\right)$ also exists if and only if $n\equiv 1,2\left(\mathrm{mod}3\right)$ and $n\ge 7$.     

QEPAS系统中石英音叉模态仿真计算与研究

对石英音叉增强型光声光谱(QEPAS)系统中常用的石英音叉进行了有限元模态计算，获得石英音叉前6阶振型与模态频率，认知了第4阶对称摆动振型为有效振动，利用单因素法分析了石英音叉的音臂长度l₁、音臂宽度w₁、音臂厚度t、音臂切角θ、音臂圆孔直径d及音臂圆孔高度h对低阶有效共振频率(Fre)的影响，敏感度依次为： l₁> w₁>d>θ>t>h，考虑实际设计情形，筛选出了l₁，w₁，d与h四个石英音叉设计变量，采用Box-Behnken实验设计方案与RSM(response surface methodology)方法，以Fre为函数目标，建立l₁，w₁，d与h的二次回归响应面模型，得到了参数之间的交互作用，利用Design-Expert软件对响应面模型进行设计参数反求，结果表明，在15 000 Hz≤Fre≤25 000 Hz计算区域内误差较小，基本满足QEPAS系统的计算需求，所提出的研究与设计方法具有一定通用性，可为QEPAS系统中石英音叉结构参数设计提供参考。     

The martingale problem for a class of nonlocal operators of diagonal type

We consider systems of stochastic differential equations of the form $$\begin{array}{c}\hfill d{X}_t^i=\sum _{j=1}^d{A}_{ij}\left(X_{t?}\right)d{Z}_t^j\end{array}$$ for $i=1,?,d$ with continuous, bounded and non‐degenerate coefficients. Here $Z_t^1,?,Z_t^d$ are independent one‐dimensional stable processes with ${\alpha }_1,?,{\alpha }_d\in (0,2)$. In this article we research on uniqueness of weak solutions to such systems by studying the corresponding martingale problem. We prove the uniqueness of weak solutions in the case of diagonal coefficient matrices.