|
l****t
发帖数: 42 | 2 这是我几个月之前总结的过去几年发生过binary events (> 50% price change) 的生
物科技类股票。大家有兴趣可以研究一下。希望对各位赌徒们有帮助。。。
总的看来，涨的机会稍微大一些，但是n X的情况相当罕见。
文件用Excel打开就可以了。。。 |
|
|
s*******2
发帖数: 1182 | 4 我也只是有这方面的兴趣，搞这个网站也没有拉谁下水的意思。 但大家似乎对binary
option 恨之入骨。估计是受到那些scam的broker的骗了吧？
有人在NADEX做过交易吗？ 听说那里挺正规的。其他的brokers 由于缺乏监管，可能存
在一些问题。
NADEX 的买卖差价大也是存在的，收trade cost 也是事实， 但在NADEX trade 也是赌
博吗？ 谁有在NADEX trade 的经验，给大家介绍一下？ 多谢 |
|
|
s*******2
发帖数: 1182 | 6 我炒股已经很长时间了，个中滋味体会很深。
hourly binary option trade 应该是一种不同的感觉。我会找一个可靠的broker，以
非赌博的心态去小试一下。
您所说的适不适合，无非就是能否控制好风险，这方面我做得还好。 |
|
y******i
发帖数: 2584 | 7 我有两个问题请教
1.能建立对冲组合并可能赢利吗，同时考虑到bid ask的spread和交易费？
2.有个股的binary option吗？ |
|
发帖数: 1 | 8 10/02/2017 Update
原先的题头“ALDX涨疯了”，已经被我改作
“暴涨暴跌 生药股：A Binary Event-driven Casino”，
用于真实反映 BioPharma Sector 的 gambling妖性。
以后就用这个thread来记录本行业中上天入地的疯狂performance。 |
|
G*F
发帖数: 427 | 9 Vanquish我没打穿就觉放下了。Binary Domain的storyline要有趣多了。 |
|
w*****g
发帖数: 16352 | 10 binary这个词不政确，你们码农要与时俱进，不能只写0和1了！
★ 发自iPhone App: ChineseWeb 16
★ 发自iPhone App: ChineseWeb 16 |
|
a*o
发帖数: 19981 | 11 这啥烂bug？为啥好多文章都来这么一出？
发信人: fancieryu (Breeze), 信区: paladin
标 题: Re: 有什么好方法找int的binary表示里面1的个数？
发信站: BBS 未名空间站 (Sun Apr 4 23:15:19 2010, 美东)
by the way, you can also mention that the instruction POPCNT in x86 SSE4 can
do it by hardware. |
|
t*****g
发帖数: 6 | 12 For WindowsXP system, could not find any binary version of 2.X version of apache
anybody has a compiled version? or anyone can tell me how to compile the
source in windows? do you have to have VC++?
Any other really stable web servers for Win XP? Apache 1.x seems has some bug
with XP.
TX |
|
f***h
发帖数: 52 | 13 放binary code, executable files |
|
R*******N
发帖数: 7494 | 14 怎样在C++中表示一个binary tree呢?
用几维数组? |
|
I**********s
发帖数: 441 | 15 You better use linked structure. Use array for tree is rare, one notable
exception is the heap which is a balanced binary tree and all the external
nodes are in the left-most positions, so there is no hole in the array
representation. |
|
g**u
发帖数: 504 | 16 【 以下文字转载自 Computation 讨论区 】
发信人: gubu (法相), 信区: Computation
标 题: 问一个C++的binary search tree类实现问题
发信站: BBS 未名空间站 (Mon Jan 30 16:55:19 2012, 美东)
我想让search返回一个指向node的指针，下面代码编译有错误，不知道错在哪里？
错误提示是
error: expected constructor, destructor, or type conversion before ‘*’
token
search函数的实现如下：
template
BinarySearchTree::tree_node* BinarySearchTree::search(tree_node* p, T
d)
{
if(p==NULL||d==p->data)
return p;
else if(d>p->data)
return search(p->right,d);
else
... 阅读全帖 |
|
w********r
发帖数: 14958 | 17 linked binary tree 更容易啊。
array你还得计算child/parent index。 现在你省事了，直接就有child，parent指针
了。 |
|
w********r
发帖数: 14958 | 18 linked binary tree 更容易啊。
array你还得计算child/parent index。 现在你省事了，直接就有child，parent指针
了。 |
|
t********k
发帖数: 808 | 19 I want to read or write a binary file in pb5.
But the functions,such as FileRead,FileWrite are
work in ASCII.So i want to use API functions.
OpenFile or CreateFile
ReadFile or ReadFileEx
WriteFile or WriteFileEx
CloseHandle
Can you tell how to declare these extern functions
in pb?
BTW,do we can use following functions in pb?
How to declare them?
_lopen,_lread,_lwrite,_lclose
Thanks. |
|
t********k
发帖数: 808 | 20 I want to read or write a binary file in pb5.
But the functions,such as FileRead,FileWrite are
work in ASCII.So i want to use API functions.
OpenFile or CreateFile
ReadFile or ReadFileEx
WriteFile or WriteFileEx
CloseHandle
Can you tell how to declare these extern functions
in pb? |
|
q*****z
发帖数: 191 | 21 Hi,
I am new to .net but have used c for years. I met a problem recently using .
net C++. What I want to do is to use openFileDialog() to open a file and
write some binary information to it. Here is what I have:
SaveFileDialog^ d = gcnew SaveFileDialog;
d->Filter = "exp files (*.exp)|*.exp";
if (d->ShowDialog() == System::Windows::Forms::DialogResult::OK)
{
FILE *fid;
fopen(fid,d->FileName,'wb+');
fwrite(buf,1,frameSize,fid);
fclose(fid);
}
It seems like d->Filename does't return the standard st |
|
z****n
发帖数: 28 | 22 In a binary tree, the depth of the deepest nodes, and the depth of the
shallowest nodes, do 'the deepest' and 'the shallowest'refer to the same nodes
or different nodes? Thanks a lot! |
|
b******y
发帖数: 9224 | 23 最近想找个免费的share binary file的服务。有人用过吗？好像google docs只是可以
share pdf, word, excel files. |
|
L*****k
发帖数: 13042 | 24 好像只有几个linux distro和solaris有
prebuilt binaries. |
|
w*s
发帖数: 7227 | 25 using gdbserver now,
where to download gdb binary for arm ?
how to build from scratch ? |
|
s********k
发帖数: 6180 | 26 【 以下文字转载自 JobHunting 讨论区 】
发信人: silverhawk (silverhawk), 信区: JobHunting
标 题: linux怎么读入一个超过有超过1B integer的binary file？
发信站: BBS 未名空间站 (Fri Oct 26 10:40:33 2012, 美东)
用什么最好？fread，fseek或者先用mmap？如果内存一下装不下，怎么能分段读？
谢谢 |
|
A*X
发帖数: 53 | 27 What's the easiest way to add two binary numbers? Like 0110+0011=1001. |
|
b*****a
发帖数: 11 | 28 【 以下文字转载自 JobHunting 讨论区 】
发信人: bazooka (bazooka), 信区: JobHunting
标 题: 求binary search的直径（最大的d(nodei,nodej))怎么最快
发信站: BBS 未名空间站 (Tue Dec 5 01:28:40 2006)
谢谢 |
|
g****z
发帖数: 2 | 29 How to read and write binary files (floating point data I/O) in Java?
Thanks! |
|
e**e
发帖数: 3 | 30 Did the Fortran program use "direct access" or "sequential access" to
write the binary file?
If "sequential access", each write statement will produce one record
in the data file, and the record is prefixed and postfixed with the
integer value that is the length of that record. For example
open(unit=..., file="...", access="sequential", form="unformatted")
write(unit=...)1.23d0
will write the four-byte integer "8", the eight-byte double "1.23d0",
and again the four-byte integer "8". The "8 |
|
d*****i
发帖数: 44 | 31 工作中遇到一个难题,请高手指教.
条件:只有一个coredump，gdb,我可以找到coredump中binary tree的root
使用gdb中的command,convenience variable可以支持简单的variable,loop,if else.
但是不支持array,而且没有stack（all variable are global).
请问如何遍历？不管效率。谢谢 |
|
b***y
发帖数: 2799 | 32 binary tree的大面试题，主要是以下要点吧：
recursive pre-order, in-order, post-order traversal
nonrecursive traversal, with/without stack
按层次traverse结点
列出所有从顶到底的路径
确定pre-order, in-order, post-order下的某结点的predecessor, successor
请问还有别的吗？树的问题，大家学的时候有什么经验，哪些知识点能起提纲挈领的作
用？
多谢了！ |
|
i***h
发帖数: 12655 | 33 我不是牛, 可是binary tree就这么点东西啊 |
|
h*******e
发帖数: 225 | 34 就算只考binary tree相关的东西也可以问到死啊 |
|
h***z
发帖数: 233 | 35 Why do you want to write ascii file as binary file? If it's for space
savings, easiest way is to just compress it using a standard compression
format that you have libraries for in all 3 languages. |
|
l***g
发帖数: 1035 | 36 what is your binary file? |
|
b***y
发帖数: 2799 | 37 ☆─────────────────────────────────────☆
birdsman (birdsman) 于 (Mon Mar 24 03:30:52 2008) 提到:
VS2005下面很简单的一段代码，
ofstream os("f", ios::binary);
float iii = 7.00001;
os << iii;
os.close();
结果得到的文件f有7个字节，显然是text mode
有谁知道这是咋回事？ 多谢
☆─────────────────────────────────────☆
birdsman (birdsman) 于 (Mon Mar 24 03:49:51 2008) 提到:
我觉得不是，如果bin模式存，应该只会占用4个字节
☆─────────────────────────────────────☆
birdsman (birdsman) 于 (Mon Mar 24 03:57:29 2008) 提到:
昏，当然不是。
float是4个bytes，7.00001的text表示就是7个bytes |
|
b***y
发帖数: 2799 | 38 ☆─────────────────────────────────────☆
CplusplusFan (C++ Fan) 于 (Sat Sep 27 17:45:03 2008) 提到:
最近在看binary search tree,在遍历概念上还是不太明白，
是不是pre-order，in-order和post-order都是属于DFS(深度优先)遍历，
而BFS(广度优先)则是另外一类遍历?
☆─────────────────────────────────────☆
CrendKing (Crend King) 于 (Sat Sep 27 22:46:32 2008) 提到:
对。DFS递归地访问每一个非叶节点的左子树，然后是又子树。BFS则是从左到右按层来
访问的。
☆─────────────────────────────────────☆
gandalf2008 (修练神功~) 于 (Tue Sep 30 22:02:11 2008) 提到:
dfs is very similar to pre-order
以下是附件内容: |
|
X****r
发帖数: 3557 | 39 Traversing a binary search tree is O(n) time and O(1) space, right?
Just to traverse two trees together, removing nodes from one tree
and insert them into the right place of the other, like merge sort. |
|
H*M
发帖数: 1268 | 40 traversing a binary search tree is O(1) space? how?
if recursion ->no
if iterative, need stack a... |
|
a*******i
发帖数: 67 | 41 有一个用工程类的软件生成的binary file，用常用的notepad打开的时候全是乱码，怎
么样才能读取到其中的内容， 谢谢！ |
|
c*******9
发帖数: 6411 | 42 int a = -20;
c = (a>>31);
running the code get c = -1, and a and c's binary presentation are:
11111111111111111111111111101100 (a)
11111111111111111111111111111111 (c)
my question is a>>31 should be 00000000000000000000000000000001, how come
the c value is -1.
thanks. |
|
s********k
发帖数: 6180 | 43 【 以下文字转载自 JobHunting 讨论区 】
发信人: silverhawk (silverhawk), 信区: JobHunting
标 题: linux怎么读入一个超过有超过1B integer的binary file？
发信站: BBS 未名空间站 (Fri Oct 26 10:40:33 2012, 美东)
用什么最好？fread，fseek或者先用mmap？如果内存一下装不下，怎么能分段读？
谢谢 |
|
r*****e
发帖数: 792 | 44 first of all, I believe the goal is to build a balanced binary
search tree. Otherwise, it's too easy.
Note, most of the times, if you are not allowed to use recursion, then use
stack explicitly can do the same. |
|
n**********2
发帖数: 214 | 45 题目明明说是连续修改，选2却是错的，为什么？
Q.3) To store a collection of values in sorted order, where you expect the
collection to be continuously modified, it would be best to use which of the
following?
A. Array
B. Linked list
C. Binary search tree (Correct Answer)
D. Hashtable |
|
L*****e
发帖数: 8347 | 46 不觉得你想偏了。。。
前半句话“To store a collection of values in sorted order”是说要把数据
sorted地存到某个数据结构中去；后半句“where you expect the collection to be
continuously modified”说以后要对这个数据结构中的数据continously modify。
insert的时候，Binary search tree比linked list快是显然的，但是continous
access的时候，显然linked list要比BST要快。如果是insert是一次性的，而以后
modification是大量的话，应该选择linked list。
不过，题目模糊的地方是，没有说清楚所谓的modify collection是modify什么，
modify的东西是不是要re-sort？
不知道你做的是什么题，从你贴出来的另外两道题看，这套题的质量不高。。。 |
|
p**o
发帖数: 3409 | 47
Below is some BST C code that I wrote in the past.
In the iterative version (O(1) space), finding the successor
of a given node is definitely not an O(1) time operation.
Recursion would trade space for time though.
/* Binary Search Tree struct */
typedef struct node {
int value;
struct node * parent;
struct node * left;
struct node * right;
} node_t;
/* Find the smallest node from a given subtree. */
node_t * min (node_t * n)
{
if (!n) return NULL;
while (n->left) n = n... 阅读全帖 |
|
n**********2
发帖数: 214 | 48 题目明明说是连续修改，选2却是错的，为什么？
Q.3) To store a collection of values in sorted order, where you expect the
collection to be continuously modified, it would be best to use which of the
following?
A. Array
B. Linked list
C. Binary search tree (Correct Answer)
D. Hashtable |
|
