i*****a
发帖数: 572 | 1 什么是vtc？我已经查过了，Honda crv的powertrain的warranty不包括starter。
What are Covered under the Honda Powertrain Warranty?
Engine - cylinder block and head and all internal parts, timing gears and
gaskets, timing chain/belt and cover, flywheel, valve covers, oil pan and
pump, intake and exhaust manifolds, engine mounts, engine/powertrain control
module, water pump, fuel pump as well as and seals and gaskets.
Transmission and Transaxle – case and all internal parts, torque converter,
transfer case and all inte... 阅读全帖 |
|
Y****a
发帖数: 17170 | 2
除了2009刚出的时候，至少从2013起所有CVT的都是前60 后40.
http://www.subaru-global.com/tec_awd.html
Active torque split AWD
An AWD system developed exclusively for 4-speed automatic transmission, E-
4AT (with manual mode) and Lineartronic models to maximise the reliable
driving performance of AWD models under any driving conditions. The
Lineartronic CVT (Continuous Variable Transmission) uses a chain instead of
a belt—allowing a greater span of overall ratios for improved performance
and efficiency as well as a fas... 阅读全帖 |
|
y******y
发帖数: 207 | 3 Supercharger 半小时充满 80%，是constant current mode
80%以后是constant voltage mode, 充电速度会慢些 |
|
p*******m
发帖数: 20761 | 4 Lexus software update gives new meaning to 'car crash'
Now that cars are as buggy as computers, we're in trouble.
Violet Blue , @violetblue
19h ago in Transportation
7
Comments
Shares
Illustration by D. Thomas Magee
Last year, headlines made everyone fearful of hackers taking over cars on
the freeway. Turns out the real menace to owners of connected cars are the
loopy manufacturers themselves.
Toyota had to suck it up this week and admit to Lexus owners, who were going
nuts on Facebook and Tw... 阅读全帖 |
|
h********e
发帖数: 1130 | 5 Sorry can't type Chinese in this computer.
Here is recording link (noise start at 1:25) https://soundcloud.com/hiac-
banks/noise-1-25
Last year I got into an accident, and my primary car is total, so I started
to drive this backup car, a 2002 Honda civic. life is a little bit messy
after the accident, spent a lot of time on the medical/billing, and paid
little attention to this old car until today.
since about 4 months ago, I notice the car is slow to start. Every day I
drove about 0.25 mile in ... 阅读全帖 |
|
q*****g
发帖数: 181 | 6 For new and pre-owned car. 有懂的牛人科普一下，lifetime 免费修list上的所有
东西？sounds too good. "Only factory scheduled maintenance required " 是什么
意思？是我按手册Maintenance 后出毛病他们才管？还是只有他们主动scheduled类似
recall的才管修？有deductible 吗？
Covered Components
Same as the Factory Powertrain Warranty
ENGINE
All Internal Lubricated Parts
Cylinder Heads
Flywheel
Manifold (Exhaust Intake)
Oil Pan
Oil Pump
Seals and Gaskets
Thermostat
Thermostat Housing
Timing Chain Cover
Timing Chain (Gears or Belt)
Turbo Charger Factory Installed
Supe... 阅读全帖 |
|
M****o
发帖数: 4860 | 7 【 以下文字转载自 Mathematics 讨论区 】
发信人: soze (Dominique Bretodeau), 信区: Mathematics
标 题: Leaving Science, by Leon Avery. (转载)
发信站: BBS 未名空间站 (Wed Feb 12 12:52:44 2014, 美东)
"My immediate plans are to go back to school and get a
degree in Mathematics." -什么叫做一错再错，哈哈
发信人: demoner (New York State of Mind), 信区: Biology
标 题: Leaving Science, by Leon Avery.
发信站: BBS 未名空间站 (Tue Feb 11 00:50:43 2014, 美东)
Leaving Science
February 8, 2014
Why I’m leaving
I have decided, after 40 years as a lab scientist and 24 y... 阅读全帖 |
|
H****y
发帖数: 2992 | 8 多谢大家鼓励！终于写完了。希望共同探讨。
On Scientific Writing
“The ancient historians gave us delightful fiction in the form of fact; the
modern novelist presents us with dull facts under the guise of fiction.” (
Oscar Wilde)
1. Adopt the Right Attitude
Just like everything else, before we start, we have to believe what we do
matters. If we can’t persuade ourselves, how are we going to persuade
others? Writing scientific essays should not be considered as an obligation,
or a pain we go through t... 阅读全帖 |
|
H****y
发帖数: 2992 | 9 自从发表了关于如何写paper的感想，每天都有不少人来我的博客，深受鼓舞。想再写
一篇和大家共同探讨。
On Public Speaking
If you ask me to offer some advice to all the WSNs, I would tell them: to me
, the biggest problem with you lot is not your sloppy clothes, or untidy
hair, or your awkward English. Not even the stinky smell. (Ugh!) The first
thing you need to learn is stand straight. Don’t droop your shoulders or
tilt your head or bend a leg. If you don’t believe me, go watch a video of
any political leader in the world. ... 阅读全帖 |
|
s********n
发帖数: 4346 | 10 I am not so sure how "free" I feel. I work 10 hours a day and constantly
feel not finishing what I should have done. Constantly feel worse than
others.
i admire people who can finish 9-5job and have a nice weekend with family. |
|
H****y
发帖数: 2992 | 11 出去开会。会还没开完，就搞了这么个东西出来。职业病呀！
On Poster Presentation
“I think the first duty of all art, …, is to entertain. That is to say, to
hold interest. No matter how worthy the message of something, if it's dull,
you're just not communicating. “ (Poul Anderson)
Poster presentation may sometimes bear an “inferior” look compared with
oral presentation. Yes, you don’t get that collective attention from dozens
or hundreds of people in a quiet room. You can’t play soun... 阅读全帖 |
|
M*P
发帖数: 6456 | 12 Monday, March 23, 2015
Responding to Rejection
Dear XXX，
Maybe it's just the rhythms of the semester, but many of you seem to be down
in the dumps. I've been hearing from lots of people who are frustrated by
cranky colleagues' comments, demoralized by rejected manuscripts and grant
proposals, and tired of students' unending complaints. With so much
negativity in our work environments, I'm going to focus this week on Common
Mistake #11: Internalizing Rejection and Negativity.
Academic Life is FUL... 阅读全帖 |
|
发帖数: 1 | 13 回来了。刚刚在网上搜到的前几年入职的教授对诺丁汉马来的评价
标题："Malaysia Campus: Do NOT work here (especially if you are an expat)"
Pros
None, other than the fact that you can put "University of Nottingham" on
your CV while looking for a better job elsewhere. I like my immediate
department, but I have heard the horror stories of how other departments are
managed.
Cons
The administration is a nightmare to deal with – especially HR, which holds
a lot of mismanaged power over employees. Faculty haven't been paid on time
, benef... 阅读全帖 |
|
D**********s
发帖数: 3139 | 14 音量控制对音质的影响，以前有一篇note写得不错，我找了半天才找到，其实还有用变
压器的方法，不过dac这块最保真的方法就是保持位深和标准输出电平，音量控制交给
前级和功放去管就好了，终究绕不过模拟放大这一关的。
Volume Control Technologies
Newsletter Edition:
July 2009 Issue
With the introduction of Benchmark’s HDR-VC™ (High Dynamic Range
Volume Control), many audio enthusiasts are taking another look at volume
control methods. What are the differences between the different volume
control topologies? Is one sonically superior, and why?
The important qualities to consider with respect to volum... 阅读全帖 |
|
a*****n
发帖数: 5158 | 15 Q4 Financial Highlights
Revenues Google reported revenues of $8.44 billion in the fourth
quarter of 2010, representing a 26% increase over fourth quarter 2009
revenues of $6.67 billion. Google reports its revenues, consistent
with GAAP, on a gross basis without deducting TAC.
Google Sites Revenues - Google-owned sites generated revenues of $5.67
billion, or 67% of total revenues, in the fourth quarter of 2010. This
represents a 28% increase over fourth quarter 2009 revenues of $4.42
billion.
Goo... 阅读全帖 |
|
s********n
发帖数: 1962 | 16 这是中国打开市场和经济腾飞的必然后果。
关系是这样的：不过不想通货膨胀（对内贬值），就需要更多对外升值。如果不想对外
升值，就必须承受更大的通货膨胀。没有其他选择。
如果我还说得不够明白：假设通货膨胀幅度是 A，对外升值幅度是 B，那么
A + B = constant。
这个 constant 基本取决于中国经济相对于美国的发展速度和美国的货币政策（我这里
假设你说的升值是针对美元的，因为 RMB 对其它大部分国家的货币都还是在贬值。）
注意是美国的货币政策，不是中国能控制的。
而中国在 A 和 B 之间如何选择是一个取舍的问题。中国在过去几年更多的选择维持
汇率低位，所以 B 小，那 A 就必然大，所以通货膨胀就严重。温家宝如果想控制
通货膨胀，相让 A 小，那么 B 就必须变大，也就是说 RMB 必须加速升值。 |
|
r****m
发帖数: 1204 | 17 Let me be direct with you - I have sold IUL in the past, I know it perfectly
well and I regret my past behavior.
There are two common OPTIONs - constant DB and variable DB. As I explained
in my post clearly - NO agent will sell constant DB because its illustration
will look ugly (very very expensive).
All my discussion has been focusing on the variable DB (which as CV grows,
it will decline). That's why IUL's illustration will look pretty good when
an agent shows to a prospect - great CV buil... 阅读全帖 |
|
r****m
发帖数: 1204 | 18 Let me be direct with you - I have sold IUL in the past, I know it perfectly
well and I regret my past behavior.
There are two common OPTIONs - constant DB and variable DB. As I explained
in my post clearly - NO agent will sell constant DB because its illustration
will look ugly (very very expensive).
All my discussion has been focusing on the variable DB (which as CV grows,
it will decline). That's why IUL's illustration will look pretty good when
an agent shows to a prospect - great CV buil... 阅读全帖 |
|
j*x
发帖数: 302 | 19 有一个超长Array，例如l[]="abc123xyz",和一个短Pattern，例如s[5]="c123x".要求
在Constant Time内知道l是否含有s.
Interviewer提示要用一种Data Structure，我觉得l怎么也要Scan一遍。不太可能在
Constant Time内解决问题。想知道高人的想法。 |
|
t********e
发帖数: 25 | 20 If you're familiar with the ? operator x ? y : z
you want to implement that in a function: int cond(int x, int y, int z);
using only ~, !, ^, &, +, |, <<, >> no if statements, or loops or anything
else, just those operators, and the function should correctly return y or
z based on the value of x. You may use constants, but only 8 bit
constants. You can cast all you want. You're not supposed to use extra
variables, but in the end, it won't really matter, using vars just makes
things cleaner. You |
|
S**Y
发帖数: 136 | 21 Given a constant number of priorities implement a priority queue with O(1) e
nqueue and dequeue implementations.
I can not think of a way doing this...O(1) enque and deque..
even with a constant number of prioritties..
Any ideas? |
|
g*******y
发帖数: 1930 | 22 就是个脑筋急转弯或者文字游戏吧。。。
题目说constant number of priorities
你就假设这个constant number = 2，i.e.，只有两种priorities。。。 |
|
H*X
发帖数: 281 | 23 我不明白这道题, 为什么不可以当成普通的算法做, 一个integer的长度是固定的, 如
果fetch一个bit是constant,那么比如说一个32bits的integer,我把每个bits都fetch一
边也是constant,那样只要针对每个integer,把bit都读出来,加一起, 就得到这个
integer的值了,这就和把所有a[i]加一起然后对比sum的算法一样了
career cup的解法是算column sum,运算的时间是一样的,也都是要吧所有的bit加一起
啊 |
|
|
a***9
发帖数: 364 | 25 lz的做法只用到constant space, 扫描一次就够了,
如果统计每个数出现的次数 就不是constant space了 |
|
R*******s
发帖数: 136 | 26 不太确定对不对啊，取很多 （x,y)，画在二维平面内，感觉就是一个而为高斯分布。y
/x=k=tan(theta). 很明显，对角度的概率密度是个常数f(theta)~constant. 然后有一
个公式可以从f(theta)转到f(k)，好像是这个形式f(theta)*d(theta)=f(k)*dk, 然后f
(k)=constant*d(theta)/dk,这里theta=atan(k).这里面没有考虑角度在第二和第三象
限，但是应该差不多就这样子了 |
|
x***y
发帖数: 633 | 27 First of all, find Longest Common extension of sequence(which uses matching
statistics in suffix tree and constant time LCA to find length of longest
substring that start from any positions at 2 string in constant time after
linear preprocsing)
2nd, find all maximal palindromes (which means that if A[i:j] is palindrome,
then A[i-1:j+1] can not be palindrome) in linear time with the help of
suffix tree and Longest Common extension.
3rd, find the segments in the original sequnce that satisfes the ... 阅读全帖 |
|
i**********e
发帖数: 1145 | 28 void foo(char** a){
*a = "hello world";
}
int main(){
char* c;
foo(&c);
printf("%s",c);
return 0;
}
这个程序有两个错误。
1) *a = "hello world";
This syntax is incorrect. The only exception is during intialization of a C-
style string constant like this: char *a = "hello world"; Note that this is a C-style string constant, if you try to modify the string, the result is undefined.
In this case, you should use strcpy(a, "hello world");
2) c is a pointer to a char. Since it is not initiali... 阅读全帖 |
|
w*****x
发帖数: 374 | 29 来自主题: JobHunting版 - fb 面经
忘了说明一个要求是constant memory. counting sort不是constant memory, 因为
input
是array, 不是linked list. 我来把原题更新一下. |
|
i**********e
发帖数: 1145 | 30 Sorry, I've deleted some of my previous posts to avoid confusion. kongbua is right, this problem actually does not require hash table.
A single priority queue is sufficient. Instead of pushing the array's value
into the queue, push the array's index into the queue. Apply the queue's
ordering that is based on the array's value, not its index. The average
complexity of this method is k*(N-W) lg W. Is this O(N) or O(N lg W)? I
think this is O(N), since W <= N, lg W is pretty significant compared to... 阅读全帖 |
|
t**d
发帖数: 352 | 31 Design a data structure for a text editor. require better than linear for
both line search and insert a new line.
for example, you can use String[] to store lines in a page. then search for
a particular line is constant time, but add a new line is linear.
you can chose to use LinkedList, but now insert is constant time while
search is linear. |
|
j*****u
发帖数: 1133 | 32 "for example, you can use String[] to store lines in a page. then search for
a particular line is constant time"
why this is constant not liner?
You could use a LinkedList or incremental array (e.g. List) + an
index like hash table or tree that provides better search than liner |
|
a******u
发帖数: 239 | 33 Review about Collabera Inc.: Previously known as GCI from myvisajobs is
attached.
How to determinate if it is ICC? The HR was nice. I searched the company's website but could not find industrial information for example, products or patents.
Any suggestion? Thanks.
- Secure company - - Pavan - 6/8/2009 1:02:45 PM
As i H1B holder i feel Collabera is bit secure in recession compare to other
consultancies i came over.I have been working for past 1 year with
collabera,I have not faced any issues with... 阅读全帖 |
|
j********x
发帖数: 2330 | 34 constant means extra space
...
in your definition, there cannot be any constant space algorithm... |
|
a********m
发帖数: 15480 | 35 用bool flags[100]算不算constant space?
constant |
|
f****4
发帖数: 1359 | 36 这个方法好
if the (number of 0) / (number of array) is a constant level, it can be
solved by O(n)么？
是不是你这里假设如果 (number of 0) = (length of array)/k , k>=1是constant
value？
如果前面的假设理解对的话，(number of 0) / (length of array) -> 0的话还是O(n^
2)?
考虑数组 2n+1长度
n个大于零的数在前 0 n个小于零的数在后面
每次只能移动1个大于零的数到数组后部，需要移动n个小于零的数
O
do |
|
l***i
发帖数: 1309 | 37 Although in practice O(n)-median algorithm carries a large constant so will
likely defeat the small constant advantage of quick-sort compared to other O
(nlogn) sorting algorithms. |
|
t*******i
发帖数: 4960 | 38 攒点人品，回忆几道题
不用临时变量swap two int,用的是 ^ 操作
怎么同时往ｃｏｎｓｏｌｅ和文件输出
函数的指针（类的函数）
constant pointer to constant value
memset
memcmp
func(p++)的结果,考的是传过去的值是 p 还是 p + 1
base class 只有一个带参数的ctor，derived class该怎么办
用什么函数把time_t变成字符串
std::remove_if用法
变量名 = new (...);
if (!变量名)
call a function； 我的答案是这个function永远不会被调用
bind2nd 出现了好几次，从来没用过的。
做题的感觉是脑子被驴踢了。 |
|
v***a
发帖数: 365 | 39 来自主题: JobHunting版 - 问一道题目 或许可以这样：
构造 Voronoi Diagram, O(NLogN) 可以构造出来
Voronoi 最多有 3N 条边
求每个点最近的点，只需要检查每条 voronoi的边，O(2 * 3N )
求每个点最近的2个点，除了检查每条边，还要检查，离他最近点的所有voronoi的边，
O(? * 3N), ? is constant,
求最近的3个点，还要检查第二近的点的所有边，以及第一近的点的所有voronnoi的边
，可以证明肯定在这些边里，O(? * 3N), ? is also constant.
Anyway, O(NLogN）
请问你面的什么公司？
这种计算几何的题目，估计 G/FB 也不会考的吧，做地图的公司？
如果还有position的话，也想投一下试试，
投了无数公司，现在一个面试都没有……杯具啊 |
|
F****n
发帖数: 3271 | 40 上面的答案基本上都是过时的over-engineering.
Google时代的答案是这样的:
Person {
String typeOfDisability;
// or int typeOfDisability;
}
// defines type of disability as constants.
// regards null or define a special constant as normal;
// you can just set or get the value, no need for "cure methods"
为啥要这样:
1. Simple, minimalist;
2. Open and dynamic, not bound to a pre-defined type. |
|
S**I
发帖数: 15689 | 41 ☆─────────────────────────────────────☆
gzou (gzou) 于 (Thu May 12 02:26:35 2011, 美东) 提到:
马上就要G on site了，
求祝福。
下面是从本版收集到的Google的试题，便于大家查询。
申明：有的附带有解释说明的，也来自于本版或者网络，大家自己看， 不保证真确
http://www.mitbbs.com/article_t1/JobHunting/31847453_0_1.html
本人ECE fresh PhD，背景是电路/EDA，跟G业务基本没什么关系
同学内部推荐的，很简单的一次电面就给了onsite
题都不难，但是自己没把握好机会，出了一些小bug。
总的感觉，出错就是硬伤，宁可从最简单的算法写起，也不能出错。
电面：
1，Skip list， http://en.wikipedia.org/wiki/Skip_list
写code实现struct skip_list * find(struct skip_list *head, int value)
2，sorted array... 阅读全帖 |
|
S**I
发帖数: 15689 | 42 ☆─────────────────────────────────────☆
gzou (gzou) 于 (Thu May 12 02:26:35 2011, 美东) 提到:
马上就要G on site了，
求祝福。
下面是从本版收集到的Google的试题，便于大家查询。
申明：有的附带有解释说明的，也来自于本版或者网络，大家自己看， 不保证真确
http://www.mitbbs.com/article_t1/JobHunting/31847453_0_1.html
本人ECE fresh PhD，背景是电路/EDA，跟G业务基本没什么关系
同学内部推荐的，很简单的一次电面就给了onsite
题都不难，但是自己没把握好机会，出了一些小bug。
总的感觉，出错就是硬伤，宁可从最简单的算法写起，也不能出错。
电面：
1，Skip list， http://en.wikipedia.org/wiki/Skip_list
写code实现struct skip_list * find(struct skip_list *head, int value)
2，sorted array... 阅读全帖 |
|
H****s
发帖数: 247 | 43 This function returns a constant integer reference, this member function is
a constant function that won't change any member variables of the associated
class. |
|
r********d
发帖数: 7742 | 44 每种sort都有自己的优势和劣势，它们各自都有存在的道理。
quicksort有最好的实践效率。同时是in-place。配上random pivot/shuffle，median-
of-K 和 少量元素转insertion sort是最实用的排序方法。O(n^2)复杂度是极其小概率
事件，一般不会发生。同时因为其对硬件cache的应用效率较高，实践中Quicksort很难
被beat, 因为cache的访问速度比内存寻址快两个数量级。
Mergesort的优势是stable以及在external sort中的使用. 理论分析时候的也会用到
worstcase n(log(n))。同时基本的merge想法和变形，不需要random access, 常常用
在很多其他问题的解决之中。比如说merge lists。但是megersort的constant factor
比较大，是quicksort的好几倍。一般比Quicksort慢。
Heapsort因为在时间上和空间上都是最优，在很多论文只要涉及到sort都会用它做理论
分析。constant factor还不错，比merge sort... 阅读全帖 |
|
L*********3
发帖数: 2 | 45 Leading company in industry. Seattle area. Support H1B.
We are looking for highly motivated Java engineer, dev and tester,
interested in designing and implementing our next generation solution,
leveraging grid, cloud, and machine-learning technologies. The new solution
must provide accurate pricing information for millions of products across
multiple data centers around the world in milliseconds. It also needs to
provide the highest levels of availability, speed, monitoring and be able to
grow i... 阅读全帖 |
|
c*****a
发帖数: 808 | 46 char[256] set + 2个指针
检查isAnagram用constant time 256，就是O(1)
总共就是O(n) time, O(1) space， 256space是constant...
public boolean isAnagram(char[]s1,char[]s2){
int i=0;
for(char c:s1)
if(c!=s2[i++]) return false;
return true;
}
public boolean checkAna(String s1,String s2){
if(s1==null || s2==null)return false;
if(s2.length()==0) return true;
if(s1.length()
char[] set1 = new char[256];
char[] set2 = new char[256];
for(int i=0;i阅读全帖 |
|
j*****y
发帖数: 1071 | 47 如果不是 constant space, 用 queue 就很漂亮。
题目里有 constant space 的要求 |
|
s********x
发帖数: 914 | 48 哦，当然不是。
偶最开始没看到要handle duplicate，后来才意识到。现在再想想既然这样要sort还不
如merge sort，呵呵。
这题确实说明要考虑constant time， 那个hashtable和autoboxing都是make constant
time worse的。所以overrall 谁更快还不一定，let alone space。 |
|
|
p*****3
发帖数: 488 | 50 来自主题: JobHunting版 - 周末上道题 给一个很大的maxHeap, size n, 数组形式表达，array A
给一个k+constant的数组 Array B，constant<< k << n
求kth max in maxHeap，不能改变maxHeap (Array A只读) |
|
