Joint Classification and Regression for Visual Tracking with Fully Convolutional Siamese Networks

International Journal of Computer Vision - Visual tracking of generic objects is one of the fundamental but challenging problems in computer vision. Here, we propose a novel fully convolutional...     

A modified teaching–learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling

In this paper, a modified teaching–learning-based optimisation (mTLBO) algorithm is proposed to solve the re-entrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. Based on the simple job-based representation, a novel decoding method named equivalent due date-based permutation schedule is proposed to transfer an individual to a feasible schedule. At each generation, a number of superior individuals are selected as the teachers by the Pareto-based ranking phase. To enhance the exploitation ability in the promising area, the insertion-based local search is embedded in the search framework as the training phase for the TLBO. Due to the characteristics of the permutation-based discrete optimisation, the linear order crossover operator and the swap operator are adopted to imitate the interactions among the individuals in both the teaching phase and the learning phase. To store the non-dominated solutions explored during the search process, an external archive is used and updated when necessary. The influence of the parameter setting on the mTLBO in solving the RHFSP is investigated, and numerical tests with some benchmarking instances are carried out. The comparative results show that the proposed mTLBO outperforms the existing algorithms significantly.     

Algorithm for the extraction of page-formatted binary digital data

We present an algorithm for fast and reliable extraction of page-formatted binary digital data. The advantages of the algorithm include a low raw bit-error rate, fast extraction speed, the use of a simple and density-efficient coding scheme, and large tolerance to a change of the signal-to-noise ratio. We used this algorithm to analyze shot-noise-limited binary data that had large interpage and intrapage intensity variations and obtained an improvement in the bit-error rate of 3-4 orders of magnitude compared with that in a single-threshold-detection scheme. Implications of our results for the development of high-speed, high-density holographic memories are discussed.     

The first measurement of an absolute surface concentration of reaction intermediates in ethylene hydrogenation

The first measurement of a turnover rate with respect to surface intermediate concentration in a high pressure heterogeneous catalytic reaction is reported. By using infrared-visible sum frequency generation to study the hydrogenation of ethylene on Pt(111), it was found that the surface concentration of -bonded ethylene, the key reaction intermediate, represented approximately 4% of a monolayer. Thus the absolute turnover rate per surface adsorbed ethylene molecule is 25 times faster than the rate measured per platinum atom. To explain these results, we propose a model of weakly adsorbed ethylene intermediates reacting on atop sites.     

Glu227-->Lys substitution in the acidic loop of major histocompatibility complex class I alpha 3 domain distinguishes low avidity CD8 coreceptor and avidity-enhanced CD8 accessory functions

Cytotoxic T lymphocyte (CTL) activation requires specific T cell receptor (TCR)-class I major histocompatibility complex (MHC) antigen complex interactions as well as the participation of coreceptor or accessory molecules on the surface of CTL. CD8 can serve as a coreceptor in that it binds to the same MHC class I molecules as the TCR to facilitate efficient TCR signaling. In addition, CD8 can be "activated" by TCR stimulation to bind to class I molecules with high avidity, including class I not recognized by the TCR as antigenic complexes (non-antigen [Ag] class I), to augment CTL responses and thus serve an accessory molecule function. A Glu/Asp227-->Lys substitution in the class I alpha 3 domain acidic loop abrogates lysis of target cells expressing these mutant molecules by alloreactive CD8-dependent CTL. Lack of response is attributed to the destruction of the CD8 binding site in the alpha 3 domain which is likely to disrupt CD8 coreceptor function. The relative importance of the class I alpha 3 domain acidic loop Glu227 in coreceptor as opposed to accessory functions of CD8 is unclear. To address this issue, we examined CTL adhesion and degranulation in response to immobilized class I-peptide complexes formed in vitro from antigenic peptides and purified class I molecules containing wild-type or Glu227-->Lys substituted alpha 3 domains. The alpha 3 domain mutant class I-peptide complexes were bound by CTL and triggered degranulation, however to much lower levels than wild-type class I-peptide complexes. In further experiments, it is directly demonstrated that the alpha 3 domain mutant class I molecules, which lack the Glu227 CD8 binding site, still serve as TCR-activated, avidity-enhanced CD8 accessory ligands. However, mutant class I peptide Ag complexes failed to effectively serve as CD8 coreceptor ligands to initiate TCR-dependent signals required to induce avidity-enhanced CD8 binding to coimmobilized non-Ag class I molecules. Thus the Glu227-->Lys mutation effectively distinguishes CD8 coreceptor and avidity-enhanced CD8 accessory functions.     

Load-balanced parallel streamline generation on large scale vector fields

Because of the ever increasing size of output data from scientific simulations, supercomputers are increasingly relied upon to generate visualizations. One use of supercomputers is to generate field lines from large scale flow fields. When generating field lines in parallel, the vector field is generally decomposed into blocks, which are then assigned to processors. Since various regions of the vector field can have different flow complexity, processors will require varying amounts of computation time to trace their particles, causing load imbalance, and thus limiting the performance speedup. To achieve load-balanced streamline generation, we propose a workload-aware partitioning algorithm to decompose the vector field into partitions with near equal workloads. Since actual workloads are unknown beforehand, we propose a workload estimation algorithm to predict the workload in the local vector field. A graph-based representation of the vector field is employed to generate these estimates. Once the workloads have been estimated, our partitioning algorithm is hierarchically applied to distribute the workload to all partitions. We examine the performance of our workload estimation and workload-aware partitioning algorithm in several timings studies, which demonstrates that by employing these methods, better scalability can be achieved with little overhead.     

An MLS-based cartoon deformation

We present an image deformation method driven by skeleton; it is based on MLS deformation algorithm (Schaefer et al. in SIGGRAPH, vol. 25, pp. 533–540, 2006). We improve the MLS deformation by defining a new weight function based on skeleton. Being different from the weight function based on control points, our weight function has benefited from the shape information of undeformed object and keeps deformation local, therefore our method can achieve a realistic effect. In cartoon video, we propose a new method to track the skeleton in the video, to build new origin skeleton and new target skeleton on each frame, and to apply our image deformation method to each frame and maintain spatiotemporal consistency. Results demonstrate that our method is able to decrease the effect of squeeze and use less control points.     

Optimal Error Estimates of the Legendre Tau Method for Second-Order Differential Equations

In this paper, we prove that the Legendre tau method has the optimal rate of convergence in L ²-norm, H ¹-norm and H ²-norm for one-dimensional second-order steady differential equations with three kinds of boundary conditions and in C([0,T];L ²(I))-norm for the corresponding evolution equation with the Dirichlet boundary condition. For the generalized Burgers equation, we develop a Legendre tau-Chebyshev collocation method, which can also be optimally convergent in C([0,T];L ²(I))-norm. Finally, we give some numerical examples.     

计算机硬盘保护系统密码丢失问题及对策研究

硬盘保护系统作为当前保护计算机硬盘的最佳解决办法,能安全有效的保护数据。但是要实现保护硬盘数据的功能,必须通过保护系统密码,进入管理平台操作,使得密码丢失存在较大的可能性。本文分析了硬盘保护系统密码丢失的原因和后果,在技术上提出了重置保护系统密码的解决方案,具有实际意义。