Search results for " Compression"

showing 10 items of 400 documents

Getting insights into the behavior of variable speed direct expansion air conditioning systems under faulty operating conditions

2019

Direct expansion air conditioning systems, such as rooftop units, are widely adopted in small and medium scale commercial buildings. In order to increase the energy performance of these systems during part-load operation, variable-speed compressors and fans have been adopted in the last two decades. However, profitable energy saving could be achieved not only by optimizing the design and the control of these systems, but also by scheduling a proper maintenance strategy. In fact, if not properly maintained, no benefits would be achieved even when more sophisticated systems are adopted. In order to support plant owners in scheduling cost-effective maintenance program, Fault Detection and Diag…

Evaporator and Condenser FoulingCharge FaultVapor compression systemvariable-speed rooftop unitFault Detection and Diagnosi
researchProduct

Exergy analysis and thermoeconomic cost accounting of a Combined Heat and Power steam cycle integrated with a Multi Effect Distillation-Thermal Vapou…

2017

Abstract In this paper an exergy analysis and thermoeconomic cost accounting of a Combined Heat and Power steam cycle integrated with Multi Effect Distillation-Thermal Vapour Compression plant is performed; the goal of the study is to show how these methodologies provide a rational criterion to allocate production costs on electricity and freshwater in such a dual purpose system. After a brief overview on the methodology and a description of reference plant, exergy analysis is carried out to calculate exergy flows and exergy efficiencies at component level. A detailed description of the adopted thermoeconomic model is given. In a first scenario, cost accounting is performed assuming that th…

ExergyRankine cycleEngineering020209 energyCost accountingEnergy Engineering and Power Technology02 engineering and technologyDesalinationlaw.inventionThermoeconomic cost accountingCogenerationlawReverse electrodialysi0202 electrical engineering electronic engineering information engineeringUnit costProcess engineeringCogenerationWaste managementbusiness.industryDesalinationRenewable Energy Sustainability and the EnvironmentExergy analysiThermal vapour compressionFuel TechnologyNuclear Energy and EngineeringMultiple-effect distillationExergy efficiencybusiness
researchProduct

Thermodynamic, Exergy, and Thermoeconomic analysis of Multiple Effect Distillation Processes

2018

Abstract Multiple effect distillation (MED) is nowadays the preferred technology for the construction of new plants based on thermal processes in the growing desalination market. MED technology, in fact, presents a number of advantages with respect to the more traditional multistage flash technology, among all the lower energy consumption achievable in MED plants. However, a large potential for improvement in terms of lowering production costs still exists, which stimulates further efforts on process optimization from companies and researchers involved in the field. Thermodynamic and exergy analysis provides useful insights regarding the identification of main inefficiencies and the margins…

ExergySettore ING-IND/26 - Teoria Dello Sviluppo Dei Processi ChimiciComputer scienceProcess (engineering)020209 energy02 engineering and technologyMultiple effect distillation7. Clean energyDesalinationChemical exergy020401 chemical engineeringOrder (exchange)0202 electrical engineering electronic engineering information engineeringSettore ING-IND/10 - Fisica Tecnica IndustrialeProduction (economics)Process optimization0204 chemical engineeringActivity-based costingProcess engineeringbusiness.industryExergy analysi6. Clean waterThermal vapor compressionMultiple-effect distillationThermal exergyExergy cost accountingbusinessRenewable Energy Powered Desalination Handbook
researchProduct

Efficiency improvement of DC* through a Genetic Guidance

2017

DC∗ is a method for generating interpretable fuzzy information granules from pre-classified data. It is based on the subsequent application of LVQ1 for data compression and an ad-hoc procedure based on A∗ to represent data with the minimum number of fuzzy information granules satisfying some interpretability constraints. While being efficient in tackling several problems, the A∗ procedure included in DC∗ may happen to require a long computation time because the A∗ algorithm has exponential time complexity in the worst case. In this paper, we approach the problem of driving the search process of A∗ by suggesting a close-to-optimal solution that is produced through a Genetic Algorithm (GA). E…

Exponential complexity0209 industrial biotechnologyMathematical optimizationComputationProcess (computing)02 engineering and technologyFuzzy logic020901 industrial engineering & automationGenetic algorithm0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingAlgorithmMathematicsInterpretabilityData compression2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
researchProduct

P2D: a self-supervised method for depth estimation from polarimetry

2021

Monocular depth estimation is a recurring subject in the field of computer vision. Its ability to describe scenes via a depth map while reducing the constraints related to the formulation of perspective geometry tends to favor its use. However, despite the constant improvement of algorithms, most methods exploit only colorimetric information. Consequently, robustness to events to which the modality is not sensitive to, like specularity or transparency, is neglected. In response to this phenomenon, we propose using polarimetry as an input for a self-supervised monodepth network. Therefore, we propose exploiting polarization cues to encourage accurate reconstruction of scenes. Furthermore, we…

FOS: Computer and information sciences0209 industrial biotechnologyMonocularComputer sciencebusiness.industryComputer Vision and Pattern Recognition (cs.CV)PolarimetryComputer Science - Computer Vision and Pattern RecognitionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]02 engineering and technology010501 environmental sciences01 natural sciencesRegularization (mathematics)Term (time)020901 industrial engineering & automation[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]SpecularityRobustness (computer science)Depth mapComputer visionArtificial intelligenceTransparency (data compression)business0105 earth and related environmental sciences
researchProduct

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform

2021

The Burrows-Wheeler-Transform (BWT), a reversible string transformation, is one of the fundamental components of many current data structures in string processing. It is central in data compression, as well as in efficient query algorithms for sequence data, such as webpages, genomic and other biological sequences, or indeed any textual data. The BWT lends itself well to compression because its number of equal-letter-runs (usually referred to as $r$) is often considerably lower than that of the original string; in particular, it is well suited for strings with many repeated factors. In fact, much attention has been paid to the $r$ parameter as measure of repetitiveness, especially to evalua…

FOS: Computer and information sciencesBurrows–Wheeler transformSettore INF/01 - InformaticaCombinatorics on wordsFormal Languages and Automata Theory (cs.FL)Computer scienceString (computer science)Search engine indexingCompressed data structuresComputer Science - Formal Languages and Automata TheoryString indexingData structureMeasure (mathematics)Burrows-Wheeler-TransformRepetitivenessCombinatorics on wordsBurrows-Wheeler-Transform Compressed data structures String indexing Repetitiveness Combinatorics on wordsTransformation (function)Computer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)AlgorithmData compression
researchProduct

Adaptive learning of compressible strings

2020

Suppose an oracle knows a string $S$ that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is $s$ a substring of $S$?". In 1995, Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask the oracle $\sigma n/4 -O(n)$ queries in order to be able to reconstruct the hidden string, where $\sigma$ is the size of the alphabet of $S$ and $n$ its length, and gave an algorithm that spends $(\sigma-1)n+O(\sigma \sqrt{n})$ queries to reconstruct $S$. The main contribution of our paper is to improve the above upper-bound in the context where the string is compressible. We first present a universal algorithm that, given a (computable) compre…

FOS: Computer and information sciencesCentroid decompositionGeneral Computer ScienceString compressionAdaptive learningKolmogorov complexityContext (language use)Data_CODINGANDINFORMATIONTHEORYString reconstructionTheoretical Computer ScienceCombinatoricsString reconstruction; String learning; Adaptive learning; Kolmogorov complexity; String compression; Lempel-Ziv; Centroid decomposition; Suffix treeSuffix treeIntegerComputer Science - Data Structures and AlgorithmsOrder (group theory)Data Structures and Algorithms (cs.DS)Adaptive learning; Centroid decomposition; Kolmogorov complexity; Lempel-Ziv; String compression; String learning; String reconstruction; Suffix treeTime complexityComputer Science::DatabasesMathematicsLempel-ZivSettore INF/01 - InformaticaLinear spaceString (computer science)SubstringBounded functionString learningTheoretical Computer Science
researchProduct

Perceptually Optimized Image Rendering

2017

We develop a framework for rendering photographic images by directly optimizing their perceptual similarity to the original visual scene. Specifically, over the set of all images that can be rendered on a given display, we minimize the normalized Laplacian pyramid distance (NLPD), a measure of perceptual dissimilarity that is derived from a simple model of the early stages of the human visual system. When rendering images acquired with a higher dynamic range than that of the display, we find that the optimization boosts the contrast of low-contrast features without introducing significant artifacts, yielding results of comparable visual quality to current state-of-the-art methods, but witho…

FOS: Computer and information sciencesComputer Science - Artificial IntelligenceImage qualityComputer scienceComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONImage processing02 engineering and technologyLuminanceRendering (computer graphics)Computer Science - GraphicsOptics0202 electrical engineering electronic engineering information engineeringComputer visionPower functionComputingMethodologies_COMPUTERGRAPHICSbusiness.industryDynamic range020207 software engineeringAtomic and Molecular Physics and OpticsGraphics (cs.GR)Electronic Optical and Magnetic MaterialsArtificial Intelligence (cs.AI)Human visual system model020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessImage compression
researchProduct

The rightmost equal-cost position problem.

2013

LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resulting compression ratio. This is optimally achieved by using the rightmost occurrence of a factor in the previous text. Given a cost function, for instance the minimum number of bits used to represent an integer, we define the Rightmost Equal-Cost Position (REP) problem as the problem of finding one of the occurrences of a factor whose cost is equal to the cost of the rightmost one. We present the Multi-Layer Suffix Tree data structure that, for…

FOS: Computer and information sciencesOffset (computer science)Computer scienceSuffix treeComputer Science - Information Theorylaw.inventionCombinatoricslawLog-log plotComputer Science - Data Structures and AlgorithmsCompression schemetext compressiondictionary text compressionData Structures and Algorithms (cs.DS)LZ77 compressiondata compressionLossless compressionfull text indexSuffix Tree Data StructuresSettore INF/01 - InformaticaInformation Theory (cs.IT)Data structurePrefixCompression ratioCompression scheme; Constant time; Suffix Tree Data StructuresAlgorithmData compressionConstant time
researchProduct

Constructing Antidictionaries in Output-Sensitive Space

2021

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniOutput sensitive algorithmsString algorithmsPhysicsAntidictionarieSettore INF/01 - InformaticaOutput sensitive algorithm0102 computer and information sciencesAbsent wordsSpace (mathematics)01 natural sciencesAntidictionariesCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYData compressionComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Computer Science::Symbolic Computation[INFO]Computer Science [cs]Absent wordAlphabetWord (group theory)2019 Data Compression Conference (DCC)
researchProduct