9 research outputs found
Economic evaluation of asymmetric and price range information in gold and general financial markets
No full textVoluntary Adoption of Audit Committees, Ownership Structure and Firm Performance: Evidence from Taiwan
No full textTHE IMPACT OF A CROSS-BORDER CONGLOMERATE MERGER ON THE TARGET FIRM AND ITS RIVALS - A CASE STUDY OF FOXCONN’S ACQUISITION OF SHARP
Full text linkThis study explores how a cross-border conglomerate merger impacts the wealth of the acquiring firm and the target firm and its rivals, using the case of Foxconn’s acquisition of Sharp. Sharp’s rivals include domestic firms in the Japanese market and major rivals in the global market. Our results show that the announcement of this cross-border conglomerate merger leads to an increase in the shareholder wealth of Foxconn and Sharp. We also find that domestic rivals are impacted by this acquisition. By contrast, major rivals are not affected at all by this acquisition
Arbitrage opportunities, liquidity provision, and trader types in an index option market
No full text
Intraday Liquidity Provision by Trader Types in a Limit Order Market: Evidence from Taiwan Index Futures
No full text
Intraday Liquidity Provision by Trader Types in a Limit Order Market: Evidence from Taiwan Index Futures
No full textDeterministic and Efficient Hash Table Lookup Using Discriminated Vectors
No full textHash table is used in many areas of networking such as route lookup, packet classification, per-flow state management and network monitoring for its constant access time latency at moderate loads. However, collisions may become frequent at high loads in traditional hash tables, which may lead the access time complexity to be linear and intolerable to applications like high-speed route lookups. While some schemes were proposed to help resolve this problem and most of them may achieve O(1) average memory access per lookup, very few of them are able to cut down the access to a deterministic single one. In this paper, we design a structure called deterministic and efficient hash table (DEHT). In DEHT, a novel data structure on on-chip memory is built, with the help of which the off-chip memory access can be decreased to a single one at most per lookup even when the load of the hash table is very high. What's more, the on-chip data structure also plays a similar role as Bloom Filter to do membership screening, which can avoid most lookups of nonexistent items of the hash table visiting the off-chip memory. Through theoretical analysis and simulations, we show that our scheme is faster than other schemes in lookup operations; the usable load of the off-chip hash table, the memory efficiency and the false positive rate of the on-chip data structure are also favorable.Guangdong Science & Technology Project [2014B010117007]; Shenzhen Basic Research Program [JCYJ20140509093817684, JCYJ20150626110611869]CPCI-S(ISTP
