Nonlinear relaxation time and the detection of weak signals

Laser systems can be used to detect very weak optical signals. The physical mechanism is the dynamical process of the relaxation of a laser from an unstable state to a steady stable state. We present an analysis of this process based on the study of the nonlinear relaxation time. Our analytical results are compared with numerical integration of the stochastic differential equations that model this process.

Dynamically tuned interferometers for the observation of gravitational waves from coalescing compact binaries

We propose a new method of operating laser interferometric gravitational-wave detectors when observing chirps of gravitational radiation from coalescing compact binary stars. This technique consists of the use of narrow-band dual recycling to increase the signal but with the tuning frequency of the detector arranged to follow the frequency of a chirp. We consider the response of such an instrument to chirps, including the effect of inevitable errors in tracking. Different possible tuning strategies are discussed. Both the final signal-to-noise ratio and timing accuracy are evaluated and are shown to be significantly improved by the use of dynamic tuning. This should allow an accurate and reliable measurement of Hubble's constant.

Compact thermal storage: a-state-of-the-art review of experimental results

Thermal energy storage (TES) can increase the thermal energy effieresa, of a process by reusing the waste heat from industrial process, solar energy or other sources. There are different ways to store thermal energy: by sensible heat, by latest heat, by sorption process or by chemical reaction. This thesrs provides a-state-of-the-art review of the experimental performance of TES systems based on solid gas sorption process and chemical reactions. The importance of theses processes is that provides a heat loss free storage system with a high energy density.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

A digital holography technique for generating beams with arbitrary polarization and shape

A method for generating beams with arbitrary polarization and shape is proposed. Our design requires the use of a Mach-Zehnder set-up combined with translucent liquid crystal displays in each arm of the interferometer; in this way, independent manipulation of each transverse beam components is possible. The target of this communication is to develop a numerical procedure for calculating the holograms required for dynamically encode any amplitude value and polarization state in each point of the wavefront. Several examples demonstrating the capabilities of the method are provided.