Identical Strings Research Articles

Synthesis of junction box quality assurance for KM3NeT-ARCA neutrino detector

The KM3NeT-ARCA neutrino detector is the largest underwater neutrino telescope operating in the Mediterranean Sea at a depth of 3500 m, 100 km off the coast of Portopalo di Capo Passero (Italy). It is composed of strings anchored in the deep sea and kept vertical using a buoy. Each string hosts 18 Digital Optical Modules (DOMs), containing 31 optical sensors. The entire telescope, once completed, will be composed of 230 identical strings named Detection Units (DUs) that will send data to shore in real time. A Junction Box (JB) and an electro-optical cable permit the connection to the shore and the powering of the entire system. Each JB connects to the shore, handling up to 12 strings. It is a critical element that requires strict quality assurance rules. This article will focus on the quality assurance process that has allowed the JB to be a robust and reliable element of the entire KM3NeT-ARCA background network.

Design of an origami-based cylindrical deployable mechanism

Abstract. In this paper, an innovative cylindrical deployable mechanism (DM) based on rigid origami is presented, which is used to design a parabolic cylindrical deployable antenna. The mechanism can be deployed from the cuboid folded configuration to the cylindrical unfolded configuration with only one actuator. First, an innovative deployable string is proposed based on different types of four-vertices origami unit cells and kirigami techniques. By considering the units as 6R single-loop mechanisms, the kinematics of the origami unit cells are analyzed. Through the connection of identical deployable strings, the cylindrical DM is constructed, and its mobility is analyzed utilizing the screw theory. Then the proposed DM is used to design a parabolic cylindrical deployable antenna. A number of pillars are installed on the panels of the DM, and their lengths are determined to fit the required parabolic cylindrical surface. To verify the feasibility of the design, a scaled prototype of the deployable antenna is constructed.

Irreproducibility in searches of scientific literature: A comparative analysis.

Repeatability is the cornerstone of science, and it is particularly important for systematic reviews. However, little is known on how researchers’ choice of database, and search platform influence the repeatability of systematic reviews. Here, we aim to unveil how the computer environment and the location where the search was initiated from influence hit results.We present a comparative analysis of time‐synchronized searches at different institutional locations in the world and evaluate the consistency of hits obtained within each of the search terms using different search platforms.We revealed a large variation among search platforms and showed that PubMed and Scopus returned consistent results to identical search strings from different locations. Google Scholar and Web of Science's Core Collection varied substantially both in the number of returned hits and in the list of individual articles depending on the search location and computing environment. Inconsistency in Web of Science results has most likely emerged from the different licensing packages at different institutions.To maintain scientific integrity and consistency, especially in systematic reviews, action is needed from both the scientific community and scientific search platforms to increase search consistency. Researchers are encouraged to report the search location and the databases used for systematic reviews, and database providers should make search algorithms transparent and revise access rules to titles behind paywalls. Additional options for increasing the repeatability and transparency of systematic reviews are storing both search metadata and hit results in open repositories and using Application Programming Interfaces (APIs) to retrieve standardized, machine‐readable search metadata.

Research on the pollution performance and degradation of superhydrophobic nano-coatings for toughened glass insulators

Most of the research efforts to enhance the pollution performance of glass insulators have been focused on room temperature vulcanizing (RTV) silicone rubber coatings to cover the original hydrophilic surface of glass with a hydrophobic polymeric one. However, in recent years, advanced superhydrophobic nano-coatings, with intrinsic self-cleaning properties, have been developed as a possible alternative to silicone. This paper presents a research carried out in an outdoor test station, where one insulator string composed of nano-coated glass insulators was monitored for over two years and its performance compared with other identical insulator strings, but composed by RTV silicone-coated and non-coated glass insulators. The test station was located in a heavily polluted area of France and the insulator strings were energized at transmission voltage level to represent real operational conditions. The pollution performance and degradation were investigated through leakage current analyses and quarterly visual inspections of the superhydrophobic surface. The results showed that the superhydrophobic nano-coating was only effective when it was new and during a short period of time. Later on, it was subjected to a gradual degradation resulting in a loss of hydrophobicity until reaching a steady hydrophilic condition.

Strongly Intensive Variables and Long-Range Correlations in the Model With a Lattice in the Transverse Plane

In the framework of the quark–gluon string fusion model on the transverse lattice, we study a strongly intensive variable characterizing correlations between the number of particles produced in hadronic interactions in two observation windows separated by a rapidity interval. We show that in the case of independent identical strings, this variable is indeed strongly intensive. It depends only on string characteristics and is independent of trivial so-called volume fluctuations in the string number resulting, in particular, from inevitable impact parameter fluctuations. With string fusion effects causing the production of string clusters with new properties taken into account, this variable turns out to be equal to the weighted average of its values for different string clusters. The weighting coefficients depend on the collision conditions, and the variable loses its strongly intensive character. In the framework of this model in a realistic case with a nonuniform string distribution in the transverse plane, we find explicit analytic formulas for the asymptotic coefficients of long-range correlations between different quantities including an intensive one, the average transverse momentum. We analyze the properties of the obtained correlation coefficients, the studied strongly intensive variable, and also the possibilities of its experimental observation.

Strongly Intensive Observables in the Model with String Fusion

We calculate the strongly intensive observables for multiplicities in two rapidity windows in the model with independent identical strings taking into account the charge sign of particles. We express the observables through the string pair correlation functions describing the correlations between the same and opposite sign particles produced in a string decay. We extract these charge-wise string two-particle correlation functions from the ALICE data on the forward-backward correlations and the balance function. Using them we predict the behavior of the charge-wise strongly intensive observables in the model with independent identical strings. We also show that the observable between multiplicities in two acceptance windows separated in rapidity, which is a strongly intensive in the case with independent identical strings, loses this property, when we take into account string fusion effects and a formation of strings of a few different types takes place in a collision. We predict the changes in the behaviour of this observable with energy and collision centrality, arising due to the string fusion phenomena.

Strongly intensive observable between multiplicities in two acceptance windows in a string model

The strongly intensive observable between multiplicities in two acceptance windows separated in rapidity and azimuth is calculated in the model with quark-gluon strings acting as sources. The dependence of this observable on the two-particle correlation function of a string, the width of observation windows and the rapidity gap between them is analyzed. In the case with independent identical strings the model calculation confirms the strongly intensive character of this observable: it is independent of both the mean number of string and its fluctuation. For this case the peculiarities of its behaviour for particles with different electric charges are also analyzed. In the case when the string fusion processes are taken into account and a formation of strings of a few different types takes place in a collision, this observable is proved to be equal to a weighted average of its values for different string types. Unfortunately, in this case through the weight factors this observable becomes dependent on collision conditions and, strictly speaking, can not be considered any more as strongly intensive variable. For a comparison the results of the calculation of considered observable with the PYTHIA event generator are also presented.

Deep Entity Linking via Eliminating Semantic Ambiguity With BERT

Entity linking refers to the task of aligning mentions of entities in the text to their corresponding entries in a specific knowledge base, which is of great significance for many natural language process applications such as semantic text understanding and knowledge fusion. The pivotal of this problem is how to make effective use of contextual information to disambiguate mentions. Moreover, it has been observed that, in most cases, mention has similar or even identical strings to the entity it refers to. To prevent the model from linking mentions to entities with similar strings rather than the semantically similar ones, in this paper, we introduce the advanced language representation model called BERT (Bidirectional Encoder Representations from Transformers) and design a hard negative samples mining strategy to fine-tune it accordingly. Based on the learned features, we obtain the valid entity through computing the similarity between the textual clues of mentions and the entity candidates in the knowledge base. The proposed hard negative samples mining strategy benefits entity linking from the larger, more expressive pre-trained representations of BERT with limited training time and computing sources. To the best of our knowledge, we are the first to equip entity linking task with the powerful pre-trained general language model by deliberately tackling its potential shortcoming of learning literally, and the experiments on the standard benchmark datasets show that the proposed model yields state-of-the-art results.

String model calculation of the strongly intensive observables for multiplicities in two windows

We calculate the strongly intensive observables for multiplicities in two rapidity windows in the model with independent identical strings taking into account the charge sign of particles. We express the observables through the string pair correlation functions describing the correlations between the same and opposite sign particles produced in a string decay. We extract these charge-wise string two-particle correlation functions from the ALICE data on the forward-backward correlations and the balance function. Using them we predict the behavior of the charge-wise strongly intensive observables in the model with independent identical strings.

Short- and long-range rapidity correlations in the model with a lattice in transverse plane

In the framework of the quark-gluon string model we consider the various fluctuation and correlation observables used in the analysis of the multiparticle production in hadronic interactions at high energy. We express these observables through the fundamental string characteristics and analyze their resulting properties: the dependence on the width of observation window(s), the range of the correlation in rapidity, the intensive or strongly intensive behavior. To take into account the influence of a string fusion processes on the string characteristics and on the behavior of the observables. we use the version of string model with a lattice (grid) in the impact parameter plane. In particular we show that the observable between multiplicities in two acceptance windows separated in rapidity, which is a strongly intensive in the case with independent identical strings, loses this property, when we take into account the string fusion and the formation of strings of a few different types takes place in a collision.

Null objects are ellipsis in Brazilian Portuguese

Abstract Brazilian Portuguese (BP) is known to license anaphoric null objects (ANO), that is, null objects with a linguistic antecedent. It also licenses VP ellipsis (VPE), with auxiliaries, modals and main verbs, the latter a case of V-stranding VPE (V-VPE), the one with which we will be concerned. Although ANOs and V-VPE may have identical surface strings in BP, we propose that they do not have the same structure. We argue that ANOs in BP are cases of DP ellipsis, and they present four properties that have been associated with (VP) ellipsis in the literature: a) availability of strict/sloppy readings (Ross, 1967. Constraints on variables in syntax. Cambridge, MA: MIT dissertation); b) structural parallelism between the antecedent and the elided string (Fiengo and May 1994. Indices and identity. Cambridge, MA: MIT Press); c) formal licensing by a functional category immediately c-commanding the elided string (Lobeck 1995. Ellipsis: Functional heads, licensing, and identification. Oxford: Oxford University Press); and d) disjunctive E-type readings (Simons 1996. Disjunction and anaphora. Proceedings of Semantics and Linguistic Theory 6. 245–260; Simons 2001. On issues in the semantics and pragmatics of disjunction. Ithaca, NY: Cornell University dissertation; Sakamoto 2013. Beyond sloppy identity of elliptic arguments: An interim report. Paper presented at the LingLunch, University of Connecticut. November 5). We then present evidence for an analysis of the ANO as a base-generated empty phrase marker that will be reconstructed in LF. We also propose that ANOs and VPE in BP are licensed by a lexicalized aspectual head, as a consequence of the loss of generalized verb movement in the language.

Entanglement distribution over 150 km in wavelength division multiplexed channels for quantum cryptography

AbstractGranting information privacy is of crucial importance in our society, notably in fiber communication networks. Quantum cryptography provides a unique means to establish, at remote locations, identical strings of genuine random bits, with a level of secrecy unattainable using classical resources. However, several constraints, such as non‐optimized photon number statistics and resources, detectors' noise, and optical losses, currently limit the performances in terms of both achievable secret key rates and distances. Here, these issues are addressed using an approach that combines both fundamental and off‐the‐shelves technological resources. High‐quality bipartite photonic entanglement is distributed over a 150 km fiber link, exploiting a wavelength demultiplexing strategy implemented at the end‐user locations. It is shown how coincidence rates scale linearly with the number of employed telecommunication channels, with values outperforming previous realizations by almost one order of magnitude. Thanks to its potential of scalability and compliance with device‐independent strategies, this system is ready for real quantum applications, notably entanglement‐based quantum cryptography. image

An Efficient Compression Algorithm for Forthcoming New Species

Genomic repositories gradually increase individual and reference sequences, which shares long identical and near-identical strings of nucleotides. In this paper a lossless DNA data compression technique called Optimized Base Repeat Length DNA Compression (OBRLDNAComp) has been proposed, based upon redundancy of DNA sequences. For easy storage, retrieval time reducing and to find similarity within and between sequences compression is mandatory. OBRLDNAComp searches long identical and near-identical strings of nucleotides which are overlooked by other DNA specific compression algorithms. This technique is an optimal solution of longest possible exact repeat benefits towards compression ratio. It scans a sequence horizontally from left to right to find statistic of repeats then follow substitution technique to compress those repeats. The algorithm is straightforward and does not need any external reference file; it scans the individual file for compression and decompression. The achieved compression ratio 1.673 bpb outperforms many non-reference based compression methods.

Shading effect on the energy rating of two identical PV systems on a building façade

The first BIPV system of Turkey was installed on the façade and two towers of the Staff’s Block of Education Faculty building of Mugla Sıtkı Koçman University in February 2008. The PV systems cover 405m2 (60 tilted surface and two vertical towers on east and west sides of the building) with single and triple junction amorphous (3j-aSi) photovoltaic modules. The total installed power of the BIPV system is 40.3kWp. Total cumulative produced electricity of the BIPV system at the end of 2014 from the start up is exceeding 200,000kWh. In this work, the shading effect on the performance of two PV systems based on 3j-aSi photovoltaic modules on the façade is analysed. There are 5 rows on the façade of the building and two identical strings’ energy rating values are compared. One string has only row shading but the second string has smaller shading. In this comparison it is found that energetic performances so called energy rating (kWh/kWp) values of the arrays differ 16% for an annual average between 10% and 24% monthly intervals. In winter months the shading effect is caused by the tree is less than 1% in the electricity yield where there is no row shading in winter months. But in summer months (because of the height of the sun) the calculated energy yield difference is about 15%. In 21st of June between 9.00 and 13.00 it is calculated that the output between the inverters is 15% where there is no shading because of the tree all shading is from the upper rows.PV data is collected with a Sunlog data logger. Daily power and electricity production values and the shading effect on different seasons are also analysed.

Detection of Annotation Errors in Corpora

AbstractThis paper surveys methods for annotation error detection and correction. Methods can broadly be characterized as to whether they detect inconsistencies with respect to some statistical model based only on the corpus data or whether they detect inconsistencies with respect to a grammatical model, in general, some external information source. Two extended examples are presented, illustrating these different techniques: (1) the variation n‐gram method, which searches for inconsistences in annotation for identical strings; and (2) a method of ad hoc rule detection, for syntactic annotation, which compares treebank rules to a grammar to determine which are anomalous. Methods for detecting annotation errors have developed much over the last decade, and thus corpus practitioners can benefit greatly from them, while at the same time NLP researchers can learn more about the nuances of the annotation they use and see how error correction methods intersect with NLP techniques.

Investigating academic plagiarism: A forensic linguistics approach to plagiarism detection

Automatic plagiarism detection tools have evolved considerably in recent years. Owing in part to the recent technological developments, which provided more powerful processing capacities, as well as to the research interest that plagiarism detection attracted among computational linguists, results are nowadays more accurate and reliable. However, most of the plagiarism detection systems freely and commercially available are still based on similarity measures, whose algorithms search for similar or, at most, identical strings of text, within a more or less short search distance. Although these methods tend to perform well in detecting literal, verbatim plagiarism, their performance drops when other strategies are used, such as word substitution or reordering. This paper presents the results of a forensic linguistic analysis of real plagiarism cases among higher education students. Comparing the suspect plagiarised strings against the most likely originals from a legal perspective, it is demonstrated that strategies other than literal borrowing are increasingly used to plagiarise. A forensic linguistic explanation of the strategies used and why they represent instances of plagiarism is then offered, and examples are provided to illustrate why existing software fails to detect them. The paper concludes by arguing that commonly used detection software packages can be effective in identifying matching text, but are not necessarily good plagiarism detection systems. More indepth research and improvements in computational linguistics and natural language processing are required to increase the accuracy and reliability of the machinedetection procedure.

Unshuffling a square is NP-hard

A shuffle of two strings is formed by interleaving the characters into a new string, keeping the characters of each string in order. A string is a square if it is a shuffle of two identical strings. There is a known polynomial time dynamic programming algorithm to determine if a given string z is the shuffle of two given strings x, y; however, it has been an open question whether there is a polynomial time algorithm to determine if a given string z is a square. We resolve this by proving that this problem is NP-complete via a many-one reduction from 3-Partition.

An analysis of error reconciliation protocols used in Quantum Key Distribution systems

Quantum Key Distribution (QKD) is a revolutionary security technology that exploits the laws of quantum mechanics to achieve information-theoretic secure key exchange. QKD enables two parties to “grow” a shared secret key without placing any limits on an adversary’s computational power. Error reconciliation protocols have been developed that preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these is the Cascade protocol, which is effective but suffers from a high communication complexity and low throughput. The Winnow protocol reduces the communication complexity over Cascade, but has the disadvantage of introducing errors. Finally, Low Density Parity Check (LDPC) codes have been shown to reconcile errors at rates higher than those of Cascade and Winnow, but with greater computational complexity. In this paper we evaluate the effectiveness of LDPC codes by comparing the runtime, throughput and communication complexity empirically with the Cascade and Winnow algorithms. The effects of inaccurate error estimation, non-uniform error distribution and varying key length on all three protocols are evaluated for identical input key strings. Analyses are performed on the results in order to characterize the strengths and weaknesses of each protocol.

Stimulated acoustic emissions from coupled strings

We consider traveling transverse waves on two identical uniform taut strings that are elastically coupled through springs that gradually decrease their stiffness over a region of finite length. The wave system can be decomposed into two modes: an in-phase mode (+) that is transparent to the coupling springs, and an out-of-phase mode (-) that engages the coupling springs and can resonate at a particular location depending on the excitation frequency. The system exhibits linear mode conversion whereby an incoming (+) wave is reflected back from the resonance location both as a propagating (+) wave and an evanescent (-) wave, while both types emerge as propagating forward through the resonance location. We match a local transition layer expansion to the WKB expansion to obtain estimates of the reflection and transmission coefficients. The reflected waves may be an analog for stimulated emissions from the ear.

Iterative Dictionary Construction for Compression of Large DNA Data Sets

Genomic repositories increasingly include individual as well as reference sequences, which tend to share long identical and near-identical strings of nucleotides. However, the sequential processing used by most compression algorithms, and the volumes of data involved, mean that these long-range repetitions are not detected. An order-insensitive, disk-based dictionary construction method can detect this repeated content and use it to compress collections of sequences. We explore a dictionary construction method that improves repeat identification in large DNA data sets. Our adaptation, COMRAD, of an existing disk-based method identifies exact repeated content in collections of sequences with similarities within and across the set of input sequences. COMRAD compresses the data over multiple passes, which is an expensive process, but allows COMRAD to compress large data sets within reasonable time and space. COMRAD allows for random access to individual sequences and subsequences without decompressing the whole data set. COMRAD has no competitor in terms of the size of data sets that it can compress (extending to many hundreds of gigabytes) and, even for smaller data sets, the results are competitive compared to alternatives; as an example, 39 S. cerevisiae genomes compressed to 0.25 bits per base.