The supersymmetric technique for random-matrix ensembles with zero eigenvalues

The supersymmetric technique is applied to computing the average spectral density near zero energy in the large-N limit of the random-matrix ensembles with zero eigenvalues: B, DIII-odd, and the chiral ensembles (classes AIII, BDI, and CII). The supersymmetric calculations reproduce the existing results obtained by other methods. The effect of zero eigenvalues may be interpreted as reducing the symmetry of the zero-energy supersymmetric action by breaking a certain abelian symmetry.Comment: 22 pages, introduction modified, one reference adde

A survey on maximal green sequences

Maximal green sequences appear in the study of Fomin-Zelevinsky's cluster algebras. They are useful for computing refined Donaldson-Thomas invariants, constructing twist automorphisms and proving the existence of theta bases and generic bases. We survey recent progress on their existence and properties and give a representation-theoretic proof of Greg Muller's theorem stating that full subquivers inherit maximal green sequences. In the appendix, Laurent Demonet describes maximal chains of torsion classes in terms of bricks generalizing a theorem by Igusa.Comment: 15 pages, submitted to the proceedings of the ICRA 18, Prague, comments welcome; v2: misquotation in section 6 corrected; v3: minor changes, final version; v4: reference to Jiarui Fei's work added, post-final version; v4: formulation of Remark 4.3 corrected; v5: misquotation of Hermes-Igusa's 2019 paper corrected; v5: reference to Kim-Yamazaki's paper adde

Discrete Gauge Groups in F-theory Models on Genus-One Fibered Calabi-Yau 4-folds without Section

We determine the discrete gauge symmetries that arise in F-theory compactifications on examples of genus-one fibered Calabi-Yau 4-folds without a section. We construct genus-one fibered Calabi-Yau 4-folds using Fano manifolds, cyclic 3-fold covers of Fano 4-folds, and Segre embeddings of products of projective spaces. Discrete $\mathbb{Z}_5$, $\mathbb{Z}_4$, $\mathbb{Z}_3$ and $\mathbb{Z}_2$ symmetries arise in these constructions. We introduce a general method to obtain multisections for several constructions of genus-one fibered Calabi-Yau manifolds. The pullbacks of hyperplane classes under certain projections represent multisections to these genus-one fibrations. We determine the degrees of these multisections by computing the intersection numbers with fiber classes. As a result, we deduce the discrete gauge symmetries that arise in F-theory compactifications. This method applies to various Calabi-Yau genus-one fibrations.Comment: 29 pages. Some clarifications, updated acknowledgments, added reference

Mobile collaborative cloudless computing

Although the computational power of mobile devices has been increasing, it is still not enough for some classes of applications. In the present, these applications delegate the computing power burden on servers located on the Internet. This model assumes an always-on Internet connectivity and implies a non-negligible latency. The thesis addresses the challenges and contributions posed to the application of a mobile collaborative computing environment concept to wireless networks. The goal is to define a reference architecture for high performance mobile applications. Current work is focused on efficient data dissemination on a highly transitive environment, suitable to many mobile applications and also to the reputation and incentive system available on this mobile collaborative computing environment. For this we are improving our already published reputation/incentive algorithm with knowledge from the usage pattern from the eduroam wireless network in the Lisbon area

A large neighbourhood based heuristic for two-echelon routing problems

In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computational experiments to investigate the contribution of these operators to the search performance, and measure the performance of the method on both problem classes. The proposed algorithm finds the current best known solutions, or better ones, for 95% of the two-echelon vehicle routing problem benchmark instances. Overall, for both problems, it achieves high-quality solutions within short computing times. Finally, for future reference, we resolve inconsistencies between different versions of benchmark instances, document their differences, and provide them all online in a unified format

Multispectral Vision for Monitoring Peach Ripeness

The main objective of this research was to develop an automatic procedure able to classify Rich Lady commercial peaches according to their ripeness stage through multispectral imaging techniques. A classification procedure was applied to the ratio images calculated as red (R, 680 nm) divided by infrared (IR, 800 nm), that is, R/IR images. Four image-based ripeness reference classes (A: unripe to D: overripe) were generated from 380 fruit images (season 1: 2006) by a nonsupervised classification method and evaluated according to reference measurements of the ripeness of the same samples: Magness-Taylor penetrometry firmness, low-mass impact firmness, reflectance at 680 nm (R680, and soluble solids content. The assignment of unknown sample images from those season 1 images (internal validation, n = 380) and of 240 images from the 2nd season (season 2: 2007) to the ripeness reference classes (external validation) was carried out by computing the minimum Euclidean distance (classification distance, Cd) between each unknown image histogram and the average histogram of each ripeness reference class. For both validation phases, firmness values decreased and R680 increased for increasing alphabetical order of image-based class letter, reflecting the ripening process. Moreover, 70% (season 1) and 80% (season 2) of the samples below bruise susceptibility firmness were classified into class D

User\u27s Manual for CCRC: (Common Lisp Version) Computing Reference Classes Statistical Reasoning Shell v. 2.5

CCRC implements a subset of Kyburg\u27s rules for statistical inference. The system states from 1961 and is briefly described in The Reference Class, (H. Kyburg Philosophy of Science 50, 1982). Consult the paper Computing Reference Classes (R. Loui, in Kanal, L. and Lemmer, J., Uncertainty in AI, v.1, North-Holland 1987) for a precis of the ideas underlying this program. This document is only the skeleton of a manual. It is designed to get the novice on the program as quickly as possible, and to provide some guidance for advanced questions. This piece of software is the extended version of a prototype principally intended to assist AI research on reasoning with uncertainty. This program is a small prototype extended so that it can be patched into larger experimental systems

Graphical calculus for Gaussian pure states

We provide a unified graphical calculus for all Gaussian pure states, including graph transformation rules for all local and semi-local Gaussian unitary operations, as well as local quadrature measurements. We then use this graphical calculus to analyze continuous-variable (CV) cluster states, the essential resource for one-way quantum computing with CV systems. Current graphical approaches to CV cluster states are only valid in the unphysical limit of infinite squeezing, and the associated graph transformation rules only apply when the initial and final states are of this form. Our formalism applies to all Gaussian pure states and subsumes these rules in a natural way. In addition, the term "CV graph state" currently has several inequivalent definitions in use. Using this formalism we provide a single unifying definition that encompasses all of them. We provide many examples of how the formalism may be used in the context of CV cluster states: defining the "closest" CV cluster state to a given Gaussian pure state and quantifying the error in the approximation due to finite squeezing; analyzing the optimality of certain methods of generating CV cluster states; drawing connections between this new graphical formalism and bosonic Hamiltonians with Gaussian ground states, including those useful for CV one-way quantum computing; and deriving a graphical measure of bipartite entanglement for certain classes of CV cluster states. We mention other possible applications of this formalism and conclude with a brief note on fault tolerance in CV one-way quantum computing.Comment: (v3) shortened title, very minor corrections (v2) minor corrections, reference added, new figures for CZ gate and beamsplitter graph rules; (v1) 25 pages, 11 figures (made with TikZ