|
|
w******e
发帖数: 1038 | 3 我是头天晚上决定买，然后用pivot price 挂。
Daytrader 好像用它像守株待兔的做法，我没这么做过
out |
|
B****A
发帖数: 816 | 4 Independent Data Monitoring Committee Recommends Continuation of Spectrum
Pharmaceuticals’ Pivotal Registrational Study of Belinostat in Peripheral T
-Cell Lymphoma
•Independent Data Monitoring Committee (DMC) Recommends That the
BELIEF Study Continue According to Protocol Until 100 Evaluable Patients
Enrolled
•No Safety Concerns Raised Based on DMC Safety Analysis
http://www.businesswire.com/news/home/20110328005575/en/Indepen |
|
r*******u
发帖数: 143 | 5 Stock Research Trader
Sprewell
Week ending: 03/10/2012
READING THE MARKET
At this moment, it seems like the stock market is at a cross road. With a
distribution day on Tuesday while leading stock sold hard, it’s time to
take a cautious stand, while the rest of the week market went up with low
volume. Leading stocks are ok so far. However it’s time on the lookout for
big boy selling, and set your stop tight to protect your capital and
confidence. It’s a week with mostly good news, the Greece issu... 阅读全帖 |
|
l****p
发帖数: 397 | 6 刚写了一个O(lg N)的算法：
import math
import random
NUM_MAP_TASKS = 3000
NUM_REDUCE_TASKS = 2
def select(array, order = (len(array)+1)/2):
pivot = array.pop(random.random()*len(array))
length = math.floor(len(array)/NUM_MAP_TASKS)
map_results = {'less than or equal to pivot': [], 'greater than pivot':
[]}
for i in range(0, NUM_MAP_TASKS):
r = map(array[length*i:length*(i+1)], pivot)
map_results['less than or equal to pivot'] += r['less than or equal
to pivot']
map_... 阅读全帖 |
|
r*******u
发帖数: 143 | 7 Stock Research Trader
Sprewell Yu
Week ending: 01/28/2012
READING THE MARKET
Stocks continued to march to higher as break out stock holding up well and
move higher while the indexes were consolidating in healthy fashion. And
institutions were still putting money to work. On Wednesday, the Fed would
let the interest rate holding at their current low level until 2014 which
has sparked the rally, and on Friday there were divergence on the index, Dow
was pulling back while Nasdaq going higher. Anot... 阅读全帖 |
|
r*******u
发帖数: 143 | 8 Stock Research Trader
Week ending: 02/11/2012
READING THE MARKET
In this kind of environment, it’s not a good solution to argue with the
trend. The market is only going in one direction it is up. Even the Greece
event still hovering around the market, but the market just keep bypassing
the bad news to surge higher. This week the market has three accumulation
days, and two of those day pullback in light volume which is ideal to say.
Nevertheless, this market is a bit extended, a small correction ... 阅读全帖 |
|
r*******u
发帖数: 143 | 9 Stock Research Trader
Week ending: 02/11/2012
READING THE MARKET
In this kind of environment, it’s not a good solution to argue with the
trend. The market is only going in one direction it is up. Even the Greece
event still hovering around the market, but the market just keep bypassing
the bad news to surge higher. This week the market has three accumulation
days, and two of those day pullback in light volume which is ideal to say.
Nevertheless, this market is a bit extended, a small correction ... 阅读全帖 |
|
r*******u
发帖数: 143 | 10 Stock Research Trader
Sprewell Yu
Week ending: 02/04/2012
READING THE MARKET
It seems as the market wants to keep on marching higher as the Nasdaq
surpass the 2011 high with three accumulation day in one week with strong
job data on Friday. Leading stocks are acting well, and plenty of them break
out in heavy volume, the most in many years. There’s a tremendous amount
of strength in the market as volume pick the day before the Nasdaq break out
. In this market environment, all negative news has ... 阅读全帖 |
|
p*********e
发帖数: 32207 | 11 最下面是完整原文,这里摘选一下:
根据规则b,c
b. A player who receives the ball while he is progressing or upon completion
of a dribble, may use a two-count rhythm in coming to a stop, passing or
shooting the ball.
The first count occurs:
(1) As he receives the ball, if either foot is touching the floor at the
time he receives it.
c. A player who comes to a stop on the count of one may pivot, using either
foot as the pivot foot.
那么接下来简单了,kobe什么时候receives the ball的?
是顺步启动后左脚交叉步迈出去之后,右脚向左面后转身跨步的过程中
那么根据规则,他接下来可以选择左脚或者... 阅读全帖 |
|
c**********e
发帖数: 2007 | 12 Quick Selection:
选target个最小的。最终目的是，使a[0], …, a[target-1]为最小的。因为是递归调用子函数，子函数对数组的一部分a[low], …, a[high]操作。
#include
using namespace std;
#define swap(x,y) { int z=x; x=y; y=z; }
int low_n(int a[], int low, int high, int target) {
int pivot; int mid=(low+high)/2;
if(a[low]<=a[mid])
{
if(a[high]<=a[low]) pivot=a[low];
else if(a[high]<=a[mid]) pivot=a[high];
else pivot=a[mid];
} else
{
if(a[high]<=a[mid]) pivot=a[mid];
else if(a[high]<=a[low]) pivot=a[high];
... 阅读全帖 |
|
b******g
发帖数: 77 | 13 一个martrix，每行每列都是sorted，找到前kth 个
Analysis:
Applying a quick-select algorithm will achieve an O( n * n ) time
complexity. Can we do better? Yes. Here is a algorithm:
1. Like quick-select algorithm, this algorithm applies divide-and-
conquer.
2. Initialize those two boundary lines to (n * [0] and n * [n]) to
include all array items in boundary.
3. Process subarray between boundary lines (lo, hi ) in each
recursive call:
a. select a random item in su... 阅读全帖 |
|
r*******u
发帖数: 143 | 14 Stock Research Trader
current holding- AH, TIBX, LNKD, FTNT, SPPI, INVN, VPHM
Sprewell Yu
Week ending: 01/21/2012
READING THE MARKET
The scent of game on long side has stated over the last two reports. The
NYSE has gone above 200 day line while Nasdaq broke out of a consolidation
with confirmation from leading stocks. On Tuesday the market gap up from
strong GDP Data from China, the market has gap up in the morning has pulled
back by Citigroup miss earning, While on Wednesday plenty of stock has... 阅读全帖 |
|
d******1
发帖数: 349 | 15 Qualcomm CEO: 'We have to pivot the company'
Restructuring will better position company in markets like the Internet of
Things, wireless health
Mugshot of Mike FreemanBy Mike Freeman | 1:44 p.m. Sept. 2, 2015
"There are number of different markets that we think will leverage
mobile technology. And our job is to pivot the company to take advantage of
that over the next five years," said Qualcomm CEO Steve Mollenkopf in an
exclusive interview with the San Diego Union-Tribune.
"There ar... 阅读全帖 |
|
p*********e
发帖数: 32207 | 16 另外pivot foot的定义有一套严密的体系的,不存在事实上的pivot foot这一说法
对于上篮来说,按照定义体系来讲你迈出的第一步是pivot foot
紧接着你以这个脚为轴做pivoting并迈出第二步,之后pivot foot 抬起
以第二步单脚起跳,在pivot foot落地前完成上篮
他所做的只是抬起pivot foot之后没有立即用另一脚起跳
不过像这种动作很容易引起裁判不适,所以不建议使用,毕竟实际比赛裁判响哨就是一念
之差
最后说一下,单脚站立本身并不构成pivot foot的定义,所以仅凭这一点不能判断为
"交换pivot foot"
另外走步的定义也是说步伐超过了pivoting定义所允许的范围即为运球违例
交换中枢脚本身也不属于违例定义的一部分:D
foot |
|
g******0
发帖数: 1165 | 17 整理分享一套有用的Day Trade方法
Pivot Point Trading
1. 计算R/S
Resistance 3 = High + 2*(Pivot - Low)
Resistance 2 = Pivot + (R1 - S1)
Resistance 1 = 2 * Pivot - Low
Pivot Point = ( High + Close + Low )/3
Support 1 = 2 * Pivot - High
Support 2 = Pivot - (R1 - S1)
Support 3 = Low - 2*(High - Pivot)
如果如何使用R/S
开盘在pp 上,考虑long, 开盘在pp下,考虑short
The general idea behind trading pivot points is to look for a reversal or
break of R1 or S1. By the time the market reaches R2,R3 or S2,S3 the market
will already be overboug... 阅读全帖 |
|
h***n
发帖数: 276 | 18 quick有，不难，merge sort也是
随便拷贝一段代码给你看看吧
void quick_sort_list(list *list)
{
if (list == NULL)
return;
list->head = quick_sort_list_recursive(list->head);
}
list_node* quick_sort_list_recursive(list_node *node)
{
list_node *pivot, *less, *larger, *p, *next;
if (node == NULL)
return NULL;
less = larger = NULL;
pivot = node;
p = pivot->next;
pivot->next = NULL;
while (p) {
next = p->next;
if (p->data < pivot->data) {
p-... 阅读全帖 |
|
d**********x
发帖数: 4083 | 19 quicksort也是一样的
本身sort没什么难的，一个递归。
关键是partition的不变量要记住，或者一旦理解了循环不变量的概念，现场重新构造
不变量也能写出来。
比如说，我现在大概知道partition是需要把pivot放到末尾，然后把所有小于pivot的
变量移动到数组前段。我还知道这里应该大体有俩指针。于是构造两个不变量，m指向
所有比pivot小的元素段的后一个元素， n指向当前正要和pivot比较的元素，于是两者
都可以初始化为0 —— 0是满足这两个条件的，然后当前元素由不变量可知是a[n]，和
pivot比较，要保持不变量，如果这个元素比pivot小，则把它和a[m]互换并且m++，因
为a[0...m-1]是我们已经得到的结果，这个不会破坏不变量。如果它比pivot大，则m不
需改变。接下来因为a[n］已经比较完毕，做n++。直到pivot前面的元素比较完毕之后
，结束循环。
这样写出来的程序相当于有严格的数学证明，逻辑上基本不会出错 |
|
M***n
发帖数: 5815 | 20 这个方法叫 Pivot Points System。最早是floor trader在使用。
经典Pivot Points System的版本：
思路就是用头天的价格的信息去快速的估算第二天的价格的支撑位和阻力位。计算公式
来了:
R3 = H + 2×(P − L) = R1 + (H − L)
R2 = P + (H - L) = P + (R1 - S1)
R1 = (P x 2) - L
P = (H + L + C) / 3
S1 = (P x 2) - H
S2 = P - (H - L) = P - (R1 - S1)
S3 = L − 2×(H − P) = S1 − (H − L)
"S" 代表支撑位, "R" 代表阻力位，"P" pivot point枢轴价位. "H", "L", "C" 是昨
天的最高价，最低价，和收盘价。
P就是头天的最高价，最低价和收盘价的平均数。
------------------------------------------------------------
第... 阅读全帖 |
|
d***3
发帖数: 81 | 21 这个已很清楚了。
把这个拷全:
"To start a dribble after establishing a pivot foot, the ball must be
released from the player’s hand before his pivot foot leaves the floor or
he has committed a traveling violation." 就是楼主的misunderstood rule
NBA’s Misunderstood Rules
。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。
Traveling:
To start a dribble after establishing a pivot foot, the ball must be
released from the player’s hand before his pivot foot leaves the floor or
he has committed a traveling violation. A player who receives ... 阅读全帖 |
|
s*****c
发帖数: 753 | 22 其实又回到了FIBA和NBA的规则差异。
https://en.wikipedia.org/wiki/Traveling_(basketball)
FIBA：25.2.2. Progressing with the ball by a player who has established a
pivot foot while having control of a live ball on the playing court:
While standing with both feet on the floor:
To start a dribble, the pivot foot may not be lifted before the ball is
released from the hand(s).
To pass or shoot for a field goal, the player may jump off a pivot foot, but
neither foot may be returned to the floor before the ball is rel... 阅读全帖 |
|
f*****n
发帖数: 15 | 23 we can do something similar to find the median of an array by using quick
sort.
1. randomly pick up a number as a pivot from the N^2 numbers
2. split each array into two groups, smaller than the pivot and greater than
the pivot
3. if the count of numbers smaller than or equal to the pivot is N^2/2, the
pivot is the median
3.1 if the count is smaller than N^2/2, throw all numbers smaller than pivot
and try to find the (N^2/2 - count) smallest number in the left numbers
3.2 if the count is larger ... 阅读全帖 |
|
f*****n
发帖数: 15 | 24 we can do something similar to find the median of an array by using quick
sort.
1. randomly pick up a number as a pivot from the N^2 numbers
2. split each array into two groups, smaller than the pivot and greater than
the pivot
3. if the count of numbers smaller than or equal to the pivot is N^2/2, the
pivot is the median
3.1 if the count is smaller than N^2/2, throw all numbers smaller than pivot
and try to find the (N^2/2 - count) smallest number in the left numbers
3.2 if the count is larger ... 阅读全帖 |
|
r***k
发帖数: 13586 | 25 这球和pivot脚抬起无关，而是怎样定义pivot脚。根据定义，要hold the ball的时候
才能定pivot，第一步落地时没有hold the ball，第二步开始hold the ball，所以第
三步落地那只脚才是pivot。
Section VII—Pivot
a. A pivot takes place when a player, who is holding the ball, steps once or
more than
once in any direction with the same foot, with the other foot (pivot foot)
in contact with the
floor. |
|
p****e
发帖数: 37 | 26 void partition2(int v[], int b1, int e2, int& e1, int& b2)
{
if (e2 <= b1) return;
int pivot = v[e2];
int i = b1 - 1;
int j = e2;
int p = b1 -1;
int q = e2;
while (true)
{
while (v[++i] < pivot);
while (pivot < v[--j]) if (j <= b1) break;
if (i >= j)
break;
exch(v[i], v[j]);
if (v[i] == pivot) {exch(v[++p], v[i]);}
if (v[j] == pivot) {exch(v[--q], v[j]);}
}
exch(v[i], v[e2]);
j = i - 1;
i ... 阅读全帖 |
|
K*****k
发帖数: 430 | 27 都是取第一个元素为支点, 哪个写得更好？
void quickSort1(int arr[], int left, int right)
{
if (left >= right)
return;
int pivot = arr[left];
int i = left;
int j = right + 1;
while (i < j)
{
do { i++; } while (i <= right && arr[i] < pivot);
do { j--; } while (arr[j] > pivot);
if (i < j)
swap(arr, i, j);
}
swap(arr, left, j);
quickSort1(arr, left, j - 1);
quickSort1(arr, j + 1, right);
}
===============================================... 阅读全帖 |
|
t***y
发帖数: 2276 | 28 感觉这个评论对中该很中肯。各位股友有何指点？
http://www.minyanville.com/buzz/buzzalert/time-to-evaluate/07/0
Indices paused yesterday as leaders continued to move up and break out. Last
week the market had its most powerful move since 2009, taking numerous
market participants by surprise. Next few days will be tricky as key stocks
continue to act great, but the indices themselves are extremely overbought.
Market is ignoring news like the “Portugal debt downgrade” as well as
chatter of some “Banking problems in China”... 阅读全帖 |
|
a*****e
发帖数: 329 | 29 看了这个贴，终于理解这里为啥这么多人纠缠走步了。
楼主给的第一个，解说都解释清楚了。各位看客上班没带耳机也就算了。
hubn，把规则也翻出来贴到这里了，居然还有那么多人认为走步。真的这么关心走步，
花几分钟时间看看那几行英语都不能吗？
谁说投蓝时，pivot foot不能离地了。那双脚起跳的跳投，是不是都是pivot foot离地
了。
pivot foot 可以离地，但是必须在pivot foot落地之前，投蓝或传球。pivot foot落
地之前，球必须离手。
此后，pivot foot落地，如果没有其他人碰过球，球也没碰到蓝板/框，那么这个人就
不能地一个碰球。
第一个是绝对好球，教科似标准上篮。 |
|
a*****e
发帖数: 329 | 30 这球是走步了，你看他双手收球时，右脚脚尖还在地上。右脚是pivot foot. 他下次跳
起>来后，右脚落地前，球必须离开手。但实际上，他右脚落地后，再起跳，再出手的。
前几天在另外一个帖子, 27楼，有人说，这是FIBA的规则。
NBA的规则是，收球时在地上的脚不是pivot foot. 随后落地的脚才是Pivot foot. 如
果这么说，那么Wade这球，收球后，落地的是左脚，那就不是走步。
我自己一直认为这个解读是错的。 我认为以上这个规则，适用于，收球瞬间，两脚都
在空中的情况，这时，随后落地的便是Pivot foot. 这种情况多出现在跳步上篮，和小
部分的>后撤步。
例如：跳步上篮中，双脚起跳后在双脚离地的情况下收球，先落地的是pivot foot，然
后他在跨出另外一只脚起跳，pivot foot 落地前球出手。动作连续起来，就是跳了两
次。
Wade这种球，经常看到，都没吹。也不光他，还有其他人也有这个动作。我个人认为是
误>判，因为他们在打这球的时候，本意是在空中，双脚离地再收球的。从截图可以看
到Wade>这球只差一点点，右脚已经起来了。裁判没注意到，或者注意到了... 阅读全帖 |
|
m*****r
发帖数: 1240 | 31 http://www.usab.com/youth/news/2011/06/establishing-a-pivot-foo
根据这个网页里解释的规则，The moment you gain possession or end your dribble
, you can establish a pivot foot in the following ways： 2. If one foot is
on the court, that foot is the pivot foot.
Then, You may raise your pivot foot to shoot or pass, provided the ball
leaves your hands before the pivot foot returns to the court.
我的理解是17秒右脚着地时，已经是 the moment you gain possession， 那么右脚
就是 pivot foot.
那后来右脚又起跳再着地再release ball to shoot, 那就是违例了 |
|
M*****e
发帖数: 1827 | 32 i just learned several figures that involve pivot, which is very
hard for me. pivot alone is ok, but when followed by other figure
i can never find the right foot position or the balance.
currently, two combinations bothers me most
1. fallaway reverse, slip pivot, double reverse spin
2. quick open reverse, reverse pivot, double reverse spin
i can't make enough amount of turn in pivot, and after the pivot
my foot is too close or too left to my partner, i kind of feel
falling back right. and thus |
|
c*****e
发帖数: 3226 | 33 http://yaleglobal.yale.edu/content/china%E2%80%99s-new-silk-roa
China’s response to the so-called US pivot to Asia is to expand influence
in Asia. Known as the “One Belt, One Road,” the modern-day Silk Road
network “will not only enhance ‘five connections’ – trade,
infrastructure, investment, capital and people – it will create a community
with ‘shared interests, destiny and responsibilities,’” explains
Shuaihua Wallace Cheng, managing director of ICTSD China and a Yale World
Fellow. China hopes... 阅读全帖 |
|
m**q
发帖数: 189 | 34 Good point, a few details though:
1 1 2 2 3 2 4 1 4 4
For example, we picked 2 as pivot, as we divided the array to
the following
1 1 1 2 2 2 3 4 4 4
< 2 pivot >= 2
Then both sides have 3n elements, but pivot value 2 is not the
one we want to find. In this case we can save discard the left
half, and simply compare pivot with its next neighbour on the right,
if they are not equal then we're done and pivot is the one, otherwise
continue with the right half. |
|
a*******6
发帖数: 520 | 35 所谓的quicksort不stable不是说partition那一步，而是选pivot那步
一般认为的quicksort，（递归的）每次随机选一个pivot，然后partition，复杂度期
望下是O(nlogn)，最坏是O(n^2)，这个可能是你说的不stable
但是partition那一步肯定是O(n)的
理想情况下，如果pivot选到median，那么复杂度肯定是O(nlogn)了
有一种确定性算法可以每次以O(n)的时间选到一个pivot在median附近（至少1/3的元素
小于他，同时至少1/3的元素大于他），那么这样quicksort的复杂度最坏情况下也是O(
nlogn)了，不过实际中没太多人用这个版本，因为其实实际的performance不如那个随
机选pivot的版本 |
|
n******n
发帖数: 567 | 36 class Tree{
Node head;
class Node{
urlPair[k] topKlist;
Time start;
Time end;
Time pivot
Node left;
Node right;
public urlPair[] query(Time qstart, Time qend){
if(qstart <= start && qend >= end)
return this.topKlist;
urlPair[] left = new urlPair[k];
urlPair[] right = new urlPair[k];
if(qstart < pivot)
leftResult = left.query(qstart, pivot);
if(qend > pivot)
rightResult = right.query(pivot, qend);
return merge(leftResult, rightResult);
}
public void add(Time start, Time end, urlPair[] in){
urlPai... 阅读全帖 |
|
G****A
发帖数: 4160 | 37 这两道题onsite肯定拿不下来啊
1. 算是binary search的一个应用。2分法找pivot，对于每个pivot计算相应的
expected k. 如果expected k和当前pivot的位置吻合(i.e., k >= A[pivot] && k <=
A[pivot + 1])，则返回k
2. 他应该不是想求最优解吧？！能不能给个heuristic？ 排序 p(i) / (l(i) * w(i))
,然后顺序选取。
26, |
|
G****A
发帖数: 4160 | 38 这两道题onsite肯定拿不下来啊
1. 算是binary search的一个应用。2分法找pivot，对于每个pivot计算相应的
expected k. 如果expected k和当前pivot的位置吻合(i.e., k >= A[pivot] && k <=
A[pivot + 1])，则返回k
2. 他应该不是想求最优解吧？！能不能给个heuristic？ 排序 p(i) / (l(i) * w(i))
,然后顺序选取。
26, |
|
G********p
发帖数: 3504 | 39 The following are the pivot points for SPY. Pivot High: $178.610, Pivot Low:
$176.350. These were calculated using the DeMark method. It is generally
believed to be bullish when price breaks out above the pivot high or bearish
when price breaks down below the pivot low. |
|
G********p
发帖数: 3504 | 40 The following are the pivot points for SPY. Pivot High: $180.845, Pivot Low:
$178.705. These were calculated using the DeMark method. It is generally
believed to be bullish when price breaks out above the pivot high or bearish
when price breaks down below the pivot low.
Hopefully, it will cross over 181. |
|
f*******2
发帖数: 341 | 41 http://www.fool.com/investing/general/2015/09/19/qualcomm-start
Qualcomm Starts Its Latest Round of Cuts
The mobile chip giant starts to implement its turnaround plan. Can it pivot,
too?
Earlier this year, mobile chip giant Qualcomm (NASDAQ:QCOM) announced a new
Strategic Realignment Plan as part of a broader turnaround effort. The
company's business has been under different kinds of pressure due to slowing
growth in the smartphone market as well as "changing industry dynamics,"
particularly in ... 阅读全帖 |
|
p*********y
发帖数: 2288 | 42 ft
这个还要争？如果pivot foot确定了，离地可以，但必须两只脚同时离地，然后在落地
前出手，pivot foot离地，非pivot foot在地上是不允许的
因为pivot foot离地以后，neither foot can touch gorund before release the
ball
不然的话，我确定了pivot foot,然后抬起来，另一只脚一只单脚跳着去上篮 |
|
r***v
发帖数: 12658 | 43 NCAA也没说不许抬pivot啊
说的是pivot may be lifted吗？但是球出手前not returned to the playing court
跟FIBA的规则是一样的啊
FIBA 原文
25.2.2
To pass or shoot for a field goal, the player may jump off a pivot foot, but
neither foot may be returned to the floor before the ball is released from
the
hand(s).
这里也是说pivot可以离地，但是在球出手前两脚都不能回到(return)地面，也就是非
pivot一直在地面是可以的 |
|
s*****c
发帖数: 753 | 44 So the NCAA allow you to "lift" pivot foot whereas FIBA says you may "jump
off" a pivot foot. So here is an obvious difference.
If I come to a stop with my pivot foot at the back. Can I stop there for 3
seconds to see if I can pass, and then decided to shoot, so I lift my back
pivot foot (not jump off yet), move it forward in air, then jump off my non-
pivot foot. Is that legal in FIBA?
Also, FIBA rule says "neither foot" may be returned to the floor. So how
about 三步上篮？ My understanding to t... 阅读全帖 |
|
s*****c
发帖数: 753 | 45 That is called jump-stop.
After you catch the ball in air, or stop the dribbling in air, you can land
with one foot/(or two feet simultaneously) and jump off that foot and land
with both feet to come to a stop. In FIBA/NCAA rule neither foot is pivot
foot. You can
lift your foot off ground (like jumping off) then shoot or pass in air
before landing. But you can't pivot.
In NBA rule, after jump stop, you can pivot. If one foot is ahead of the
other foot, the one on the back is the pivot. If n... 阅读全帖 |
|
n*****n
发帖数: 1029 | 46 另外解释一下所谓的三步上篮。很多人以为三步上篮是规则对于走步的一个特殊变通，
其实是不对的。三步上篮是严格遵守走步判定的规则的！
规则规定：pivot可以离地，但在pivot落地前必须出球。
在控球球员空中收球后，落地的第一只脚（比如右脚）即为pivot foot。这时候球员又
向前一步，左脚落地，右脚抬起，这是规则允许的：pivot可以离地。最后左脚起跳，
双脚腾空，只要在右脚（pivot）落地前出球，就符合上面提到的规则。 |
|
y**********7
发帖数: 769 | 47 我倒不觉得LZ有reverse pivoting. REVERSE PIVOT是上杆时重心在左脚,而下杆时重心
移动到右脚. 重心的移动与正常挥杆刚好相反. LZ 挥杆时重心始终在左脚,所以应该没
有reverse pivoting,因而也不会出现FAT的情形.
有一个很爱研究GOLF的朋友告诉我重心始终在左脚是韩国女职业球手最近发明的新技术
. 特点是技术简单,击球的稳定性和距离都很好. 我是没有核查,只是随便提一下.
我觉得LZ的挥杆看起来最不舒服的是左膝严重内弯. 上杆时,左脚跟不必抬起. 左膝严
重内弯是我在国内练习场看到的常见情况. 估计是韩国教练的杰作,因为我看了两个韩
国教练就是这样挥杆,双脚平行站立就会出这个问题.
成了reverse pivoting. 正确的stance是在整个backswing中, 保持重心60-70%在右脚
上, 双腿(从你的对面看)呈稳定的反K字形, 也就是说, 左膝只是前移不能内弯, 右膝
在setup的时候就内弯一些并在整个挥杆过程中保持这个弯度不变, 这个是防止你hip左
移太多(因而造成reverse pivot)的关键. 而且保持这 |
|
l**********n
发帖数: 8443 | 48 这个很难吗？
function quicksort(array)
if length(array) ≤ 1
return array // an array of zero or one elements is already sorted
select and remove a pivot element pivot from 'array' // see '#Choice
of pivot' below
create empty lists less and greater
for each x in array
if x ≤ pivot then append x to less
else append x to greater
return concatenate(quicksort(less), list(pivot), quicksort(greater)) //
two rec |
|
O*******d
发帖数: 20343 | 49 贴在这里,面试时也许用得上
void quickSort(int * a, int len)
{
if(len > 1)
{
int pivot;
int *up, *down;
int c;
/* choose the first element as pivot */
pivot = *a;
/* set up and down */
up = a + 1;
down = a + len - 1;
while(up < down)
{
/* partition */
while(up < down && *up <= pivot)
++up;
while(up < down && *down > pivot)
--down;
if(up < down)
{
c = *up;
*up = *down;
|
|
a***m
发帖数: 666 | 50 不知道发在哪里好，就发这里了。这里能人多，能不能帮我一个忙。我正在学excel
VBA，今天遇到一个pivot table问题。The routine is to filter the page field
for the dates before 30 Nov 2013. But it doesn't work. The system pops up an
error message: object or application defined error. 可是我找死都找不到问题
在哪里。也许你们看到那个inputbox function 很奇怪。本来我想通过它输入一个日期
，然后pivot table根据输入的日期自动filter the pivot table。但是有问题。我就
用30/11/2013来测试。可惜还是没反应。愁呀，求大牛帮忙，不胜感激。
Sub Update()
Application.Calculation = xlCalculationManual
Worksheets("pivot").Select
ActiveSheet.Pivo... 阅读全帖 |
|
