<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Collection:</title>
    <link>http://dspace.cityu.edu.hk:80/handle/2031/327</link>
    <description />
    <pubDate>Tue, 30 Apr 2013 10:02:36 GMT</pubDate>
    <dc:date>2013-04-30T10:02:36Z</dc:date>
    <item>
      <title>S.P.A.C.E</title>
      <link>http://dspace.cityu.edu.hk:80/handle/2031/174</link>
      <description>Title: S.P.A.C.E
Authors: Lai, Alice Yee Man (賴綺雯)</description>
      <pubDate>Sat, 01 Mar 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://dspace.cityu.edu.hk:80/handle/2031/174</guid>
      <dc:date>2003-03-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Hashing with Cauchy Graph</title>
      <link>http://dspace.cityu.edu.hk:80/handle/2031/6806</link>
      <description>Title: Hashing with Cauchy Graph
Authors: Tao, Liang (陶亮); Prof. Ip, Horace Ho-shing
Abstract: Approximate nearest neighbor search within large scale image&#xD;
datasets strongly demands efficient and effective algorithms. One&#xD;
promising strategy is to compute compact bits string via the hashing&#xD;
scheme as representation of data examples, which can dramatically reduce&#xD;
query time and storage requirements. In this paper, we propose a&#xD;
novel Cauchy graph-based hashing algorithm for the first time, which&#xD;
can capture more local topology semantics than Laplacian embedding.&#xD;
In particular, greater similarities are achieved through Cauchy embedding&#xD;
mapped from the pairs of smaller distance over the original data&#xD;
space. Then regularized kernel least-squares, with its closed form solution,&#xD;
is applied to efficiently learn hash functions. The experimental&#xD;
evaluations over several noted image retrieval benchmarks, MNIST,&#xD;
CIFAR-10 and USPS, demonstrate that performance of the proposed&#xD;
hashing algorithm is quite comparable with the state-of-the-art hashing&#xD;
techniques in searching semantic similar neighbors, especially in quite&#xD;
short length hash codes, such as those of only 4, 6, and 8 bits.
Notes: Won the Best Paper Award (Machine Learning) at the 2012 Pacific-Rim Conference on Multimedia (PCM 2012) organized by Nanyang Technological University, Singapore and National University of Singapore.</description>
      <pubDate>Sat, 01 Dec 2012 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://dspace.cityu.edu.hk:80/handle/2031/6806</guid>
      <dc:date>2012-12-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>The 21st Century Board: What is an Effective Board?</title>
      <link>http://dspace.cityu.edu.hk:80/handle/2031/6805</link>
      <description>Title: The 21st Century Board: What is an Effective Board?
Authors: Wong, Sardonna Ka-yi (黃嘉怡); Chan, Ken Wai-kit (陳偉傑)
Abstract: In this paper, we investigate the effectiveness of the board of directors and discuss some of the loopholes related to corporate boards in the 20th century as highlighted by many researchers. We use Enron Corporation as an underlying case as it symbolizes the biggest corporate fraud and corruption scandal that occurred in the past decade. This scandal has revealed many challenges that corporate boards face today. More relevantly, we provide several recommendations to improve the culture and effectiveness of modern corporate boards: an increase in board independence and board diversity, provide better access to information, and being more socially responsible. In essence, these recommended features of a 21st century board could help to prevent the same blunders that were made by Enron’s board members, which were detrimental to shareholders value.
Notes: Won the Best Paper Award and Best Presenter Award in the Hong Kong Institute of Chartered Secretaries (HKICS) Corporate Governance Paper Competition 2012.</description>
      <pubDate>Mon, 01 Oct 2012 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://dspace.cityu.edu.hk:80/handle/2031/6805</guid>
      <dc:date>2012-10-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>The Low-profile Magneto-electric Dipole Antenna</title>
      <link>http://dspace.cityu.edu.hk:80/handle/2031/6804</link>
      <description>Title: The Low-profile Magneto-electric Dipole Antenna
Authors: Li, Mingjian (李明鑒)</description>
      <pubDate>Wed, 01 Aug 2012 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://dspace.cityu.edu.hk:80/handle/2031/6804</guid>
      <dc:date>2012-08-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

