b**********0
发帖数: 53 | 1 Hi,
Besides seeking help from friends in China, I wonder if anyone has good
strategies in finding good students in China for Ph.D. study in US? For
instance, is there any good website via which we can announce Ph.D.
positions? I am not in a highly-ranked research university, and the basic
pool of student applicants are not strong, thus I have to actively pursue
good students. |
|
hr
发帖数: 247 | 2 very important. Talk to your advisor and find out how supportive he is. |
|
c***5
发帖数: 34 | 3 Thanks for the reply. If I could find a letter from the professor who has
joint lab meeting with us, could this help? Maybe I have to talk with my
current PI first. |
|
H***N
发帖数: 373 | 4 香港各个大学都在最近几年转成美式的TENURE制了。 以前在英式大锅饭系统下忽略了
PUBLICATION的大陆同胞们成了苦主了： 在港人把持的系统里， 只有任人鱼肉的份了
。
在一年的时间里， 跳槽开始了：两位同事跳到别的香港大学拉开了跳槽的序幕。 接
着一位跳到韩国， 后来一位跳到加拿大， 最近一位又决定去悉尼， 今天一位同事
在午餐中透露打算： 辞职回大陆开个零售店（他太太已经开了三间）， 拟将手头上
的博士生委托给我。
闻之沧然泪下：曾经大陆同事人声鼎沸的系如今走得七零八落。
Ｌife will find its way out. 衷心祝愿他们找到更加幸福的生活。 |
|
c**********w
发帖数: 1746 | 5 we found an error with a high-impact journal paper. the "exciting finding"
is but a mathematical coincidence. Assuming we are right, can this be
published in that same high-impact journal? (PNAS) |
|
x****1
发帖数: 1410 | 6 I found a good deal in craigslist.com, but I doubt the guy is the real owner.
Is there any website I can find out it?
Thanks a lot. |
|
y*******3
发帖数: 659 | 7 you can go to the county clerk's office and find out that way.. |
|
d**i
发帖数: 4 | 8 Can someone help me on this: Where I can find the Ambico Tripod quick
release Plate V-0551 ? Price around ? Thank you. |
|
C****y
发帖数: 115 | 9 I am pretty new here and just read the JHQ.
then I try on the website
http://www.onlinegiftrewards.com
I find all those link.
I will donate all the baozi i got because It belongs to the preious people
who wrote the article in JHQ |
|
I**********h
发帖数: 37 | 10 where can I find G/T materials?
please help me. I am in St. Louis now.
thank you! |
|
r*******g
发帖数: 461 | 11 前后遇到好几次了,都是认识不久问得..:"How did you find out Prof XXXX or 某大
学......?"
请问大家一般是怎么回答的. |
|
s***k
发帖数: 256 | 12 I have a pair of HD 497. Excellent sound. But ear pads are deteriorating.
Where can I find the replacement ear pad? TIA |
|
y******n
发帖数: 1 | 13 This two bedroom apartment is at 381 Western Ave., Cambridge, Boston. It is a
Harvard affiliated housing, ten minutes walk to Harvard square. The current
tenant is a Harvard graduate student, who wants to find a roommate. The
monthly rent is 676, utilities not included. The lease will be signed with
Harvard housing office. The apartment is on the second floor, newly furnished,
with plenty of sunshine and space. To rent it you should be a Harvard
affiliate. If interested, please email: inchchao@h |
|
l********e
发帖数: 636 | 14 I will move to newyork around middle of feb. now I want to find a girl (lady
) and look for a nice two-bedroom together. I hope you are reponsible, nice
and neat. if anyone is intrested, pleasen drop a mail in my mit account,
thanks ! |
|
l****d
发帖数: 1 | 15 I just rent a 2 bedroom/2 bathroom apartment in Crossing On Kirby. It's 844
square feet. The rent is $860 including water and trash. I want to find a
male roommate so the rent is $430 each person.
The address is 7600 Kirby Dr., Houston, TX, 77030. The apartment is very
safe and convenient. 5 minutes' drive to Rice and Medical Center, 5-10
minutes' walk to Kroger, CVS, Target and Fiesta. Also the apartment is next
to Brays Bayou Bike Trail. You can go to Medical Center using bike.
You can contact |
|
y****n
发帖数: 1 | 16 POSTGRAD Apartment, which is a real estate middle agent helping people to
find an ideal apartment for FREE. Currently, we have networks and
partnership with real estate agencies in Chicago, New York and Boston. In
addition, we also offer information about the city such as entertainment,
nightlife, restaurants to help you to transit from China to United States.
Another service we offer is that your students can sell or buy furniture on
our website. Please visit our website: www.PostGradApartm |
|
x****1
发帖数: 1410 | 17 I found a good deal in craigslist.com, but I doubt the guy is the real owner.
Is there any website I can find out it?
Thanks a lot. |
|
a**s
发帖数: 177 | 18 dummy question. where I can find this information? |
|
|
s*****r
发帖数: 773 | 20 请问是不是find duplication和missing 的方法都是一样的
有n个数 range 是 [1, N-1]，只有一个是duplication， 比如，N=4, {1，2，3，3}
方法:
1 数组全部加起来，和减去 1到N-1的和；
2 数组全部XOR， 然后依次XOR 1到 N-1；
3 二分法；
有 n-1 个数 range 是 [1, N]，只有一个missing， 比如，N=4, {1，2，3}
方法:
1 全部 1到N，加起来，和减去数组的和；
2 数组全部XOR， 然后依次XOR 1到 N；
3 二分法； |
|
s*********t
发帖数: 1663 | 21 ah
forgot you want same level
well, same method
first call $(node).parent() till reach document root, finding the depth
then, n = $(document)
repeat n = n.children() 'depth'times, n is the list of nodes at the same
level
); |
|
l******c
发帖数: 2555 | 22 write a program that finds all repeated substrings in the string and provide
the complexity of this program. how can you make it to perform better in
time and memory |
|
P********l
发帖数: 452 | 23 suppose Si=one substring that make of the whole string.
Now the question is to find n that whole string = n * Si
give an array of prime numbers = {2,3,5,7,11,...} try to divide and check if
the Si is the substring. For example, whole string = 2 * S1 = 5 * S2 = 7 *
S3. and no other way to divide it.
Then the smallest sub string is divide the whole string into 2 * 5 * 7
pieces.
For example, UUUUUU = UU . UU . UU = UUU . UUU.
good luck.
provide
` |
|
P********l
发帖数: 452 | 24 In that case, use surfix tree.
for example, tabcab, the surfix tree is:
b -cab
ab -cab
cab
tabcab
in the construction of the surfix tree you can find the substrings.
to |
|
s********e
发帖数: 83 | 25 Find the first k smallest numbers in an array.
是不是先找到K+1大的值，然后遍历整个array，凡是<这个值，就加到结果里面 |
|
f*********5
发帖数: 576 | 26 1)create a generalized suffix tree for A[0..n] and its reverse string
B[0..n]
###u need to make sure that u can get LCA of two nodes with O(1).
This step is difficult,i think unless u understand it very well,
otherwise it is very difficult to recite..
2) for (i=1;i
find max {LCA(a[i],b[n-1-i]),LCA(a[i+1],b[n-1-i])}
3) the max LCA is just the length of longest parlindrome,
i or i+1 is just the center of the parlindrome |
|
b********e
发帖数: 693 | 27 any website, we can find locla company's list? include headquarter local,
and local brach
thanks |
|
f*******8
发帖数: 149 | 28 If you want a complete list, I do not know.
If you want to find a job in the local companies, it will be very easy.
Go to a main job searching website (i.e. Monster), and then leave the
keyword part blank and input your zip code only. Then you can get a list of
positions, which are related to a list of companies. |
|
l****e
发帖数: 15 | 29 H1-b LAID OFF, AND CURRENTLY IN f2 VISA, IF FIND A JOb in one year, can it
be transfered to h1b without gap?
Thanks a lot! |
|
d********w
发帖数: 363 | 30 Given an array of 0's and 1's. only, find the maximum length of the subarray
such that the number of 0's and 1's in that subarray are equal. |
|
S******1
发帖数: 269 | 31 // Find the longest subarray with equal 1 and 0.
public static int[] longestSub(int[] inputArray) {
int length = inputArray.length;
int[][] record = new int[length][length];
//Initial
for (int i = 0; i < length; i++)
if (inputArray[i] == 1)
record[i][i] = 1;
else
record[i][i] = -1;
for (int i = 0; i < length; i++) {
for (int j = i; j < length; j++) {
if (i < j)
... 阅读全帖 |
|
p******r
发帖数: 2999 | 32 read the definition of bst
you will find out where the second largest is. |
|
g***s
发帖数: 3811 | 33 Even if it is not sorted, the finding median of all (k*n) item only needs
O(k*n) |
|
g***s
发帖数: 3811 | 34 1. put all number into one array, size = k*n O(k*n)
2. find the median of the array O(k*n)
I think LZ is asking for a better solution since the above method doesn't
care if it is sorted or not in the k arrays.
【 在 lolhaha (haha) 的大作中提到: 】 |
|
r****l
发帖数: 28 | 35 Given an unsorted array A[] with size (100 - k), the elements in the array
are unique numbers from 1 to 100.
Apparently there are k numbers are missing. Give a linear time and constant
space solution to find the k
missing numbers.
Any thoughts? |
|
r****l
发帖数: 28 | 36
you mean use one of the element space as a bitmap?
I think it'll work, and we can also reset that element after find out all
missing numbers, thus the array will
remain unchanged.
Cool. |
|
f****4
发帖数: 1359 | 37 修改了一下try_find_kth函数，新的函数可以同时handle O(lgn+lgm)和O(lgk)的情况
bool try_find_kth(int a[], int lowa, int higha, int b[], int lowb, int highb
, int k)
{
while(lowa<=higha)
{
int mid=lowa+(higha-lowa)/2;
if (mid>=k)
{
higha=mid-1;
continue;
}
if(a[mid]b[k-mid-2]))
{
printf("find %dth %d\n",k,a[mid]);
return true;
}
else
if(a[mid]>b[k-mid-1])
higha= mid-1;
else // a[mid>b[k-mid-2]]]
lo... 阅读全帖 |
|
c**********e
发帖数: 2007 | 38 Find the nearest common parent to two given nodes in a tree. |
|
c**********e
发帖数: 2007 | 39 Find the bits that are one in a byte (in C) |
|
e*****a
发帖数: 79 | 40 I am now a 1st year in financial engineering program and want to find a
software engineering job. I wonder whether it is feasible or not. |
|
a***r
发帖数: 93 | 41 memory O(n)
time O(nlogn)
//~ Given a array,find out if there exist a subarray such its sum is zero
#include
#include
using namespace std;
static void swap(int *p, int i, int j) {
int t=p[i]; p[i]=p[j];p[j]=t;
}
static int partition(int *p,int left,int right) {
int j=left;
for(int i=left;i
if(p[i]
}
swap(p,j,right);
return j;
}
static void binary_sort(int *p, int left, int right) {
if(left>=r... 阅读全帖 |
|
|
f****4
发帖数: 1359 | 43 原帖：http://www.mitbbs.com/article_t/Programming/31198701.html
Two reverse sorted arrays A and B have been given.such that size of A is m
and size of B is n You need to find the k th largest sum (a+b) where a is
taken from A and b is taken from B. such that k < m*n
有O(n)的解么？怎么转化成杨矩啊？
谢谢 |
|
f****4
发帖数: 1359 | 44 原帖：http://www.mitbbs.com/article_t/Programming/31198701.html
Two reverse sorted arrays A and B have been given.such that size of A is m
and size of B is n You need to find the k th largest sum (a+b) where a is
taken from A and b is taken from B. such that k < m*n
有O(n)的解么？怎么转化成杨矩啊？
谢谢 |
|
c*******r
发帖数: 309 | 45 Given an array of random numbers. Find the longest consecutive sequence.
For ex
Array 100 3 200 1 2 4
Ans 1 2 3 4
Array 101 2 3 104 5 103 9 102
Ans 101 102 103 104
Can we do it in one go on array using extra space??
我想到的方式是先sort， 然后用index来存,然后记录max长度. 不断更新新的index指
针.
不过据说复杂度要控制在o(n).
没什么好的想法啊 |
|
q*a
发帖数: 518 | 46 How to find the Export license status after submitted? any website link?
Thanks and have a great weekend. |
|
k***t
发帖数: 276 | 47 Given an array A[], find (i, j) such that A[i] < A[j] and (j - i) is maximum.
a = 1 3 2 4 的答案是无解:) |
|
c*******t
发帖数: 39 | 48 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.... 阅读全帖 |
|
r*******8
发帖数: 49 | 49 how to find employer's E-verify name and ID number? 我google E-verify
website, 但如何找到
employer's name listed as E-verify and employer's E-verify company
identification number.
多谢!!!! |
|
p*****i
发帖数: 197 | 50 问一道题目，how to find the majority element in an array?
例如 一个array里有 4,2,3,1,2,2,2 就要return 2(因为2出现的次数是4, 4超过了
array 长度的一半）。相反，如果array 里是4,2,3,1,2,2,3 就要return -1（因为没
有数超过array 长度的一半）。
如何在 O(n) 的time complexity 和O(1) 的space里完成？ |
|
