|
g***n
发帖数: 14250 | 2 drive-E，还有很大潜力啊
Volvo S60 Polestar TC1
Engine: 4-cylinder, 1595 cc, Drive–E Volvo
Drive: FWD
Power: 400 HP
Max rpm: 8500 rpm
Gearbox: 6-speed sequential
Suspension: MacPherson front and rear, adjustable Öhlins dampers
Brakes front: 4-piston caliper, 390mm ventilated discs
Brakes rear: 2-piston caliper, 280mm ventilated discs
Rims: 18″ with five-bolt pattern
Body: Steel and carbon fibre
Weight: 1100 kg |
|
|
c*****y
发帖数: 1028 | 4 本想买17年的但是发现17 的mpg只有23 所以打算买个16的， 这个车网上挂了25290，
大家觉得最好OTD 可以达到25000以内吗？ 多谢！
Engine
cc: 1984
Liters: 2.0
bore: 82.5
stroke: 92.8
compression ratio: 9.6 (comp ratio)
number of cylinders: 4
configuration: in-line
variable valve timing/camshaft: yes
number of valves per cylinder: 4
engine code: EA888 (code)
Power
measurement standard: SAE
Maximum power kW: 147 (kW)
Maximum power hp/PS: 200 (hp/PS)
rpm for maximum power: 5100 (rpm max hp)
maximum torque lb ft: 207 (max torq lb ft)
maximum torque Nm: ... 阅读全帖 |
|
b*******u
发帖数: 481 | 5 Now the company is saying that the 2.2-liter diesel will be offered here,
starting in the second half of 2017. Again, Mazda is providing no specs,
although in other markets the sequentially turbocharged Skyactiv-D makes as
much as 173 horsepower and 310 lb-ft of torque at 2000 rpm. Whether it will
be available with the six-speed stick or just the six-speed automatic also
remains to be seen. No fuel-economy estimates are available as of yet, with
Mazda saying only that the diesel-engine CX-5 woul... 阅读全帖 |
|
l*******g
发帖数: 27064 | 6 lol
使劲扯蛋，如果光共用平台那当然不算拉皮，就像lincoln和ford，平台共用，但是除
了最高配ford和最低配lincoln对应型号共用power train，其他都不一样，有明显的配
置差异
高配ford价格甚至比底配lincoln都高
就算同样的多连杆后悬挂，依然用料有差异，低端的用模压，高端用铸造铝
明显的不是纯拉皮
丰田lexus的垃圾是完全共用绝大部分主要配件，只有内皮和外皮有点差异，典型的纯
拉皮欺骗用户
高价垃圾
avolon本身和es一样，都是拉皮camry
还尼玛十几年前呢，就现在的
es 2017和camry v6 2017
发动机：3.5-Liter V6 DOHC 24-Valve Dual VVT-i; 268 hp @ 6200 rpm; 248 lb.-ft
. @ 4700 rpm
变速箱：Six-speed sequential-shift automatic Electronically Controlled
Transmission with intelligence (ECT-i)
后悬挂：Independent, dual-link ... 阅读全帖 |
|
f*******l
发帖数: 964 | 7 go老师，你这就是误导别人了。各州的政策不一样。加州的规定，标准车牌必须跟车走
，卖家不能保留。卖家只可以保留自定义的车牌。
What do I do with the license plates when I sell my car?
Most vehicles have sequentially issued "standard" license plates that remain
with the vehicle when ownership is transferred. If the vehicle has a
special interest or personalized license plate, these plates belong to the
plate owner, not the vehicle. Aas the seller you must decide if you want
to retain the license plate for use on another vehicle, or release your
interest in ... 阅读全帖 |
|
X***9
发帖数: 7385 | 8
刚才没看到题目，您说的按键换档我想您问的应该是本田odyssey或pilot
那么您放心，本田有智能模式，不用您自己手动切换降档
10年前本田就有grade logic control技术解决您的顾虑了
您选择的本田车行的销售人员没有给您解释清楚本田贵的原因是本公司的疏忽
再此本人向您表示歉意。
新款odyssey变速箱除了Grade Logic Control System还有Shift Hold Control和
Cornering G Shift Control
奥德赛自动变速器可以在两种不同的全自动模式下工作：D（或 "Drive”）模式是大多
数驾驶情况的理想选择，并且在需要时将燃油效率与平稳运行和响应功率相结合。 S（
“Sequential”）模式适用于更苛刻的驾驶，并且具有更强大的换档映射，以保持发动
机转速更高，从而实现更大的加速和拉动功率。
在D模式（针对正常驾驶进行了优化）时，变速器包含一个先进的档位逻辑控制系统，
换档保持控制和转角G换档控制 - 所有这些都减少了不必要的换档和抢档。结果是智能
传动操作，优化燃油效率，并将变速箱保持在合适的档位，用于驾驶条件，... 阅读全帖 |
|
|
w**********s
发帖数: 179 | 10 Sorry I cannot type in Chinese. I am helping a friend post this.
She has a 2003 Chevrolet Corvette 50th Anniversary Edition for sale. Below
are some information about the car.
(BLACK EXTERIOR and INTERIOR is a BLACK LEATHER TRIM SEATING) 5.7 liter 350
HP Sequential fuel injection V8 Engine / 346 cu. in.; Horsepower-350 @ 5600
rpm; Torque (lb-ft)-360 @ 4000 rpm;Transmission-4-speed electronically-
controlled; Wheelbase / Length-104.5 in. / 179.7 in.; Curb Weight-3246 lbs.;
Pounds Per Horsepower-9... 阅读全帖 |
|
D******s
发帖数: 61 | 11 2002 Nissan Sentra SE-R sedan 89650 miles 银色带天窗
Engine 4-Cyl, 2.5 Liter
Horsepower 165 @ 6000 RPM
Torque 175 @ 4000 RPM
Fuel Economy City 20/Hwy 25/Comb 22 MPG
Bore x Stroke 3.51 x 3.94
Compression Ratio 9.5
Fuel Type Gas
Fuel Induction Sequential Fuel Induction
Valve Train Dual Overhead Cam
Valves Per Cylinder 4
Total Number Valves 16
Transmission Automatic
Drivetrain FWD
KBB good condition 4116刀
换过电池，头灯，机油，平时local买菜和开芝加哥和indy，11年买的没开超过1万迈
图片可... 阅读全帖 |
|
r******d
发帖数: 4666 | 12 only sequential write is slower, other index all faster, look at the
comparison chart |
|
g*****t
发帖数: 195 | 13 还是老印的马工厉害. 是不是现在收gc, kc都要承担很大的风险啊.
A New Jersey couple is charged with stealing more than $300,000 in
merchandise by defrauding the Kohl's Cash rewards program.
Pavan Gurram and Vanaja Gattupalli, who are originally from India, are
charged with 10 counts of mail fraud. Each count carries a maximum penalty
of 20 years in prison if they are convicted.
Gattupalli has been released on bail, but Gurram remains behind bars in
Wisconsin. Gurram has offered to put up $100,000 in bail, but prosecutors
fr... 阅读全帖 |
|
l*******7
发帖数: 39 | 14 We would like to inform you that you are in our shortlist for the faculty
position to which you have applied. This position is not yet filled. We are
currently processing shortlisted applicants in sequential order of
suitability to the position, based on the evaluation of the staff search
committee. The search committee continues to maintain a strong impression of
you based on your track record and your research/teaching statements. We
apologize for the lengthy selection process and that we are |
|
o****y
发帖数: 790 | 15 Thanks, but I'll be greatly offended if people find me ONLY entertaining.
My disclosure was meant to warn readers that my suggested solutions
should be taken with a grain of salt. To avoid unnecessary misreadings,
I hereby state that my disclosure should NOT be interpreted
as a call-for-dates.
I propose the following sequential algorithmic procedure, which
is well known to be O(n) and scalable.
1. Wait until the fly lands on a horizontal surface.
2. Approach it very slowly, with one hand extende |
|
M****o
发帖数: 4860 | 16 【 以下文字转载自 JobHunting 讨论区 】
发信人: chump (chump), 信区: JobHunting
标 题: 又一牛人： 9个offer，12家公司，35场面试，从微软到谷歌，应届计算机毕业生的2012求职之路
发信站: BBS 未名空间站 (Fri Jan 11 21:59:21 2013, 美东)
转自
http://www.cnblogs.com/figure9/archive/2013/01/09/2853649.html
9个offer，12家公司，35场面试，从微软到谷歌，应届计算机毕业生的2012求职之路
1，简介
毕业答辩搞定，总算可以闲一段时间，把这段求职经历写出来，也作为之前三个半月的
求职的回顾。
首先说说我拿到的offer情况：
微软，3面->终面，搞定
百度，3面->终面，口头offer
搜狗，2面，悲剧
腾讯，1面，悲剧
布丁移动，3面，搞定
涂鸦游戏，3面，搞定
友盟，3面->CEO面，搞定
雅虎，4面->终面，搞定
微策略，2面，悲剧
人民搜索，3面->终面，搞定
人人，2面+终面+Special面，搞定
Google，7面，搞... 阅读全帖 |
|
q******g
发帖数: 390 | 17 https://www.fastlane.nsf.gov/a6/A6RC_THISWEEK.html
43. CAREER: Novel Approaches and Instrumentation for 21cm Cosmology
Experiments
Award#:1352519 Current Year Award Amount:$787,369 Cumulative Award Amount:$
787,369 Estimated Total Award Amount:$787,369
Original Start Date:Sep 01, 2014 Projected Duration:0 Months
PI: Parsons Institution:U of Cal Berkeley State:California District:13
44. CAREER: Discovering the Underpinnings of Statistical Language
Learning in Infants
Award#:1352443 Curren... 阅读全帖 |
|
L**********1
发帖数: 12 | 18 大家好，
真诚求paper review的机会! 给一些journal写了信但是都还没给什么机会，非常着急
，感激不尽！
Background: Statistics Ph.D.
Research Interests: Applied Statistics, Bayesian Statistics, Causal
Inference, Group Sequential Design, Missing Data, Observation Studies,
Reliability, Survival Analysis, Pharmaceutical Related Topics.
Email: L*************[email protected]
Many thanks!! |
|
L**********1
发帖数: 12 | 19 各位老师好~ 真诚求paper review的机会! 给一些journal写了信但是都还没给什么机
会，非常着急，感激不尽！
Background: Statistics Ph.D.
Research Interests: Applied Statistics, Bayesian Statistics, Causal
Inference, Group Sequential Design, Missing Data, Observation Studies,
Reliability, Survival Analysis, Pharmaceutical Related Topics.
Email: L*************[email protected]
Many thanks!! |
|
S***J
发帖数: 1210 | 20 云老师发了个贴说清华目前的找人标准，很多人不相信。特地调研了一下清华生命学院
最近回去的人的情况，如云老师所说，绝大多数都有2cns，如果只有一篇cns，那基本
上还有>2的子刊。这个不仅仅局限于胖老师经常说的结构生物学，而是所有方向都基本
如此。
当然这些新回去的绝大部分都是千青（有些不是的是因为回去那一年千青还没开始）。
网页上的Title有的是教授，有的是研究员，估计当时还没有统一。但校内一律都是副
教授，也就是相当于这边的AP。我还特地打听了一下，国内的TT制度好像没有Tenured
Associate这一档，清华5年考核通过了就是正经的full professor。
有些老师看不上国内的科研，我就仅列出两位回国后的publication，咱就不说颜宁等
这种Early T的个例了。说两个没太有名气的，还没有评上T的，各位老师可以参考一下
，看看自己有没有别人这么productive。
一. Guangshuo Ou （11年回国，千青）
Select item 25342559
1.CYLD mediates ciliogenesis in multiple organs b... 阅读全帖 |
|
l*******n
发帖数: 178 | 21 我想卖的物品:
Toshiba 256G SATA2 SSD 拆机硬盘
可接受的价格 (required):
480 + your label
物品新旧要求:
4
brand new.
邮寄方式要求:
YL
买卖双方谁承担邮寄损失(required if not code only):
default
付款方式说明:
BOA
其他补充说明:
从t400s 上拆下来的SSD
具体配置
Form Factor 1.8-inch Serial ATA-2
Capacity 256GB
Product Number THNS256GG8BA
Product Specification
1.8-inch Serial ATA-2 1
54.0(W) x 5.0(H) x78.5(D) mm
Mass 48g (Typ.)
Interface Serial ATA-2 (3Gbps5 )
Voltage 3.3V (1.8-inch type),
Reading speed Maximum speed 230MBps (sequential m |
|
c*****e
发帖数: 737 | 22 On the surface, China appears to be leading the world from recession to
recovery. After coming to a virtual standstill in late 2008—at least as
measured on a sequential quarter- to-quarter basis—Chinese economic growth
accelerated sharply in the spring of 2009.
A back-of-the envelope calculation suggests China may have accounted for as
much as two percentage points of annualized growth in inflation-adjusted
world output in the second quarter of 2009.
With contractions moderating elsewhere in the |
|
M****d
发帖数: 20 | 23 I'm from machine learning/data mining background
三个问题跟我的兴趣没有一点关系
1. Estimate the time cost of transfering 1M of data from one memory stick to
another.
- when the data in memory is sequentially stored;
- when the data in memory is stored in blocks;
- does the bus width matter here?
2. Design a data structure/class that has insert(p*), remove(p*), p* random()
functions. All functions must be implemented in costant time.
Is it possible to realize constant time with |
|
x***y
发帖数: 633 | 24 "do while" is a loop itself and if it's not allowed to use some loop command
, can you really realize "do while" with "if else" and some sequential stuff
? |
|
|
c****w
发帖数: 565 | 26 I totally agree with what you said. However, you did not answer my question.
As for development position in those software companies (Ansys, Simulia,etc
), is that enough for person only proficient in Fortran?
Here, I use "proficient", because I think most engineering graduates also
know how to do sequential programming in c++. But "proficient" in c++, means
totally different programming concept, OO. You need to know class, template
, virtual function, etc.
If you're at the development position |
|
H*M
发帖数: 1268 | 27 1. 一个公车站，有两路车，一路每5分钟一班，一路10分钟一班
你刚看到有辆车通过（不知道哪路），问，间隔下一辆车到来的时间的期望值是多少？
2. 招聘问题。 decide一个策略使得招到最牛的人的概率最大。
1. There is a single secretarial position to fill.
2. There are n applicants for the position, and the value of n is known.
3. The applicants can be ranked from best to worst with no ties.
4. The applicants are interviewed sequentially in a random order, with ea
ch order being equally likely.
5. After each interview, the applicant is accepted or rejected.
6. The decision to |
|
x***y
发帖数: 633 | 28 1. You can use LCS, backtracking and take the one with minimum sequence in B or
using the elements in A(assume A is fixed) as key of hash table, and then
hash elements in B(assume B varies a lot) with the index as the hash value,
and try all the indice in the sequential way to find the answer.( for
example, find the first index of h, then the next possbile index of e, and
go on, find a length and corresponding lower index and upper index of the
subsequence; then starting from next index of h, re |
|
y***m
发帖数: 7027 | 29 Write a function "function make_matrix($matrix)" that given a list of '
matrix' links them together sequentially in the order they are given, and
prints out its progress at each step. A matrix is a square split into
quadrants, where each quadrant has a number from 0 to 9. A matrix can
connect if at least two of its quadrants match quadrants on adjacent matrix,
but all adjacent quadrants have to match. matrix can be rotated, and the
inputs are always designed so there is only one place a matrix w |
|
t********1
发帖数: 266 | 30 non-CS guy's solution:
Given same length A, B python lists.
Steps:
1, turn A, B lists into associated arrays A1, B1, keys are the uniq numbers,
values are counts of the particular uniq numbers.
2, quicksort A1, B1 arrays' key space lists, so the KA1, KB1 arrays' keys
are in order.
3 compare the sorted keys sequentially (which are lists themselves), stop at:
3.1: the lengths of KA1, KB1 key lists differ.
3.2: At the same list position i, KA1[i], KB1[i] keys differ.
3.3, at the same list pos |
|
i***0
发帖数: 8469 | 31 You have a test application that is issuing asynchronous un-buffered
sequential writes to a 15k RPM disk. The test application is able to get 150
IOPS for an IO size of 8KB. What is the throughput for the writes being
issued by this test application?
In 30 words, please describe the boot process of a Windows-based PC. |
|
l********s
发帖数: 30 | 32 刚刚放下电话，很新鲜的面经~
一印度同学面的，之前一直在担心印度口音，没想到这位同学英语很好，几乎没有什么
口音，听起来很舒服。整个过程才35分钟，基本上很smooth，除了开始时他把我的名字
念得不像样以至于我以为是wrong number之外。还有一个奇怪的事，他最后没让我问问
题，就说 thanks for your time. 88~ 不知道这是不是不吉之兆。。。大伙有没有碰
到这种情况的？
1. talk about his team and amazon
2. introduce yourself
3. talk about my research
4. what's linked list? how to insert a node into middle?
ans: a data structure only sequential access to its elements allowed. for
each node, it has data field and next pointer field. in general, the
application h |
|
i**********e
发帖数: 1145 | 33 这也算是一个方法。
如果要 reverse 的话，那还不如数组往前挪一位快（hardware dependable，由于往前
挪一位是 sequential access，读/写 速度较快）
一些常见面试题的答案与总结 -
http://www.ihas1337code.com |
|
y*********e
发帖数: 518 | 34 比如今天问的问题：
CPU Register/Cache
Cache miss
What is the bottleneck of RAM (transferring data to CPU cache?)?
Disk random seek/sequential seek/bottleneck
Garbage collection/how to design it/Generations/Finalize/destructor
Data Structures/how they work?/Hashtable/Bintree/Heap
Overhead of Hashtable/How to design hashtable to minimize overhead
Java String overhead/
MapReduce/Parallel processing/bottleneck |
|
m********0
发帖数: 2717 | 35 easy.
buy low sell high sequentially
if up, up, hold in the middle.
down-> down hold,
other wise,
from long to short or short to long.
if max profit is sum(abs(p_i+1-p_i)){i,0,6} |
|
g******n
发帖数: 339 | 36 I am on the same boat. There are two sequential steps for a transfer:
1>LCA(labor condition applicatoin)
2>H1b Transfer
The first step takes about a week or so from online submission to approval;
After LCA is certified, the you can submit H1b transfer. You can start
working for the new employer immediately after they submit the transfer by
law.
I would say 4 weeks seems to be sufficient. |
|
f********y
发帖数: 278 | 37 The answer is right, but the logic is wrong, as you can only throw the dice
sequentially.
*
*
*
* |
|
t****a
发帖数: 1212 | 38 Nothing wrong.
The sequential have nothing to do with the strategy after the first round.
Only the distribution of Max(x,y) does matter with our choice.
dice |
|
p********7
发帖数: 549 | 39 1.开放式问题,有些网站每天只允许有限次访问,怎么抓取网页使得索引尽量全面和新鲜
？？
2.在C++文件中只declare class A, 但不以任何方式define class A, 是做什么用
3. Estimate the time cost of transfering 1M of data from one memory stick to
another.
- when the data in memory is sequentially stored; - when the
data in memory is stored in blocks; - does the bus width matter
here?
4.How to transform a unbalanced tree into balanced tree?
第2个题我想的是保留A的名字，以后再定义
第四个题我想的是先算每个节点的blance factor然后再调整，具体怎么调整就不知道了。
第四个题还想到一个办法是转成双链表，然后再转balanced tre |
|
A*********r
发帖数: 564 | 40 唉，我挺怕这种题的，希望只是电面题，on-site的时候不要被问到。。
对于第三题，不明白究竟是要考察什么，如果给出读写的rate, 然后加起来不就是么
estimate time？
如果是比较sequentially stored和stored in blocks的话，前者读起来会快一点的。
。另外对于memory stick, 号称是可以直接读写不用进入memory的，所以我猜跟bus
width没关系。。
在现实生活中，传送1M的数据时间大概不需要一秒钟吧。。
to
the |
|
s*****n
发帖数: 5488 | 41 linked list和array也就是第一轮店面的基本问题吧。这里的答案很多多余而且是错的。
如果linked list是动态分配内存，overhead相当高。小的malloc代价是64B above
.大的malloc是128b above.
grow:array也能realloc，除非你生成在stack上，否则也可以在地址空间无限扩展。
箭头那个，maybe for sequential scan, 但是提高相当有限度。
that |
|
l********n
发帖数: 54 | 42 最近开始准备OO design questions, 这两天学习了一下design pattern, 用Amazon了
经典的Hotel Reservation OO
Design的问题练习了一下。希望能和版上各位高手交流一下。
(1) 问题1: 这个system应该就那些类
在version 1设计，我定义了如下类Room, SingleRoom, DoubleRoom, SuitRoom,
Hotel, Customer,
Reservation, Date。 因为感觉这个design,主要就是如何设计check different types
of rooms' availability和make
reservation。
(2) 问题2: 这些类的关系应该如何
其实就是"has-a" and "is-a" 的设计，也就是用inheritance或是composition
。根据直觉定了了如下的UML图
以上两步估计大部分人都能得道，不过如何才能打动interviewer呢？怎么才能提高这
个设计呢？
我想可以从两各方面入手：（1）program wit... 阅读全帖 |
|
o******e
发帖数: 81 | 43 btw这个是俺的马甲
今天第一轮电面，我是experienced的不是fresh
感觉不怎么好，就问了一道题，太多detail了
电话来迟了8分钟，加拿大人。先问了问最challenge/favorite的project，说了几分钟
后他说我知道了，考你个题吧
很简单，Unicode的charactor array/string，找出现次数最多的char
我给了3个解，基本没有用任何考虑时间
1. double loop, O(n^2)
2. hash，他问我worse case，我一不留神说了O(n)，忘了hash的陷阱。他说恩perfect
hashing是不存在的，blablabla，我说我完全同意。我说如果space足够的话效率比较
好的char hashing是不太难的，他说anyway那也是O(n)，好吧。。
3. int[65536]的array，因为是unicode，我跟他确认了一下是2 bytes。我一开始说复
杂度的时候原来的solution是iterate string一遍，然后iterator count的array一遍
，突然想到可以用一个temp varia... 阅读全帖 |
|
A*****i
发帖数: 3587 | 44 太扯了，碰见个小印女，口音巨重听不懂，我说的她也不理解。
估计悬了
1.判断一个单链表是否是Palindrome。
2.判断一个数组中的数是否是sequential。
第一个我除了reverse链表之后再用俩指针开始比较不知道还有啥好办法。
第二个先排序然后再用后一个元素减前一个元素，如果差都是1就对，否则就错，结果
她问我不用排序还
能怎么做……只好说hash table，结果她还没听懂我的hash table结构就说时间到了得
挂电话了。
就怕碰见小印……结果……唉…… |
|
F**r
发帖数: 84 | 45 EAC1190188075 Card/ Document Production
Does VSC deal with OPT applications sequentially according to the receipt
number, or just randomlly? |
|
s**x
发帖数: 405 | 46 This is exactly equivalent to finding loop in a singly linked list.
The singly linked list is defined with entry A[0] of the input array as the
HEAD node, and the numeric value of each array element as the array index
for the NEXT node. Since every array element A[i] is between 1..(n-1), all
the nodes have valid NEXT node pointers. Thus by sequentially traversing the
list you will encounter a loop.
Just use two iterators I1 and I2, initialized to A[0] and A[A[0]]. Then
while (I1 != I2), let I1 =... 阅读全帖 |
|
s***h
发帖数: 662 | 47
Usually it is, but, not really when your array is 1000 times bigger than
memory. if you use quick select, then you will sometimes need to read the
chunk that you read before, that will cause disk seeking and be expensive.
On the other hand, his heap select only needs to read the whole array
sequentially, this is actually the highest efficiency for disk access.
what do you think? |
|
b*******y
发帖数: 232 | 48 amazon电面是sequential的么？
目前只约了一次电面，据说有2次。是说第一次不行就没第二次？
好像其他公司的两次面试都是parellel的 |
|
q****x
发帖数: 7404 | 49 algorithm: interval tree
coding: sort, binary search, sequential search. |
|
q****x
发帖数: 7404 | 50 algorithm: interval tree
coding: sort, binary search, sequential search. |
|
