查询词典 signed numbers

In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M. H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M. H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.

LUCA证明了Fermat数都是孤立数；2005年，乐茂华教授证明了2的方幂都是孤立数，用乐茂华教授的方法给出孤立数的一些新的结果：对于任意含有4w+1型素因子的正整数n，设p为n的任意一个4w+1型素因子，则在n^2，p^2n^2，p^4n^2，p^6n^2里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。

To the moduli with special forms (such as Mersenne numbers, pseudo-Mersenne numbers, generalized Mersenne numbers), we analysis and study modular arithmetic laws, and obtain the conclusions as follows: for Mersenne numbers and pseudo-Mersenne numbers, we get modular arithmetic formulas, and determine exact expressions of the number of modular addition to generalized Mersenne numbers generated by irreducible monic trinomials and pentanomials.

针对具有特殊形式的模数(如Mersenne数，伪Mersenne数，广义Mersenne数等)，深入分析了其取模运算规律，得到如下结果：对Mersenne数和伪Mersenne数，给出了取模运算转换为模加或模减运算的公式；对模数为任意首一三项式和五项式产生的广义Mersenne数，推导了相应取模运算的复杂度计算解析表达式。

If we rechange these two numbers: one number to two times as many as its original value, and the other to four times as many as its original value, the average of the five numbers will become 13. Which two numbers have been changed?I only know that the total sum of the original numbers is 45(5×9), the total sum of the 5 numbers after the first change is 40(5×8), and the total sum of the 5 numbers after the second change is 65(13×5). What can I do next? Please help me with the problem.Thank you!

这就要求琬婷一方面要用英语准确地把她想要问的问题清晰地表达出来，只有这样网上"数学博士"才能明白你要问的问题；另一方面琬婷还必须能够正确理解网上"数学博士"对她所提问题的英语答复，这两者是相互依赖的，否则就不能正确地帮助你理解和解决问题，这就要求琬婷必须用英语进行正确地表述和理解。

Note that unsigned numbers on a signed magnitude machine are equivalent to signed non-negative numbers as a consequence of the forced correspondence between addresses and unsigned numbers and of the required behavior of + and -.

注意在一个有号量机器上，无号数是相等於有号的非负数，作为一个强迫对应於位址和无号数而且需要+和-行为的影响。

Just as signed files remain signed until the file is modified, signed VBA projects remain signed until the macro code is altered.

经过签名的文件在被修改之前一直保持签名状态，同样，经过签名的 VBA 项目在宏代码被修改之前一直保持签署状态。

We improve the protocol for signing contract based on the research result of secure multiparty computation. In this protocol, the parties obliviously transfer the signed bit and the committed bit; the other parties can prove the validity of this bit based on the confirming sub-protocol, but he can't gain more information about the whole signature by accumulating the more signed bit or the committed bit. After the parties exchange the whole signed information, they declare the commitment about the signature respectively, and gain the whole signature of the other party. At this moment, the party doesn't care about the advance quit of the other party, because he has gained the whole signed information.

在协议执行过程中，参与者将合同的签名位以及他对签名位的承诺不经意传输给对方，对方可以利用验证子协议证明该位的有效性，但是他却不能通过位交换次数的增加获取更多的完整签名的信息；在完成签名位的交换之后，参与者分别公开承诺，并得到对方对合同的完整签名；在公开承诺时，协议参与者已经获得全部的签名内容，要么是签名位，要么是对方对该位的承诺，因此参与者并不需要担心对方提前终止协议，同时本文也利用多方安全计算的结论证明了该协议满足终止公平性。

If two parties want to sign a contract C over a communication network, they must "simultaneously" exchange their commitments to C Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchange partial commitments in a piece by piece manner The party of secondly sending commitments may have a slight advantage; a "fair" protocol must keep this advantage within acceptable limits The protocol for signing a contract is improved based on the research result of secure multiparty computation In this protocol, the parties obliviously transfer the signed bit and the committed bit; the other parties can prove the validity of this bit based on the confirming sub protocol, but he can't gain more information about the whole signature by accumulating the signed bit or the committed bit After the parties exchange the whole signed information, they declare the commitment about the signature respectively, and gain the whole signature of the other party At this moment, the party doesn't care about the advance quit of the other party, because he has gained the whole signed information Finally, it is proved that this protocol is quit fairness

作者中文名：曲亚东；侯紫峰；韦卫摘要：在网络环境中解决合同签订问题需要保证信息交换的同时性，以前提出的协议都会给第2个发送者部分计算特权，利用不经意传输协议则可以解决这个问题。在协议执行过程中，参与者将合同的签名位以及他对签名位的承诺不经意传输给对方，对方可以利用验证子协议证明该位的有效性，但是他却不能通过位交换次数的增加获取更多的完整签名的信息；在完成签名位的交换之后，参与者分别宣布承诺，并得到对方对合同的完整签名；在宣布承诺时，协议参与者已经获得全部的签名内容，要么是签名位，要么是对方对该位的承诺，因此参与者并不需要担心对方提前终止协议。在文章的最后利用多方安全计算的结论证明了该协议满足终止公平性。

If two parties want to sign a contract C over a communication network, they must "simultaneously" exchange their commitments to C Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchange partial commitments in a piece by piece manner The party of secondly sending commitments may have a slight advantage; a "fair" protocol must keep this advantage within acceptable limits The protocol for signing a contract is improved based on the research result of secure multiparty computation In this protocol, the parties obliviously transfer the signed bit and the committed bit; the other parties can prove the validity of this bit based on the confirming sub protocol, but he cant gain more information about the whole signature by accumulating the signed bit or the committed bit After the parties exchange the whole signed information, they declare the commitment about the signature respectively, and gain the whole signature of the other party At this moment, the party doesnt care about the advance quit of the other party, because he has gained the whole signed information Finally, it is proved that this protocol is quit fairness

在网络环境中解决合同签订问题需要保证信息交换的同时性，以前提出的协议都会给第 2个发送者部分计算特权，利用不经意传输协议则可以解决这个问题在协议执行过程中，参与者将合同的签名位以及他对签名位的承诺不经意传输给对方，对方可以利用验证子协议证明该位的有效性，但是他却不能通过位交换次数的增加获取更多的完整签名的信息；在完成签名位的交换之后，参与者分别宣布承诺，并得到对方对合同的完整签名；在宣布承诺时，协议参与者已经获得全部的签名内容，要么是签名位，要么是对方对该位的承诺，因此参与者并不需要担心对方提前终止协议在文章的最后利用多方安全计算的结论证明了该协议满足终止公平性1 引言两个参与者A和B想要通过网络协商签订合同C 为了保证公平性，参与者必须同时交换自己对合同的签名，然而在实际的网络环境中，想要完全同时地交换对合同的签名是不可能的，他们必须将签名分成若干块依次地执行，以保证大致的同时性但是这种方法依然存在着问题

Features - FSK and DTMF dual mode CLIP (Calling Line Identification Presentation)- Stores up to 50 calling numbers, up to 20 digits for each number*- Stores up to 3 last dialed numbers, up to 24 digits for each number*- Stores up to 50 PSTN Phone Book numbers, up to 12 characters for each name and 24 digits for each number (while the LCD displays the maximum of 12 digits)*- LCD displays calling and dialing number - Barring numbers setting (up to 5 numbers)*- Key lock setting - Hot call setting*- Call transfer of external calls*- Internal calls*- Three-way Conference Call*- Various ring melody (up to 9 for option)- Ring volume adjusting (up to 9 levels)- Handset earpiece volume setting (up to 9 levels)- Microphone mute - Delete single or all records in PSTN Phone Book*- Redialing and preparation dialing functions - Paging function to locate the handset easily from base station - Clicking key tone on or off - Supports GAP function - Speakerphon

特点－FSK和DTMF双模的CLIP－能存储多达50组来电，每组来电能够存储20个数字*－能够存储最近的3个已拨电话号码，每个号码能够存储24个数字*－能够存储50个PSTN电话簿号码，每个名字有12个字符，每个号码有24个数字（而LCD最多只能显示12个数字）*－LCD来电显示和去电号码－不包括号码设置（5个号码）*－键盘锁设置－热键设置*－外部来电转接*－内部呼叫*－三方电话会议*－多种铃声（一共有9种可供选择）－音量调节（一共有9个级别）－话机听筒音量设置（一共有9个级别）－静音－在PSTN电话簿内删除单个或者全部记录*－回拨和准备拨号功能－寻呼功能能够简单的从话机座定位话筒－开启或关闭滴答声－支持GAP功能－免提

If ris also irreducible in Z_nand f~n~κ≡fmodn,r(xfor all f∈Z_nthen we call n a Carmichael number of orderκmodulo r.Denote the set of all such numbers by C_κ,r(x.Define C_κ=∪_r(xC_κ,r(x,where rpasses through all monic irreducible polynomials over Z of degreeκ.We call elements of the set C_κCarmichael numbers of orderκ.ZHU and SUN[Journal of Sichuan University,42;1(2005), 47-51]first gave a necessary condition for Carmichael numbers of order 3.Then they gave a sufficient condition for Carmichael numbers of order 3,but did not find any such numbers less than 10~8 satisfying the sufficient condition.At last,they asked three questions;1.is the necessary condition also sufficient?

f∈Z_n，就称n是模r的κ阶Carmichael数，用C_κ，r(x表示所有这种数的集合，定义C_κ=∪_r(xC_κ，r(x，这里r跑遍Z中所有κ次首一不可约多项式，C_κ里面的元素就称为κ阶Carmichael数，C_κ称为κ阶Carmichael数集，朱文余和孙琦[四川大学学报，42；1(2005)，47-51]首先给出了3阶Carmichael数的一个必要条件；然后又给出了这种数的一个充分条件，并发现10~8内没有满足此充分条件的这种数；最后他们提出三个问题；一、问必要条件是否也是充分的？

Metrorrhagia is also gynaecological problems of common diseases.

崩漏是妇科常见病也是疑难症。

WordFTP gives you the convenience and timesaving you need.

wordftp让您的方便和省时您所需要的。