A correlative classifiers approach based on particle filter and sample set for tracking occluded target

Target tracking is one of the most important issues in computer vision and has been applied in many fields of science, engineering and industry. Because of the occlusion during tracking, typical approaches with single classifier learn much of occluding background information which results in the decrease of tracking performance, and eventually lead to the failure of the tracking algorithm. This paper presents a new correlative classifiers approach to address the above problem. Our idea is to derive a group of correlative classifiers based on sample set method. Then we propose strategy to establish the classifiers and to query the suitable classifiers for the next frame tracking. In order to deal with nonlinear problem, particle filter is adopted and integrated with sample set method. For choosing the target from candidate particles, we define a similarity measurement between particles and sample set. The proposed sample set method includes the following steps. First, we cropped positive samples set around the target and negative samples set far away from the target. Second, we extracted average Haar-like feature from these samples and calculate their statistical characteristic which represents the target model. Third, we define the similarity measurement based on the statistical characteristic of these two sets to judge the similarity between candidate particles and target model. Finally, we choose the largest similarity score particle as the target in the new frame. A number of experiments show the robustness and efficiency of the proposed approach when compared with other state-of-the-art trackers.     

Multichannel and omnidirectional transparency in periodic metamaterial layers

Multichannel and omnidirectional transmission can be realized in one-dimensional periodic metamaterial layers, where double-negative materials and single-negative materials are alternately stacked. The proposed structures can produce as many resonance transmission modes as desired by adjusting the number of the periods. Such transmission modes with perfect transmission are robust against incident angles and polarizations. The frequencies and frequency intervals of these modes can be tuned by changing the thicknesses of the metamaterial layers. Composite right/left-handed transmission lines with lumped elements (capacitors and inductors) were used to verify the characteristics of the considered system. Our findings provide an efficient way to select useful multiple channel signals from all directions, and it is useful in optoelectronic device applications.     

Combretastatin A-4 derivatives: synthesis and evaluation of 2,4,5-triaryl-1H-imidazoles as potential agents against H1299 (non-small cell lung cancer cell)

A number of 2,4,5-triaryl-1H-imidazole derivatives were synthesized and evaluated for their antiproliferative activities against the growth of five cell lines including three non-small cell lung cancers (H460, H1299, and A549), one breast cancer (MCF-7), and one normal diploid embryonic lung cell line (MRC-5). Preliminary results indicated that both 2-(5-bromofuran-2-yl)-4,5-bis{4-[3-(dimethylamino) propoxy] phenyl}-1H-imidazole (10f) and 4,5-bis{4-[3-(dimethylamino)propoxy]phenyl}-2-(5-nitrofuran-2-yl)-1H -imidazole (10g) were selectively active against the growth of H1229 with an IC₅₀ of less than 0.1???M, thus were more active than topotecan (IC₅₀ >?10.0??? M). However, both 10f and 10g exhibited only marginal cytotoxicity against H460, A549, MCF-7, and MRC-5 requiring an IC ₅₀ of at least 4.16???M. Our results also indicated that 10f induced H1299 cell cycle arrest at G0/G1 through the inactivation of p38 MAPK, JNK, ERK, as well as the expression of SIRT1 and survivin. These results suggested that 10f might have therapeutic potential against H1299 (non-small cell lung cancer cell).     

A meshless point collocation method for 2-D multi-term time fractional diffusion-wave equation

In this paper, a meshless collocation method is considered to solve the multi-term time fractional diffusion-wave equation in two dimensions. The moving least squares reproducing kernel particle approximation is employed to construct the shape functions for spatial approximation. Also, the Caputo’s time fractional derivatives are approximated by a scheme of order O(τ ^3?α ), 1< α < 2. Stability and convergence of the proposed scheme are discussed. Some numerical examples are given to confirm the efficiency and reliability of the proposed method.     

Asymptotic behavior and finite element error estimates of Kelvin-Voigt viscoelastic fluid flow model

In this article, the convergence of the solution of the Kelvin-Voigt viscoelastic fluid flow model to its steady state solution with exponential rate is established under the uniqueness assumption. Then, a semidiscrete Galerkin method for spatial direction keeping time variable continuous is considered and asymptotic behavior of the semidiscrete solution is derived. Moreover, optimal error estimates are achieved for large time using steady state error estimates. Based on linearized backward Euler method, asymptotic behavior for the fully discrete solution is studied and optimal error estimates are derived for large time. All the results are even valid for κ→0, that is, when the Kelvin-Voigt model converges to the Navier-Stokes system. Finally, some numerical experiments are conducted to confirm our theoretical findings.     

Pull-based load distribution among heterogeneous parallel servers: the case of multiple routers

The model is a service system, consisting of several large server pools. A server’s processing speed and buffer size (which may be finite or infinite) depend on the pool. The input flow of customers is split equally among a fixed number of routers, which must assign customers to the servers immediately upon arrival. We consider an asymptotic regime in which the total customer arrival rate and pool sizes scale to infinity simultaneously, in proportion to a scaling parameter n, while the number of routers remains fixed. We define and study a multi-router generalization of the pull-based customer assignment (routing) algorithm PULL, introduced in Stolyar (Queueing Syst 80(4): 341–361, 2015) for the single-router model. Under the PULL algorithm, when a server becomes idle it sends a “pull-message” to a randomly uniformly selected router; each router operates independently—it assigns an arriving customer to a server according to a randomly uniformly chosen available (at this router) pull-message, if there is any, or to a randomly uniformly selected server in the entire system otherwise. Under Markov assumptions (Poisson arrival process and independent exponentially distributed service requirements), and under subcritical system load, we prove asymptotic optimality of PULL: as \(n\rightarrow \infty \), the steady-state probability of an arriving customer experiencing blocking or waiting vanishes. Furthermore, PULL has an extremely low router–server message exchange rate of one message per customer. These results generalize some of the single-router results in Stolyar (2015).     

Koszulity and Koszul modules of dual extension algebras

Let A and B be algebras, and let T be the dual extension algebra of A and B. We provide a different method to prove that T is Koszul if and only if both A and B are Koszul. Furthermore, we prove that an algebra is Koszul if and only if one of its iterated dual extension algebras is Koszul, if and only if all its iterated dual extension algebras are Koszul. Finally, we give a necessary and sufficient condition for a dual extension algebra to have the property that all linearly presented modules are Koszul modules, which provides an effective way to construct algebras with such a property.     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

On the growth and approximation of entire functions represented by Laplace–Stieltjes’ transformation

In the present paper, we obtain the characterization of various growth parameters of an entire function F(s) represented by Laplace–Stieltjes transformation in terms of the rate of decrease of \(E_n ( {F,\beta } ),\)where \(E_n ( {F,\beta } )\) represents the error in approximating the function F(s) by exponential polynomials.     

On optimal partitions,individual values and cooperative games: Does a wiser agent always produce a higher value?

We consider an optimal partition of resources (e.g. consumers) between several agents, given utility functions (“wisdoms”) for the agents and their capacities. This problem is a variant of optimal transport (Monge–Kantorovich) between two measure spaces where one of the measures is discrete (capacities) and the costs of transport are the wisdoms of the agents. We concentrate on the individual value for each agent under optimal partition and show that, counter-intuitively, this value may decrease if the agent’s wisdom is increased. Sufficient and necessary conditions for the monotonicity with respect to the wisdom functions of the individual values will be given, independently of the other agents. The sharpness of these conditions is also discussed. Motivated by the above we define a cooperative game based on optimal partition and investigate conditions for stability of the grand coalition.