由买买提看人间百态

topics

全部话题 - 话题: minimed
首页 上页 1 2 3 4 5 6 7 8 9 10 下页 末页 (共10页)
y***r
发帖数: 16594
1
Brian,
I have been a field service employee or GSI (Geek Squad Installer) for over
eight years now, and having been one of the first in my particular market, I
have seen the gradual change from client service to make as much profit via
in-home up-sells from the client as you can first hand. The current tagline
for this is “In home solutions”. GS installers are hired and put in the
field with minimal training or knowledge of the job and expected to
professionally install products and educate clie... 阅读全帖
w***o
发帖数: 151
2
【 以下文字转载自 Chemistry 讨论区 】
发信人: evans2 (evans), 信区: Chemistry
标 题: 哥大Shames 叫兽必须谢罪-包子伺候-修改稿出台公示
发信站: BBS 未名空间站 (Sun Jul 24 14:06:10 2011, 美东)
第二版出台 也同时希望中国化学教授能表现出支持的态度,虽然事不关己,看在民族大义份上,务必团结
Should Mr. Sames apologize to these students being ruined by his fraud?
Mr Sames is a tenured Professor in chemistry department of Columbia University, he focused on his study in organic chemistry. During the past 10 years, he is considered by peers as a genius chemist and published a variety of research publ... 阅读全帖
p*l
发帖数: 1359
3
When I was in Boston, the salary depended on the group's culture. In groups
where the postdoc mostly came from directly from mainland on J1 visa, often
the salary was below NIH standard, as long as it is higher than the minimal
requirement for J1. In other groups where postdocs were most US and
Europe degree holder, NIH standard was the norm. If you have money, paying a
little above the NIH standard will definitely make you a very nice boss.
HMS is famous for its low postdoc salary. One reason I... 阅读全帖
s******y
发帖数: 28562
4
现在红遍天下的光遗传学,大家(包括我)都认为是Stanford的Deisseroth创造的。但
是昨天我不小心看到了一篇新闻文章,才惊讶的发现其实最早做出来的,有可能是
Wayne State University的潘卓华。虽然他的投稿时间和Deisseroth的类似,但是因为
他是一个没有什么名气的学者,而且他的文章包装得不对,所以他的文章被百般耽误,
最后比Deisseroth的晚了一年才发表。
在2004年底潘就做出了和Deisseroth几乎一样的文章,除了用的细胞略微不同:他做的
神经细胞是从视网膜分离的,而Deisseroth 做的神经细胞是从大脑分离的。然后他把
文章陆续投向Nature, Nature Neuroscience,Journal of Neuroscience,却统统遭到
了拒稿。然后大半年之后,也就是2005年8月份,Deisseroth 的文章发表在Nature
Neuroscience上。潘得知之后,心都凉了。
有意思的是潘卓华发现自己的文章被人scoop之后写信问 Nature Neuroscience为什么
两篇几乎一模一样的文章,他们接受了De... 阅读全帖
w********t
发帖数: 5586
5
冒个泡。。
will try to minimized the loss to use the code in store..
what if the code is already redeemed?
声明。。 是讨论帖。。没有扯皮的问题啊。。
我感觉原则是俺before deliver/ after deliver
but both side should work together to minimize the loss if there is
something
happen.
l**f
发帖数: 1892
6
来自主题: FleaMarket版 - 二手洗钱的大老虎原来是他 (转载)
【 以下文字转载自 ebiz 讨论区 】
发信人: lysf (lysf), 信区: ebiz
标 题: 二手洗钱的大老虎原来是他
发信站: BBS 未名空间站 (Tue Jan 13 12:43:37 2015, 美东)
与之相比,那些卖肉鸡卡的,躲在QQ群里吆喝换钱的都弱爆了。
大家看看这个,
发信人: dealgraph (草上飞), 信区: FleaMarket
标 题: [出售] 5% off Amazon/Target/Bestbuy GC @0.95 Gift Card
发信站: BBS 未名空间站 (Fri Jan 9 20:54:54 2015, 美东)
Limited time offer: 5% off all gift card
If you need less than $10,000 gc, just go ahead and fill out this form:
$4000 is the minimal order!
dealgraph低调的卖卡,但是交易门槛可不低,上来就要$4000 minimal。但这个帖子并
不符合二手版规矩,没有说明卡的来... 阅读全帖
a*****y
发帖数: 311
7
For the speakers that I have audited. Maggie 1.7 does sound a lot better
than traditional cone speakers as far as I can tell --- the clarity is
unmatched by the traditional speakers, although I think ML ElectroMotion is
probably even better in clarity. However I think Maggie 1.7 is very
sensitive to the quality of amplifiers. Yesterday I audited Maggie 1.7 first
on a 1600 amplifier and then a 16,000 one, definitely heard the difference.
I am doing my research online and found the following, thin... 阅读全帖
c*****e
发帖数: 3226
8
来自主题: Investment版 - 问个balance transfer的问题 (转载)
【 以下文字转载自 Money 讨论区 】
发信人: capcase (gotmail), 信区: Money
标 题: 问个balance transfer的问题
发信站: BBS 未名空间站 (Tue Dec 14 02:25:03 2010, 美东)
请问个balance transfer的问题,有实际操作经验的看一看:
我收到citi 0% balance transfer 的check 到 Dec/2011.
1) 是不是我写支票可以去pay off 我的车的贷款?
2)上一步中我是不是必须保证 under credit limit?
3) 每个月我是不是支付minimal pay 就可以了? 其余的balance 到 Dec/2011是
没有利息的?
4)我现在平时的生活支出也在这个citi 卡上,如何区分和车款支付的钱? 那我如果
只是支付minimal pay, 显然生活支出的会有利息,这个如何操作的?
只是感觉0% apr through 2010/Dec有点诱惑,但是也不想找来不必要的麻烦。
请有实际操作经验的请指点。
s*******d
发帖数: 126
9
来自主题: Investment版 - is tax-deferred always good?
I see that people have been discussing VUL and what not, and this is the
question I have.
Suppose that we don't worry about all the hidden costs (significant, I agree
) of VUL, and it is considered just as a tax-deferred investement. And let's
assume that we are not talking about tax-free death benefit, but in general
, we wish to make some withdraw on the investment and that the withdraw is
taxed at the income tax level. Is this type of investment necessarily better
than an index fund that has ... 阅读全帖
y*******8
发帖数: 162
10
本人新手,在论坛潜水好些时间,有个问题向版上大牛请教:
按照boglehead的以下说法:选择rothIRA 还是traditional IRA 就是看你现在的收入
和将来的收入那个高。
“The main reason to prefer one type of account over the other is the
comparison of marginal tax rates. If your marginal tax rate now is higher
than your estimated marginal tax rate at retirement, then the traditional
account is better; if it is lower, then the Roth account is better.”
那么如果说觉得自己未来海归的可能行很大,是否说选择traditional比较好??如果
你在回国不久或者等到60岁的时侯取出,不是美国公民,不需要报税,在美国的收入为
零。不知道我的理解对吗?
希望哪位能够指点迷津,谢谢!
Withdraw... 阅读全帖
r****9
发帖数: 4961
11
来自主题: Investment版 - 为什么roth 401k比trad 401k划算
Assuming tax law does not change.
1. Usually you have less taxable income when you retire.
2. You can manage when and how much to withdraw money from 401k year by year
to minimize the tax. If in one year you made a lot of money, you can
minimize your withdraw from your 401k that year.
3. You can move to a low state income tax state.
r****9
发帖数: 4961
12
来自主题: Investment版 - 为什么roth 401k比trad 401k划算
Assuming tax law does not change.
1. Usually you have less taxable income when you retire.
2. You can manage when and how much to withdraw money from 401k year by year
to minimize the tax. If in one year you made a lot of money, you can
minimize your withdraw from your 401k that year.
3. You can move to a low state income tax state.
w***n
发帖数: 1519
13
来自主题: Investment版 - HSA里的钱,大家都拿来投资吗?
我懂你说的,不过我说的可能太绕了,难理解。
我想考量的当然是都放满了之后,投资比投资,什么样的vehicle更好。这钱如果拿去
消费,该考虑的就是乐趣,谈钱就俗了。
找到这篇文章,里边就解释了我的concern:
https://blog.wealthfront.com/high-deductible-health-plan/
"Assume you start with $10,000, your HSA charges fees of 1%, the mutual
funds available to you are likely to underperform the market by 2.1% and “
the market” is expected to generate a gross 6% annual return. After 20
years your HSA will grow to $17,714. That same $10,000, put into a passive
taxable account, with a 0.25% annual fee, ... 阅读全帖
s*x
发帖数: 3328
14
来自主题: JobHunting版 - 问一道NP算法题
not necessarily connected, so the minimal set of affect differs from the
nodes in a minimal spanning tree.

of
1
E********a
发帖数: 124
15
来自主题: JobHunting版 - 这个算法题算难吗
一个数组,N个正整数,分成x段,找一种分段法,minimize the maximum sum of x
pieces,
i.e.,
minimize: MAX OF {sum of piece_1, sum of piece_2, ..., sum of piece_X}
大家觉得这个题目如果用了很多提示,最后能做出来,是不是还不错了?
g*****n
发帖数: 21
16
来自主题: JobHunting版 - 请教一道电面算法题
There's a book and each sentence consists of several words. How to find the
minimal set of words which can used by the reader to understand half of
total number of the sentences. Each sentence is readable if the reader know
all the words.
I can only think of brute force solution -- do word counting on every
possible collection of half number of sentences and choose the minimal. But
that's exponential C(n,n/2).
Any better solution?
Thanks
g*********s
发帖数: 1782
17
来自主题: JobHunting版 - 继续研究数组分段题
正整数的数组x[1..n],分成k段,找分段法,minimize the maximum sum of any
pieces,
minimize: MAX OF {sum of piece_1, sum of piece_2, ..., sum of piece_X}
dp:
f(n,k) = min { max { f(i,k-1), sum(x[j]) | i = 1..n, j = i+1..n } }
这个复杂度是O(K*N^2),可以加速到O(K*NlgN)?
如果输入改成非负整数数组呢?
如果改成任意整数呢?
二分法要求必须是正整数吧?
i********g
发帖数: 77
18
来自主题: JobHunting版 - 给生物生化硕士毕业想找工作的
Job Description
This position is in a R&D group that manufactures reagents and instruments
for in-vitro medical diagnostics. Day to day activities will include data
analysis and process development studies to support R&D feasibility and
verification/validation project phases.
The applicant must have minimally a BS or MS in Chemistry, Biochemistry or
related discipline with experience or an advanced degree in a similar field.
Applicants with industrial background and knowledge of GMP/ISO will be
... 阅读全帖
s*******e
发帖数: 4188
19
来自主题: JobHunting版 - 算法面试题
saw this on careercup:
3 sorted arrays, A, B, C, find indexes i, j, k, so that max(a-b, b-c, c-a)
is minimized. (a = A[i], b = B[j], c = C[k])
Another version is to minimize max(|a-b|, |b-c|, |c-a|).
T***C
发帖数: 1011
20
来自主题: JobHunting版 - [FYI]会日文的看这里
Dear XXX,
I am Masako, a recruiter with TS Consulting International. I am working on
a following JAPANESE BILINGUAL positions nationwide. If you know of someone
for one or some of those positions, would you forward this email to that
person?
I really appreciate your help in advance.
Have a great day!
1. Sales Manager position
Company: A Japan-based Human Resources company
Qualifications:
· 5+ years of Sales Experience in the any industries
· ... 阅读全帖
b*******y
发帖数: 232
21
来自主题: JobHunting版 - 这个facebook puzzle样题怎么做?
是样题,然后还是45分钟倒计时的
可以用各种语言编写
感觉这种题目,用C或者java写是不是编程时间上比不过python?
单单看题目本身也很难啊,像是hannoi,但比它难多了,不知道有什么思路?
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs who have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move ... 阅读全帖
c*******t
发帖数: 39
22
Some thought:
Do two scans:
1. from left to right, for each element mark the minimal element seen so far
2. from right to left, for each element mark the maximal element seen so far
Then do a third scan from left to right:
Start from the first element, go as far as possible until the marked maximal
element is smaller than it and record the current j-i
Then find next possible left start point, which is the element has minimal
mark equal to itself and less than the current maximal of element at j.... 阅读全帖
e***n
发帖数: 42
23
来自主题: JobHunting版 - FB coding challenge sample question
既然是样题,希望能公开讨论一下:这道题像careercup书上Hanoi Tower的一个变形:
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any o... 阅读全帖
i********y
发帖数: 34
24
来自主题: JobHunting版 - 我们公司招人
Minimally Invasive Device Engineer
We are seeking an exceptional, self-motivated individual to work with a
small team to construct, test and expand upon a novel minimally-invasive
device to reach far inside the lungs. Research will include: mechanical
analysis of current prototypes, industrial design for manufacturing, ease-of
-use, integration of diagnostic and therapeutic devices and pre-clinical
testing. A thorough understanding of mechanical design tools, material
testing techniques and us... 阅读全帖
l*****y
发帖数: 56
25
来自主题: JobHunting版 - 一道google 经典题
像楼主说的,每次把最小的往上移。
用了三个指针,分别指向三个数组,中间会交换指针,min, mid, max,他们分别指向
三个从小到到大排列的数, 距离就是 *max -*min.
最后return the minimal distance, the vector d records the three elements
with minimal distance.
请指正, 谢谢了!
void swap(vector::iterator &a, vector::iterator &b){
vector::iterator temp;
temp=a;

a=b;
b=temp;
}
int min_dist(vector &a, vector &b, vector &c, vector &d){
vector::iterator min=a.begin(), mid=b.begin(), max=c.begin();
int dist=100... 阅读全帖
l*****y
发帖数: 56
26
来自主题: JobHunting版 - 一道google 经典题
像楼主说的,每次把最小的往上移。
用了三个指针,分别指向三个数组,中间会交换指针,min, mid, max,他们分别指向
三个从小到到大排列的数, 距离就是 *max -*min.
最后return the minimal distance, the vector d records the three elements
with minimal distance.
请指正, 谢谢了!
void swap(vector::iterator &a, vector::iterator &b){
vector::iterator temp;
temp=a;

a=b;
b=temp;
}
int min_dist(vector &a, vector &b, vector &c, vector &d){
vector::iterator min=a.begin(), mid=b.begin(), max=c.begin();
int dist=100... 阅读全帖
i*********7
发帖数: 348
27
You are given an integer N and an integer M. You are supposed to write a
method void findBestCoinsThatMinimizeAverage(int N, int M) that prints the
best collection of N coins that minimize the average number of minimum coins
needed to generate values from 1 to M. So, if M = 100, and N = 4, then if
we use the set {1, 5, 10, 25} to generate each value from 1 to 100, so that
for each value the number of coins are minimized, i.e. 1 = 1 (1 coin), 2 = 1
+ 1 (2 coins),..., 6 = 1 + 5 (2 coins), ..., 24 ... 阅读全帖
l***i
发帖数: 1309
28
As pointed by an earlier reply, 24 = 10 + 10 + 1 + 1, so the example is
incorrect. That aside, here is a DP solution which might not be the best
possible.
Let dp[K][N][last] be a bool array such that
dp[i][j][k] is true if there exists a set of j coins with largest coin being
k, and was able to generate 1 to M with a sum of i coins.
To minimize average is the same as minimize the sum over 1 to M.
Then we are looking for the smallest K that dp[K][N][last] is true. K is at
most (1+...+M)=1/2 M^2, ... 阅读全帖
l*******b
发帖数: 2586
29
来自主题: JobHunting版 - 两道google的题
嗯。。我是按这个写的,感觉比翻转容易写错,改了3,4遍
void reconstruct(string &s) {
/* reconstruct minimal lexical seq with DIDI */
int n = s.size();
int m = 1; // minimal current availabe number
int i = 0;
while(i < n) {
if(s[i] == 'I') {
cout << m++ << " "; // output
i++;
}
else {
int j;
for(j = i; j < n && s[j] != 'I'; ++j)
;
int t = m + j -... 阅读全帖
s*********l
发帖数: 103
30
来自主题: JobHunting版 - 不会newton多项式
:发信人: dreamstring (ric_li), 信区: JobHunting
:标 题: Re: 不会newton多项式
:发信站: BBS 未名空间站 (Tue Jan 22 10:27:34 2013, 美东)
:【 在 lingandcs (lingandcs) 的大作中提到: 】
:: 牛顿迭代在machine learning里面貌似很有用
:: 好多模型,比如最大熵,CRF,SVM,等的training方法都是基于这个的,叫L-BFGS。
BFGS (L-BFGS) 不是严格意义上的牛顿法,而属于拟牛顿法(Quasi-Newton Method).
http://en.wikipedia.org/wiki/BFGS_method
http://en.wikipedia.org/wiki/L-BFGS
http://en.wikipedia.org/wiki/Quasi-Newton_method
:其实能不用尽量都不用,算逆矩阵太费事~~
Quasi-Newton 方法不用算二阶导 (Hessian Matrix) 以及逆矩阵 (inverse of
Hessia... 阅读全帖
d**e
发帖数: 6098
31
☆─────────────────────────────────────☆
travelodge (travelodge) 于 (Fri Aug 31 00:46:34 2012, 美东) 提到:
总觉得山寨淘宝的research scientist很鸡肋, 工资跟sde一样,但基本不
发paper,
这样怎么来评定该不该升级。 不发paper又不经常写code那就等于没法跳槽,万一被裁
员别家的research scientist还是看paper的吧。
至于山寨百度的SDE(T4), 又担心他们家高手如云, 很难升级, 会不会做万年sde(最多
升到5)
钱上其实账目上差不多, 扣掉免税州的低房价, 不过淘宝少了很多福利
对于fresh phd来说
RSII: 125k + 40k sign-on /2 + 55k RSU / 4 = 158.75K
SDE 127k + 15% bonus + 160 RSU/4 = 170K
有没有过来人给点建议。。。。
面经,记不清了 
山寨淘宝/京东
onsite有个job talk,
然后有五六轮聊天面试吧,题目... 阅读全帖
o******3
发帖数: 91
32
来自主题: JobHunting版 - 面试F家让先做programming puzzle
决定把题目跟我写的很挫的代码贴上来,有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目:
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topm... 阅读全帖
o******3
发帖数: 91
33
来自主题: JobHunting版 - 面试F家让先做programming puzzle
决定把题目跟我写的很挫的代码贴上来,有需要的同学可以来看。。。
代码可以过sample test
但是目前还不能过所有的Test
题目:
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topm... 阅读全帖
s*****n
发帖数: 994
34
来自主题: JobHunting版 - 汉诺塔为啥dfs可以解决?
为啥dfs是最短solution?
题目在此
There are K pegs. Each peg can hold discs in decreasing order of radius when
looked from bottom to top of the peg. There are N discs which have radius 1
to N; Given the initial configuration of the pegs and the final
configuration of the pegs, output the moves required to transform from the
initial to final configuration. You are required to do the transformations
in minimal number of moves.
A move consists of picking the topmost disc of any one of the pegs and
placing it ... 阅读全帖
a*****h
发帖数: 4
35
来自主题: JobHunting版 - 内部推荐 赛门铁克
职位信息如下 地点在洛杉矶 感兴趣的话可以把简历发给我 a*******[email protected]
我会pre-screen一下直接丢给hiring manager 也可以直接去公司网站投
CM(Configuration Management)组 日常比较忙 压力略大 但组老大人很好 一年以后
可以转到开发 他不会拦着 而且很鼓励
M.S. New Grads 也欢迎来投 简历请发pdf格式 谢谢
Title Sr Software Engineer
Auto req ID 17129BR
Full-time or Part-time Full-time
Location USA - California, Culver City
About Us We are the configuration management group of Symantec. We design
, support, automate and maintain the build process for multiple product
platforms. We help... 阅读全帖
s*******x
发帖数: 427
36
来自主题: JobHunting版 - Software Developer position at TX
Software Developer
We are seeking a Software Developer to develop and maintain components of
the finite element solver.
Responsibilities:
• Develop finite element/optimization software within OptiStruct
team
• Maintain and develop utility software for builds and qa process
for OptiStruct and other solvers
• Develop and expand internal data structures and base algorithms
in finite element solvers
• Participate in tuning and optimization of specific routines/
al... 阅读全帖
o**********e
发帖数: 18403
37
烙印都说了,MS layoff has minimal impact on india
不知这位同学哪来的数据?
http://www.outlookindia.com/news/article/Microsoft-to-Axe-18000
When asked on the restructuring impact on India, a Microsoft India
spokesperson told PTI: "We have about 6,500 employees in India, which also
includes employees from Nokia. The impact will be minimal. It will be very
very small."
m******a
发帖数: 84
38
来自主题: JobHunting版 - 请教一道算法题
Give an integer array, adjust each integers so that the difference of every
adjacent integers are not greater than a given number target. If the array
before adjustment is A, the array after adjustment is B, you should minimize
the sum of abs(A[i] - B[i])
You can assume each number in the array is a positive integer and not
greater than 100
Example:
Given [1,4,2,3] and target=1, one of the solutions is [2,3,2,3], the
adjustment cost is 2 and it's minimal. Return 2.
题目如上,请问大牛们有没有好的想法?谢谢!
y*****e
发帖数: 712
39
我忘了是F家还是G家的了,当时没仔细看大家的讨论,这两天做lintcode,竟然和这题
重逢了,看了半天一点思路也没有,不知有没有大神愿意指点一下,动态方程应该怎么
写?
题目:
Given an integer array, adjust each integers so that the difference of every
adjcent integers are not greater than a given number target.
If the array before adjustment is A, the array after adjustment is B, you
should minimize the sum of |A[i]-B[i]|
例子
Given [1,4,2,3] and target=1, one of the solutions is [2,3,2,3], the
adjustment cost is 2 and it's minimal. Return 2.
我要是面试碰到这题,直接傻眼。。。。
l******2
发帖数: 41
40
来自主题: JobHunting版 - 问一道面试题目
Given an integer array, adjust each integers so that the difference of every
adjcent integers are not greater than a given number target.
If the array before adjustment is A, the array after adjustment is B, you
should minimize the sum of |A[i]-B[i]|
You can assume each number in the array is a positive integer and not
greater than 100
Given [1,4,2,3] and target=1, one of the solutions is [2,3,2,3], the
adjustment cost is 2 and it's minimal. Return 2.
j**y
发帖数: 462
41
不好意思 JD有点长 Sorry, No fresh pls. Seattle based. email to:
[email protected]
/* */
Walt Disney Parks and Resorts Online
Staff Software Engineer (IOS)
Responsibilities
Understanding WDPRO architectural vision and how it helps meet WDPRO
business objectives
Leading small to medium size teams to deliver and execute on a project
Analyzing user stories and participating in sprint planning, scrums, demos
and retrospectives
Accountable for uptime and high-availability for all solutions
Accou... 阅读全帖
J*****n
发帖数: 4859
42
来自主题: JobHunting版 - Need a Jr developer
Great C#.Net Developer position that is co-located with the Front Office
Securities business and is part of the global trading technology team. You
will have the opportunity to work on the real time trading platforms as well
as working closely with the traders to automate trading strategies. This
role is unique in that it is both Development and Ops focussed (on a roster)
and you will get the opportunity to work with trading teams in Asia Pac and
Europe. The desk is focussed on trading Equities ... 阅读全帖
c***r
发帖数: 1570
43
由于是朋友公司,具体细节不知情。请直接申请。
http://chc.tbe.taleo.net/chc02/ats/careers/requisition.jsp?org=
http://chc.tbe.taleo.net/chc02/ats/careers/requisition.jsp?org=
Software Developer I
HCR #15N20065141C
Pittsburgh, PA - HQ
JOB SUMMARY
The Software Developer is responsible for developing the postprocessing and
graphics capabilities in the current and next generation products in the
Workbench Mechanical suite.
ESSENTIAL FUNCTIONS
- Implement features for post processing and graphics visualization in the
Workbe... 阅读全帖
x******a
发帖数: 4
44
来自主题: JobHunting版 - 求大牛帮看看简历
XX XX
+1xxx-xxx-xxxx | [email protected]
/* */
Project Manager Trainee
PROFESSIONAL SUMMARY

Expert in: Project Management, Communication, Teamwork, and Learning Ability
An effective team player, with excellent verbal and written communication
skills, who is also able to ensure healthy communication flow in a dynamic
team environment. Skilled in negotiating partnerships and alliances with a
keen ability to capture opportunities and catapult new ventures.
CORE COMPETENCIES
Project Man... 阅读全帖
k****r
发帖数: 807
45
来自主题: JobHunting版 - 热乎乎的Z家面经
>第一轮面完就已跪。
this is onsite?
No. 1 question:
the diff of sum is minimized, right? you mean minimized positive or 0, right?
thanks,
W***n
发帖数: 11530
46
来自主题: JobHunting版 - Good mechanical & material engineers needed
Latest Advances in Internal Combustion Engines
Automakers continue to look to the internal combustion engine (ICE) and its
decades of reliable and resilient service when it comes to offering improved
fuel economy and longer engine life.
May 2014, By Stephane Babcock
Even with all the buzz that surrounds hybrids, hydrogen fuel cells, and the
numerous gaseous alternatives, OEMs are still betting on the benefits of the
constantly improving internal combustion engine (ICE). From its humble
beginning... 阅读全帖
r*******g
发帖数: 1335
47
来自主题: JobHunting版 - 面经加求建议
find kth minimal number in tournament tree
这个minimal number是第k名吗
看起来像toplogicalsort

发帖数: 1
48
You are given a list of tasks as an integer array, task_costs. Every i-th
element of task_costs represents a task and requires task_costs[i] seconds
to complete. All tasks listed in the array are independent of other tasks.
It is required to finish all the tasks independently and as soon as possible
. You are given a single worker robot to start taking the tasks and finish
them one at a time. However if you like, you can divide the worker robot in
two. Each resulting robot can then be further di... 阅读全帖
E*********g
发帖数: 185
49
【 以下文字转载自 Programming 讨论区 】
发信人: Eagleflying (惭愧), 信区: Programming
标 题: AI Programmer: Autonomously Creating Software Programs Using Genetic
Algorithms
发信站: BBS 未名空间站 (Sun Oct 1 00:36:21 2017, 美东)
码农终于开发出了上吊用的绳子
https://arxiv.org/abs/1709.05703
AI Programmer: Autonomously Creating Software Programs Using Genetic
Algorithms
Kory Becker, Justin Gottschlich
(Submitted on 17 Sep 2017)
In this paper, we present the first-of-its-kind machine learning (ML) system
, called AI Programmer, that can auto... 阅读全帖
B********1
发帖数: 5
50
来自主题: JobMarket版 - Hiring SAS Consultant / SAS Engineer
Title: SAS Engineer
Areas of focus: SAS, SQL, Communication, Analysis Experience
Location: San Jose, CA
Start: January 2012
===== Description of specific need =====
Client's Experiment Design and Analysis (EDA) team helps product teams to
design, conduct, and analyze experimental changes in product features. The
experiments consist of providing a randomly selected subset of client users
with experimental changes and comparing subsequent results with those of
other users. At the conclusion of an ... 阅读全帖
首页 上页 1 2 3 4 5 6 7 8 9 10 下页 末页 (共10页)