由买买提看人间百态

topics

全部话题 - 话题: jacksheng
1 (共1页)
d**u
发帖数: 1639
1
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Mon Aug 11 08:59:18 2008) 提到:
search了一下版面,大家suggest去walmart,但是查了一下地图,walmart比较远。请
问有没有在Bala-Cynwyd附近的信誉较好的车铺,多谢了
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Mon Aug 11 15:10:32 2008) 提到:
ding

☆─────────────────────────────────────☆
ukyo (橘右京) 于 (Tue Aug 12 20:40:57 2008) 提到:
say's auto
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Tue Aug 12 21:21:56 2008) 提到:
多谢,请问地址是?
b***k
发帖数: 2673
2
来自主题: Quant版 - [合集] 请教一个面试题?
☆─────────────────────────────────────☆
leephy (leephy) 于 (Tue Sep 16 23:57:58 2008) 提到:
If X is uniform distributed in (0,pi), what is E(X|sinX)?
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Wed Sep 17 00:00:18 2008) 提到:
pi/2?

☆─────────────────────────────────────☆
ccca (cc) 于 (Wed Sep 17 18:16:22 2008) 提到:
I think pi/2 is correct.
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Wed Sep 17 20:40:50 2008) 提到:
why?
☆────────────────────────────────
b***k
发帖数: 2673
3
来自主题: Quant版 - [合集] interview question 3
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 02:34:20 2009, 美东) 提到:
this one is pretty standard, from another i-bank
which one is larger, e^\pi or \pi^e?
☆─────────────────────────────────────☆
pcasnik (pcasnik) 于 (Fri Jun 19 10:38:42 2009, 美东) 提到:
for x>0, ln(x)/x gets its maximum at x=e.
hence ln(e)/e > ln(pi)/pi, i.e., e^pi > pi^e.
or use e^x>1+x, and take x=pi/e-1.
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 20:34:18 2009, 美东
b****g
发帖数: 1912
4
来自主题: Working版 - [合集] 自打被雷后
☆─────────────────────────────────────☆
Zeratul (坚决不吵架) 于 (Tue Dec 16 09:40:38 2008) 提到:
Bless

☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Tue Dec 16 09:41:45 2008) 提到:
男人真惨,内外受气
bless
☆─────────────────────────────────────☆
xianqian (闲钱一点点) 于 (Tue Dec 16 09:44:09 2008) 提到:
不是受气,安慰性质,本人无心。
☆─────────────────────────────────────☆
zilch (Zilch Jr) 于 (Tue Dec 16 09:58:11 2008) 提到:
次数和频率有什么区别?请举例。
☆─────────────────────────────────────☆
xianqian (闲钱一点点) 于 (Tu
j******e
发帖数: 50
5
来自主题: UnitedKingdom版 - Cambridge University living expense ??
It's a post-doc job.
JackSheng, Do you know how much cost each month?
m**********7
发帖数: 30
6
来自主题: UnitedKingdom版 - 在英国找美国工作容易么
JackSheng,不是在高盛的吗?
c*********t
发帖数: 30088
7
来自主题: UnitedKingdom版 - [英伦风情活动]伪币奖励明细
suwen:西南三日游,文字约2800字,奖励伪币100
感谢下列ID为活动做的捐款!
Suchelicht,13-08-2009, 888.00
FlyUpLife , 06-08-2009,20.00
FlyUpLife, 06-08-2009,80.00
MyCottage,06-08-2009,50.00
JackSheng,06-08-2009,10.00
suwen,06-08-2009,50.00
segawang,06-08-2009,50.00
s***n
发帖数: 10693
8
来自主题: UnitedKingdom版 - 美元换英镑
JackSheng说的是这家
http://money.marksandspencer.com/
o********y
发帖数: 1138
9
附加说明:
J*******g
发帖数: 267
10
来自主题: Mathematics版 - 问个问题
【 以下文字转载自 Quant 讨论区 】
发信人: JackSheng (重新振作), 信区: Quant
标 题: 问个问题
发信站: BBS 未名空间站 (Sat May 16 22:59:30 2009), 转信
证明matrix inversion和matrix multiplication是equivalent in terms of
complexity?
I can show one direction (realize matrix multiplication using matrix
inversion) but got stuck on the other direction. Someone assured me that
the other direction is true too. Any thoughts?
B*********h
发帖数: 800
11
☆─────────────────────────────────────☆
progress2007 (progress@2007) 于 (Sat Mar 3 15:31:36 2007) 提到:
谁有经验介绍一下前台的情况吧,比如主要职责,工作时间,压力大小,要求技能,所
需教育背景和工作经历等等,大家讨论讨论,撞点儿火花出来。
☆─────────────────────────────────────☆
bysz (bysz) 于 (Sun Mar 4 18:57:06 2007) 提到:
不同group职责,时间,技能差别很大。干这行,时间是不可能少的,front office直
接跟钱打交道,压力自然大很多,出大岔子马上就被fire了,more challenging, more
promising, 当然淘汰率也更高。

☆─────────────────────────────────────☆
JackSheng (快乐每一天) 于 (Sun Mar 4 19:08:16 2007) 提到:
the career of thos
b***k
发帖数: 2673
12
来自主题: Quant版 - [合集] a question on statistics
☆─────────────────────────────────────☆
littleegg (爱吃茶叶蛋) 于 (Wed Jul 9 09:09:24 2008) 提到:
what is the expected number of random numbers, uniformally distributed from
0 to 1 needed for the sum to be greater than 1?
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Wed Jul 9 09:33:23 2008) 提到:
e

from
☆─────────────────────────────────────☆
littleegg (爱吃茶叶蛋) 于 (Wed Jul 9 10:05:01 2008) 提到:
but sum(n*P(N=n)) does not seem to be a finite number. not e either!
☆───────────
b***k
发帖数: 2673
13
☆─────────────────────────────────────☆
magnitude (难以释怀) 于 (Sun Aug 3 15:24:13 2008) 提到:
有做 Forcasting Modle的么?工作好做么?该看些什么书?
☆─────────────────────────────────────☆
stoneyl (stone) 于 (Mon Aug 4 06:31:12 2008) 提到:
u mean "forecasting model"
☆─────────────────────────────────────☆
stoneyl (stone) 于 (Mon Aug 4 06:57:18 2008) 提到:
u mean "forecasting model"
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Mon Aug 4 09:15:49 2008) 提到:
forecasting what?

☆────────────
b***k
发帖数: 2673
14
☆─────────────────────────────────────☆
jejune (孑孓) 于 (Mon Oct 20 04:02:45 2008) 提到:
微分方程
dx/x=a*dy/y+dw(t)
a是常数,x,y是随机过程,w(t)是weiner process.
它的积分形式是什么?就是说
dln(x)=a*dln(y)+ ?
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Mon Oct 20 13:39:29 2008) 提到:
I thought dln(x) =\= dx/x, if x is a stochastic process, actually dx/x = dln
(x) + (dx)^2/(2 x^2)

☆─────────────────────────────────────☆
jejune (孑孓) 于 (Wed Oct 22 02:08:10 2008) 提到:
you are right. otherwise it won't b
b***k
发帖数: 2673
15
☆─────────────────────────────────────☆
moyuecha (抹月茶) 于 (Sat Oct 25 04:30:33 2008) 提到:
已知m(t)时间的函数 且满足以下条件
m'(t)-bm(t)=a m(t)一阶导数减其本身 得到常数a (b is constant)
m(0)=x
请问 m(t) 的函数是什么形式呢
☆─────────────────────────────────────☆
smilenuts (smilenuts) 于 (Mon Oct 27 02:02:50 2008) 提到:
It's just a regular affine ODE and more generally you can solve for am'' + bm' + c m = d.

☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Mon Oct 27 08:34:35 2008) 提到:
multiply both sides with ex
m*******e
发帖数: 15
16
来自主题: Quant版 - answer to jacksheng's question
1. you don't need to pay to renege offer
2. I think that's GS CVA desk strategist.
3. GS EM desk trades EM FX, EM rates and exotics
CVA desk stratesgist is a typical quant role, you will learn a lot of
correlation and modeling stuff
obviously EM desk quant is the best choice,I know last year EM new york was
looking to hire some phds
p****u
发帖数: 2596
17
来自主题: Quant版 - answer to jacksheng's question
what is this post about?? where is the original water??

was
P*********t
发帖数: 4451
p****u
发帖数: 2596
19
来自主题: Quant版 - answer to jacksheng's question
ah?? you are??
b***k
发帖数: 2673
20
来自主题: Quant版 - [合集] interview question 1
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 00:09:32 2009, 美东) 提到:
I have been trying to post my interview experience, but found it quite tedious to write down the procedure in one post, so I would rather put down the questions individually in posts. Here is one from an "investment bank". Well, you guess which one i
You are asked to store a symmetric matrix of, say integers, efficiently. All you know about the matrix is that it is symmetric. Please write me a func
b***k
发帖数: 2673
21
来自主题: Quant版 - [合集] interview question 2
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 02:33:24 2009, 美东) 提到:
this question from an i-bank, still, you guess which one
how many subsets does {1, 2, ..., n} have that contains no consecutive
integers? for example, {1, 2} not okay, while {1, 3, 5} okay.
think recursion
☆─────────────────────────────────────☆
daj (肉丝炒饭--小吵肉fan) 于 (Fri Jun 19 14:39:01 2009, 北京) 提到:
赛 。。。
没找到感觉 .....

☆─────────────────────────────────────☆
accessto (11) 于 (Fri Jun 19 02:
b***k
发帖数: 2673
22
来自主题: Quant版 - [合集] interview question 4
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 02:39:03 2009, 美东) 提到:
this one is also from an i-bank
given a length-n array of real numbers (either positive or negative), find
the contiguous sub-array of maximum sum in linear time
☆─────────────────────────────────────☆
daj (肉丝炒饭--小吵肉fan) 于 (Fri Jun 19 14:44:42 2009, 北京) 提到:
谢谢

☆─────────────────────────────────────☆
ChinaTian (Work on my dream) 于 (Fri Jun 19 09:37:43 2009, 美东) 提到:
good, mark
☆───────────
b***k
发帖数: 2673
23
来自主题: Quant版 - [合集] interview question 5
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 02:44:53 2009, 美东) 提到:
this one is too standard ...
a unit-length stick, broken into three pieces at two uniformly randomly
selected points. what is the probability that the three pieces can form a
triangle.
i know i know this is tooooold, please bear with me, just for the record
☆─────────────────────────────────────☆
xmly (xmly) 于 (Fri Jun 19 04:22:41 2009, 美东) 提到:
tooold我还是不知道答案
ft

☆─────────────────────────────
b***k
发帖数: 2673
24
来自主题: Quant版 - [合集] interview question 6
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 02:48:58 2009, 美东) 提到:
this one is from an i-bank
given an Gaussian random number generator, how would you estimate \pi?
☆─────────────────────────────────────☆
daj (肉丝炒饭--小吵肉fan) 于 (Fri Jun 19 15:02:01 2009, 北京) 提到:
gaussian a ?
orz......
正反 distribution to get a uniform ?
这个以前没见到过

☆─────────────────────────────────────☆
netghost (Up to Isomorphism) 于 (Fri Jun 19 04:22:35 2009, 美东) 提到:
Just let Z=sqrt(X^2+Y^
b***k
发帖数: 2673
25
来自主题: Quant版 - [合集] interview question 7
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 20:43:46 2009, 美东) 提到:
question from an i-bank
write a function, with a directed graph as the input, output whether the
graph contains a path that passes all vertices exactly once (a.k.a.
Hamiltonian path)
☆─────────────────────────────────────☆
Jadeson (Jadeson) 于 (Fri Jun 19 21:00:33 2009, 美东) 提到:

你这个是电话面试还是on site?
我看你前几个问题都象是电面啊。
☆─────────────────────────────────────☆
swordmans (风云第一刀) 于 (Fri Jun 19 22:00:
b***k
发帖数: 2673
26
来自主题: Quant版 - [合集] interview question 8
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Fri Jun 19 21:01:08 2009, 美东) 提到:
question from an i-bank
suppose there are k denominations in a coin system, denoted as d_1, ..., d_k
. give me an efficient algorithm that makes an amount of n using as few
coins as possible.
☆─────────────────────────────────────☆
swordmans (风云第一刀) 于 (Fri Jun 19 21:59:47 2009, 美东) 提到:
Dynamics programming, and for some special cases, Greey method may work

_k
☆────────────────────────────────
b***k
发帖数: 2673
27
来自主题: Quant版 - [合集] 请教一个面试的问题
☆─────────────────────────────────────☆
miernikcx (nik) 于 (Wed Oct 14 18:10:01 2009, 美东) 提到:
在两张纸A,B上分别随机写两个数字,两个数字不相等。所以猜对哪个大的概率为1/2

现在随机翻开A或者B,再猜A或者B上哪个数字大。设计一种策略使得你猜对的概率大于
1/2。
我没什么思路,有知道的给点思路么?
☆─────────────────────────────────────☆
JackSheng (重新振作) 于 (Wed Oct 14 18:18:30 2009, 美东) 提到:
呵呵,这道题也大众化了。。。

2
☆─────────────────────────────────────☆
california11 (加州) 于 (Wed Oct 14 18:33:53 2009, 美东) 提到:
请问怎么做
☆─────────────────────────────────────☆
simple1987 (simple) 于 (Wed O
m*********k
发帖数: 10521
28
来自主题: WBCenter版 - 申请代发包子
[NextGeneration] snowforever May 18 ● 为宝爸求祝福发400个包子
10*400=4000
成功奖励 10 伪币的用户: zkjeffrey, Joyce1222, HappyF1, sylj, iceeblue,
cinnamon, Kawai, bamboo2000, galah, dundun, momagain, drew, dumpty, ongo,
cpxt, laofuzi, fbfb, saculaki, misato, Bali, shakila, myhouse, ilovesam,
yunbao, tox, crysknife, so2011223, smileinfire, springfor, frogprincebs,
zzgn, leaflee, PInce, lovett, piu, zcaomei, renayin, junebelle, hbxg1207,
orange975095, kaylaxu, suanle, newrock, Uglypig, alexx, smartegg, Mutombo,
ya... 阅读全帖
m*********k
发帖数: 10521
29
来自主题: WBCenter版 - 申请代发包子
[MedicalCareer] yugan2005 May 24 ● 求助 500个包子 国内朋友的母亲需要处
方药治疗?
10*500=5000
成功奖励 10 伪币的用户: simon06, grass, aplets, milkswan, Belichick, utahfly
, KAKO, icesnowsky, junting, simon1000, brave, CECILE8308, VichyBoy, kaylaxu
, isis1414, lanzhu, parkjisung, bingchuan, lhr, parfume, Uglypig, greentee,
jjl231, mariah, Rosefield, santorini, Rodimus, iSeven, mmflypig, Allspice,
chaselife, Patchouli, wiiwii, cherubtessie, XXXOOO123, mdctl, zhanglong0,
guoguo82, SpikeLi, antony, huanglaoxie, hbsm, ldm, ... 阅读全帖
m*********k
发帖数: 10521
30
来自主题: WBCenter版 - Military版申请代发包子
"[Military]TempBM Oct 31. ● (过十万,再接再励!)众志成城,白宫请愿
签名需要你"
成功奖励 50 伪币的用户: CATCAT, fourriver, ptx, Doser, IV, rebecca1975, PT,
huyanke, allence, ilovqianqian, AnyMoreLeft, laoshu09, hahaha2012, hj630,
TempBM, happymyt, OldLady80, shinn, davidcrazy, cathy1061, MMT007, shenms,
shouben, cassfs, wxu121, acrophoenix, mimi12, xxmj, xuxuaiying, pplar,
chuweitong, easy0784, bluepen, cj1208, sunnyy, nmstarry, bingbing01,
juliemzhu, iruka, xiaose, rooster, acespade, crasher, mit09, xinchong,
jonsun, hyp... 阅读全帖
1 (共1页)