Image Labeling on a Network: Using Social-Network Metadata for Image Classification

Large-scale image retrieval benchmarks invariably consist of images from the Web. Many of these benchmarks are derived from online photo sharing networks, like Flickr, which in addition to hosting images also provide a highly interactive social community. Such communities generate rich metadata that can naturally be harnessed for image classification and retrieval. Here we study four popular benchmark datasets, extending them with social-network metadata, such as the groups to which each image belongs, the comment thread associated with the image, who uploaded it, their location, and their network of friends. Since these types of data are inherently relational, we propose a model that explicitly accounts for the interdependencies between images sharing common properties. We model the task as a binary labeling problem on a network, and use structured learning techniques to learn model parameters. We find that social-network metadata are useful in a variety of classification tasks, in many cases outperforming methods based on image content.Comment: ECCV 2012; 14 pages, 4 figure

Optimization of cathode flooding in scaled-up microfluidic fuel cells

published_or_final_versio

Numerical simulation on the local impact of an operating wind trubine

Session VII - Energy Optimization II: no. 5Wind energy is commonly considered to be a clean and environmentally friendly renewable energy resource, as they do not pollute our atmosphere with greenhouse gas, nor do they cause any radioactive problems compared to nuclear energy. However, there are still some environmental impacts due to the installation and operation of the wind turbines that cannot be ignored, such as noise, visual and climatic impact. Especially, the observed local climate change in some wind turbine areas has attracted general concern in recent years. Experts suspected that the a long time operation of ...postprin

HEA-Loc: A robust localization algorithm for sensor networks of diversified topologies

In recent years, localization in a variety of Wireless Sensor Networks (WSNs) is a compelling but elusive goal. Several algorithms that use different methodologies have been proposed to achieve this goal. The performances of these algorithms depend on several factors, such as the sensor node placement, anchor deployment or network topology. In this paper, we propose a robust localization algorithm called Hybrid Efficient and Accurate Localization (HEA-Loc). HEA-Loc combines two techniques, Extended Kalman Filter (EKF) and Proximity-Distance Map (PDM) to improve localization accuracy. It is distributed in nature and works well in various scenarios as it is less susceptible to anchors deployment and the network topology. Furthermore, HEA-Loc has strong robustness and it can work well even the measurement errors are large. Simulation results show that HEA-Loc outperforms existing algorithms in both computational complexity and communication overhead. ©2010 IEEE.published_or_final_versionThe IEEE Wireless Communications and Networking Conference (WCNC 2010), Sydney, NSW., 18-21 April 2010. In Proceedings of WCNC, 2010, p. 1-

Epidemiological updates of venous thromboembolism in a Chinese population

published_or_final_versio

Chiral Spin Liquid in a Frustrated Anisotropic Kagome Heisenberg Model

published_or_final_versio

Effectiveness of proximal intra-operative salvage Palmaz stent placement for endoleak during endovascular aneurysm repair

published_or_final_versio

Angioplasty of forearm arteries as a finger salvage procedure for patient with end-stage renal failure

Case Reportpublished_or_final_versio

Low-dose versus high-dose fish oil for pain reduction and function improvement in patients with knee osteoarthritis

postprin

A Polynomial Approach to Verifying the Existence of a Threatening Sensor Attacker

The development of cyber-physical systems (CPS) has brought much attention of researchers to cyber-attack and cyber-security. A sensor attacker targeting on a supervised discrete event system can modify a set of sensor readings and cause the closed-loop system to reach undesirable states. In this letter, we propose a new attack detection mechanism under which the supervisor only needs to keep track of the last observable event received. Given a plant and a supervisor enforcing a state specification, we define a sensor attacker threatening if it may cause the closed-loop system to enter a forbidden state. Our goal is to verify whether there exists such a threatening sensor attacker for a given controlled system. A new structure, called All Sensor Attack (ASA), is proposed to capture all possible sensor attacks launched by the attacker. Based on the ASA automaton, a necessary and sufficient condition for the existence of a stealthy threatening sensor attacker is presented. Finally, we show that the condition can be verified in polynomial time