y****d
发帖数: 291 | 1 楼主面啥？
收到cgg in depth interview面试机会，求告知如果准备，要聊两个小时，都聊啥 |
|
o**l
发帖数: 312 | 2 不是他家要雷好几千人吗？每个员工都要求收拾桌子了，待命
[在 huoshankou (skyboard) 的大作中提到：]
：收到cgg in depth interview面试机会，求告知如果准备，要聊两个小时，都聊啥 |
|
b**j
发帖数: 20742 | 3 our DB depth now in serious trouble |
|
p******f
发帖数: 341 | 4 If you want to stay in control of the point, you've got to get good depth on
your shots.
By Debbie Graham
From the August 2003 issue of TENNIS Magazine
So there I am, running side to side, up and back, trying to chase down a
tennis ball that's controlling me. I feel like a puppet on strings manipulated
by the hands of my opponent. The harder I try to turn the point around, the
shorter my balls land and the more my opponent runs me all over the court.
Help!!
The solution seems obvious, but in th |
|
b*********s
发帖数: 6757 | 5 Here is my take.
your definition of moon baller is mainly block high and push the ball right?
Some with some topspin, but it's not those high and heavy balls (Rafa)...
Their strokes racquet has more open face, it makes "more" contact with the
ball thus they get more of a response, or more consistent response.
Therefore they get more feel, and grasp the this control faster. They also
pay more attention to this because their game style.
You probably hit with more spin and pace. For spin, it's more... 阅读全帖 |
|
m****z
发帖数: 978 | 6 You are right. That is my style.
I hit top spin BH, FH on almost every shot. When I hit harder, I create
more pace and along with more top spin. Due to additional top spin, my
harder shot does not go that much deeper. I think most of my rally balls
land around service line. Even it has good pace, due to lack of depth, it
does not hurt my opponent that much.
I want to change my average rally ball to land in the middle of base line
and service line. I hit with a teaching pro for couple poin... 阅读全帖 |
|
m****z
发帖数: 978 | 7 Yes, that took away my top spin, which is my control.
Now, I feel the height control is the key to control Depth. Focusing on hit
4-5 feet over the net with good top spin. I want to be top spin
moonballers. lol
But how to learn to control the height in order for me the keep my shots
deep? |
|
m****z
发帖数: 978 | 8 Gosh, now I think that is my biggest issue. My shots are usually only 2-3
feet over the net!
Take a look of my video and take a look of the heigh and depth. I am
fxxxing play mini tennis! My shorts land all around or within services line
, if it goes over the net. WTF!
First of all, it gives me tons of UE since it easily goes into the net.
2nd, even it is a good pace ball, it lands very shot. The other dude has
all day to wait til it drop right in there zone, while still close or in the
ba... 阅读全帖 |
|
m****z
发帖数: 978 | 9 Take a look of my video and take a look of the height and depth. I am
fxxxing play mini tennis! My shorts land all around or within services line
, if it goes over the net. And, I am swing hard. All of these = UE + tired
+ does not hurt my opponent.. |
|
m****z
发帖数: 978 | 10 Hitting the Wall
I like to use Kids red or orange ball. It slows thing down. Allow you to
hit though the ball with limited space.
It is productive, you don't need to pick up tons of balls.
It is great for preparation, foot work, timing.
Downside
But I don't see the depth of the short.
Hard to work on CC shots. |
|
h*d
发帖数: 19309 | 11 Nintendo 3DS in-depth preview: it works!
By Paul Miller posted Jun 15th 2010 9:40PM
So, we got shuffled past a 3DS at a rapid pace this morning on our way
out of the Nintendo keynote, but we've just had an opportunity to play
some titles and really get a feel for the thing... and we're pretty
impressed. Before we were only shown a technical demo, but at Nintendo's
booth there are games, games, games. The booth was about evenly split
between playable tech demos, non-playable live-rendered trailer |
|
l**********s
发帖数: 4363 | 12 我草好不容易用9W的魂搞定了，怎么跑回depth，那个npc不见了！？ |
|
p*******m
发帖数: 136 | 13 I have heard people talking about shallow depth of field when doing macro or
close up photography. Here I tried to get an idea of exact how shallow it
is. I stacked some pennies into 5 stacks.
As you can see from the picture, the five stacks had 1, 2, 3, 4, and 5
pennies respectively. The stack of 3 pennies was in the center.
Then I used a 50mm lens with the Nikon 4T close-up lens attached. I set the
aperture of the lense at f/2 and focused on the central stack. Here is the
result
I think I can |
|
f********p
发帖数: 8584 | 14 这个留言有意思
I actually came to this video because of the title "depth of field",
which I was interested in, but got to admit that the lady and her boobs
made me stay watching to the end, by the way, it was hard to focus on, so I
had to replay several times.... for the information she gave, hehe. Thanks
Snapchick, you are lovely and informative, keep doing this great job...
Cheers! |
|
|
s*****o
发帖数: 22187 | 16 【 以下文字转载自 Living 讨论区 】
发信人: sisomso (羊羊), 信区: Living
标 题: 请问Counter Depth冰箱
发信站: BBS 未名空间站 (Fri Dec 2 09:38:52 2011, 美东)
有人买吗？side by side和french door分别有啥好处坏处？标准的实在太厚了，挡路
。。。谢谢！ |
|
h**********c
发帖数: 4120 | 17 GPU,GLSL,OPENGL,GTS,MULTI-PASS-Rendering, Depth peeling transparency (
3layers)
有对这个感兴趣的吗?
这是用一块,ATI RADEON HD 2600 XT做出来的,nvdia的那个sample不支持(学校里奔四机器上nvdia卡也不支持).试了很多,一度想买块nvdia的新卡.关键的概念搞清楚了,ATI也可以.
省的钱可以花在新本子上.
有一个问题,就是模型的边缘是锯齿状的,而且是黑色的,用什么技术能处理一下,还望指教! |
|
h**********c
发帖数: 4120 | 18 那位大牛对depth peeling transparency 有研究
图形，
留个contact， |
|
|
D*****e
发帖数: 761 | 20 所以单个的depth sensor仅仅是个LiDAR 对吧，有没有关于这个sensor的科普文章？
如果是这样，一个三角仅能给出一个平面位置，怎么能确定严格的空间位置啊？ |
|
c**********e
发帖数: 2007 | 21 【 以下文字转载自 JobHunting 讨论区 】
发信人: careerchange (Stupid), 信区: JobHunting
标 题: Depth-First-Search
发信站: BBS 未名空间站 (Sun Jan 1 21:59:42 2012, 美东)
In the following graph, with starting point 0, what is the order of DFS
traversal?
0
/ \
1 2
/
3
We use a stack for DFS visit. The problem is, is the visit order the order each node is pushed into the stack, or the order each node is popped from the stack. |
|
G*O
发帖数: 687 | 22 【 以下文字转载自 Engineering 讨论区 】
发信人: GEO (CEO), 信区: Engineering
标 题: [合集] 昨天的PE(Civil/Struct Depth)考试小结
发信站: BBS 未名空间站 (Fri Jul 27 20:45:36 2007), 站内
☆─────────────────────────────────────☆
ZQBX (以默默潜水为荣，以掐架恶灌为耻！) 于 (Sat Apr 22 08:20:24 2006) 提到:
AM：
都是基本概念。除了Lindeburg的CERM，几乎不需要其他任何书。这次只有一个概念题
CERM里面没有查到，在Das的Fundamentals of Foundation Engineering里查到了(即使没
有，应该还是凭判断能答对。)
建议：
1. 打印CERM后面的INDEX并单独装订，这样在查找时比较省时省劲。
2. 把NCEES的FE SSupplied-reference Handbook中的Civil Engineering的章节搞懂。
PM：
我选的是Structur |
|
c*****e
发帖数: 119 | 23 有人考过Civil PE Water Resources and Environmental Depth 吗？
请问除了那本Civil Engineering Reference Manual for the PE Exam 之外还需要哪
些参考书？ |
|
Z**X
发帖数: 366 | 24 AM：
都是基本概念。除了Lindeburg的CERM，几乎不需要其他任何书。这次只有一个概念题
CERM里面没有查到，在Das的Fundamentals of Foundation Engineering里查到了(即使没
有，应该还是凭判断能答对。)
建议：
1. 打印CERM后面的INDEX并单独装订，这样在查找时比较省时省劲。
2. 把NCEES的FE SSupplied-reference Handbook中的Civil Engineering的章节搞懂。
PM：
我选的是Structural Depth。仍旧都是基本概念，几乎没有冗长的计算。
建议：
1. ACI 318-02和AISC规范是必须的。这次考试有三四道bridge题目要求使用AASHTO规范
，不过只需Section 3: Load即可。IBC-2003和ASCE-7也都被要求用到了。这次的Wood题
目几乎不需规范。这次没有出现Masonry题目。
2. 参考书除了CERM，建议使用NCEES的Sample Problems: Structural I。有若干题目只
是改变了数字就出现在考题中。我没有买NCE |
|
t******o
发帖数: 467 | 25 All the depth are same for afternoon. That is 4 hours.
I just start reviewing and looks like a lot of topics.
is |
|
t******o
发帖数: 467 | 26 I remember there is no Civil depth. You mean Geotechnical? |
|
G*O
发帖数: 687 | 27 ☆─────────────────────────────────────☆
ZQBX (以默默潜水为荣，以掐架恶灌为耻！) 于 (Sat Apr 22 08:20:24 2006) 提到:
AM：
都是基本概念。除了Lindeburg的CERM，几乎不需要其他任何书。这次只有一个概念题
CERM里面没有查到，在Das的Fundamentals of Foundation Engineering里查到了(即使没
有，应该还是凭判断能答对。)
建议：
1. 打印CERM后面的INDEX并单独装订，这样在查找时比较省时省劲。
2. 把NCEES的FE SSupplied-reference Handbook中的Civil Engineering的章节搞懂。
PM：
我选的是Structural Depth。仍旧都是基本概念，几乎没有冗长的计算。
建议：
1. ACI 318-02和AISC规范是必须的。这次考试有三四道bridge题目要求使用AASHTO规范
，不过只需Section 3: Load即可。IBC-2003和ASCE-7也都被要求用到了。这次的Wood题
目几乎不 |
|
|
k******u
发帖数: 3137 | 29 http://grfx.cstv.com/photos/schools/nd/sports/m-footbl/auto_pdf/depth-chart.pdf
Notre Dame Offense
X 19 George West 5-10 197 So.
1 D.J. Hord 6-1 196 Jr.
18 Duval Kamara 6-5 222 Fr.
LT 72 Paul Duncan 6-7 308 Jr.
70 Matt Romine 6-5 279 Fr.
LG 77 Mike Turkovich 6-6 301 Jr.
55 Eric Olsen 6-5 303 So.
C 78 JOHN SULLIVAN 6-4 303 Sr.
67 Thomas Bemenderfer 6-5 285 Jr.
RG 51 Dan Wenger 6-4 287 So.
73 Matt Carufel 6-5 295 So.
RT 74 SAM YOUNG 6-8 310 So.
75 Taylor Dever 6-5 289 Fr.
TE 89 JOHN CARLSON 6-6 25 |
|
d**********o
发帖数: 1321 | 30 hw3b c-.y file
上面这一楼贴了载止hw3b deadline时我match的结果（也就是老师可以以这些不match
的ERROR为借口不给后来我补上的成绩），但是因为当时我还是没有写完，后来感恩节
期间就接着又写了一些，而且hw5是based on hw3 & hw3b的基础上（当我hw5是based
on更好的hw3的结果时，我应该可以得更多的分吧）。
hw4因为写得比较顺利，就不曾保留任何交上去作业的output，没有什么一目了然的结
果是我可以贴在这里的。原本我是想要把自己最的一次作业hw5贴出来的，但那已经是
一个完整的compiler，而且以后我还需要用自己的course project来找工作，所以一定
就不贴最终结果了。那就贴一个hw3b的c-.y文件吧，它集中的hw1、hw2、hw3、 hw3b的
结果，是我自己hw3b *.y文件的最完整版本。这些作业里面也有很多机关一一人为增加
的难度，比如那六七个IO相关的function，不仅traverse tree、build syntax tree的
时候会成为一个考点（把它们作为一个node连在syntax... 阅读全帖 |
|
d**********o
发帖数: 1321 | 31 hw3b c-.y file
上面这一楼贴了载止hw3b deadline时我match的结果（也就是老师可以以这些不match
的ERROR为借口不给后来我补上的成绩），但是因为当时我还是没有写完，后来感恩节
期间就接着又写了一些，而且hw5是based on hw3 & hw3b的基础上（当我hw5是based
on更好的hw3的结果时，我应该可以得更多的分吧）。
hw4因为写得比较顺利，就不曾保留任何交上去作业的output，没有什么一目了然的结
果是我可以贴在这里的。原本我是想要把自己最的一次作业hw5贴出来的，但那已经是
一个完整的compiler，而且以后我还需要用自己的course project来找工作，所以一定
就不贴最终结果了。那就贴一个hw3b的c-.y文件吧，它集中的hw1、hw2、hw3、 hw3b的
结果，是我自己hw3b *.y文件的最完整版本。这些作业里面也有很多机关一一人为增加
的难度，比如那六七个IO相关的function，不仅traverse tree、build syntax tree的
时候会成为一个考点（把它们作为一个node连在syntax... 阅读全帖 |
|
I*******g
发帖数: 7600 | 32 【 以下文字转载自 SanFrancisco 讨论区 】
发信人: IFloating (Floating Freely), 信区: SanFrancisco
标 题: 这么频繁的小地震。房价要降了吧？
发信站: BBS 未名空间站 (Mon Oct 19 22:04:46 2015, 美东)
是不是就是大震的前兆啊？
房价要降了吧？
42 minutes ago 2.5 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 1.7 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 2.5 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 1.9 magnitude, 6 km depth
San Ramon, California, United States
about an ... 阅读全帖 |
|
A**u
发帖数: 2458 | 33 来自主题: JobHunting版 - 算法题求教 这个题目我刚好练过
这里有介绍
http://www.geeksforgeeks.org/archives/14469
用backtracking.
关键是，这个树的有些node, 可以不用访问
比如 你要找9.
假设从1开始那么，到达(1,2,4)node.
(1,2,4)的和 加上 {5,7,8}的最小值 > 9.
所以不用考虑 包含1，2，4的node了，这样可以可以排序不少点
这是我的算法
#include
#include
#include
using namespace std;
void re(int depth, int sum, vector selected,int w[], int N, int target){
if ( depth == N )
{
if ( sum == target )
{
for(vector::iterator it = selected.begin(); it != selecte... 阅读全帖 |
|
I*******g
发帖数: 7600 | 34 是不是就是大震的前兆啊？
房价要降了吧？
42 minutes ago 2.5 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 1.7 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 2.5 magnitude, 7 km depth
San Ramon, California, United States
about an hour ago 1.9 magnitude, 6 km depth
San Ramon, California, United States
about an hour ago 1.8 magnitude, 7 km depth
San Ramon, California, United States
about 2 hours ago 1.6 magnitude, 6 km depth
San Ramon, California, United Sta... 阅读全帖 |
|
a****r
发帖数: 71 | 35 请教一个《Carpenter's Complete Guide to the SAS Macro》上SAS macro的例子。
Chapter 6， Page 111 有一个根据data A1 里两个变量 station 和 depth 生成 一系
列ACSII文件的macro的例子；
**********************;
***6.2.1d
***%DOIT
**********************;
* 1993 Water quality data.
*************************************************;
data a1
(keep=datetime station depth temp ph do cond salinity);
input datetime datetime13. @15 station $3.
depth temp ph do cond salinity;
label datetime = 'date and time of sample collection'
st... 阅读全帖 |
|
s********1
发帖数: 54 | 36 ______________________________________________
I got the following error message:
______________________________________________
ERROR: Insufficient authorization to access C:\Program Files\SASHome\
SASFoundation\9.3\TS30.dat
______________________________________________
My code is as follows:
______________________________________________
**********************;
***6.2.1d
***%DOIT
**********************;
* 1993 Water quality data.
*************************************************;
data a1
... 阅读全帖 |
|
n**d
发帖数: 9764 | 37 【 以下文字转载自 SanFrancisco 讨论区 】
发信人: elipses (elipses), 信区: SanFrancisco
标 题: Re: 刚地震了
发信站: BBS 未名空间站 (Fri Sep 15 01:13:15 2017, 美东)
San Jose地区6次了已经。
https://earthquaketrack.com/p/united-states/california/recent
16 minutes ago 2.8 magnitude, 0 km depth
East Foothills, California, United States
about 4 hours ago 1.6 magnitude, 17 km depth
Colton, California, United States
about 4 hours ago 2.0 magnitude, 0 km depth
East Foothills, California, United States
about 4 hours ago 3.3 magnitude, 0 km dept... 阅读全帖 |
|
发帖数: 1 | 38 Yangtze River
RIVER, CHINA
WRITTEN BY: Aleksandr Pavlovich Muranov Charles E. Greer
See Article History
Alternative Titles: Ch’ang Chiang, Chang Jiang, Da Jiang
Yangtze River, Chinese (Pinyin) Chang Jiang or (Wade-Giles romanization) Ch
’ang Chiang, longest river in both China and Asia and third longest river
in the world, with a length of 3,915 miles (6,300 kilometres). Its basin,
extending for some 2,000 miles (3,200 km) from west to east and for more
than 600 miles (1,000 km) from north to so... 阅读全帖 |
|
发帖数: 1 | 39 Yangtze River
RIVER, CHINA
WRITTEN BY: Aleksandr Pavlovich Muranov Charles E. Greer
See Article History
Alternative Titles: Ch’ang Chiang, Chang Jiang, Da Jiang
Yangtze River, Chinese (Pinyin) Chang Jiang or (Wade-Giles romanization) Ch
’ang Chiang, longest river in both China and Asia and third longest river
in the world, with a length of 3,915 miles (6,300 kilometres). Its basin,
extending for some 2,000 miles (3,200 km) from west to east and for more
than 600 miles (1,000 km) from north to so... 阅读全帖 |
|
l*******g
发帖数: 27064 | 40 +
-
50 km
30 mi
Map data: National Geographic, Esri,... | Powered by Esri
about 5 hours ago 1.9 magnitude, 2 km depth
Volcano, Hawaii, United States
about 7 hours ago 1.8 magnitude, 39 km depth
Pāhala, Hawaii, United States
about 19 hours ago 1.7 magnitude, 11 km depth
Pāhala, Hawaii, United States
about 20 hours ago 1.9 magnitude, 33 km depth
Pāhala, Hawaii, United States
about 23 hours ago 2.1 magnitude, 36 km depth
Pāhala, Hawaii, United States
a day ago 1.7 magnitude, 10 km depth
Pāhala, Haw... 阅读全帖 |
|
l******h
发帖数: 2 | 41 Highly reputational company with very competitive compensation for all
positions.
Please send in your resume and position/positions you like to apply to my
email address below.
h*******[email protected]
All resumes will be deliver to hiring manager directly. Act fast!
Thanks!
Silicon Engineering Group
Sr. Physical Design Timing Engineer
Timing (STA) Manager
Senior Physical Design Engineer
CAD Manager - Front-End Design and Verification
Sr. CAD Engineer - Place & Route / Physical Design Engineer
Sr. CA... 阅读全帖 |
|
l*****a
发帖数: 14598 | 42 我的体会是这种题最好定义一个结构
class Info {
int depth;
boolean balanced;
}
来记录当前子树信息，因为这种题都需要用递归从root一直到leaves.
而且求depth要递归，判断balanced还要递归，最好一次递归就把所需要的值都存下来
类似的还有那道求树中两结点间最大path那题
这是我的code,见笑了
public boolean isBalanced(TreeNode root) {
return depth(root).balanced;
}
public Info depth(TreeNode root) {
if(root==null) return new Info(true,0);
Info leftInfo=depth(root.left);
Info rightInfo=depth(root.right);
boolean bo=(Math.abs(leftInfo.depth-rightInfo.depth)<=1... 阅读全帖 |
|
j******s
发帖数: 48 | 43 Hi,请问word ladder II 的测试数据是不有点问题么？
对于输入:
"hit", "cog", ["hot","cog","dot","dog","hit","lot","log"]
我的输出是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"],["hot","dot
","lot","log","cog"],["hot","dot","dog","log","cog"]]
测试数据输出的是
[["hit","hot","dot","dog","cog"],["hit","hot","lot","log","cog"]]
根据题目的定义应该是都可以的吧？
嗯嗯，我知道答案是不是正确不是特别重要，只是这道题我花了很多时间对比BFS,DFS,
IDS以及实现他们的一些不同方式，所以希望可以求证一下而已。
附贴上我的代码
class Solution {
private:
class Node{
public:
string word;
vector阅读全帖 |
|
l***4
发帖数: 1788 | 44 题目是
Given a nested list of integers, returns the sum of all integers in the list
weighted by their depth. For example, given the list {{1,1},2,{1,1}} the
function should return 10 (four 1's at depth 2, one *2 at depth 1). Given
the list {1,{4,{6}}} the function should return 27 (one 1 at depth 1, one 4
at depth 2, and *one 6 at depth 3)
第二个例子我还能理解，第一个例子为啥有四个1在depth 2啊？难道不应该是两个1在
depth 1，一个2在depth 2，还有两个1在depth 3吗？？？
求拍醒 |
|
l******h
发帖数: 2 | 45 Highly reputational company with very competitive compensation for all
positions.
Please send in your resume and position/positions you like to apply to my
email address below.
h*******[email protected]
All resumes will be deliver to hiring manager directly. Act fast!
Thanks!
Silicon Engineering Group
Sr. Physical Design Timing Engineer
Timing (STA) Manager
Senior Physical Design Engineer
CAD Manager - Front-End Design and Verification
Sr. CAD Engineer - Place & Route / Physical Design Engineer
Sr. CA... 阅读全帖 |
|
e*****s
发帖数: 121 | 46 来自主题: SanFrancisco版 - 刚地震了 San Jose地区6次了已经。
https://earthquaketrack.com/p/united-states/california/recent
16 minutes ago 2.8 magnitude, 0 km depth
East Foothills, California, United States
about 4 hours ago 1.6 magnitude, 17 km depth
Colton, California, United States
about 4 hours ago 2.0 magnitude, 0 km depth
East Foothills, California, United States
about 4 hours ago 3.3 magnitude, 0 km depth
East Foothills, California, United States
about 6 hours ago 1.9 magnitude, 0 km depth
East Foothills, California, United States
a... 阅读全帖 |
|
s******9
发帖数: 283 | 47 The peer review process at Science
http://www.publications.parliament.uk/pa/cm201011/cmselect/cmsc
1.Peer-reviewed scientific publications represent the primary useful archive
of scientific progress. Scientific publications have served other main
functions as well: They are a primary means of evaluating scientists and
institutions, and they have become a main pathway for informing the general
public about science, through coverage in the media and press releases (new
results are news). Peer-revi... 阅读全帖 |
|
l**********i
发帖数: 11748 | 48 去马路边捡一分钱先
然后
http://www.pepboys.com/tires/treadsmart/take_the_penny_test/
The Penny Test for Tires - How it works
Just take a penny, hold it vertically with Lincoln facing you and place the
dated section of the coin into several tread grooves across the tire. If
part of our 16th President’s head is always hidden by the tread, you have
more than 2/32" of tread depth remaining.
If you duplicate the process with a quarter and part of Washington’s head
is always hidden, then you have more than 4/32”... 阅读全帖 |
|
A**u
发帖数: 2458 | 49 我晕
这developer position 也问这么非常规得问题
我感觉这题目还得用递归的思路
struct KOU{
KOU(bool x):val(x),depth(0){};
bool val;
int depth;
virtual ~KOU(){}
}
struct TIAN:public KOU{
TIAN(int depth_val):depth(depth_val){
if (depth = 0 ){
I = new KOU;
II = new KOU;
III = new KOU;
IV = new KOU;
}
else{
I = new TIAN(depth -1);
II = new TIAN(depth -1);
III = new TIAN(depth - 1);
IV = new TIAN(depth - 1);
}
}
virtual ~TIAN(){
delete I,II,II... 阅读全帖 |
|
