l**T
发帖数: 19 | 1 【 以下文字转载自 ME 讨论区 】
发信人: lowT (lowT), 信区: ME
标 题: 请教个FIB的问题.
发信站: BBS 未名空间站 (Mon Mar 14 23:19:14 2011, 美东)
我在用FIB做contact,发现用FIB沉积的线电阻很大,远大于样品的电阻,导致测量非常困
难.
有用过FIB的前辈,给点建议吧.. |
|
l**T
发帖数: 19 | 2 我在用FIB做contact,发现用FIB沉积的线电阻很大,远大于样品的电阻,导致测量非常困
难.
有用过FIB的前辈,给点建议吧.. |
|
l******e
发帖数: 151 | 3 as far as I know, the price is same. It's ridiculous that there is a price
difference when there are multiple companies is available to provide the
service, and FIB is not really a high tech at all.
Any FIB services do pad growth on the silicon. |
|
|
m*******i
发帖数: 8711 | 5 黄教授的笑话：CIF and FOB
CIF = Can I fuck?
FIB = Free On Bed. |
|
l******e
发帖数: 151 | 6 So... is price high? --- 1st question.
2nd question: So do you know that these requirements will be asked before
FIB services, since the passivation layer (not persavation) is always a
problem to any microscopes due to charging issue (BTW, this is physics, like
it or not)?
at |
|
n******n
发帖数: 3 | 7 本人主要从事FIBID(Focused-Ion-Beam Induced Depostion)的研究，也涉及一些FIB
etching，Electron Beam Lithography的研究，如果有从事类似研究的网友大家交流交
流吧。 |
|
A*******s
发帖数: 9638 | 8 昨天晚上睡得晚， 3am医院ICU page我， 我迷迷糊糊打电话， 刚说我不oncall，对方
说了个名字，我一下子全醒了。
这个病人是我的一个老病人， 在医院工作，67岁，她有osler-weber-rendu disease，
epistaxis是常事， 最近出现A-Fib， 因为coumadin引起出血， 所以不能服。
一个星期以后， 她出现中风，因为出血的原因， 不能上heparin， 第二天她在医院又出现右手臂动脉栓塞。 所幸手术后没事。 没办法，她需要抗凝， 所以开始服用Pradaxa。
出院后epistaxis似乎没大问题， 没想到她出现贫血， 血色素只有6。 入院后输血， Pradaxa只能停掉。
(中文太难打了。。。）
I started her on heparin. Consulted GI/Surgery for endoscopy. Surgery did
the upper and lower GI scope and I was told she has possible AVM but no
active bleeding.
I do not kn... 阅读全帖 |
|
A*******s
发帖数: 9638 | 9 I am aware of the study. Thanks for the link.
Her CHA2DS2-vasc score is 4, same as HAS-BLED Score. Risks for stroke and
bleeding are 2% and 8% respectively. But we can not only use the numbers.
These numbers tell us she is on high risks for stroke as well as bleeding.
She was not started on OAC after being found to have A-fib. After she had
the stroke, she was not started on heparin either. But on the 2nd day of stroke, she had
the 2nd emboli to right arm. Then she was started on heparin. Aft... 阅读全帖 |
|
A*******s
发帖数: 9638 | 10 Age, female. That's it. She was pretty healthy until the A-fib.
No coagulopathy and TTE was neg. No TEE since she would be on Pradaxa
anyway.
She understood the risks prior to be on anticoagulations including heparin. |
|
A*******s
发帖数: 9638 | 11 No heparin for any strokes. For a-fib, it depends.
hemorrhagic |
|
y******a
发帖数: 590 | 12 I probably didn't ask the questions in a clear way. My question is, if pt
does have a condition require anticoagulation, when would you start it after
the stroke? for example, if a pt came in with a massive MCA ischemic
stroke, and a newly identified a fib, when is the appropriate time to give
heparin/coumadin, considering the risk of hemarrhagic conversion? and will
you give both aspirin and plavix for anti platelet agent or only one of them
? I am not a neurologist, but my experience with ... 阅读全帖 |
|
A*******s
发帖数: 9638 | 13 Usually start coumadin within 2 wks after a massive infarct with a-fib. There
is a guideline for this.
Avoid anticoagulation for any new massive infarct. But it depends.
after
will
them |
|
A*******s
发帖数: 9638 | 14 昨天晚上睡得晚， 3am医院ICU page我， 我迷迷糊糊打电话， 刚说我不oncall，对方
说了个名字，我一下子全醒了。
这个病人是我的一个老病人， 在医院工作，67岁，她有osler-weber-rendu disease，
epistaxis是常事， 最近出现A-Fib， 因为coumadin引起出血， 所以不能服。
一个星期以后， 她出现中风，因为出血的原因， 不能上heparin， 第二天她在医院又出现右手臂动脉栓塞。 所幸手术后没事。 没办法，她需要抗凝， 所以开始服用Pradaxa。
出院后epistaxis似乎没大问题， 没想到她出现贫血， 血色素只有6。 入院后输血， Pradaxa只能停掉。
(中文太难打了。。。）
I started her on heparin. Consulted GI/Surgery for endoscopy. Surgery did
the upper and lower GI scope and I was told she has possible AVM but no
active bleeding.
I do not kn... 阅读全帖 |
|
A*******s
发帖数: 9638 | 15 I am aware of the study. Thanks for the link.
Her CHA2DS2-vasc score is 4, same as HAS-BLED Score. Risks for stroke and
bleeding are 2% and 8% respectively. But we can not only use the numbers.
These numbers tell us she is on high risks for stroke as well as bleeding.
She was not started on OAC after being found to have A-fib. After she had
the stroke, she was not started on heparin either. But on the 2nd day of stroke, she had
the 2nd emboli to right arm. Then she was started on heparin. Aft... 阅读全帖 |
|
A*******s
发帖数: 9638 | 16 Age, female. That's it. She was pretty healthy until the A-fib.
No coagulopathy and TTE was neg. No TEE since she would be on Pradaxa
anyway.
She understood the risks prior to be on anticoagulations including heparin. |
|
A*******s
发帖数: 9638 | 17 No heparin for any strokes. For a-fib, it depends.
hemorrhagic |
|
y******a
发帖数: 590 | 18 I probably didn't ask the questions in a clear way. My question is, if pt
does have a condition require anticoagulation, when would you start it after
the stroke? for example, if a pt came in with a massive MCA ischemic
stroke, and a newly identified a fib, when is the appropriate time to give
heparin/coumadin, considering the risk of hemarrhagic conversion? and will
you give both aspirin and plavix for anti platelet agent or only one of them
? I am not a neurologist, but my experience with ... 阅读全帖 |
|
A*******s
发帖数: 9638 | 19 Usually start coumadin within 2 wks after a massive infarct with a-fib. There
is a guideline for this.
Avoid anticoagulation for any new massive infarct. But it depends.
after
will
them |
|
s***c
发帖数: 1926 | 20 你说的就是DP加滚动数组啊，任何一本面试书里的最基本题。
#include
using namespace std;
int Fib[3];
int fib(int n)
{
Fib[1] = 0;
Fib[2] = 1;
for(int i = 2; i <= n; ++i)
{
Fib[0] = Fib[1];
Fib[1] = Fib[2];
Fib[2] = Fib[0] + Fib[1];
}
return Fib[2];
}
int main()
{
int ncase, n, ans;
scanf("%d", &ncase);
while(ncase--)
{
scanf("%d", &n);
ans = fib(n);
printf("%dn", ans);
}
return 0;
} |
|
a*****j
发帖数: 2 | 21 来自主题: JobHunting版 - G的面试题 FindFibSum(n, fib_list)
Find k such that Fib(k)< n < Fib(k+1)
Add k into the fib_list
FindFibSum(n-Fib(k));
End
Expand the fib_list using Fib(k) = Fib(k-1) + Fib(k-2) rules
For example,
n = 12
FindFibSum(12) ->
k = 5, FindFibSum(4) ->
k = 3, FindFibSum(1) ->
k = 1
fib_list = 5, 3, 1
-> 4, 3, 3, 1 x
-> 5, 2, 1, 1 x
The final answer is 5, 3, 1 = 10101 |
|
t****a
发帖数: 1212 | 22 顺便测试了一下python做fib的性能（single thread)
def fib(n):
if n < 2:
return(n)
else:
return(fib(n-1)+fib(n-2))
import timeit
print timeit.timeit("fib(36)", number=1, setup="from __main__ import fib")
速度大约是clojure single thread的10% |
|
H********g
发帖数: 43926 | 23 a
every round
we get a,c,(b+c)
so
a,b,c
R1 a,0b+c,(b+c)
R2 a,(b+c),(b+2c)
R3 a,(b+2c),(2b+3c)
R4 a,(2b+3c),(3b+5c)
R5 a,(3b+5c),(5b+8c)
R6 a,(5b+8c),(8b+13c)
...
9 rounds is quite easy for primary scholar
For MaNong, that should be R(n) : fib(n-1)*b+fib(n) *c, where fib() is
Fibonacci function with fib(0)=1,fib(1)=1,fib(2)=2
==
给定三个自然数1，2，3，对这三个数进行一次操作：将其中一个数换成另两个数的和
，这样进行9次操作后，所得的三个自然数中，最大数的最大可能的值为多少？
== |
|
e****0
发帖数: 678 | 24 Management of A fib.
1. if the A fib is the first A fib and pt never had any other health
problems, we wait it out or do a cardio version, either of which will
convert back to NSR.
2. If pt has recurrent A fib,
A. if pt only has A fib, no other cardiovascular disease
1) Class IC – to start this category with a low dose. Watch QRS duration
May choose flecanide or Propafenone, if one is unsuccessful, chose another
one.
2) Class III
3) Ablation and amiodarone (reserve amiodarone as the last choice ... 阅读全帖 |
|
t****a
发帖数: 1212 | 25 这是很有趣的问题: 如何编写并行的recusion?
我在i5 macbook pro上做了个小试验: 并行的recusion based fib函数，用FP语言(
clojure)来实现：
单thread版本:
(defn fib [n]
(if (< n 2)
n
(apply + (map fib [(dec n) (- n 2)]))))
(time (fib 32)); "Elapsed time: 1851.765 msecs"
并行版本:
(defn pfib [n m]
(if (< n 2)
n
(if (> (- m n) 4)
(apply + (map fib [(dec n) (- n 2)]))
(apply + (pmap #(pfib % m) [(dec n) (- n 2)]))
)))
(time (pfib 32 32)); "Elapsed time: 1170.566 msecs"
用clojure写并行很容易，将map改为pmap就可以了。从速度上看，提高了接近1倍... 阅读全帖 |
|
j**7
发帖数: 143 | 26 public static void fib(int n)
{
int [] DP=new int[n+1];
DP[1]=1;
fib(n,DP);
for(int i=0;i
{
System.out.print(DP[i]+" ");
}
}
public static int fib(int n,int [] DP)
{
if(n==0)
return 0;
if(n==1)
return 1;
if(DP[n]!=0)
{
return DP[n];
}
DP[n]=fib(n-1,DP)+fib(n-2,DP);
return DP[n];
} |
|
t*s
发帖数: 1504 | 27 sum [] = 0
sum x:xs = x + sum xs
我说的就是这种，这类型的在python/c/java里面就是if if 的事情
if 还不光看pattern, value也能一并看了。
fibs :: [Integer]
fibs = 1:1:zipwith (+) fibs (tail fibs)
python里面yield from, yield来构建generator也很方便，例如
def fibs():
a,b=1,1
yield from (a,b)
while True:
a,b=b,a+b
yield b
guard我去看了一下，这也叫feature? 难怪我不记得。就是switch case case |
|
t*s
发帖数: 1504 | 28 sum [] = 0
sum x:xs = x + sum xs
我说的就是这种，这类型的在python/c/java里面就是if if 的事情
if 还不光看pattern, value也能一并看了。
fibs :: [Integer]
fibs = 1:1:zipwith (+) fibs (tail fibs)
python里面yield from, yield来构建generator也很方便，例如
def fibs():
a,b=1,1
yield from (a,b)
while True:
a,b=b,a+b
yield b
guard我去看了一下，这也叫feature? 难怪我不记得。就是switch case case |
|
t****a
发帖数: 1212 | 29 sudoku solver如果用recusion的话，会在函数中多次call自己对吧？因为某个格子有
多种可能取值，那就要call多次, 也就是
solver(X) = solver(X1) or solver(X2) or ... or solver(Xn) 这里用X表示sudoku
的状况，solver函数返回T or F。
简单起见我就写了个fib，也是一样，fib(n) = fib(n-1) + fib(n-2)，可以把这种计
算用map函数来实现，再将map换成pmap就并行啦。程序里有个if来控制生成的thread个
数，生成太多就糟了，刚才试过，不加控制生成太多thread会直接挂掉。
其实map-reduce的map灵感也就来自lisp的map。
回到sudoku，这个并行要难一些，因为它是个有回溯的过程，map出的有些子函数很早
结束有些晚结束，所以用相同的逻辑并行效率不好。如果用个全局变量来估算当前的
thread个数并据此判断用map还是pmap会好一些。
不得不说这样的实现实在很丑陋... 如果有人能把lazy evaluation的思路加进去，把
recusi... 阅读全帖 |
|
b******a
发帖数: 215 | 30 inline函数不就是直接用code去代替函数的指针从而减少程序跳来跳去。如果是这样
的话，是不是就会无限的代替下去？
呵呵。我用Fibonacci function试了一下好像没有任何问题。 MSVS 6.0.
#include
using namespace std;
inline int fib(int num)
{ switch(num) {
case 0:
return(0);
break;
case 1:
return(1);
break;
default:
return(fib(num - 1) + fib(num - 2));
break;
}
}
main()
{
int sum=fib(9);
cout<
return s |
|
y*******g
发帖数: 6599 | 31 递归不inline
inline和海盗法典一样 只是指导
inline函数不就是直接用code去代替函数的指针从而减少程序跳来跳去。如果是这样
的话，是不是就会无限的代替下去？
呵呵。我用Fibonacci function试了一下好像没有任何问题。 MSVS 6.0.
#include
using namespace std;
inline int fib(int num)
{ switch(num) {
case 0:
return(0);
break;
case 1:
return(1);
break;
default:
return(fib(num - 1) + fib(num - 2));
break;
}
}
main()
{
int sum=fib(9);
|
|
E*****m
发帖数: 25615 | 32
這怎麼來的？
你到底讀了那本書沒有？ 我覺得你沒有。
我說的 pattern matching 是這種
sum [] = 0
sum x:xs = x + sum xs
python 的太有限， 你看看這個經典算 Fibonacci series 的
fibs :: [Integer]
fibs = 1:1:zipwith (+) fibs (tail fibs)
python 做不到這麼精簡的
Learn You a Haskell for Great Good! 第四章
我不是Python 黑，事實上我是Python 粉， 不過各有
長處罷了。 |
|
E*****m
发帖数: 25615 | 33
這怎麼來的？
你到底讀了那本書沒有？ 我覺得你沒有。
我說的 pattern matching 是這種
sum [] = 0
sum x:xs = x + sum xs
python 的太有限， 你看看這個經典算 Fibonacci series 的
fibs :: [Integer]
fibs = 1:1:zipwith (+) fibs (tail fibs)
python 做不到這麼精簡的
Learn You a Haskell for Great Good! 第四章
我不是Python 黑，事實上我是Python 粉， 不過各有
長處罷了。 |
|
a*********a
发帖数: 3656 | 34 hmm, I thought long and hard how can a simple Fibonacci violate separation
of data and code.
Then I realized, that we were demonstrating how static computation can be
used to optimize run time. I said you can create a static table of fib
for n
imposed separation of data and code so algorithms to compute Fibonacci at
compile time are outlawed.
Very very impressive PPT skills you possess there! Your legal team should
have asked ... 阅读全帖 |
|
t*******a
发帖数: 4055 | 35 钱学森为何要离开连空气都充满香甜的美国？
“科学无国界”，这是西方舆论常常挂在嘴边的一句名言。但科学家有国界，钱学森是
中国人，对于他来说，打败法西斯之后，最迫切的任务就是回国，为中国导弹技术，航
空航天科技发展尽自己一份力量。在钱学森回国这个问题上，美国撕下了“自由民主”
的面具，展露了真实的丑恶嘴脸。直到今天为止，美国科学界有良知的知识分子仍然在
质疑美国当年做法。
【本文为作者向察网的投稿，文章内容纯属作者个人观点，不代表本网观点，转载请注
明来自察网(www.cwzg.cn)】
今天是10月8日，在1955年这一天钱学森一家四口人，历尽艰辛终于回到久违的祖国。
9月17日下午四时，钱学森带着妻子蒋英和一双儿女在洛杉矶港口登上“克利弗兰总统
号”邮轮，经停夏威夷，横滨，马尼拉。
10月8日接近香港中环码头时，由中国旅行社(香港)直接从邮轮接到驳船上，向北行至
九龙，再乘车抵达罗湖口岸，当天中午11点30分进入深圳，晚上抵达广州。
钱学森为何要离开连空气都充满香甜的美国？
钱学森从此结束了在美国长达五年的软禁岁月，重获人身自由，并为新中国“两弹一星
”事业做出了永载史册，不可磨灭的... 阅读全帖 |
|
n****e
发帖数: 629 | 36 先证明如果先拿的人拿到fib必败
然后证明如果先拿的人不是fib 必可以走到让后拿方式fib 而且不能全部提光的状态
12->11
18->13 |
|
l***8
发帖数: 149 | 37 use recursion and shortcut boolean:
int fib(int n)
{
return (n < 2) || (n = fib(n - 2) + fib(n - 1)), n;
} |
|
j*****u
发帖数: 1133 | 38 说实话这个题太没意思了，比用stack写queue还无聊。。
不知道这样写满不满足他的要求(不用全局变量)
int Fib(int n, int a, int b)
{
return n <= 1 ? b : Fib(n - 1, b, a + b);
}
wrapper function call的时候Fib(n, 1, 1);
2)
30 |
|
g*****i
发帖数: 2162 | 39 先谢谢了
1. 算POLYNOMIAL，比如5x^4+6x^3-7x^2-8=?
原文说思路是减少乘法变成x^2(x(5x+6)-7)-8, 然后找数据结构存数字和运算符.
我的问题是什么数据结构呢?是否要存prefix notation?
2.给你三个烤箱，每个烤箱可以同时烤两片面包，需要的时间分别是3分钟，4分钟和3
分钟。但第三个烤箱有一个slot出了点问题，每次只能烤面包的一面。所以这个烤箱三
分钟后只能算烤好一片半面包，你需要把那半片翻个面，在同一个slot里再烤一次才算
一片完整的。现在给你这三个烤箱，问烤好21片面包最少需要多少时间？如果是2100片
呢？如果是任意给定的N片，要求O(1)时间内给出最少需要的时间。
我的思路:12分钟正好20片没浪费,1-19事先算好存在array里.对吗?
3. read n lines of random numbers(space as delimiter) from a file, lines
with same numbers are treated as duplicated lines, regardless of the ... 阅读全帖 |
|
c*********t
发帖数: 2921 | 40 问用recursive求fib(n)的复杂度,是不是和求fib(n)值本身的方法一样？
两种方法：
1.数学表达式：用特征值
fib本身F(n) = F(n-1) + F(n-2), F(0) = 0, F(1) = 1
复杂度T(n) = T(n-1) + T(n-2), T(0) = 1, T(1) = 1
这两个的特征值都一样，就是因为初始值不一样，所以最后的系数不一样，对吧？
2. 如果用logn的方法，也可以，区别还是初始值，对吧？
谢谢！ |
|
f*****7
发帖数: 92 | 41 DP的定义是递归的
我们要得到原问题的最优解，就得先算出若干个子问题的最优解，然后extend到原问题
。我们不断地把大问题归结为若干个小问题，最后就是解决base case。这种思维方式
by nature就是递归的思想。----最优子结构
对于多个大问题，要解决它们所用到的子问题可能有重复。所以我们需要用cache记录
已经计算过的子问题，如果该子问题被解决过了，直接从cache中fetch子问题的解。如
果该子问题没有被解决，那么就解决这个子问题，并且将solution存在cache对应的
entry里。----重复子问题
这两个是DP的重要性质。
CLRS对于DP的算法有两种
1. Top-down recursion with memoization
这种写法就是递归，用数组保存子问题的solution。
好处在于解决某些大问题，并不需要tabulate所有的子问题的时候，我们可以节约计算
时间，类似lazy evaluation。子问题只有在需要的时候才会被计算。第二个好处是直
接从定义出发，递归结构清晰，易于调试。
坏处是递归函数需要OS维护stack frame，如果问... 阅读全帖 |
|
b*****o
发帖数: 715 | 42 iteration != recursion.
Take a very simple example of computing Fibonacci array:
(1) This is recursion, but NOT DP:
int fib(int n) {
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
(2) This is DP:
int fib_dp(int n) {
int a = 1;
int b = 1;
int sum;
for (int i=0;i
sum = a + b;
a = b;
b = sum;
}
return sum;
}
stored |
|
t*********n
发帖数: 89 | 43 10分钟前面完的，大家将就看看
白人小伙, project 5min
1. 检查BST
2. 计算逆波兰表达式
3. 检查两个日期之间的天数差距：
int calculateDays(int day1, int month1, int year1, int day2. int month2, int
year2)
不知道哪里人的口音，很奇怪，经常不知道他要问什么，project 5min . Linkedlist
vs Array
1. 数组中找两数sum为一个数
2. 打印Fib(N) ，如果n为奇数，打印"Fizz" fib(n) 次，如果n为偶数，打印“Buzz”
fib(n)次。
然后抱怨了下波士顿的天气...结束
两个面试官 都说了，HR will contact you by the end of next week. 希望是好消息
。 |
|
z****j
发帖数: 111 | 44 可能是我理解有点问题... 不过像fib（n） = fib（n-1） + fib（n-2）这样的递归式
它的optimal点体现在哪里呢？这个也可以算是optimal substructure吗 |
|
j****y
发帖数: 1714 | 45 【 以下文字转载自 Running 讨论区 】
发信人: joyjoy (joy), 信区: Running
标 题: Extreme Endurance Exercise and heart attack
发信站: BBS 未名空间站 (Sat Oct 5 01:52:16 2013, 美东)
我有同事骑自行车突然心脏病发作死亡。所以看了看锻炼过度和心脏病的关联的文章。
仅供参考：
http://fitness.mercola.com/sites/fitness/archive/2013/08/23/ext
By Dr. Mercola
Do you dread going to the gym for what feels like hours at a stretch? Or do
you avoid working out altogether because you just don't have the time? Then
what I'm about to tell you should be music to your ears: when it comes to... 阅读全帖 |
|
j****y
发帖数: 1714 | 46 【 以下文字转载自 Running 讨论区 】
发信人: joyjoy (joy), 信区: Running
标 题: Extreme Endurance Exercise and heart attack
发信站: BBS 未名空间站 (Sat Oct 5 01:52:16 2013, 美东)
我有同事骑自行车突然心脏病发作死亡。所以看了看锻炼过度和心脏病的关联的文章。
仅供参考：
http://fitness.mercola.com/sites/fitness/archive/2013/08/23/ext
By Dr. Mercola
Do you dread going to the gym for what feels like hours at a stretch? Or do
you avoid working out altogether because you just don't have the time? Then
what I'm about to tell you should be music to your ears: when it comes to... 阅读全帖 |
|
j****y
发帖数: 1714 | 47 【 以下文字转载自 Running 讨论区 】
发信人: joyjoy (joy), 信区: Running
标 题: Extreme Endurance Exercise and heart attack
发信站: BBS 未名空间站 (Sat Oct 5 01:52:16 2013, 美东)
我有同事骑自行车突然心脏病发作死亡。所以看了看锻炼过度和心脏病的关联的文章。
仅供参考：
http://fitness.mercola.com/sites/fitness/archive/2013/08/23/ext
By Dr. Mercola
Do you dread going to the gym for what feels like hours at a stretch? Or do
you avoid working out altogether because you just don't have the time? Then
what I'm about to tell you should be music to your ears: when it comes to... 阅读全帖 |
|
j****y
发帖数: 1714 | 48 我有同事骑自行车突然心脏病发作死亡。所以看了看锻炼过度和心脏病的关联的文章。
仅供参考：
http://fitness.mercola.com/sites/fitness/archive/2013/08/23/ext
By Dr. Mercola
Do you dread going to the gym for what feels like hours at a stretch? Or do
you avoid working out altogether because you just don't have the time? Then
what I'm about to tell you should be music to your ears: when it comes to
exercise, less is more.
It's becoming increasingly clear from the recent flurry of scientific
studies that overdosing on exercise can have detrimental... 阅读全帖 |
|
R*****s
发帖数: 41236 | 49 ☆─────────────────────────────────────☆
joyjoy (joy) 于 (Sat Oct 5 01:52:16 2013, 美东) 提到:
我有同事骑自行车突然心脏病发作死亡。所以看了看锻炼过度和心脏病的关联的文章。
仅供参考：
http://fitness.mercola.com/sites/fitness/archive/2013/08/23/ext
By Dr. Mercola
Do you dread going to the gym for what feels like hours at a stretch? Or do
you avoid working out altogether because you just don't have the time? Then
what I'm about to tell you should be music to your ears: when it comes to
exercise, less is more.
It's becoming increasingly clea... 阅读全帖 |
|
j****y
发帖数: 1714 | 50 【 以下文字转载自 Complain 讨论区 】
发信人: joyjoy (joy), 信区: Complain
标 题: 【投诉】running 版版主Rodimus威胁网友，无故删帖
发信站: BBS 未名空间站 (Sun Oct 6 02:20:59 2013, 美东)
我在running 版转帖了题为Extreme Endurance Exercise and heart attack的文章。
全篇文章都是认同跑步的好处，但是提醒过渡锻炼可能和心脏病有关联。
一些网友跳出来羞辱讽刺。我无所谓。文章总有喜欢和不喜欢的。
Rodimus对该帖极为不满，说running版不欢迎这类文章,封了很难看。同时说置顶文章
有类似讨论了。
我发帖反驳，问他是不是私人俱乐部，不允许公开发帖，同时要他拿出白底黑字的版规
看我违反了哪一条。我说我读了置顶文章，要么是空连接，要么内容不相同。
Rodimus 根本拿不出任何版规，居然发帖说我是受虐狂。
我发帖反驳说他动不动冒充全版不欢迎新人，还无根据威胁封人，是虐待狂。
Rodimus恼羞成怒，把我的帖子和后面更贴的对话全删了。
我要问站务，一个版... 阅读全帖 |
|
