J*******r
发帖数: 379 | 1 wrapfigure处理enumerate,itemize,和subsection非常不好，
格式常常乱七八糟的，用的时候要小心。 |
|
h********g
发帖数: 116 | 2 enumerate 的item是 1，2，3编号的
怎么用字母标号呢？
谢谢 |
|
|
l********r
发帖数: 175 | 4 I like the section to be list as:
ABSTRACT
not
1. Abstract
how to remove the number before the section name? I did not use enumerate
package. thanks a lot. |
|
t***s
发帖数: 4666 | 5 there's a package for reverse order enumerate. not sure about section
numbering. |
|
S**I
发帖数: 15689 | 6 use description enviornment |
|
d*****1
发帖数: 1837 | 7 thx,
这个好像不行，01-09可以，以后就是010,而不是10 |
|
|
n*******s
发帖数: 4 | 9 56K猫上网显示的速度居然是115,200.
在control panel system中除了98下原有的Modem/LT Win modem
还多了个WDM Modem Enumerator/Lucent Win Modem
Modem也从98下的com3换成了现在的com5,
还有一些设备的地址呀，IRQ变了。
不过还没感觉到速度变快了。
dial up connection可以automatically connect了.
richwin还可以用。
Recycle bin的样子变得和win2k一样了。
另外我是从98 upgraded, 并没有把MBR里的lilo给冲掉.
开机以后有一个unplug
device的小图表在右下角，应该是表示device可以
热插拔吧？可是里面只有一个我的USB zip drive。
啊，居然把logitech home USB video camera放在了explorer里和什
么C: D:
control panel并列的位置，点击后在右侧窗口直接出现了capture的
图象.
有一个system restore功能，说能把harm的chan |
|
l*****y
发帖数: 5 | 10 Hi
Another error message is that there were 3 drives partitioned in one
harddisk. And now I can only find one drive. But the total size of harddisk
is correct. Also I can not use DIR in DOS to list drive with the error
message of NO ENUMERATION.
I have tried Win2000 registry repair with no luck.
Any ideas on how to fix it?
Thanks a lot. |
|
l*****y
发帖数: 5 | 11 Hi
Another error message is that there were 3 drives partitioned in one
harddisk. And now I can only find one drive. But the total size of harddisk
is correct. Also I can not use DIR in DOS to list drive with the error
message of NO ENUMERATION.
I have tried Win2000 registry repair with no luck.
Any ideas on how to fix it?
Thanks a lot. |
|
a*****a
发帖数: 438 | 12 I'd say this is a bad design of XML:)
You should have used enumerated attributes, ie. limit the choice of ACK
to YES or NO in a DTD.
For your question, I don't know how to do it in XSL |
|
P****d
发帖数: 564 | 13 My two cents (or 5) in addition to Arty's and bomberblitz's advice:
1. 突出框架。
(1) 不厌其烦地确保每一个段落，每一个句群的最开始，都是一个pointer ("In order
to control for XXX", or "I consider three possibilities...")。如果哪一部分
的pointer加得很困难，说明那一块还没组织好。
(2) Enumerate when possible. "I consider three possibilities. First, ...
Second, ... Third, ..." is easier on the reader than "There are multiple
possibilities. For example, ... Furthermore, ... In addition, ..."
(3) For each section, highlight one or two sentences in bold, ... 阅读全帖 |
|
o****u
发帖数: 214 | 14 Imperial College London的Stefan Grimm教授逝去了，邮件系统在他逝去之后，按照
他的设定，自动群发了一封题为“How Professors are treated at Imperial College
”的邮件；读完让人唏嘘。为了保持原汁原味，我就直接引用英文。
邮件原文如下：
From: Stefan Grimm <[email protected]
/* */>
Date: 21 October 2014 23:41:03 BST
To:
Subject: How Professors are treated at Imperial College
Dear all,
If anyone is interested how Professors are treated at Imperial College: Here
is my story.
On May 30th ’13 my boss, Prof Martin Wilkins, came into my office together
with his P... 阅读全帖 |
|
f***4
发帖数: 886 | 15 http://www.dcscience.net/2007/08/03/how-should-universities-be-
Dear Colleagues,
You may have already heard about the tragic death of Professor Stefan Grimm
a former member of the Faculty of Medicine at Imperial College. He died
suddenly and unexpectedly in early October. As yet there is no report about
the cause of his death. Some two weeks later a delayed email from him was
received by many of the senior staff of the medical school, and other
researchers worldwide. It has been forwarded to me ... 阅读全帖 |
|
s******y
发帖数: 28562 | 16
你先把他的信看完吧。下面是他自己对相关事情的说法。很明显，是校方逼
他一定要拿到某某数量以上的外来资金，而且要每年200，000英镑，这个
相当于一个半到两个R01的数量了，在英国是非常难以办到的。拿不到这个
钱就要走人。很明显，他没有达到校方的要求。新闻报道里还有一句话说是
“校方在取得他的同意之下为他咨询了其他地方的职位”， 这个其实就是
很含蓄的说，校方已经开动了开除他的手续了。这个还是很吓人的，他作为
一个正教授，居然就这么被扫地出门，所以他是被气死的吧。
On May 30th ’13 my boss, Prof Martin Wilkins, came into my office together
with his PA and ask me what grants I had. After I enumerated them I was told
that this was not enough and that I had to leave the College within one
year – “max” as he said. He made it clea... 阅读全帖 |
|
发帖数: 1 | 17 It's an interesting question. To the best of my knowledge, no RNA-seq
alignment tool was designed to tolerate CRISPR-mediated indels to date. I'm
not an RNA-seq expert, so it's possible that there are some on the way. You
can also email Luca Pinello, the author of CRISPResso. He might know more,
and he's a really nice guy.
Here I'm trying to think about a solution. There are two situations - I don'
t know which one is your case.
a) The sample for RNA-seq was derived from a single mutant clone. I... 阅读全帖 |
|
m****y
发帖数: 74 | 18 this boils down to enumerate the ways in which 23 can be decomposed, with
each decomposed element less than 10. should not be hard do this manually... |
|
D**********s
发帖数: 320 | 19 It's impractical to enumerate all possible circumstances under which you
might be driving. Thus it is up to the judge to determine whether your act
contitutes "careless driving" or not, based upon the particular circumstance
and precedents.
I strongly urge you not to argue with the judge on the specific words used
in the law. After all, the thrust of the law is "operating a vehicle in a
manner that will endanger the life, limb, or property of any person".
Careless driving in a parking lot does n |
|
b****d
发帖数: 1311 | 20 I don't know any way other than enumeration. |
|
T*******r
发帖数: 30 | 21 你可以不引用tableofcontents,但使用enumerate
和
\item[$\bullet$]。。。 |
|
p**o
发帖数: 3409 | 22 无向图，10万个节点，50万条边。
已经在Matlab中用spconvert读入成上三角的0-1稀疏方阵A。
请问如何迅速找齐满足以下条件的所有(i,j,k)？
i
A(i,j)=A(j,k)=A(i,k)=1
三个for循环蛮干的话时间复杂度是节点数的立方，有没有快一些的算法？ |
|
|
a***s
发帖数: 616 | 24 这个看上去像小学数奥题，用因数分解.
For any $N = \prod_{i=1}^k p_i^r_i$ where $p_i$'s are prime numbers, the to
tal number of factorization $N$ has is $\prod_{i=1}^k (r_i + 1)$. For exampl
e, $24 = 2^3 \cdot 3^1$ and it has $(3+1)\cdot(1+1) = 8$ factorization. For
this case, we divide it by 2 to get the number of tiling.
To get 10 different rectangles, we need at least 20 factorization. 20 can be
achieved by $2 \cdot 2 \cdot 5$ or $4 \cdot 5$. By enumeration, one can fig
ure out the smallest number $2^4 \cdot 3 ... 阅读全帖 |
|
f*****e
发帖数: 2992 | 25 假设有n个node的graph，只有一个connected component.假设有m条边，具有这个特性
的图，肯定有很多是同构的。怎么把不同构的图一个一个列出来呢？然后用并行计算找
出具有最优特性的图。 |
|
c*******h
发帖数: 1096 | 26 产生所有n点m边的图，每个图走一次bfs，把非联通的图扔掉。
剩下的图里面，算点的邻边数的分布，如果分布不一样的话图就不同构。
在邻边数分布一样的图里面，算图的特征值，如果特征值分布不一样图就不同构。
把邻边数分布和特征值分布都一样的图帖出来，让板上的人帮你挑，每挑到一对同构
的或者不同构的就发5个包子，基本上一个礼拜之内问题就解决了。 |
|
|
c*******h
发帖数: 1096 | 28 the summ of the first m positive odd integers is m^2
the sum of the first n positive even integers is n(n+1)
let m = n+p, p>0. then m^2-n(n+1)=212 becomes p^2+(2p-1)n=212.
enumerating p from 1 to 14, we have integer solutions
p = 1, n = 211
p = 4, n = 28
p = 6, n = 16
the idea should fit a 9th grade's education
there are other possible methods to come up with the solution
the
n? |
|
s**c
发帖数: 1247 | 29 enumerate就行了吧
10到98，不算很多 |
|
p*****k
发帖数: 318 | 30
one possible application is for the chess team championship (not necessarily round-robin tournament), with 4 members in each team. ignore the fact that games might end up with draw and the difference between white & black, team indeed cares about the points to gain in each round, rather than beating the other team.
(but 4 is a small number so presumably it's ok to enumerate)
back to the inequality, here are some special cases:
if t(1)*...*t(n) = 1, then sum of 1/[1+t(i)] < n-1
(with one -> inf |
|
h**********a
发帖数: 40 | 31 the only thing i know is:
enumerate for numbered lists,
itemize for un-numbered lists,
description for description lists.
don't know which one's 行矩最小
也许可以调吧?? i don't know |
|
d*z
发帖数: 150 | 32 I do not need the ID too.
It took my computer 112741 seconds to prove that the result is best.
It enumerates 267,475,186,879 expressions.
I think we could access the process by precomputer all expressions with 5
numbers. (Its not very much).
贴出 |
|
D******n
发帖数: 2836 | 33 u flip two coins, and u can see the probability they have the same faces is
0.5 by enumerating all the posibilities. |
|
S******y
发帖数: 1123 | 34 # in case you would like to do it in Python.
def mean(ls):
return sum(ls)/len(ls)
def deviation(ls):
m = mean(ls)
return [x-m for x in ls]
in_file='C:\\type_data.txt'
f = open(in_file, 'r')
my_list = []
my_type=None
for line in f:
typex, value = line.split()
if my_type != typex and my_type!=None:
for loc,x in enumerate(deviation(my_list)):
print my_type,my_list[loc], x
my_list=[]
my_list.append(float(value))
my_type=typex
for loc,x in enum |
|
S******y
发帖数: 1123 | 35 #A Python approach: scramble the oder within a group
import random
var1_list = ['A', 'A', 'B', 'B', 'B', 'C', 'C', 'C', 'D', 'D']
ls_item=[]
ls_int =[]
tmp_var1 =''
for item in var1_list:
if tmp_var1 != item and tmp_var1 !='':
ls_int = range(len(ls_item))
random.shuffle(ls_int)
for index, x in enumerate(ls_item):
print x, ls_int[index]+1 #print out var1, var2
ls_item=[]
ls_int=[]
ls_item.append(item)
tmp_var1 = item
ls_int |
|
S******y
发帖数: 1123 | 36 #Python2.5 - sum b by var - a (only for top 5 dates)
#input format like this (see below).
'''
s1 10 20100216
s1 20 20100210
'''
in_file = '_five.txt'
f=open(in_file ,'r')
ctr=0
my_var_a = ''
d={}
sumx = 0
for line in f:
line = line.rstrip('\n')
a, b, datex = line.split('\t')
if a != my_var_a and my_var_a!= '':
for index, item in enumerate(sorted(d.keys())):
sumx += float(d[item])
if index ==4:
break
print my |
|
S******y
发帖数: 1123 | 37 #Python 2.5.4
#by_line.py 2010-09-02
#Per Da Sha Gen's request :-)
#A data structure proves to be handy here
S = '''0 0 0 0 0 1.2
0 0 0 0 5.8 4.7
58.8 0 0 30 0 33.3
100 0 0 100 0 66.6'''
ctr = 0
d={}
for line in S.split('\n'):
ctr += 1
d[ctr] = []
ls = [float(x) for x in line.split()]
for index, item in enumerate(ls):
if item < 50 and item > 0:
d[ctr].append(index+1)
else:
pass
#for examle, you would like to see line #3
line_number = 3
prin |
|
S******y
发帖数: 1123 | 38 #Python 2.6
txt ='''
firm year
A 1990
A 1991
A 1993
b 1978
b 1979
b 1980
c 2001
c 2009
d 2004
d 2006
e 1999
f 1990
f 1997
f 1999'''
txt_lst = txt.split('\n')
txt_lst.remove('')
txt_lst.remove('firm year')
def checck_consecutive(ls):
length = len(ls)
for index, item in enumerate(ls):
if index > 0:
if abs(int(item) - int(ls[index-1]))==1:
return True
return False
ls = []
prev_firm_nm = ''
for line in txt_lst:
firm_nm, |
|
S******y
发帖数: 1123 | 39 Nice SQL code, statcompute!
#Here is cleaner version of Python code using itertools library
#Python 2.6
import itertools
txt ='''
firm year
A 1990
A 1995
A 1999
b 1978
b 1979
b 1980
c 2001
c 2009
d 2004
d 2005
e 1999
f 1990
f 1997
f 1998'''
txt_lst = txt.split('\n')
txt_lst.remove('')
txt_lst.remove('firm year')
def checck_consecutive(ls):
length = len(ls)
if len(ls) < 2:
return False
for index, item in enumerate(ls):
if index > 0:
|
|
S******y
发帖数: 1123 | 40 #Python 2.6 StatsGuy 2010-09-27
import itertools
txt='''
1001
1001
1001
1001
1002
1002
1002
1002
1002'''
txt_lst = txt.split('\n')
txt_lst.remove('')
def get_my_id(ls):
my_id = ls[0:4]
return my_id
# Loop over id-blocks using the groupby function
for my_id, g in itertools.groupby(txt_lst, get_my_id):
ls=list(g)
for index, item in enumerate(ls):
print item + '.' + str(index+1)
################################################# |
|
S******y
发帖数: 1123 | 41 #Python 3.1.2
import itertools
data_raw= '''
a 1 23
a 2 56
a 3 45
a 4 55
a 5 60
a 6 34
b 1 10
b 2 11
b 3 12
b 4 13
b 5 14
b 6 15'''
data_listing = data_raw.split('\n')
data_listing.remove('')
def get_my_id(ls):
my_id = ls[0:1]
return my_id
v = []
for my_id, g in itertools.groupby(data_listing,get_my_id):
ls = list(g)
v.append(my_id)
for index, item in enumerate(ls):
loc = index + 1
... 阅读全帖 |
|
c*****a
发帖数: 808 | 42 Theory of Automata这课 ?
what is this
"
Regular languages
Context-free languages
Recursive and Recursively Enumerable Languages
Turing machine languages
"
是不是就是教 scripting languages Powershell, Bash or Perl？ |
|
m****r
发帖数: 202 | 43 Thank you for your kindly reply.
1. I have baseline, 12mon, 18mon variables, that's way the variables are
named tr01-tr28,tr01_12-tr28_12,tr01_18-tr28_18
2. Macro can't be used here
3.when I use "all = sum(of tr01_12 - tr28_12);" the log said"
ERROR: Alphabetic prefixes for enumerated variables (tr01_12 - tr28_12)
are different.
ERROR 71-185: The SUM function call does not have enough arguments."
4.These variables are physically seperated,so I can't use
"all = sum(of tr01_12 -- tr28_12);"
Thank ... 阅读全帖 |
|
D******n
发帖数: 2836 | 44 Your task can be very hard if you want 0% miss rate.
it is more like a AI problem, because you need the machine to know/learn
what is "sensitive" in a human world.
unless u can enumerate the situations you list and also have a "human name"
table. |
|
t******g
发帖数: 372 | 45 seems like a weighted sum of components from a multivariate hypergeometric
distibuted variable. dont think there is a general formula, but it should be
easy to enumerate the distribution by checking all possible combination.
.,
of |
|
h***b
发帖数: 43 | 46 Sorry I can not input Chinese now.
I have some character variables, abc_1_ok,......,abc_50_ok. The numbers are
in the middle of the name, instead of at the end. When I run ARRAY, there
are two ERRORs shown as the following. I think the reason for the following
two errors is the variable name. If so, could any one of you tell me how to
deal with it? Thanks much!
ERROR: Alphabetic prefixes for enumerated variables {abc_1_ok - abc_50_ok}
are different.
ERROR: Too few variables defined for the dimen... 阅读全帖 |
|
y****d
发帖数: 432 | 47 【7】【Springer】GTM美国研究生数学书籍全集
LIST：
1 Introduction to Axiomatic Set Theory, Gaisi Takeuti, W. M. Zaring
2 Measure and Category, John C. Oxtoby
3 Topological Vector Spaces, H.H. Schaefer, M.P. Wolff
4 A Course in Homological Algebra, Peter Hilton, Urs Stammbach
5 Categories for the Working Mathematician, Saunders Mac Lane
6 Projective Planes, Hughes, Piper
7 A Course in Arithmetic, Jean-Pierre Serre
8 Axiomatic Set Theory, Gaisi Takeuti, Zaring
9 Introduction to Lie Algebras and Representation The... 阅读全帖 |
|
B*****g
发帖数: 34098 | 48 啥也不说了，你直接发包子吧
1
def numRepeats(numlist, num):
return numlist.count(num)
or
def numRepeats(numlist, num):
return sum(1 for s in numlist if s==num)
2
def diagonal(multiArray):
return [s[idx] for idx,s in enumerate(multiArray)] |
|
z*******n
发帖数: 1034 | 49 http://www.informit.com/articles/printerfriendly/2211695
Introduction to "The Java Language Specification, Java SE 8 Edition"
By James Gosling, Gilad Bracha, Alex Buckley, Bill Joy, Guy L. Steele
Date: Jun 12, 2014
The Java® programming language is a general-purpose, concurrent, class-
based, object-oriented language. It is designed to be simple enough that
many programmers can achieve fluency in the language. The Java programming
language is related to C and C++ but is organized rather dif... 阅读全帖 |
|
i**w
发帖数: 883 | 50 攻击应该是基于SIP协议的‘users enumeration’ attack。
在sip.conf中定义的extendsion一般是基于username/password认证的。所以，攻击者
可以用特殊的SIP client配合字典，暴力猜测sip.conf中存在的extension和密码。一
旦蒙对了，就可以注册到你的asterisk server来盗打电话。
上面的文章主要描述了如何模拟这种攻击，和如何监测这种攻击（利用SEC，扫描
asterisk的log）。
防范的方法：sip.conf中定义的extension密码强度要加强，或者authentication基于
IP address |
|
