The set of toric minimal log discrepancies

We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points. This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011.     

Kubische Berechnung der Retentionsindices ohne Kenntnis der Totzeit tm

Zusammenfassung In der vorliegenden Arbeit wird eine Methode zur Retentionsindex-Bestimmung beschrieben, die von einem kubischen Zusammenhang zwischen Bruttoretentionszeit-Differenzen der Referenzhomologen und der Kohlenstoffzahl ausgeht. Hieraus ergeben sich direkt die Nettoretentionszeiten. Der Fehler der Totzeitbestimmung entfällt bei dieser Methode. Mit den so gewonnenen Nettoretentionszeiten erhält man über einen kubischen Zusammenhang zwischen 1g t_s=f(C) die Retentionsindices. Extrapolationen und Interpolationen sind über 300 Retentionsindexeinheiten mit einem mittleren Fehler von ±0,02 Retentionsindexeinheiten möglich. Das Verfahren bietet sich für eine automatische Berechnung der I-Werte mittels on-line-Datenverarbeitung an.

---

Cubic calculation of retention indices without determining the dead-time t_m

Summary The method for the calculation of retention indices described here is based on a third order relationship between the logarithm of differences of unadjusted retention times of homologues and the carbon number. From this adjusted retention times are directly calculated. A determination of the dead-time is not necessary thus avoiding the errors connected with this factor. A cubic equation for the logarithm of the adjusted retention time lg t_s as a function of carbon number C_n is used for the retention index calculation. Extrapolations and interpolations can be done over a range of 300 index units with an average deviation of ±0.02 i.u.. The method offers the possibility of an automated on-line calculation of retention indices by computer merely on the basis of unadjusted retention times.

     

Analysis of grid file algorithms

Grid file algorithms were suggested in [12] to provide multi-key access to records in a dynamically growing file. We specify here two algorithms and derive the average sizes of the corresponding directories. We provide an asymptotic analysis. The growth of the indexes appears to be non-linear for uniform distributions:O(v ^c ) orO(v ), wherec=1+b^–1, =1+(s-1)/(sb+1),s is the number of attributes being used,v the file size, andb the page capacity of the system. Finally we give corresponding results for biased distributions and compare transient phases.     

An <Emphasis Type="BoldItalic">in silico</Emphasis> approach for screening flavonoids as P-glycoprotein inhibitors based on a Bayesian-regularized neural network

Summary P-glycoprotein (P-gp), an ATP-binding cassette (ABC) transporter, functions as a biological barrier by extruding cytotoxic agents out of cells, resulting in an obstacle in chemotherapeutic treatment of cancer. In order to aid in the development of potential P-gp inhibitors, we constructed a quantitative structure–activity relationship (QSAR) model of flavonoids as P-gp inhibitors based on Bayesian-regularized neural network (BRNN). A dataset of 57 flavonoids collected from a literature binding to the C-terminal nucleotide-binding domain of mouse P-gp was compiled. The predictive ability of the model was assessed using a test set that was independent of the training set, which showed a standard error of prediction of 0.146 ± 0.006 (data scaled from 0 to 1). Meanwhile, two other mathematical tools, back-propagation neural network (BPNN) and partial least squares (PLS) were also attempted to build QSAR models. The BRNN provided slightly better results for the test set compared to BPNN, but the difference was not significant according to F-statistic at p = 0.05. The PLS failed to build a reliable model in the present study. Our study indicates that the BRNN-based in silico model has good potential in facilitating the prediction of P-gp flavonoid inhibitors and might be applied in further drug design.     

路由器端电子邮件拦截与放行设计与实现

针对实时电子邮件传输过程中安全性和可靠性的需求,提出一种在路由器端基于特征分析的拦截与放行方法。通过对电子邮件传输协议和内核机制的分析,以及对特征文件的解析,在内核态下采用多模式匹配方法对数据包进行识别及时的做出判断。实验结果表明,在满足可行性的前提下,对邮件实现安全性过滤,该方法具有很好的时效性。     

一种基于STM32的NAND flash的块分配框架设计

STM32对大容量数据文件存储与管理问题可通过NAND flash来解决。而NAND flash的高效管理需要文件系统参与。NAND flash有特殊的块读写及擦除机制,一般的嵌入式文件系统组织结构并不完全兼容NAND flash。针对NAND flash的特点兼顾STM32的资源承受力要提出新的NAND flash块分配框架,框架通过块分配槽这种数据结构,在不使用块分配表与垃圾表的情况下,实现了NAND flash均衡负载与垃圾块的回收;同时通过节点分配栈与文件节点表的配合来提高STM32对文件的读写速度,空间利用率和系统性能。仿真实验和计算结果表明该块分配框架可有效提高NAND flash块的均衡负载与节省RAM空间。     

微流控芯片计算机辅助设计、辅助制造方法研究

介绍了一种采用计算机辅助制造中快速成型技术实现微流控芯片快速制作的方法。采用VB二次开发工具(VBA),在计算机辅助设计(CAD)二次开发平台上建立微流控芯片三维CAD立体模型,并通过计算机软件算法对CAD模型进行分层切片,为实现微流控芯片计算机辅助制造提供加工数据。文中针对微流控芯片加工精度要求高的特点,提出了采用位图数据图像格式(BMP)数据格式取代快速成型分层切片中常用的三角面片数据格式(STL),并对具体实现方法进行了详细介绍。     

用胶束液相色谱模拟生物膜预测药物的醇-水分配系数log P

通过比较药物在不同类型表面活性剂的胶束液相色谱中的容量因子与药物的醇-水分配系数(log P)的相关性, 发现药物在非离子型表面活性剂Brij35作为流动相的胶束液相色谱中的容量因子与其文献中报道的log P间有一定的相关性, 进一步考察了Brij35浓度对药物保留的影响, 并建立了药物在不同浓度的Brij35胶束液相色谱中的容量因子与文献中log P的相关关系, 该方法简单、快速, 将为药物的疏水性评价提供重要的参考价值.     

Weighted differentiation composition operator from logarithmic Bloch spaces to Bloch‐type spaces

In this paper, we give a new characterization for the boundedness of weighted differentiation composition operator from logarithmic Bloch spaces to Bloch‐type spaces and calculate its essential norm in terms of the n‐th power of induced analytic self‐map on the unit disk. From which a sufficient and necessary condition of compactness of this operator follows immediately.