Search results for "complex"
showing 10 items of 5889 documents
On thermoeconomics of energy systems at variable load conditions: integrated optimization of plant design and operation
2007
Abstract Thermoeconomics has been assuming a growing role among the disciplines oriented to the analysis of energy systems, its different methodologies allowing solution of problems in the fields of cost accounting, plant design optimisation and diagnostic of malfunctions. However, the thermoeconomic methodologies as such are particularly appropriate to analyse large industrial systems at steady or quasi-steady operation, but they can be hardly applied to small to medium scale units operating in unsteady conditions to cover a variable energy demand. In this paper, the fundamentals of thermoeconomics for systems operated at variable load are discussed, examining the cost formation process an…
Radiative heat exchanges of people in complex geometry buildings: An experimentally based algorithm for computing angle factors
2008
Thermal comfort of people working or living in confined spaces depends, to a large extent, on the radiative thermal exchanges. These contributions are expressed, among other things, as a function of the mean radiant temperature that, in the general cases where there is a presence of high intensity sources, must be expressed as a function of the angle factors between subjects and the surrounding surfaces of enclosures. Angle factors, in turn, depend on the projected area factors. Despite this evidence, at the present there is a lack in the availability of simple and reliable methods capable of computing angle factors of people in assigned postures with respect to complex geometry buildings. …
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…
Spin crossover behavior in a series of iron(III) alkoxide complexes.
2015
The synthesis, crystal structures, magnetic behavior, and electron paramagnetic resonance studies of five new FeIII spin crossover (SCO) complexes are reported. The [FeIIIN5O] coordination core is constituted of the pentadentate ligand bztpen (N5) and a series of alkoxide anions (ethoxide, propoxide, n-butoxide, isobutoxide, and ethylene glycoxide). The methoxide derivative previously reported by us is also reinvestigated. The six complexes crystallize in the orthorhombic Pbca space group and show similar molecular structures and crystal packing. The coordination octahedron is strongly distorted in both the high- and low-temperature structures. The structural changes upon spin conversion ar…
On the effectiveness of Finite Element simulation of orthogonal cutting with particular reference to temperature prediction
2007
Abstract Finite Element simulation of orthogonal cutting is nowadays assuming a large relevance; in fact a very large number of papers may be found out in technical literature on this topic. In recent years, numerical simulation was performed to investigate various phenomena such as chip segmentation, force prediction and tool wear. On the other hand, some drawbacks have to be highlighted; due to the geometrical and computational complexity of the updated-Lagrangian formulation mostly used in FE codes, a cutting time of only a few milliseconds can be effectively simulated. Therefore, steady-state thermal conditions are not reached and the simulation of the thermal phenomenon may be ineffect…
Combined effects of compost and Medicago sativa in recovery a PCB contaminated soil
2020
The effectiveness of adding compost and the plant Medicago sativa in improving the quality of a soil historically contaminated by polychlorinated biphenyls (PCBs) was tested in greenhouse microcosms. Plant pots, containing soil samples from an area contaminated by PCBs, were treated with the compost and the plant, separately or together. Moreover, un-treated and un-planted microcosms were used as controls. At fixed times (1, 133 and 224 days), PCBs were analysed and the structure (cell abundance, phylogenetic characterization) and functioning (cell viability, dehydrogenase activity) of the natural microbial community were also measured. The results showed the effectiveness of the compost an…
Inducing the Lyndon Array
2019
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space, where $n$ is the length of the text and $\sigma$ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use $O(n)$ words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not onl…
On the Inner Product Predicate and a Generalization of Matching Vector Families
2018
Motivated by cryptographic applications such as predicate encryption, we consider the problem of representing an arbitrary predicate as the inner product predicate on two vectors. Concretely, fix a Boolean function $P$ and some modulus $q$. We are interested in encoding $x$ to $\vec x$ and $y$ to $\vec y$ so that $$P(x,y) = 1 \Longleftrightarrow \langle\vec x,\vec y\rangle= 0 \bmod q,$$ where the vectors should be as short as possible. This problem can also be viewed as a generalization of matching vector families, which corresponds to the equality predicate. Matching vector families have been used in the constructions of Ramsey graphs, private information retrieval (PIR) protocols, and mor…
Combinatorial proofs of two theorems of Lutz and Stull
2021
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…
Unit contradiction versus unit propagation
2012
Some aspects of the result of applying unit resolution on a CNF formula can be formalized as functions with domain a set of partial truth assignments. We are interested in two ways for computing such functions, depending on whether the result is the production of the empty clause or the assignment of a variable with a given truth value. We show that these two models can compute the same functions with formulae of polynomially related sizes, and we explain how this result is related to the CNF encoding of Boolean constraints.