检索结果-内蒙古大学图书馆

12th SIAM International Conference on Data Mining, SDM 2012

作者： Long, Mingsheng Wang, Jianmin Ding, Guiguang Cheng, Wei Zhang, Xiang Wang, Wei Department of Computer Science and Technology Tsinghua University Beijing 100084 China School of Software Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education United States Department of Computer Science University of North Carolina Chapel Hill NC United States Dept of Electrical Engineering and Computer Science Case Western Reserve University OH United States

ISBN: (纸本)9781611972320

Transfer learning aims to leverage the knowledge in the source domain to facilitate the learning tasks in the tar- get domain. It has attracted extensive research interests recently due to its effectiveness in a wide range of applica- Tions. The general idea of the existing methods is to utilize the common latent structure shared across domains as the bridge for knowledge transfer. These methods usually model the common latent structure by using either the marginal distribution or the conditional distribution. However, with- out exploring the duality between these two distributions, these single bridge methods may not achieve optimal capa- bility of knowledge transfer. In this paper, we propose a novel approach, Dual Transfer Learning (DTL), which simultaneously learns the marginal and conditional distributions, and exploits the du- Ality between them in a principled way. The key idea behind DTL is that learning one distribution can help to learn the other. This duality property leads to mutual reinforcement when adapting both distributions across domains to trans- fer knowledge. The proposed method is formulated as an optimization problem based on joint nonnegative matrix tri- factorizations (NMTF). The two distributions are learned from the decomposed latent factors that exhibit the duality property. An efficient alternating minimization algorithm is developed to solve the optimization problem with con- vergence guarantee. Extensive experimental results demon- strate that DTL is more effective than alternative transfer learning methods. Copyright © 2012 by the Society for Industrial and Applied Mathematics.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

A cloud-based watermarking method for health data security

A cloud-based watermarking method for health data security

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Zhiwei Yu Clark Thomborson Chaokun Wang Jianmin Wang Rui Li Department of Computer Science and Technology Tsinghua University Beijing China Department of Computer Science University of Auckland New Zealand School of Software Key Laboratory for Information System Security Ministry of Education Tsinghua National Laboratory for Information Science and Technology(TNList) Tsinghua University Beijing China

Private health information once confined to local medical institutions is migrating onto the Internet as an Electronic Health Record (EHR) that is accessed by cloud computing. No matter where it is hosted, health data is subject to security breaches, privacy abuses, and access control violations. However, novel technologies have new vulnerabilities, and allow new mitigations. In this paper, we propose a watermarking method in the architecture of cloud computing, to mitigate the risks of insider disclosures. Our design and preliminary implementation are accomplished by exploiting the MapReduce mechanism in the cloudlet we built. Our evaluation shows that our proposal addresses all of the requirements of the Cloud Oriented Architecture (COA) framework of the Jericho Forum.

关键词： Watermarking Medical services Cloud computing Computer architecture Cryptography Organizations

来源：评论

学校读者我要写书评

暂无评论

Exploiting constructive interference for scalable flooding in wireless networks

Exploiting constructive interference for scalable flooding i...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Yin Wang Yuan He Xufei Mao Yunhao Liu Zhiyu Huang Xiangyang Li MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Department of Computer Science and Engineering HKUST Hong Kong China Institute of Software Chinese Academy of Sciences China Department of Computer Science Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Exploiting constructive interference in wireless networks is an emerging trend for it allows multiple senders transmit an identical packet simultaneously. Constructive interference based flooding can realize millisecond network flooding latency and sub-microsecond time synchronization accuracy, require no network state information and adapt to topology changes. However, constructive interference has a precondition to function, namely, the maximum temporal displacement Δ of concurrent packet transmissions should be less than a given hardware constrained threshold. We disclose that constructive interference based flooding suffers the scalability problem. The packet reception performances of intermediate nodes degrade significantly as the density or the size of the network increases. We theoretically show that constructive interference based flooding has a packet reception ratio (PRR) lower bound (95:4%) in the grid topology. For a general topology, we propose the spine constructive interference based flooding (SCIF) protocol. With little overhead, SCIF floods the entire network much more reliably than Glossy [1] in high density or large-scale networks. Extensive simulations illustrate that the PRR of SCIF keeps stable above 96% as the network size grows from 400 to 4000 while the PRR of Glossy is only 26% when the size of the network is 4000. We also propose to use waveform analysis to explain the root cause of constructive interference, which is mainly examined in simulations and experiments. We further derive the closed-form PRR formula and define interference gain factor (IGF) to quantitatively measure constructive interference.

关键词： constructive interference Wireless networks Flood NECTIN1 gene ATP6AP2 gene PULSE REPETITION RATE stem cell inhibitory factor Glossy

来源：评论

学校读者我要写书评

暂无评论

Recovering geometric detail by octree normal maps

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2012年 7145 LNCS卷 62-73页

作者： Fan, Wenshan Wang, Bin Chan, Bin Paul, Jean-Claude Sun, Jiaguang School of Software Tsinghua University China Beijing Aerospace Control Center China Department of Computer Science and Technology Tsinghua University China Key Laboratory for Information System Security Ministry of Education China Tsinghua National Laboratory for Information Science and Technology China University of Hong Kong Hong Kong INRIA France

ISBN: (纸本)9783642290497

This paper presents a new approach for constructing normal maps that capture high-frequency geometric detail from dense models of arbitrary topology and are applied to the simplified version of the same models generated by any simplification method to mimic the same level of detail. A variant of loose octree scheme is used to optimally calculate the mesh normals. A B-spline surface fitting based method is employed to solve the issue of thin plate. A memory saving Breadth-First Search (BFS) order construction is designed. Furthermore, a speedup scheme that exploits access coherence is used to accelerate filtering operation. The proposed method can synthesize good quality images of models with extremely high number of polygons while using much less memory and render at much higher frame rate. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

WILL: Wireless indoor localization without site survey

WILL: Wireless indoor localization without site survey

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Chenshu Wu Zheng Yang Yunhao Liu Wei Xi MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science and Engineering HKUST Hong Kong China Xian Jiaotong University China

ISBN: (纸本)9781467307734

Indoor localization is of great importance for a range of pervasive applications, attracting many research efforts in the past two decades. Most radio-based solutions require a process of site survey, in which radio signatures are collected and stored for further comparison and matching. Site survey involves intensive costs on manpower and time. In this work, we study unexploited RF signal characteristics and leverage user motions to construct radio floor plan that is previously obtained by site survey. On this basis, we design WILL, an indoor localization approach based on off-the-shelf WiFi infrastructure and mobile phones. WILL is deployed in a real building covering over 1600m 2 , and its deployment is easy and rapid since site survey is no longer needed. The experiment results show that WILL achieves competitive performance comparing with traditional approaches.

关键词： Fingerprint recognition Floors Databases Skeleton Mobile handsets IEEE 802.11 Standards

来源：评论

学校读者我要写书评

暂无评论

Mechanism design for finding experts using locally constructed social referral web

Mechanism design for finding experts using locally construct...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Lan Zhang Xiang-Yang Li Yunhao Liu QiuYuan Huang Shaojie Tang MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science Illinois Institute of Technology USA Department of Computer Science and Engineering HKUST Hong Kong China Department of Electrical Engineering University of Florida USA

ISBN: (纸本)9781467307734;9781467307758

In this work, we address the problem of finding experts using chains of social referrals and profile matching with only local information in online social networks. By assuming that users are selfish, rational, and have privately known cost of participating in the referrals, we design a novel truthful efficient mechanism in which an expert-finding query will be relayed by intermediate users. When receiving a referral request, a participant will locally choose among her neighbors some user to relay the request. In our mechanism, several closely coupled methods are carefully designed to improve the search performance, including, profile matching, social acquaintance prediction, score function for locally choosing relay neighbors, and budget estimation. We conduct extensive experiments on several datasets of online social networks. The extensive study of our mechanism shows that the success rate of our mechanism is about 90% in finding closely matched experts using only local search and limited budget, which significantly improves the previously best rate 20%. The overall cost of finding an expert by our truthful mechanism is about 20% of the untruthful method and only about 2% of the method that always selects high-degree neighbors. The median length of social referral chains is 6 using our localized search decision, which surprisingly matches the well-known small-world phenomenon of global social structures.

关键词： Vectors Probability Search problems Facebook Relays Databases

来源：评论

学校读者我要写书评

暂无评论

Human action recognition based on sparse representation induced by L1/L2 regulations

Human action recognition based on sparse representation indu...

引用

International Conference on Pattern Recognition

作者： Zan Gao An-an Liu Hua Zhang Guang-ping Xu Yan-bing Xue Key Laboratory of Computer Vision and System Ministry of Education Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China Department of Electronic Information Engineering Tianjin University Tianjin China

ISBN: (纸本)9781467322164

Sparse representation based classification (SRC) has been widely used for face recognition (FR). Although SRC algorithm is also adopted in human action recognition, the evaluations of different regular terms have not been given. In this paper, we will discuss and evaluate the role of different regular terms of SRC in human action recognition, after that, we propose human action recognition algorithm based on sparse representation induced by L 1 and L 2 regulations - called SR-L12. Experiments on well known KTH action dataset show that SR-L12 is much better than that of nearest neighbor (NN), nearest subspace (NS), full-space (NF), SRC and collaborative representation classification (CRC). Moreover, the proposed method is comparable to most of state-of-the-art algorithms for human action recognition.

关键词： Humans Accuracy Noise measurement Testing Training Classification algorithms Feature extraction

来源：评论

学校读者我要写书评

暂无评论

CitySee: Urban CO2 monitoring with sensors

CitySee: Urban CO2 monitoring with sensors

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Xufei Mao Xin Miao Yuan He Xiang-Yang Li Yunhao Liu Department of Computer Science and Engineering HKUST Hong Kong China MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Computer Science Department Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Motivated by the needs of precise carbon emission measurement and real-time surveillance for CO 2 management in cities, we present CitySee, a real-time CO 2 -monitoring system using sensor networks for an urban area (around 100 square kilometers). In order to conduct environment monitoring in a real-time and long-term manner, CitySee has to address the following challenges, including sensor deployment, data collection, data processing, and network management. In this discussion, we mainly focus on the sensor deployment problem so that necessary requirements like connectivity, coverage, data representability are satisfied. We also briefly go through the solutions for the remaining challenges. In CitySee, the sensor deployment problem can be abstracted as a relay node placement problem under hole-constraint. By carefully taking all constraints and real deployment situations into account, we propose efficient and effective approaches and prove that our scheme uses additional relay nodes at most twice of the minimum. We evaluate the performance of our approach through extensive simulations resembling realistic deployment. The results show that our approach outperforms previous strategies. We successfully apply this design into CitySee, a large-scale wireless sensor network consisting of 1096 relay nodes and 100 sensor nodes in Wuxi City, China.

关键词： Sensors Wireless sensor networks Wireless communication Joining processes Relays Steiner trees Carbon dioxide

来源：评论

学校读者我要写书评

暂无评论

Towards energy-fairness in asynchronous duty-cycling sensor networks

Towards energy-fairness in asynchronous duty-cycling sensor ...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Zhenjiang Li Mo Li Yunhao Liu Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China School of Computer Engineering Nanyang Technological University Singapore MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China

ISBN: (纸本)9781467307734

In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategy, i.e., operating sensor nodes with identical sleep intervals, or intuitive control heuristics, i.e., greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find it a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate in the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings.

关键词： Energy consumption Silicon carbide Protocols Receivers Wireless sensor networks Data communication Switching circuits

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on Computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：