Sketch-based 3D Shape Retrieval using Convolutional Neural Networks

Retrieving 3D models from 2D human sketches has received considerable attention in the areas of graphics, image retrieval, and computer vision. Almost always in state of the art approaches a large amount of "best views" are computed for 3D models, with the hope that the query sketch matches one of these 2D projections of 3D models using predefined features. We argue that this two stage approach (view selection -- matching) is pragmatic but also problematic because the "best views" are subjective and ambiguous, which makes the matching inputs obscure. This imprecise nature of matching further makes it challenging to choose features manually. Instead of relying on the elusive concept of "best views" and the hand-crafted features, we propose to define our views using a minimalism approach and learn features for both sketches and views. Specifically, we drastically reduce the number of views to only two predefined directions for the whole dataset. Then, we learn two Siamese Convolutional Neural Networks (CNNs), one for the views and one for the sketches. The loss function is defined on the within-domain as well as the cross-domain similarities. Our experiments on three benchmark datasets demonstrate that our method is significantly better than state of the art approaches, and outperforms them in all conventional metrics.Comment: CVPR 201

Does a low solar cycle minimum hint at a weak upcoming cycle?

The maximum amplitude (Rm) of a solar cycle, in the term of mean sunspot numbers, is well-known to be positively correlated with the preceding minimum (Rmin). So far as the long term trend is concerned, a low level of Rmin tends to be followed by a weak Rm, and vice versa. In this paper, we found that the evidence is insufficient to infer a very weak Cycle 24 from the very low Rmin in the preceding cycle. This is concluded by analyzing the correlation in the temporal variations of parameters for two successive cycles.Comment: 5 pages, 2 figures. Accepted by RA

Effects of laser fluence on silicon modification by four-beam laser interference

This paper discusses the effects of laser fluence on silicon modification by four-beam laser interference. In this work, four-beam laser interference was used to pattern single crystal silicon wafers for the fabrication of surface structures, and the number of laser pulses was applied to the process in air. By controlling the parameters of laser irradiation, different shapes of silicon structures were fabricated. The results were obtained with the single laser fluence of 354 mJ/cm, 495 mJ/cm, and 637 mJ/cm, the pulse repetition rate of 10 Hz, the laser exposure pulses of 30, 100, and 300, the laser wavelength of 1064 nm, and the pulse duration of 7-9 ns. The effects of the heat transfer and the radiation of laser interference plasma on silicon wafer surfaces were investigated. The equations of heat flow and radiation effects of laser plasma of interfering patterns in a four-beam laser interference distribution were proposed to describe their impacts on silicon wafer surfaces. The experimental results have shown that the laser fluence has to be properly selected for the fabrication of well-defined surface structures in a four-beam laser interference process. Laser interference patterns can directly fabricate different shape structures for their corresponding applications

NPRF: A Neural Pseudo Relevance Feedback Framework for Ad-hoc Information Retrieval

Pseudo-relevance feedback (PRF) is commonly used to boost the performance of traditional information retrieval (IR) models by using top-ranked documents to identify and weight new query terms, thereby reducing the effect of query-document vocabulary mismatches. While neural retrieval models have recently demonstrated strong results for ad-hoc retrieval, combining them with PRF is not straightforward due to incompatibilities between existing PRF approaches and neural architectures. To bridge this gap, we propose an end-to-end neural PRF framework that can be used with existing neural IR models by embedding different neural models as building blocks. Extensive experiments on two standard test collections confirm the effectiveness of the proposed NPRF framework in improving the performance of two state-of-the-art neural IR models.Comment: Full paper in EMNLP 201

Entanglement criterion via general symmetric informationally complete measurements

We study the quantum separability problem by using general symmetric informationally complete measurements and present a separability criterion for arbitrary dimensional bipartite systems. We show by detailed examples that our criterion is more powerful than the existing ones in entanglement detection.Comment: 8 pages, 5 figure

Advanced Nanomatericals for Solar Photocatalysis

Heterogeneous photocatalysis using semiconductors and renewable solar energy has been regarded as one of the most promising processes to alleviate and even solve both the world crises of energy supply and environmental pollution. Recently, numerous semiconducting materials and its composites have been studied for their photocatalytic applications. In this chapter, we briefly summarize recent progress in the binary oxide system (including TiO2 and α-Fe2O3), ternary oxide (Bi system), and the semiconducting materials and their composites which have remarkable applications in photocatalytic degradation of toxic pollutants, hydrogen production and as an adsorbent for wastewater treatment. In addition, we highlight the challenges and opportunities when we implement photocatalytic materials to help on the development of energy research and find ways to approach major problems

Online VNF Scaling in Datacenters

Network Function Virtualization (NFV) is a promising technology that promises to significantly reduce the operational costs of network services by deploying virtualized network functions (VNFs) to commodity servers in place of dedicated hardware middleboxes. The VNFs are typically running on virtual machine instances in a cloud infrastructure, where the virtualization technology enables dynamic provisioning of VNF instances, to process the fluctuating traffic that needs to go through the network functions in a network service. In this paper, we target dynamic provisioning of enterprise network services - expressed as one or multiple service chains - in cloud datacenters, and design efficient online algorithms without requiring any information on future traffic rates. The key is to decide the number of instances of each VNF type to provision at each time, taking into consideration the server resource capacities and traffic rates between adjacent VNFs in a service chain. In the case of a single service chain, we discover an elegant structure of the problem and design an efficient randomized algorithm achieving a e/(e-1) competitive ratio. For multiple concurrent service chains, an online heuristic algorithm is proposed, which is O(1)-competitive. We demonstrate the effectiveness of our algorithms using solid theoretical analysis and trace-driven simulations.Comment: 9 pages, 4 figure