T*****n
发帖数: 2456 | 1 JOINT DECLARATIONON THE DOCTRINE OF JUSTIFICATION
by the Lutheran World Federation and the Catholic Church
Preamble
1.The doctrine of justification was of central importance for the Lutheran
Reformation of the sixteenth century. It was held to be the "first and chief
article"[1] and at the same time the "ruler and judge over all other
Christian doctrines."[2] The doctrine of justification was particularly
asserted and defended in its Reformation shape and special valuation over
against the Roman... 阅读全帖 |
|
l******e
发帖数: 470 | 2 i did say the sum of ...i have 2 bounding boxes
in your case, it is 2.
however, your argument is cleaner.
i am not quite sure about what you mean by ``bounding box''.
e.g. 3 \times 3 matrix
..*
...
*..
* represents an uncovered region
does the length of the smaller edge of the bounding box equal 3?
if i compare x with either one of them, the bounding box will become 1 \
times 1
my method is to consider the cells on the minor diagonal
if i compare x with a cell in the upper-left triangle,
adv an |
|
y***a
发帖数: 840 | 3 if you only hoist the end() out of the loop and not the "begin()". I think
oftentimes it doesn't make any difference. The reason the hoisting is good
is because after hoisting, it is easier for the compiler to figure out the
upper-bound of the loop is loop-invariant. but you only know the upper-bound
is constant in the loop but don't know the lower-bound, it really doesn't
help much. Unless you knw both bounds are constant, compiler can do soem
tricks for better performance. |
|
c*******9
发帖数: 9032 | 4 http://homepages.cwi.nl/~tromp/go/Go.hs
{-# LANGUAGE ScopedTypeVariables #-}
module Go where
import Data.Ix
import Data.List
import Data.Array
import Control.Monad
import Control.Monad.State
data Player = Black | White deriving (Eq, Enum, Show)
data Color = Empty | Stone Player deriving (Eq, Show)
newtype Position p = Position (Array p Color) deriving (Eq)
color :: (Point p) => Position p -> p -> Color
color (Position pos) p = pos!p
class (Show p, Ix p) => Point p where
pointBounds :: (p,p)
... 阅读全帖 |
|
t**r
发帖数: 3428 | 5 /**
* Returns whether all bounded integers within `s` satisfy `p`.
*/
def forall(s: Set, p: Int => Boolean): Boolean = {
def iter(a: Int): Boolean = {
if (a > bound) true
else if (contains(s, a) && !p(a)) false
else iter(a + 1)
}
iter(-bound)
}
/**
* Returns whether there exists a bounded integer within `s`
* that satisfies `p`.
*/
def exists(s: Set, p: Int => Boolean): Boolean = !forall(s, (x => !p(x)))
/**
* Returns a set transformed ... 阅读全帖 |
|
z****e
发帖数: 54598 | 6 尝试着回答一下这个问题
1）做不到比os native的更好，但是问题在于，有些操作系统根本就没有cooperative
sheduling，比如linux，如果有的话，直接做一层包装就好了，但是没有的话，就只能
让语言来做了
2）不靠机器码，但是靠字节码，基本上就差不多了，光靠当前java的api，是不够的，
需要加多一个context参数，参考kotlin的coroutine实现，或者是通过java agent_织
入_一些context代码，这就是quasar的实现，这也是loom名称的由来
3）强在哪里呢
嗯，这个说来话长，说说我的理解
wdong有一篇回帖，解释了os层面cooperative scheduling和preemptive scheduling的
区别，有空自己去找，但是我觉得他说得复杂了，当然也因为后来用户层面框架的发展
，比如actor model有关系，看看我能不能解释清楚，这一块涉及的东西太多，os&jvm
和vert.x/actor model乃至开发者自身，都有需要配合的部分，任何一个部分不能掉链
子，所以解释起来不容易
先说os&jvm层面，这个是... 阅读全帖 |
|
b*********n
发帖数: 173 | 7 No bounding box.
If the bounding box information is totally missing from the graphics
file, LaTeX issues the error message
! LaTeX Error: Cannot determine size of graphic
in ... (no BoundingBox).
The solution is to determine the bounding box coordinates somehow (see
next point) and to include them, either in the \includegraphics command, or
by editing the graphics file itself. However, if there really is no bounding
box information in the |
|
s*****r
发帖数: 469 | 8 我记得是可以的，但估计很难。
整个re-entry的过程好像就是在减速，主要的动力只是改变飞船姿态。好几种方法。速
度不是很大可以直接找切入点和切入角，然后绕地球螺旋线的着落。还有一种如果进入
大气之前速度还很大，就可以采用在大气外层像打水瓢一样的bound减速。直到速度合
适之后再寻求切入点。但是这个技术要求非常高，弄不好就被bound回太空了很远，然
后要再次靠动力系统让飞船回地球。关于再绕一圈就是采用这个方法的，如果切入时飞
行特征不符合要求，可以bound回太空，然后寻找机会，不过这个难道很大。因为登陆
不是在地球上什么地方都能着落的，所以对于re-rentry轨道要求非常高。而且在从选
择切入登陆到转成被bound回太空时非常困难的。 |
|
s*****0
发帖数: 357 | 9 The difference is huge, and you don't necessarily need an 'official' test to
prove it. Here is some brutal force method for a quick answer:
Step 1: Calculate the percentage of Hypermethylated cells for each type.
This is your p-hat.
Step 2: Calculate the standard deviation for sample mean (your p-hat for
each cell type). Too much hassle to type in a formula here, but you may
check out this link:
http://en.wikipedia.org/wiki/Binomial_proportion_confidence_int
Step 3: Calculate the standard error ... 阅读全帖 |
|
l****u
发帖数: 529 | 10 A and C 之间可能会有significant difference.
你可以想象三条曲线，没有相交，A 在上，C 在下，B 在中间，A 置信区间的lower
bound 与B 置信区间的 upper bound 有部分重合（A 和 B 没有significant
difference），并且 B 置信区间的lower bound 与C 置信区间的 upper bound 有部分
重合（B 和 C 没有significant difference），但是 A 的 置信区间 与 C 的 置信区
间 却 没有任何重合，这就说明A和C有significant difference. |
|
j***h
发帖数: 4412 | 11 发信人: jeffh (Jeffh), 信区: CivilEngineering
标 题: Re: Can Anyone Recommend Any Study Material for SE Exam?
发信站: BBS 未名空间站 (Fri Oct 14 13:05:47 2011, 美东)
The SE exam is a fixed passing rate exam depending on the state you take the
exam. The passing rate for April 2011 SE exam is 27%: http://www.ncees.org/Exams/SE_exam.php.
By the way, just a friendly reminder, before California eliminates its use
of
the state-specific SE exam, CA SE test is not just a simple test. The board
of CA is very serious ab... 阅读全帖 |
|
j***h
发帖数: 4412 | 12 The SE exam is a fixed passing rate exam depending on the state you take the
exam. The passing rate for April 2011 SE exam is 27%: http://www.ncees.org/Exams/SE_exam.php.
By the way, just a friendly reminder, before California eliminates its use of
the state-specific SE exam, CA SE test is not just a simple test. The board
of CA is very serious about this test. The seismic-resisting design in CA
is totally different from those seismic-resisting designs in east coast and
China. In addition, th... 阅读全帖 |
|
j***h
发帖数: 4412 | 13 发信人: jeffh (Jeffh), 信区: CivilEngineering
标 题: Re: Can Anyone Recommend Any Study Material for SE Exam?
发信站: BBS 未名空间站 (Fri Oct 14 13:05:47 2011, 美东)
The SE exam is a fixed passing rate exam depending on the state you take the
exam. The passing rate for April 2011 SE exam is 27%: http://www.ncees.org/Exams/SE_exam.php.
By the way, just a friendly reminder, before California eliminates its use
of the state-specific SE exam, CA SE test is not just a simple test. The
board of CA is very serious ab... 阅读全帖 |
|
G****n
发帖数: 145 | 14 Between trust and control: Developing confidence in partner cooperation in
alliances
[PDF] from cuny.edu…, BS Teng - Academy of management Review, 1998 - JSTOR
Strategic alliances have been recognized as arenas with potential for
opportunistic behavior
by partners. Hence, a firm needs to have an adequate level of confidence in
its partner's
cooperative behavior. In this article we examine the notion of confidence in
partner ...
Cited by 1749 - Related articles - BL Direct - All 9 versions
A reso... 阅读全帖 |
|
d******s
发帖数: 180 | 15 http://aimath.org/news/primegaps70m/
第一段就很有料，四月后期投稿，五月中旬便接受，对于一篇55页的paper来说速度惊
人。
Zhang's Theorem on Bounded Gaps Between Primes
by Dan Goldston
In late April 2013 Yitang Zhang of the University of New Hampshire submitted
a paper to the Annals of Mathematics proving that there are infinitely many
pairs of primes that differ by less than 70 million. The proof of this
amazing result was verified with high confidence by several experts in the
field and accepted for publication. A public slightly re... 阅读全帖 |
|
g****a
发帖数: 1520 | 16 【 以下文字转载自 WaterWorld 讨论区 】
发信人: xiaoshushu (songshu), 信区: WaterWorld
标 题: 关于近期Fano流形上构造KE度量的工作(转载)
发信站: BBS 未名空间站 (Sat Aug 31 10:30:12 2013, 美东)
关于近期Fano流形上构造Kähler-Einstein度量的工作
最近公布的Fano流形上构造Kähler-Einstein度量的工作，是Kähler几
何近年来引人注目的进展，专家们正在验证。若验查无误，将证明丘成桐关于Fano流形
的构想与猜测是正确的。Donaldson的稳定性条件是其中的关键步骤，还需在代数几何
上把此概念搞清楚，这样丘猜测就为深刻理解Fano流形奠定了基础。由于近期发生了一
些混淆不清的事件，我们将相关工作的公开记录做了客观、学术的分析，望有助于澄清
事实。本文主要涉及文献的比较，阅读本文无需是专家，数学专业本科高年级学生或研
究生可读懂绝大部分。欢迎关于数学上的批评与指正。
本文分三个部分：
1) 陈-Don... 阅读全帖 |
|
g****a
发帖数: 1520 | 17 【 以下文字转载自 WaterWorld 讨论区 】
发信人: xiaoshushu (songshu), 信区: WaterWorld
标 题: 关于近期Fano流形上构造KE度量的工作(转载)
发信站: BBS 未名空间站 (Sat Aug 31 10:30:12 2013, 美东)
关于近期Fano流形上构造Kähler-Einstein度量的工作
最近公布的Fano流形上构造Kähler-Einstein度量的工作，是Kähler几
何近年来引人注目的进展，专家们正在验证。若验查无误，将证明丘成桐关于Fano流形
的构想与猜测是正确的。Donaldson的稳定性条件是其中的关键步骤，还需在代数几何
上把此概念搞清楚，这样丘猜测就为深刻理解Fano流形奠定了基础。由于近期发生了一
些混淆不清的事件，我们将相关工作的公开记录做了客观、学术的分析，望有助于澄清
事实。本文主要涉及文献的比较，阅读本文无需是专家，数学专业本科高年级学生或研
究生可读懂绝大部分。欢迎关于数学上的批评与指正。
本文分三个部分：
1) 陈-Don... 阅读全帖 |
|
发帖数: 1 | 18 from: Liang Xue
to: John Hutchinson
cc: Tomasz Wierzbicki
date: Mon, Aug 11, 2014 at 12:12 PM
subject: Re: No winners--follow-up
Dear John,
Thank you for your email. I had a difficult time to understand the
message you want sent. My guess is that the central message you would like
to emphasize is that you can develop the same model once you understood that
ductile fracture is indeed J3 dependent. Possibly. I
believe many people have the necessary knowledge to do so on their
own. H... 阅读全帖 |
|
y*********c
发帖数: 1014 | 19 Discuss the clinical implications of Diclofenac (Voltaren) given orally with
a half life of 2 hours and a protein binding that is 99% bound to albumin.
Only address half life and protein binding for this drug.
Since Voltaren is 99% bound to albumin, it has to be careful to adminter the
drug that is also protein bound. It will casue Voltaren to increase its
concentration in blood. Should avoid administer NSAIDS with this drug since
they are also protein bound. 不知道理解的对吗？那这个half life对protein bind
有 |
|
y*********c
发帖数: 1014 | 20 Discuss the clinical implications of Diclofenac (Voltaren) given orally with
a half life of 2 hours and a protein binding that is 99% bound to albumin.
Only address half life and protein binding for this drug.
Since Voltaren is 99% bound to albumin, it has to be careful to adminter the
drug that is also protein bound. It will casue Voltaren to increase its
concentration in blood. Should avoid administer NSAIDS with this drug since
they are also protein bound. 不知道理解的对吗？那这个half life对protein bind
有 |
|
w*********g
发帖数: 30882 | 21 Times have changed,
And we've often rewound the clock,
Since the Puritans got a shock,
When they landed on Plymouth Rock.
If today,
Any shock they should try to stem,
'Stead of landing on Plymouth Rock,
Plymouth Rock would land on them.
In olden days a glimpse of stocking
Was looked on as something shocking,
But now, God knows,
Anything Goes.
Good authors too who once knew better words,
Now only use four letter words
Writing prose, Anything Goes.
The world has gone mad today
And good's bad today... 阅读全帖 |
|
w*********g
发帖数: 30882 | 22 Times have changed,
And we've often rewound the clock,
Since the Puritans got a shock,
When they landed on Plymouth Rock.
If today,
Any shock they should try to stem,
'Stead of landing on Plymouth Rock,
Plymouth Rock would land on them.
In olden days a glimpse of stocking
Was looked on as something shocking,
But now, God knows,
Anything Goes.
Good authors too who once knew better words,
Now only use four letter words
Writing prose, Anything Goes.
The world has gone mad today
And good's bad today... 阅读全帖 |
|
y***e
发帖数: 676 | 23 October 1, 2011, 4:29 pm
Police Arrest About 400 Protesters on Brooklyn Bridge
By AL BAKER and COLIN MOYNIHAN
Updated, 6:12 p.m. | In a tense showdown above the
East River, the police arrested about 400 demonstrators from the Occupy Wall
Street protests who took to the roadway as they tried to cross the Brooklyn
Bridge on Saturday afternoon.
The police did not immediately release precise arrest figures, but said it
was the choice of those marchers that led to the swift enforcement.
“Protesters w... 阅读全帖 |
|
c*********d
发帖数: 9770 | 24 论林彪反党集团的社会基础
On the Social Basis of the Lin Piao Anti-Party Clique
姚文元
by Yao Wen-yuan
[This article is reprinted from Peking Review, #10, March 7, 1975, pp. 5-10.]
毛主席在讲到必须搞清楚无产阶级对资产阶级专政的问题时明确指出：“林彪一类如上
台，搞资本主义很容易。因此，要多看点马列主义的书。”这就提出了一个极其重要的
问题：即“林彪一类”的阶级本质是什么？林彪反党集团产生的社会基础是什么？把这
个问题弄清楚，对于巩固无产阶级专政、防止资本主义复辟，对于坚定地执行党在社会
主义历史阶段的基本路线，一步一步地造成资产阶级既不能存在也不能再产生的条件，
无疑是十分必要的。
SPEAKING of the necessity for a clear understanding of the question of the
proletariat exercising dictatorship over the bourgeoisi... 阅读全帖 |
|
T**********e
发帖数: 29576 | 25
她是毕业生代表毕业典礼演讲。
By the time she graduated from Wellesley in May 1969, Hillary Rodham was
already such a notable figure that she was featured, along with four other
speakers from four other schools — and excerpts from their commencement
addresses — in the June 20, 1969, issue of LIFE, in an article titled,
simply, “The Class of ’69.”
1969 Student Commencement Speech
by Hillary D. Rodham (now Hillary Rodham Clinton)
May 31, 1969
Wellesley College
I am very glad that Miss Adams made it clear that w... 阅读全帖 |
|
m*****n
发帖数: 1513 | 26 KUALA LUMPUR: A Malindo Air flight bound for Kuala Terengganu had to return
to the Subang Airport soon after take-off this morning after one of its
engines caught fire.
A Malindo Air spokesman told the NST that the aircraft took off at 7.35am,
before the incident occurred soon after.
He said the pilot had taken immediate action by switching off the affected
engine, before safely landing at Subang airport.
It is learnt that among the passengers onboard were players of the
Terengganu football te... 阅读全帖 |
|
g*q
发帖数: 26623 | 27 A Brooklyn-bound express F train carrying about 1,000 passengers derailed
near the 65th Street station in Woodside, Queens, Friday morning, leaving
four people with "potentially serious" injuries and 15 others with minor
injuries, officials said.
Metropolitan Transportation Authority chairman Thomas F. Prendergast said
that the middle six cars of the eight-car train derailed -- and that the
incident was under investigation.
The FDNY citywide tour commander, Deputy Assistant Chief James Leonard, ... 阅读全帖 |
|
z*******3
发帖数: 13709 | 28 大多数国家都只有top2
我能想起top3同时在第一档次只有袋鼠国
其他都是top2，top3就是一个upper bound
一般top2都说自己毕业自最好的大学，而不是top2这样
所以这个其实就是一个upper bound
简历上写的都是自己毕业档次大学的upper bound排名 |
|
t******l
发帖数: 10908 | 29 有比 smallest decision tree 不费体力的解法。计算 Lowest bound,然后证明该
bound 是 reachable.
Lowest bound 是 max(m, n)，因为每个套套有两个 surface。。。然后证明
reachable 稍微复杂一点。。。。
这样可以算 AMC12 应该 |
|
t******l
发帖数: 10908 | 30 套子可以翻面的 lowest bound 是 (m+n+1)/2 (整数除法）
套子不能翻面的 lowest bound 也是 (m+n+1)/2 (整数除法），因为在该拓扑空间里，
阴茎和阴道拓扑等价。
然后你要么找到一个 decision tree 证明该 lowest bound 存在，要么用庞加莱群证
明存在性。。。这个体力活归你，我不干了。 |
|
发帖数: 1 | 31 只要没死很多人的群租房，都可以继续群下去，租下去，你说你们支持低端人口的低端
人群，咋对自己人就这么狠呢？
发信人: jeff (bound), 信区: Military
标 题: Re: 给大家看看东边二环外前些日子也是群租房的火
发信站: BBS 未名空间站 (Wed Nov 29 14:46:49 2017, 美东)
关键是有没有烧死人
烧死了多少人
没有人员伤亡的着火没人关注的
发信人: jeff (bound), 信区: Military
标 题: Re: 给大家看看东边二环外前些日子也是群租房的火
发信站: BBS 未名空间站 (Wed Nov 29 14:48:43 2017, 美东)
扯淡
烧死很多人的着火都非常受社会关注。
上次记得还是贾庆林书记时网吧着了一把大火烧死不少人
发信人: jeff (bound), 信区: Military
标 题: Re: 给大家看看东边二环外前些日子也是群租房的火
发信站: BBS 未名空间站 (Wed Nov 29 14:55:01 2017, 美东)
你就是一弱智
我告诉你，这种着火在北京这种特大城市里每天都有很多起。
关键... 阅读全帖 |
|
发帖数: 1 | 32 太湖之光的CPU sw26010在设计取向上是针对“暴力浮点”优化的，出现上面这个结果
（FLOPS强，某些其他测试不太好）意料之中。
比较显著的一个指标是这个CPU的内存带宽／浮点比率达到令人难以置信的1/22.4=0.
045 Byte／FLOP。作为对比（数据来源Yokota，J Algo Comp Tech， 7，3，2013）：
INTEL Xeon E5 2690: 0.211
AMD Opteron 6284 SE： 0.235
NVIDIA Fermi GF110: 0.266
IBM PowerPC A2（BG/Q）：0.208
Fujitsu Sparc64（FX10）：0.359
相比较而言sw26010的内存带宽太小，很多操作都会卡在内存上。实际应用上，优化好
的FMM或者DGEMM大概需要0.2，使用特殊向量指令还可以更低，3D FFT大概需要0.6～0.
9， stencil大概2～3，spmv大概5。在x86上FMM／DGEMM是compute bound，后面几个都
是memory bound，而在sw26010上这些操作几乎全都是memory boun... 阅读全帖 |
|
发帖数: 1 | 33 Naval History and Heritage Command
Naval History and Heritage Command
Open for Print Social Media
Search
Home
Research
Our Collections
Visit Our Museums
Browse by Topic
News & Events
Get Involved
About Us
DANFS » S » South Dakota I (Armored Cruiser No. 9)
Tags
Related Content
Topic
Document Type
Ship History
Wars & Conflicts
nhhc-wars-conflicts:world-war-i
Navy Communities
File Formats
Image (gif, jpg, tiff)
Location of Archival Materials
South Dakota I (Armored Cruiser No. 9)
1902... 阅读全帖 |
|
X1
发帖数: 1823 | 34 A timeline of murder
One statement of facts obtained by the news agency detailed a timeline of
the murders:
Navaratnam was killed on or about Sept. 6, 2010. During the investigation,
detectives found a piece of leather lacing in McArthur’s van that contained
Navaratnam’s DNA. His bracelet was found in McArthur’s bedroom.
Faizi, 42, was killed on or about Dec. 29, 2010, after disappearing from Gay
Village. His abandoned vehicle was found near a home to which McArthur had
access at the time of the... 阅读全帖 |
|
l****z
发帖数: 29846 | 35 The End of the Euro?
by Bruce Thornton (Research Fellow and W. Glenn Campbell and Rita Ricardo-
Campbell National Fellow, 2009–10, 2010–11)
Good riddance to a bad idea.
The champions of the European Union once touted it as a “bold new
experiment in living” and “the best hope in an insecure age.” But these
days “fear is coursing through the corridors of Brussels,” as the B.B.C.
reported in September. Such fear is justified, for the nations of Europe are
struggling with fiscal problems that challe... 阅读全帖 |
|
|
g*****u
发帖数: 298 | 37 设3个壶每按一次分别由upper和lower bound
u1, l1
u2, l2
u3, l3
两个容量的bound B1和B2
设每个壶要按x_i次，
则这就是一个integer programming问题，更确切的来说就是一个un-bounded knapsack |
|
i**********e
发帖数: 1145 | 38 谢谢你们的尝试，我又尝试了一个方案，但还是不能证明worst case的upper bound是O
(N).
思路是这样的：
假设矩阵的大小是 NxM，那么总共有 NxM 个元素。每一次划分可以保证去除正好 NM/2
个元素。第二层的划分又可以保证去除 NM/4 个元素。那么最坏的情况我们可以保证
划分的层数绝对不会超过 lg (NM)。这也表示 recursion 的深度不会超过 lg (NM)。
第一层我们总共用了 lg N 的时间来去除 NM/2 个元素，剩下 NM/2 个元素来搜索。
第二层我们总共用了 lg(i1) + lg(N-i1) 的时间来去除 NM/4 个元素，剩下 NM/4 个
元素。（i1 是第二层选择的划分点）
Complexity:
1st level = lg (N), NM/2 items left
2nd level = lg(i1) + lg(N-i1), NM/4 items left
3rd level = lg(i2) + lg(i1-i2) + lg(i3) + lg(N-i1-i3), NM/8 items left... 阅读全帖 |
|
i**********e
发帖数: 1145 | 39 Something to add.
>> Build a heap of N elements, ...
Please note that the N is a variable, not a constant. The N would grow as
more elements are being printed.
For example, to print the first element, N = 2, and you must insert 2^2 and
3^2 into the heap.
ExtractMin() would get you 2^2 as the first element to print. Then, you must
insert 2^3 to the heap next. There are now 2 elements in the heap, so N = 2
. ExtractMin() again and you get 2^3. Insert 2^4 to the heap. N is still 2.
ExtractMin() aga... 阅读全帖 |
|
l*****g
发帖数: 685 | 40 严格地说 degree bounded 好像是既有upper bound, 又有lower bound （leaf nodes
除外）
举个特例，balanced BST应该符合这个要求吧？但想不出怎么做BFS traverse with O(
1) space |
|
i**********e
发帖数: 1145 | 41 LZ，32 的 super cool 应该是 32 才对吧？
因为 32 = 2^5.
刚写了一个程序，利用 binary search 的思路.
首先选定一个 upper bound，也就是 ceiling(log(n)).
然后再 i=2 到 upper bound 每一个做 binary search.
例如，n=32，upper bound = log(32) = 5.
i=2，从 low = 1 到 high = ceiling(n^(1/2))
i=3, 从 low = 1 到 high = ceiling(n^1/3))
..
以此类推...
binary search 的 invariant 就是比较 target 和 middle and middle's next，看哪
一个比较近。如果是离 middle 比较近，那就 middle's next 和它上边的值都可以抛
掉了。相反，那就 middle 和它下边的值就可以抛掉。
这里，我们确保 middle's next 不会大于 high。这个条件可以保证，因为取的是
lower middle = (L+H)/2.
... 阅读全帖 |
|
g**********y
发帖数: 14569 | 42 这是我做模式识别的研究方向。专门有好多牛人做这个。
简单地说，比如一张扫描进去的地图，上面有很多字符，象街道名，山脉，河流。问题
是要把这些字符识别出来，然后跟路/山/河流联系起来，digitize map。为了识别这些
字符，需要把单词提取出来，然后用模式匹配。bounding box就是来计算包含单词的最
小矩阵。简单情况是，字符只要纵向或横向，但实际情况，不仅可以斜着，还可以弯曲
，而且字符可能和图形相交。所以这个bounding box的计算在实际里很复杂。一般的步
骤是先计算图的connected component。然后尝试连接component的中心，形成线，延长
，看是不是包含几个类似大小的component, 里面会采用一些估计和猜测。然后用几何
算bounding box。
现在可能有更好的办法做，但我也没去跟踪过进展。
问这种很无聊。做过的就很清楚，没做过的，面试那点时间，想的方向可能都不对。 |
|
f*******n
发帖数: 12623 | 43 Functions to find the left and right bounds, both log(n):
// left bound, inclusive
int binarySearch_left(char* arr, int len, char value) {
int low = 0, high = len-1, mid;
while (low < high) {
mid = (low + high) / 2;
if (arr[mid] >= value)
high = mid - 1;
else
low = mid + 1;
}
return low;
}
// right bound, inclusive
int binarySearch_right(char* arr, int len, char value) {
int low = 0, high = len-1, mid;
while (low <= high) {
... 阅读全帖 |
|
r*******k
发帖数: 1423 | 44 好像可以进一步优化，类似LIS优化成O(NlgN)
之前的所有record的upper bound是排序了的。
用i+1个record的lower bound去upper bound里二分查找，可以找到不想交的最大index
，然后低于这个index的就不用比了。高于这个index的，由于相交了，也不用比了。
这需要另外一个数组X记录低于i的最大值。因为M[i]是以i结尾的最大值，并不是小于
等于i的最大值。
不过这么看，M都没有记录的必要了。。。
因为高于i的那些record，也就是和i+1有交集的，也有可能是最大值。
所以M[i+1]可以通过二分查找迅速算出，但X[i+1]必须用M[i+1]和X[i]比较之后算出 |
|
c*********h
发帖数: 102 | 45 原题在这里：
http://www.geeksforgeeks.org/median-of-stream-of-integers-runni
Given that integers are read from a data stream. Find median of elements
read so for in efficient way. For simplicity assume there are no duplicates.
For example, let us consider the stream 5, 15, 1, 3 …
After reading 1st element of stream - 5 -> median - 5
After reading 2nd element of stream - 5, 15 -> median - 10
After reading 3rd element of stream - 5, 15, 1 -> median - 5
After reading 4th element of stream - 5, 15, 1, 3 -... 阅读全帖 |
|
发帖数: 1 | 46 小白路过，学习了。
第一题是leetcode 271道.
public class Solution {
public String serialize(List strs) {
if (strs == null) return null;
StringBuffer ret = new StringBuffer();
for (String s : strs) ret.append(s.replace("#", "##")).append(" # ");
return ret.toString();
}
public List deserialize(String s) {
if (s == null) return null;
List ret = new ArrayList();
String[] array = s.split(" # ", -1);
for (int i = 0; ... 阅读全帖 |
|
z****l
发帖数: 5282 | 47 ☆─────────────────────────────────────☆
Feny2013 (央未名) 于 (Mon May 20 11:00:59 2013, 美东) 提到:
因为无节制的申请信用卡，没办法喜欢信用卡啊，没有任何的baddies ，帐号被review
今天打电话给信用部门，人家居然说我seeking credit ,要关掉我boa/fiedlity ，我
的妈呀，boa是我最老的一张信用卡啊。为什么关掉我的卡，人家不停我的解释，执意
关卡，请问会对我的信用记录有影响吗，还有
update:礼貌，哀求都没有用，和好几个客服还有经理谈话都是说我账户会被关闭，所
以我上好厕所
后，拍了我的大便然后打印出来，我打电话给Boa说我可以传送收入证明过来，给了他
们的传真号，我就把我的大便传过去给他们看了，boa先不仁在先，也就别怪我恶心了
☆─────────────────────────────────────☆
epicureanism (Pesen) 于 (Mon May 20 11:06:46 2013, 美东) 提到:
肯定会有影响啊。。。
... 阅读全帖 |
|
t*******r
发帖数: 22634 | 48 如果你把竖式除法看成一个 iterative solver，而计算完每一位数字，看成
iterative solver 的一个个 iteration。那么，在任何一个 iteration 结束的时候，
你当然知道那个 iteration 的结果的 upper bound 和 lower bound，也就是具体
bound 在哪个区间里。
大部分 iterative solver，你很难确切知道每步结果的区间，但竖式除法可以。这个
难道还能有疑问？ |
|
w****l
发帖数: 6122 | 49 想抄底的同学最好还是多存钱吧。
http://www.rgemonitor.com/roubini-monitor/254354/the_dismal_out
The Dismal Outlook for the US and Global Economy and the Financial Markets
Email PrintShare
Delicious Digg Facebook reddit Technorati Nouriel Roubini | Nov 11, 2008
Here is a below brief summary of many of the points that I have made for the
last few months on the outlook for the U.S. and global economy and for
financial markets:
The U.S. will experience its most severe recession since WWII, much worse
and longer and... 阅读全帖 |
|
b*********n
发帖数: 13256 | 50 【 以下文字转载自 LoveNLust 讨论区 】
发信人: XiaoT89757 (唐七公子), 信区: LoveNLust
标 题: 漫长的告别
发信站: BBS 未名空间站 (Fri Jan 16 02:38:17 2015, 美东)
我觉得，这是一部关于告别的电影。
勒维恩说，“如果一首歌既不是新歌也不会过时，那它就是民谣”。没错，电影里
的所有歌曲，除了那首令人忍俊不禁的《拜托啦，肯尼迪先生》是设定在60年代初之外
，其他歌似乎不论放在当时还是今天，都是令人醉心的富有诗意的小品。整张原声带先
于电影很久就发行了，单独听也绝对是非常上乘的民谣唱片。
虽然故事只是发生在三五天的时间里，但发生的各种破事真是把整个100分钟塞得
满满当当，难怪勒维恩要说感觉已经过去好久了。科恩兄弟的这部剧作是很打破常规的
，编剧老师一定会跳出来说，你们这个人物怎么从头到尾都没变，这怎么行？！我仿佛
看见兄弟俩挥挥手，说，噢是这样么？于是故意还拍了“一模一样”（镜头方面略有不
同，台词一样）的头尾两段，让本就困顿的主人公更加陷入停滞不前的这一段人生。大
家都说这部电影是科恩兄弟目前为止最“温柔”的一... 阅读全帖 |
|
