q-deformed W-algebras and elliptic algebras

Ellipticine_DNA拓扑异构酶II抑制剂_CAS号519-23-3说明书_AbMole中国

分子量246.31溶解性（25°C ） DMSO 10 mM 分子式C17H14N2Water CAS 号519-23-3Ethanol 储存条件 3年 -20°C 粉末状 生物活性 Ellipticine 是一种DNA 拓扑异构酶II 抑制剂。Ellipticine 玫瑰树碱作用的另一种方式是通过其与细胞色素P450（CYP ）和过氧化物酶的氧化介导的共价DNA 加合物的形成。Ellipticine 还可以作为生物转化酶的抑制剂或诱导剂，从而调节其自身的代谢，从而产生其遗传毒性和药理作用。 体内研究显示，Ellipticine 治疗导致在几种健康?官（肝，肾，肺，脾，乳腺，心脏和脑）和乳腺癌DNA 中产生玫瑰树碱衍生的DNA 加合物。在这些腺癌中产生的玫瑰树碱衍生的DNA 加合物的水平几乎是正常健康乳腺组织的2倍。 实验操作 来自于公开的文献，仅供参考 细胞实验细胞系MCF-7, U87MG, CCRF-CEM, UKF-NB-3 and UKF-NB-4 neuroblastoma cell lines 方法 Cells in exponential growth were seeded at 1×10 per well in a 96-well microplate. After incubation (48 hours) at 37 °C in 5% CO2saturated atmosphere the MTT solution (2 mg/ml PBS) was added, the microplates were incubated for 4 hours and cells lysed in 50%N,N-dimethylformamide containing 20% of sodium dodecyl sulfate (SDS), pH 4.5. The absorbance at 570 nm was measured for each well by multiwell ELISA reader Versamax (Molecular devices, CA, USA). The mean absorbance of medium controls was subtracted as a background. The viability of control cells was taken as 100% and the values of treated cells were calculated as a percentage of control. The IC50 values were calculated from at least 3 independent experiments using linear regression of the dose-log response curves by SOFTmaxPro. 浓度0, 0.1, 1, 5 or 10 μM 处理时间 48 hours 动物实验动物模型配制剂量给药处理 不同实验动物依据体表面积的等效剂量转换表（数据来源于FDA 指南） 小鼠 大鼠兔豚鼠仓鼠狗重量 (kg)0.020.15 1.80.40.0810体表面积 (m )0.0070.0250.150.050.020.5K 系数 3 6 12 8 5 20 动物 A (mg/kg) = 动物 B (mg/kg) × 动物 B 的K 系数动物 A 的K 系数 例如，依据体表面积折算法，将白藜芦醇用于小鼠的剂量22.4 mg/kg 换算成大鼠的剂量，需要将22.4 mg/kg 乘以小鼠的K 系数（3），再除以大鼠的K 系数（6），得到白藜芦醇用于大鼠的等效剂量为11.2 mg/kg 。 Ellipticine 目录号M9023 化学数据 42m m m m m

A new elliptic contour extraction method for reference hole detection in robotic drilling

INDUSTRIAL AND COMMERCIAL APPLICATION A new elliptic contour extraction method for reference hole detection in robotic drilling Biao Mei ?Weidong Zhu ?Guorui Yan ? Yinglin Ke Received:29September 2013/Accepted:22July 2014/Published online:3August 2014óSpringer-Verlag London 2014 Abstract In robotic drilling of aircraft structures,refer-ence holes are pre-drilled on aircraft structures and then detected by vision systems in the drilling process to com-pensate for the relative positioning errors between the robot tool center point and the workpiece,thus achieving improved position accuracy of drilled holes.In this paper,a novel elliptic contour extraction method based on salient region detection and optimization with snakes model is proposed for reference hole detection.Firstly,salient region detection is used for segmenting the region of ref-erence hole from the background,and the resultant image of this operation is used for contours retrieving.Secondly,the initial contour of the reference hole is obtained from the retrieved contours using the voting method.Then the initial contour of the reference hole is further re?ned with the snakes model through energy minimizing of the snake.Finally,the elliptical parameters of the reference hole are computed by ?tting an ellipse to the evolving result of the snake.The robustness and accuracy of reference hole detection with respect to noise and environmental distur-bance are enhanced signi?cantly through saliency estima-tion and optimization with the snakes model.Experimental results reveal that the proposed method can be applied to detect reference holes accurately and robustly in the jam-ming environment of aircraft assembly. Keywords Ellipse áContour extraction áSalient áVoting áSnakes áRobotic drilling 1Introduction With the improvement of the position accuracy of indus-trial robots and the development of stiffness compensation and off-line programming,robotic drilling system has become an effective ?exible fastener hole drilling platform for aircraft industry [1].In the process of robotic drilling,the system needs a mathematical model of the workpiece as the basis for creating the robot programs.However,sig-ni?cant differences of position and shape often exist between the workpiece and its mathematical model,lead-ing to incorrect positions of drilled fastener holes.There-fore,robotic drilling systems [2,3]are often integrated with a vision-based measurement unit to improve the position accuracy of the drilled fastener holes.To modify the drilling positions of fastener holes according to the actual workpiece in the assembly environment,typically a set of reference holes are drilled in advance on the work-piece.The actual position of the reference holes in the assembly environment are measured with the vision unit of the robotic drilling system,and the drilling positions of the fastener holes can be corrected according to the deviations between the actual positions and nominal positions of the reference holes. The detection of reference holes is based on accurate contour extraction and description of reference holes in images.In addition,due to the in?uence of noise,illumi-nation intensity and re?ection,accurate detection of ref-erence holes requires more robust algorithms than other applications.This paper focuses on improving the anti-noise performance and weakening the environmental impact in reference hole detection as well as ensuring the accuracy and effectiveness of the vision-based measure-ment.The contours of reference holes,although should be circular in theory,are elliptic in images taken with 2D B.Mei áW.Zhu (&)áG.Yan áY.Ke The State Key Lab of Fluid Power Transmission and Control,Department of Mechanical Engineering,Zhejiang University,Hangzhou 310027,China e-mail:wdzhu@https://www.wendangku.net/doc/4719006262.html, Pattern Anal Applic (2015)18:695–712DOI 10.1007/s10044-014-0394-6

ECC算法介绍

ECC （Elliptic Curves Cryptography ）加密算法是一种公钥加密算法，与主流的RSA 算法相比，ECC 算法可以使用较短的密钥达到相同的安全程度。近年来，人们对ECC 的认识已经不再处于研究阶段，开始逐步进入实际应用，如国家密码管理局颁布的SM2算法就是基于ECC 算法的。下面我们来认识一下ECC 的工作原理。 椭圆曲线 定义 在引入椭圆曲线之前，不得不提到一种新的坐标系-------射影平面坐标系，它是对笛卡尔直角坐标系的扩展，增加了无穷远点的概念。在此坐标系下，两条平行的直线是有交点的，而交点就是无穷远点。两者的变换关系为： 笛卡尔坐标系中的点a （x,y ），令x=X/Z ，y=Y/Z ，则射影平面坐标系下的点a 的坐标为（X,Y,Z)，如点（2,3）就转换为（2Z,3Z,Z ）。 椭圆曲线定义：一条椭圆曲线在射影平面上满足方程：Y 2Z+a 1XYZ+a 3YZ 2=X 3+a 2X 2Z+a 4XZ 2+a 6Z 3 的所有点的集合，且曲线上每个点都是非奇异的。 该方程有名维尔维斯特拉斯方程，椭圆曲线的形状不是椭圆，只是因为其描述的方程类似于计算一个椭圆周长的方程。转换到笛卡尔坐标系下的方程为：y 2+a 1xy+a 3y = x 3+a 2x 2+a 4x+a 6 加法法则 运算法则：任意取椭圆曲线上两点P 、Q （若P 、Q 两点重合，则做P 点的切线）做直线交于椭圆曲线的另一点R’，过R’做y 轴的平行线交于R 。我们规定P+Q=R 。（如图） ● 此处+不是简单的实数相加，是抽象出来的 ● O∞+P=P ，O∞为零元 ● 曲线上三个点A,B,C 处于一条直线上，则A+B+C=O∞ 下面，我们利用P 、Q 点的坐标(x 1,y 1)，(x 2,y 2)，求出R=P+Q 的坐标(x 4,y 4)。 P,Q,R'共线，设为y=kx+b ， 若P≠Q ，k=(y 1-y 2)/(x 1-x 2) 若P=Q ，k=(3x 2+2a 2x+a 4 -a 1y) /(2y+a 1x+a 3) 解方程组得到： x 4=k 2+ka 1-a 2-x 1-x 2; y 4=k(x 1-x 4)-y 1-a 1x 4-a 3; 密码学中的椭圆曲线

Optimizing double-base elliptic-curve single-scalar multiplication

Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication Daniel J.Bernstein1,Peter Birkner2,Tanja Lange2,and Christiane Peters2 1Department of Mathematics,Statistics,and Computer Science(M/C249) University of Illinois at Chicago,Chicago,IL60607–7045,USA djb@cr.yp.to 2Department of Mathematics and Computer Science Technische Universiteit Eindhoven,P.O.Box513,5600MB Eindhoven,The Netherlands p.birkner@tue.nl,tanja@https://www.wendangku.net/doc/4719006262.html,, c.p.peters@tue.nl Abstract.This paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: –many choices of coordinate systems and formulas for individual group operations,including new formulas for tripling on Edwards curves; –double-base chains with many di?erent doubling/tripling ratios,in-cluding standard base-2chains as an extreme case; –many precomputation strategies,going beyond Dimitrov,Imbert, Mishra(Asiacrypt2005)and Doche and Imbert(Indocrypt2006). The analysis takes account of speedups such as S?M tradeo?s and includes recent advances such as inverted Edwards coordinates. The main conclusions are as follows.Optimized precomputations and triplings save time for single-scalar multiplication in Jacobian coordi- nates,Hessian curves,and tripling-oriented Doche/Icart/Kohel curves. However,even faster single-scalar multiplication is possible in Jacobi in- tersections,Edwards curves,extended Jacobi-quartic coordinates,and inverted Edwards coordinates,thanks to extremely fast doublings and additions;there is no evidence that double-base chains are worthwhile for the fastest curves.Inverted Edwards coordinates are the speed leader. Keywords:Edwards curves,double-base number systems,double-base chains,addition chains,scalar multiplication,tripling,quintupling. 1Introduction Double-base number systems have been suggested as a way to speed up scalar multiplication on elliptic curves.The idea is to expand a positive integer n as a sum of very few terms c i2a i3b i with c i=1or c i=?1,and thus to express Permanent ID of this document:d721c86c47e3b56834ded945c814b5e0.Date of this document:2007.10.03.This work has been supported in part by the European Com-mission through the IST Programme under Contract IST–2002–507932ECRYPT. K.Srinathan,C.Pandu Rangan,M.Yung(Eds.):Indocrypt2007,LNCS4859,pp.167–182,2007. c Springer-Verlag Berlin Heidelberg2007

快速椭圆曲线密码elliptic curve formulas High speed Cryptography

High-speed cryptography, part3: more cryptosystems Daniel J.Bernstein University of Illinois at Chicago& Technische Universiteit Eindhoven

Cryptographers Working systems Cryptanalytic algorithm designers Unbroken systems Cryptographic algorithm designers and implementors E?cient systems Cryptographic users

1.Working systems Fundamental question for cryptographers: How can we encrypt,decrypt, sign,verify,etc.? Many answers: DES,Triple DES,FEAL-4,AES, RSA,McEliece encryption, Merkle hash-tree signatures, Merkle–Hellman knapsack encryption,Buchmann–Williams class-group encryption, ECDSA,HFE v ,NTRU,et al.

2.Unbroken systems Fundamental question for pre-quantum cryptanalysts: What can an attacker do using<2b operations on a classical computer? Fundamental question for post-quantum cryptanalysts: What can an attacker do using<2b operations on a quantum computer? Goal:identify systems that are not breakable in<2b operations.

rfc5903.Elliptic Curve Groups modulo a Prime (ECP Groups) for IKE and IKEv2

Internet Engineering Task Force (IETF) D. Fu Request for Comments: 5903 J. Solinas Obsoletes: 4753 NSA Category: Informational June 2010 ISSN: 2070-1721 Elliptic Curve Groups modulo a Prime (ECP Groups) for IKE and IKEv2 Abstract This document describes three Elliptic Curve Cryptography (ECC) groups for use in the Internet Key Exchange (IKE) and Internet Key Exchange version 2 (IKEv2) protocols in addition to previously defined groups. These groups are based on modular arithmetic rather than binary arithmetic. These groups are defined to align IKE and IKEv2 with other ECC implementations and standards, particularly NIST standards. In addition, the curves defined here can provide more efficient implementation than previously defined ECC groups. This document obsoletes RFC 4753. Status of This Memo This document is not an Internet Standards Track specification; it is published for informational purposes. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are a candidate for any level of Internet Standard; see Section 2 of RFC 5741. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at https://www.wendangku.net/doc/4719006262.html,/info/rfc5903. Fu & Solinas Informational [Page 1]

proposal-for-sec1v2Elliptic Curve Cryptography

Certicom Proposal to Revise SEC1:Elliptic Curve Cryptography,Version1.0 Prepared by Daniel R.L.Brown? January14,2005 Abstract The Standard for E?cient Cryptography(SEC)1,Elliptic Curve Cryptography(ECC),Version1.0[23]is a freely available speci?cation of selected ECC techniques.Because of many developments in ECC since its publication in September,2000,SEC1would bene?t from a re- vision.This document summarizes Certicom’s proposed modi?cations to SEC1,v.1.0. 1Schedule and Version Numbering The revision of SEC1shall be Version2.0.A?rst draft of the Version2.0 will be released for public comment around February18,2005,as Draft1.5. Please direct any comments to the SECG mailing list. 2Revisions to Core ECC Techniques The revised standard will continue to serve as consolidated speci?cation of selected ECC techniques.The revisions primarily function to increase security,and secondarily to improve performance and maintain consistency with other parallel standards e?orts.The following list summarizes the revisions to the ECC techniques: 1.Key transport mechanisms where a key agreement scheme is combined with a key wrap algorithm,for consistency with NIST SP800-56[18]. ?Certicom Research 1

Existence and multiplicity results for some superlinear elliptic problems on RN

This article was downloaded by: [Tomsk State University of Control Systems and Radio] On: 24 March 2012, At: 23:52 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer House, 37-41 Mortimer Street, London W1T 3JH, UK Communications in Partial Differential Equations Publication details, including instructions for authors and subscription information: https://www.wendangku.net/doc/4719006262.html,/loi/lpde20 Existence and multiplicity results for some superlinear elliptic problems on R N Thomas Bartsch a & Zhi Qiang Wang b a Mathematisches Institut, Universit?t Heidelberg, Im Neuenheimer Feld 288, Heidelberg, 69120, Germany b Department of Mathematics and Statistics, Utah State University, Logan, UT, 84322 Available online: 08 May 2007 PLEASE SCROLL DOWN FOR ARTICLE

二次筛法Eric Landquisi

二次筛法 The Quadratic Sieve Factoring Algorithm Eric Landquisi 数学488: 密码算术 2001年12月14日 1．介绍 数学家早已开始寻找更快更好的方法去分解一个和数. 一开始, 是不断用更大的质数除, 直到得知它的分解. 这种试除法一直没有被改进, 直到费马应用平方差来分解因数: a2-b2=(a-b)(a+b). 在这种方法中, 我们从被分解数n开始. 找到大于n的最小平方数. 然后检验他们的差是否平方数. 如果是, 就可以用分解平方差的技巧来分解n. 如果不是, 那么找下一个完全平方数, 重复上面的处理. 虽然费马分解法比试除法快很多, 但是在真实应用中, 例如分解一个几百位长的RSA模, 纯粹地用费马分解法太慢了. 一些其他方法已出现, 像椭圆曲线法(Elliptic Curve Method, 简称ECM)由H. Lenstra在1987发现, 还有两个由波拉德(Pollard) 在上世纪70年代中期发现的概率性的方法: ρ-1方法(ρ-1 method)和ρ方法(ρmethod)(ρ是希腊字母rho). 最快的运算法则仍然用类似费马的方法, 例如连分数法(the Continued Fraction Method), 二次筛选法(the Quadratic Sieve)(及其变种), 还有数域筛选法(the Number Field Sieve, 简称NFS)(及其变种). 一个例外是几乎与二次筛选法一样快的椭圆曲线法. 本文的中心是二次筛选法. 2．二次筛选法 以后简称二次筛选法为QS, 它在1981年由卡尔帕梅让斯(Carl Pomerance)发明,是扩展克雷契克(Kraitchik) 和狄克逊(Dixon) 的思想. QS是最快的分解法直到1993年发现了数域筛选法. 不过对小于110位的数QS还是比NFS快. 3．它怎样工作? 设n是被分解数,QS试图寻找两个数x, y 满足x≠y (mod n), 且x2=y2 (mod n). 则(x-y)(x+y)=0 (mod n), 接着用欧几里德法(辗转相除法求最大公约数) 检验(x-y,n) 是否一个非平凡约数, 至少有1/2的机会找到非平凡约.我们首先定义Q(x)=(x+[sqrt(n)])2-n=x~2-n, 然后计算Q(x(1)), Q(x(2)),...,Q(x(k)), 下面会解释如何决定x(i). 我们想要集合{Q(x)}的一个满足Q(x(i1))Q(x(i2))...Q(x(ir))是完全平方数y2 的子集. 注意到对所有x, 有Q(x)=x~^2 (mod n). 于是, 我们有Q(xi1)Q(xi2)...Q(xir)=(xi1xi2...xir)2 (mod n), 并且如果满足上面的条件, 那么我们就有了n的因数. 3.1 设定因数基和筛选区间 我们需要一个有效的方法去确定xi, 以便得到Q(xi)的乘积. 接着检查乘积是否为平方数, 即乘积的质因数的指数必须都是偶数. 为此我们需要分解每一个Q(xi). 所以我们希望它尽可能小且能用固定的被称作因数基的小质数(包括-1)集合分解. 要使Q(xi) 小, 需选择接近0的x. 所以我们规定一个范围M, 并且仅仅筛选[-M,M]中的x (或者定义Q(x)=x2-n 然后筛选区间[[sqrt(n)]-M, [sqrt(n)]+M] ). 现在, 如果x在这个筛选区间, 且一些质数p 整除Q(x), 那么(x-[sqrt(n)])2=n (mod p), 即n 是一个mod p 的二次剩余. 所以在因数基中的质数必满足勒让德符号(Legendre symbol) (n/p)=1. 第二个判断这些素数的标准是它们应该小于依赖于n的范围B, 我们分析运行时将讨论这些. 集合中的每个素数相关小,我们也说因数基是平滑的.