Search

Spelling errors are a prevalent form of interference that may result from human handwriting or natural language processing systems, such as optical character recognition. This type of interference presents a challenge for natural language processing systems that rely on context-based embeddings to comprehend the exact semantics of a sentence. The proposed fusion scheme is the main focus of this paper, which aims to correct spelling errors in sentences. The scheme employs both the original input and the masked input. The masked input is acquired by utilizing a detection module to mask any spelling errors present in the original input. By utilizing the masked input, the scheme is capable of learning the real sentence semantic information that is not affected by spelling errors. Utilizing the original input can prevent the loss of input information resulting from masking operations. Finally, the utilization of the Kullback-Leibler divergence is employed to establish concordance between the two output distributions within the framework, consequently facilitating the acquisition of comprehensive input information, all while mitigating the influence of spelling errors. Experiments were conducted on two widely used benchmarks. Compared with previous methods, the approach presented herein exhibited superior performance as it achieved improvements on two benchmarks. [ABSTRACT FROM AUTHOR]

Investigation in distributed Radar Sensor Network (RSN) and MIMO-RSN are more like two parallel paths other than one research field in current literature. In this paper, we address the comparison between optimal fusion scheme of distributed-RSN and optimal power control of MIMO-RSN for target detection. We first establish the wireless statistic channel model for these two types of RSNs under flat fading channel condition. Using Jake’s model, Rayleigh flat fading channel is obtained. Then we provide optimization for the fusion scheme and the power control. Both amplitude and phase of the received signals are applied to the optimal/suboptimal fusion schemes for the distributed-RSN. Water-filling, the optimal power control scheme is utilized in the MIMO-RSN, where two suboptimal schemes (equal power and channel inversion) are also investigated to provide a comparison. The detection performance is analyzed and compared in terms of probability of detection ( P d ) and probability of false alarm ( P f a ). The simulation results show that the water-filling in MIMO-RSN achieves the best performance, whereas the optimal fusion scheme for distributed-RSN obtains worse performance than the equal power control in MIMO-RSN, and the channel inversion in MIMO-RSN gets the worst performance, which has almost the same performance as the suboptimal fusion scheme in distributed-RSN. [ABSTRACT FROM AUTHOR]

Abstract: In Suzuki (1998) [7] Suzuki gave a classification of association schemes with multiple Q-polynomial structures, allowing for one exceptional case which has five classes. In this paper, we rule out the existence of this case. Hence Suzukiʼs theorem mirrors exactly the well-known counterpart for association schemes with multiple P-polynomial structures, a result due to Eiichi Bannai and Etsuko Bannai in 1980. [Copyright &y& Elsevier]

Abstract: In [D. de Caen, E.R. van Dam, Fissioned triangular schemes via the cross-ratio, European J. Combin. 22 (2001) 297–301], de Caen and van Dam constructed a fission scheme of the triangular scheme on . This fission scheme comes from the naturally induced action of on the 2-element subsets of . The group is one of two infinite families of finite sharply 3-transitive groups. The other such family is a “twisted” version of , where q is an even power of an odd prime. The group is the intersection of and . In this paper, we investigate the association schemes coming from the actions of , and , respectively. Through the conic model introduced in [H.D.L. Hollmann, Q. Xiang, Association schemes from the actions of fixing a nonsingular conic, J. Algebraic Combin. 24 (2006) 157–193], we introduce an embedding of into . For each of the three groups mentioned above, this embedding produces two more isomorphic association schemes: one on hyperbolic lines and the other on hyperbolic points (via an orthogonal parity) in a 3-dimensional orthogonal geometry. This embedding enables us to treat these three isomorphic association schemes simultaneously. [Copyright &y& Elsevier]

Abstract: Representing a target with multiple image fragments has been used for tracking in a video sequence and proved to be able to preserve the spatial information. However, this kind of target description poses additional challenges in terms of efficiency of a video target tracking. In this paper, we present a novel algorithm that addresses this issue. We propose a fusion scheme to fuse multiple spatially distributed fragments effectively. Under the fusion scheme, we derive a mean shift type algorithm which allows efficient target tracking with very low computational overhead. In order to properly fragment the human target, we propose a GrabCut-based method to divide the target into multiple distinctive fragments. The proposed algorithm is evaluated on extensive challenging sequences. The experimental results demonstrate that it is effective and efficient. [Copyright &y& Elsevier]

Abstract: As a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme from a pseudo-cyclic association scheme, Discrete Math. 285(1–3) (2004) 307–311], we show a construction of amorphous association scheme which is a fusion scheme of a direct product of two pseudo-cyclic association schemes with same first eigenmatrix. By using this construction, we can get at most three amorphous association scheme. We prove that if two pseudo-cyclic association scheme are non-isomorphic, then these three amorphous association schemes are mutually non-isomorphic. [Copyright &y& Elsevier]