Overview of the 1st international competition on plagiarism detection

The 1st International Competition on Plagiarism Detection, held in conjunction with the 3rd PAN workshop on Uncovering Plagiarism, Authorship, and Social Software Misuse, brought together researchers from many disciplines around the exciting retrieval task of automatic plagiarism detection. The competition was divided into the subtasks external plagiarism detection and intrinsic plagiarism detection, which were tackled by 13 participating groups. An important by-product of the competition is an evaluation framework for plagiarism detection, which consists of a large-scale plagiarism corpus and detection quality measures. The framework may serve as a unified test environment to compare future plagiarism detection research. In this paper we describe the corpus design and the quality measures, survey the detection approaches developed by the participants, and compile the achieved performance results of the competitors

Overview of the 2nd international competition on plagiarism detection

This paper overviews 18 plagiarism detectors that have been developed and evaluated within PAN'10. We start with a unified retrieval process that summarizes the best practices employed this year. Then, the detectors' performances are evaluated in detail, highlighting several important aspects of plagiarism detection, such as obfuscation, intrinsic vs. external plagiarism, and plagiarism case length. Finally, all results are compared to those of last year's competition

Overview of the 3rd international competition on plagiarism detection

This paper overviews eleven plagiarism detectors that have been developed and evaluated within PAN'11. We survey the detection approaches developed for the two sub-tasks "external plagiarism detection" and "intrinsic plagiarism detection," and we report on their detailed evaluation based on the third revised edition of the PAN plagiarism corpus PAN-PC-11

Influence of anisotropic conductivity of the white matter tissue on EEG source reconstruction a FEM simulation study

The aim of this study was to quantify the influence of the inclusion of anisotropic conductivity on EEG source reconstruction. We applied high-resolution finite element modeling and performed forward and inverse simulation with over 4000 single dipoles placed around an anisotropic volume block (with an anisotropic ratio of 1:10) in a rabbit brain. We investigated three different orientation of the dipoles with respect to the anisotropy in the white matter block. We found a weak influence of the anisotropy in the forward simulation on the electric potential. The relative difference measure (RDM) between the potentials simulated with and without taking into account anisotropy was less than 0.009. The changes in magnitude (MAG) ranged from 0.944 to 1.036. Using the potentials of the forward simulation derived with the anisotropic model and performing source reconstruction by employing the isotropic model led to dipole shifts of up to 2 mm, however the mean shift over all dipoles and orientations of 0.05 mm was smaller than the grid size of the FEM model (0.6 mm). However, we found the source strength estimation to be more influenced by the anisotropy (up to 7-times magnified dipole strength)

Demonstration of multi-channel 80 Gbit/s integrated transmitter and receiver for wavelength-division multiplexing passive optical network and fronthauling applications

The performance evaluation of a multi-channel transmitter that employs an arrayed reflective electroabsorption modulator-based photonic integrated circuit and a low-power driver array in conjunction with a multi-channel receiver incorporating a pin photodiode array and integrated arrayed waveguide grating is reported. Due to their small footprint, low power consumption and potential low cost, these devices are attractive solutions for future mobile fronthaul and next generation optical access networks. A BER performance of <10(-9) at 10.3 Gbit/s per channel is achieved over 25 km of standard single mode fibre. The transmitter/receiver combination can achieve an aggregate bit rate of 82.4 Gbit/s when eight channels are active

The Complexity of Flow Expansion and Electrical Flow Expansion

FlowExpansion is a network design problem, in which the input consists of a flow network and a set of candidate edges, which may be added to the network. Adding a candidate incurs given costs. The goal is to determine the cheapest set of candidate edges that, if added, allow the demands to be satisfied. FlowExpansion is a variant of the Minimum-Cost Flow problem with non-linear edge costs. We study FlowExpansion for both graph-theoretical and electrical flow networks. In the latter case this problem is also known as the Transmission Network Expansion Planning problem. We give a structured view over the complexity of the variants of FlowExpansion that arise from restricting, e.g., the graph classes, the capacities, or the number of sources and sinks. Our goal is to determine which restrictions have a crucial impact on the computational complexity. The results in this paper range from polynomial-time algorithms for the more restricted variants over NP-hardness proofs to proofs that certain variants are NP-hard to approximate even within a logarithmic factor of the optimal solution

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots

A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is successful if each node of the graph is visited before its deadline by a reliable robot. The edge weight corresponds to the time needed by a robot to traverse the edge. Given the number of robots which may crash, is it possible to design an algorithm, which will always guarantee the exploration, independently of the choice of the subset of unreliable robots by the adversary? We find the optimal time, during which the graph may be explored. Our approach permits to find the maximal number of robots, which may turn out to be unreliable, and the graph is still guaranteed to be explored. We concentrate on line graphs and rings, for which we give positive results. We start with the case of the collections involving only reliable robots. We give algorithms finding optimal times needed for exploration when the robots are assigned to fixed initial positions as well as when such starting positions may be determined by the algorithm. We extend our consideration to the case when some number of robots may be unreliable. Our most surprising result is that solving the line exploration problem with robots at given positions, which may involve crash-faulty ones, is NP-hard. The same problem has polynomial solutions for a ring and for the case when the initial robots' positions on the line are arbitrary. The exploration problem is shown to be NP-hard for star graphs, even when the team consists of only two reliable robots

New Heuristic Algorithms for the Windy Rural Postman Problem

[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.Benavent, E.; Corberán, A.; Piñana, E.; Plana. I.; Sanchís Llopis, JM. (2005). New Heuristic Algorithms for the Windy Rural Postman Problem. Computers & Operations Research. 32(12):3111-3128. doi:10.1016/j.cor.2004.04.007S31113128321

Sampling the canonical phase from phase-space functions

We discuss the possibility of sampling exponential moments of the canonical phase from the s-parametrized phase space functions. We show that the sampling kernels exist and are well-behaved for any s>-1, whereas for s=-1 the kernels diverge in the origin. In spite of that we show that the phase space moments can be sampled with any predefined accuracy from the Q-function measured in the double-homodyne scheme with perfect detectors. We discuss the effect of imperfect detection and address sampling schemes using other measurable phase-space functions. Finally, we discuss the problem of sampling the canonical phase distribution itself.Comment: 10 pages, 7 figures, REVTe

Characterization of Multi-Core Fiber Group Delay with Correlation OTDR and Modulation Phase Shift Methods

Using a Correlation-OTDR and a modulation phase shift method we characterized four multi-core fibers. The results show that the differential delay depends on the position of the core in the fiber and varies with temperature.Comment: This work has received funding from the European Union's Horizon 2020 research and innovation programme under grant agreement No 762055 (BlueSpace Project