Solving problems of radiation and diffraction electromagnetic waves based on integral representations electromagnetic field

Annotation Various forms of integral representations of the electromagnetic field are considered. It is shown that the use of analytically developed integral representations of the electromagnetic field instead of the vector potential method makes it possible to significantly simplify the formulation of the internal and external electrodynamic problem for specific structures. The numerical results of solving problems of radiation and diffraction of electromagnetic waves are presented. It is shown that taking into account the peculiarities of the geometry and using projection functions close to the eigenfunctions of the integral operator of the internal electrodynamic problem for basic elements make it possible to construct effective algorithms for the electrodynamic analysis of metastructures. A mathematical model of a multistage chiral frame is proposed. By the example of a tubular vibrator, the possibility of approximating the solution of an internal electrodynamic problem using eigenfunctions is demonstrated. The prospects for further development of the integral representations of the electromagnetic field method are considered.

Bi-shifting semantic auto-encoder for zero-shot learning

<abstract><p>Zero-shot learning aims to transfer the model of labeled seen classes in the source domain to the disjoint unseen classes without annotations in the target domain. Most existing approaches generally consider directly adopting the visual-semantic projection function learned in the source domain to the target domain without adaptation. However, due to the distribution discrepancy between the two domains, it remains challenging in dealing with the projection domain shift problem. In this work, we formulate a novel bi-shifting semantic auto-encoder to learn the semantic representations of the target instances and reinforce the generalization ability of the projection function. The encoder aims at mapping the visual features into the semantic space by leveraging the visual features of target instances and is guided by the semantic prototypes of seen classes. While two decoders manage to respectively reconstruct the original visual features in the source and target domains. Thus, our model can capture the generalized semantic characteristics related with the seen and unseen classes to alleviate the projection function problem. Furthermore, we develop an efficient algorithm by the advantage of the linear projection functions. Extensive experiments on the five benchmark datasets demonstrate the competitive performance of our proposed model.</p></abstract>

Estimating Needle and Shoot Inclination Angle Distributions and Projection Functions in Five Larix principis-rupprechtii Plots via Leveled Digital Camera Photography

The leaf inclination angle distribution function is a key determinant that influences radiation penetration through forest canopies. In this study, the needle and shoot inclination angle distributions of five contrasting Larix principis-rupprechtii plots were obtained via the frequently used leveled digital camera photography method. We also developed a quasi-automatic method to derive the needle inclination angles based on photographs obtained using the leveled digital camera photography method and further verified using manual measurements. Then, the variations of shoot and needle inclination angle distributions due to height levels, plots, and observation years were investigated. The results showed that the developed quasi-automatic method is effective in deriving needle inclination angles. The shoot and needle inclination angle distributions at the whole-canopy scale tended to be planophile and exhibited minor variations with plots and observation years. The small variations in the needle inclination angle distributions with height level in the five plots might be caused by contrasting light conditions at different height levels. The whole-canopy and height level needle projection functions also tended to be planophile, and minor needle projection function variations with plots and observation years were observed. We attempted to derive the shoot projection functions of the five plots by using a simple and applicable method and further evaluated the performance of the new method.

Online Hashing with Efficient Updating of Binary Codes

Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be recomputed to guarantee the retrieval accuracy. Recomputing the binary codes by accumulating the whole database brings a timeliness challenge to the online retrieval process. In this paper, we propose a novel online hashing framework to update the binary codes efficiently without accumulating the whole database. In our framework, the hash functions are fixed and the projection functions are introduced to learn online from the streaming data. Therefore, inefficient updating of the binary codes by accumulating the whole database can be transformed to efficient updating of the binary codes by projecting the binary codes into another binary space. The queries and the binary code database are projected asymmetrically to further improve the retrieval accuracy. The experiments on two multi-label image databases demonstrate the effectiveness and the efficiency of our method for multi-label image retrieval.

On Hash-Based Work Distribution Methods for Parallel Best-First Search

Parallel best-first search algorithms such as Hash Distributed A* (HDA*) distribute work among the processes using a global hash function. We analyze the search and communication overheads of state-of-the-art hash-based parallel best-first search algorithms, and show that although Zobrist hashing, the standard hash function used by HDA*, achieves good load balance for many domains, it incurs significant communication overhead since almost all generated nodes are transferred to a different processor than their parents. We propose Abstract Zobrist hashing, a new work distribution method for parallel search which, instead of computing a hash value based on the raw features of a state, uses a feature projection function to generate a set of abstract features which results in a higher locality, resulting in reduced communications overhead. We show that Abstract Zobrist hashing outperforms previous methods on search domains using hand-coded, domain specific feature projection functions. We then propose GRAZHDA*, a graph-partitioning based approach to automatically generating feature projection functions. GRAZHDA* seeks to approximate the partitioning of the actual search space graph by partitioning the domain transition graph, an abstraction of the state space graph. We show that GRAZHDA* outperforms previous methods on domain-independent planning.

Deep Supervised Hashing with Nonlinear Projections

Hashing has attracted broad research interests in large scale image retrieval due to its high search speed and efficient storage. Recently, many deep hashing methods have been proposed to perform simultaneous nonlinear feature learning and hash projection learning, which have shown superior performance compared to hand-crafted feature based hashing methods. Nonlinear projection functions have shown their advantages over the linear ones due to their powerful generalization capabilities. To improve the performance of deep hashing methods by generalizing projection functions, we propose the idea of implementing a pure nonlinear deep hashing network architecture. By consolidating the above idea, this paper presents a Deep Supervised Hashing architecture with Nonlinear Projections (DSHNP). In particular, soft decision trees are adopted as the nonlinear projection functions, since they can generate differentiable nonlinear outputs and can be trained with deep neural networks in an end-to-end way. Moreover, to make the hash codes as independent as possible, we design two regularizers imposed on the parameter matrices of the leaves in the soft decision trees. Extensive evaluations on two benchmark image datasets show that the proposed DSHNP outperforms several state-of-the-art hashing methods.

A flag representation of projection functions

The