HMM Expanded to Multiple Interleaved Chains as a Model for Word Sense Disambiguation

PACLIC 23 / City University of Hong Kong / 3-5 December 200

Localized linear polynomial operators and quadrature formulas on the sphere

The purpose of this paper is to construct universal, auto--adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper--)sphere \SS^q ($q\ge 2$). The approximation and localization properties of our operators are studied theoretically in deterministic as well as probabilistic settings. Numerical experiments are presented to demonstrate their superiority over traditional least squares and discrete Fourier projection polynomial approximations. An essential ingredient in our construction is the construction of quadrature formulas based on scattered data, exact for integrating spherical polynomials of (moderately) high degree. Our formulas are based on scattered sites; i.e., in contrast to such well known formulas as Driscoll--Healy formulas, we need not choose the location of the sites in any particular manner. While the previous attempts to construct such formulas have yielded formulas exact for spherical polynomials of degree at most 18, we are able to construct formulas exact for spherical polynomials of degree 178.Comment: 24 pages 2 figures, accepted for publication in SIAM J. Numer. Ana

Multiplication and Composition in Weighted Modulation Spaces

We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer look onto associated norm inequalities under restrictions in the Fourier image. This will give us the opportunity to treat the boundedness of composition operators.Comment: 49 page

МЕТОД ДОКАЗЫВАНИЯ НЕИЗМЕННОСТИ ФОТОИЗОБРАЖЕНИЙ В РАМКАХ КОМПЬЮТЕРНО- ТЕХНИЧЕСКОЙ ЭКСПЕРТИЗЫ (НА ПРИМЕРЕ ИЗ ЭКСПЕРТНОЙ ПРАКТИКИ)

The possibility of research "les of image formats for changes after creation, through Hu#man tables and Quantization tables analysis are discussed.В статье рассматриваются возможности по исследованию файлов графических форматовна предмет внесения в них изменений после создания, через оценку таблиц Квантования и Хаффмана

Travelling waves for the Gross-Pitaevskii equation II

The purpose of this paper is to provide a rigorous mathematical proof of the existence of travelling wave solutions to the Gross-Pitaevskii equation in dimensions two and three. Our arguments, based on minimization under constraints, yield a full branch of solutions, and extend earlier results, where only a part of the branch was built. In dimension three, we also show that there are no travelling wave solutions of small energy.Comment: Final version accepted for publication in Communications in Mathematical Physics with a few minor corrections and added remark

Dynamical SimRank search on time-varying networks

SimRank is an appealing pair-wise similarity measure based on graph structure. It iteratively follows the intuition that two nodes are assessed as similar if they are pointed to by similar nodes. Many real graphs are large, and links are constantly subject to minor changes. In this article, we study the efficient dynamical computation of all-pairs SimRanks on time-varying graphs. Existing methods for the dynamical SimRank computation [e.g., LTSF (Shao et al. in PVLDB 8(8):838–849, 2015) and READS (Zhang et al. in PVLDB 10(5):601–612, 2017)] mainly focus on top-k search with respect to a given query. For all-pairs dynamical SimRank search, Li et al.’s approach (Li et al. in EDBT, 2010) was proposed for this problem. It first factorizes the graph via a singular value decomposition (SVD) and then incrementally maintains such a factorization in response to link updates at the expense of exactness. As a result, all pairs of SimRanks are updated approximately, yielding (Formula presented.) time and (Formula presented.) memory in a graph with n nodes, where r is the target rank of the low-rank SVD. Our solution to the dynamical computation of SimRank comprises of five ingredients: (1) We first consider edge update that does not accompany new node insertions. We show that the SimRank update (Formula presented.) in response to every link update is expressible as a rank-one Sylvester matrix equation. This provides an incremental method requiring (Formula presented.) time and (Formula presented.) memory in the worst case to update (Formula presented.) pairs of similarities for K iterations. (2) To speed up the computation further, we propose a lossless pruning strategy that captures the “affected areas” of (Formula presented.) to eliminate unnecessary retrieval. This reduces the time of the incremental SimRank to (Formula presented.), where m is the number of edges in the old graph, and (Formula presented.) is the size of “affected areas” in (Formula presented.), and in practice, (Formula presented.). (3) We also consider edge updates that accompany node insertions, and categorize them into three cases, according to which end of the inserted edge is a new node. For each case, we devise an efficient incremental algorithm that can support new node insertions and accurately update the affected SimRanks. (4) We next study batch updates for dynamical SimRank computation, and design an efficient batch incremental method that handles “similar sink edges” simultaneously and eliminates redundant edge updates. (5) To achieve linear memory, we devise a memory-efficient strategy that dynamically updates all pairs of SimRanks column by column in just (Formula presented.) memory, without the need to store all (Formula presented.) pairs of old SimRank scores. Experimental studies on various datasets demonstrate that our solution substantially outperforms the existing incremental SimRank methods and is faster and more memory-efficient than its competitors on million-scale graphs

Новый подход к сравнительному анализу текстов в рамках комплексной компьютерно-технической и лингвистической экспертизы

The article presents a new methodological approach to forensic comparison of large amounts of text to establish their similarity/distinctiveness. The proposed approach assumes interaction between a forensic linguist and a forensic examiner with specialized knowledge in the field of forensic computer science, which the effect of optimizing forensic workflow and maximizing objectivity of the resulting expert conclusions.Рассмотрен методический подход по исследованию текстов больших объемов на предмет установления их сходства/различия. Подход предполагает взаимодействие эксперта- лингвиста и эксперта, обладающего специальными знаниями в области информационных компьютерных средств, позволяет оптимизировать экспертную работу и сформулировать максимально объективные выводы

SimRank*: effective and scalable pairwise similarity search based on graph topology

Given a graph, how can we quantify similarity between two nodes in an effective and scalable way? SimRank is an attractive measure of pairwise similarity based on graph topologies. Its underpinning philosophy that “two nodes are similar if they are pointed to (have incoming edges) from similar nodes” can be regarded as an aggregation of similarities based on incoming paths. Despite its popularity in various applications (e.g., web search and social networks), SimRank has an undesirable trait, i.e., “zero-similarity”: it accommodates only the paths of equal length from a common “center” node, whereas a large portion of other paths are fully ignored. In this paper, we propose an effective and scalable similarity model, SimRank*, to remedy this problem. (1) We first provide a sufficient and necessary condition of the “zero-similarity” problem that exists in Jeh and Widom’s SimRank model, Li et al. ’s SimRank model, Random Walk with Restart (RWR), and ASCOS++. (2) We next present our treatment, SimRank*, which can resolve this issue while inheriting the merit of the simple SimRank philosophy. (3) We reduce the series form of SimRank* to a closed form, which looks simpler than SimRank but which enriches semantics without suffering from increased computational overhead. This leads to an iterative form of SimRank*, which requires O(Knm) time and O(n2) memory for computing all (n2) pairs of similarities on a graph of n nodes and m edges for K iterations. (4) To improve the computational time of SimRank* further, we leverage a novel clustering strategy via edge concentration. Due to its NP-hardness, we devise an efficient heuristic to speed up all-pairs SimRank* computation to O(Knm~) time, where m~ is generally much smaller than m. (5) To scale SimRank* on billion-edge graphs, we propose two memory-efficient single-source algorithms, i.e., ss-gSR* for geometric SimRank*, and ss-eSR* for exponential SimRank*, which can retrieve similarities between all n nodes and a given query on an as-needed basis. This significantly reduces the O(n2) memory of all-pairs search to either O(Kn+m~) for geometric SimRank*, or O(n+m~) for exponential SimRank*, without any loss of accuracy, where m~≪n2 . (6) We also compare SimRank* with another remedy of SimRank that adds self-loops on each node and demonstrate that SimRank* is more effective. (7) Using real and synthetic datasets, we empirically verify the richer semantics of SimRank*, and validate its high computational efficiency and scalability on large graphs with billions of edges