This work is about setting up Samba software on server with operating system from BSD family to primary domain controller rule in the high school computer network environment with Microsoft Windows stations. After introduction to Samba software there is examined problem of Windows network based on SMB protocol. There are described steps that are necessary to setup Samba software, disk sharing services, creation of user accounts and adding client stations to domain trust. At the next there is described problematic of network printing in the Windows environment, print servers and the solution with classical printing support in FreeBSD and CUPS printing support. In the next part there is described mass installation procedure of Windows stations with same hardware configuration. At the finish, there are noticed some tasks that are necessary for next operation of installed system.

No description available.

Résumé: De nombreuses études ont établi que l’exposition aux moisissures intérieures peut être nuisible à la santé. Dans une récente étude, 21 composés organiques volatils microbiens (COVM) ont été sélectionnés comme biomarqueurs potentiels de l’exposition aux moisissures intérieures. L’objectif du projet était de déterminer les coefficients de partage (CP) sang:air, urine:air, plasma:air et eau:air pour ces composés, paramètres utilisés dans la prédiction de la toxicocinétique des xénobiotiques. Pour y parvenir, la méthode de flacons à l’équilibre a été utilisée. Les COVM (1.57-2.01 µg) injectés dans des flacons (20 ml) hermétiquement scellés contenant soit 0.5 ml de matrice (flacons test) ou simplement de l’air (flacons références) ont été incubés 60 min à 37⁰ C sous agitation continue. La quantification des COVM dans l’espace de tête des flacons (test et références) a été ensuite faite par chromatographie en phase gazeuse couplée à la spectrométrie de masse (GC-MS/MS). Les CP de 19 COVM variaient entre 78 et 4721 pour sang:air, 14 et 3586 pour urine:air, 64 et 5604 pour plasma:air et 16 et 2210 pour eau:air. Les CP eau:air étaient étroitement liés aux CP urine:air pour 17 COVM (R2 = 0,97, pente =1,001) suggérant que la valeur de CP eau:air (lorsqu’inférieur à103) peut être un substitut au CP urine:air. L’étude des ratios sang:urine indique que six COVM seraient nettement plus concentrés dans le sang, matrice de choix pour ces composés. Les données générées par cette étude faciliteront le développement de modèles pharmacocinétiques de COVM et le paramétrage de leurs prélèvements en tant que biomarqueurs de l’exposition aux moisissures intérieures. / Abstract: Numerous studies have established that exposure to indoor molds can be harmful to health. In a recent study, 21 microbial volatile organic compounds (mVOCs) were selected as potential biomarkers of indoor mold exposure. The objective of the project was to determine the blood:air, urine:air, plasma:air, and water:air partition coefficients (PCs) for these compounds, parameters used in predicting the toxicokinetics of xenobiotics. To achieve this, the vial-equilibration method was used. mVOCs (1.57-2.01 µg) were injected into hermetically sealed vials (20 ml) containing either 0.5 ml of matrix (test vials) or simply air (reference vials) and were incubated for 60 min at 37 ⁰C under continuous agitation. Quantification of mVOCs in the headspace of the vials (test and reference) was then performed by gas chromatography mass spectrometry (GC-MS/MS). The PCs of 19 mVOCs ranged from 78 and 4721 for blood:air, 14 and 3586 for urine:air, 64 and 5604 for plasma:air, and 16 and 2210 for water:air. Water:air PCs were closely related to urine:air PCs for 17 mVOCs (R2 = 0.97, slope =1.001) suggesting that the water:air PC value (when less than 103) may be a surrogate for the urine:air PC. The blood:urine ratio study indicates that six mVOCs would be significantly more concentrated in blood, the matrix of choice for these compounds. The data generated from this study will facilitate the development of pharmacokinetic models of mVOCs and the parameterization of their sampling as biomarkers of indoor mold exposure.

No description available.

[pt] A programação estocástica dois estágios é uma abordagem matemática amplamente usada em aplicações da vida real, como planejamento da operação de sistemas de energia, cadeias de suprimentos, logística, gerenciamento de inventário e planejamento financeiro. Como a maior parte desses problemas não pode ser resolvida analiticamente, os tomadores de decisão utilizam métodos numéricos para obter uma solução quase ótima. Em algumas aplicações, soluções não convergidas e, portanto, sub-ótimas terminam sendo implementadas devido a limitações de tempo ou esforço computacional. Nesse contexto, os métodos existentes fornecem uma solução otimista sempre que a convergência não é atingida. As soluções otimistas geralmente geram altos níveis de arrependimento porque subestimam os custos reais na função objetivo aproximada. Para resolver esse problema, temos desenvolvido duas metodologias de solução conservadora para problemas de programação linear estocástica dois estágios com incerteza do lado direito e suporte retangular: Quando a verdadeira distribuição de probabilidade da incerteza é conhecida, propomos um problema DRO (Distributionally Robust Optimization) baseado em esperanças condicionais adaptadas à uma partição do suporte cuja complexidade cresce exponencialmente com a dimensionalidade da incerteza; Quando apenas observações históricas da incerteza estão disponíveis, propomos um problema de DRO baseado na métrica de Wasserstein a fim de incorporar ambiguidade sobre a real distribuição de probabilidade da incerteza. Para esta última abordagem, os métodos existentes dependem da enumeração dos vértices duais do problema de segundo estágio, tornando o problema DRO intratável em aplicações práticas. Nesse contexto, propomos esquemas algorítmicos para lidar com a complexidade computacional de ambas abordagens. Experimentos computacionais são apresentados para o problema do fazendeiro, o problema de alocação de aviões, e o problema do planejamento da operação do sistema elétrico (unit ommitmnet problem). / [en] Two-stage stochastic programming is a mathematical framework widely used in real-life applications such as power system operation planning, supply chains, logistics, inventory management, and financial planning. Since most of these problems cannot be solved analytically, decision-makers make use of numerical methods to obtain a near-optimal solution. Some applications rely on the implementation of non-converged and therefore sub-optimal solutions because of computational time or power limitations. In this context, the existing methods provide an optimistic solution whenever convergence is not attained. Optimistic solutions often generate high disappointment levels because they consistently underestimate the actual costs in the approximate objective function. To address this issue, we have developed two conservative-solution methodologies for two-stage stochastic linear programming problems with right-hand-side uncertainty and rectangular support: When the actual data-generating probability distribution is known, we propose a DRO problem based on partition-adapted conditional expectations whose complexity grows exponentially with the uncertainty dimensionality; When only historical observations of the uncertainty are available, we propose a DRO problem based on the Wasserstein metric to incorporate ambiguity over the actual data-generating probability distribution. For this latter approach, existing methods rely on dual vertex enumeration of the second-stage problem rendering the DRO problem intractable in practical applications. In this context, we propose algorithmic schemes to address the computational complexity of both approaches. Computational experiments are presented for the farmer problem, aircraft allocation problem, and the stochastic unit commitment problem.

The Macintosh Hierarchical File System Plus, HFS +, or as it is commonly referred to as the Mac Operating System, OS, Extended, was introduced in 1998 with Mac OS X 8.1. HFS+ is an update to HFS, Mac OS Standard format that offers more efficient use of disk space, implements international friendly file names, future support for named forks, and facilitates booting on non-Mac OS operating systems through different partition schemes. The HFS+ file system is efficient, yet, complex. It makes use of B-trees to implement key data structures for maintaining meta-data about folders, files, and data. The implementation of what happens within HFS+ at volume format, or when folders, files, and data are created, moved, or deleted is largely a mystery to those who are not programmers. The vast majority of information on this subject is relegated to documentation in books, papers, and online content that direct the reader to C code, libraries, and include files. If one can’t interpret the complex C or Perl code implementations the opportunity to understand the workflow within HFS+ is less than adequate to develop a basic understanding of the internals and how they work. The basic concepts learned from this research will facilitate a better understanding of the HFS+ file system and journal as changes resulting from the adding and deleting files or folders are applied in a controlled, easy to follow, process. The primary tool used to examine the file system changes is a proprietary command line interface, CLI, tool called fileXray. This tool is actually a custom implementation of the HFS+ file system that has the ability to examine file system, meta-data, and data level information that iv isn’t available in other tools. We will also use Apple’s command line interface tool, Terminal, the WinHex graphical user interface, GUI, editor, The Sleuth Kit command line tools and DiffFork 1.1.9 help to document and illustrate the file system changes. The processes used to document the pristine and changed versions of the file system, with each experiment, are very similar such that the output files are identical with the exception of the actual change. Keeping the processes the same enables baseline comparisons using a diff tool like DiffFork. Side by side and line by line comparisons of the allocation, extents overflow, catalog, and attributes files will help identify where the changes occurred. The target device in this experiment is a two-gigabyte Universal Serial Bus, USB, thumb drive formatted with Global Unit Identifier, GUID, and Partition Table. Where practical, HFS+ special files and data structures will be manually parsed; documented, and illustrated.

<p>The recent groundbreaking demonstrations of quantum supremacy in noisy intermediate scale quantum (NISQ) computing era has triggered an intense activity in establishing finer boundaries between classical and quantum computing. In this dissertation, we use established techniques based on quantum Monte Carlo (QMC) to map quantum problems into probabilistic networks where the fundamental unit of computation, p-bit, is inherently probabilistic and can be tuned to fluctuate between ‘0’ and ‘1’ with desired probability. We can view this mapped network as a Boltzmann machine whose states each represent a Feynman path leading from an initial configuration of q-bits to a final configuration. Each such path, in general, has a complex amplitude, ψ which can be associated with a complex energy. The real part of this energy can be used to generate samples of Feynman paths in the usual way, while the imaginary part is accounted for by treating the samples as complex entities, unlike ordinary Boltzmann machines where samples are positive. This mapping of a quantum circuit onto a Boltzmann machine with complex energies should be particularly useful in view of the advent of special-purpose hardware accelerators known as Ising Machines which can obtain a very large number of samples per second through massively parallel operation. We also demonstrate this acceleration using a recently used quantum problem and speeding its QMC simulation by a factor of ∼ 1000× compared to a highly optimized CPU program. Although this speed-up has been demonstrated using a graph colored architecture in FPGA, we project another ∼ 100× improvement with an architecture that utilizes clockless analog circuits. We believe that this will contribute significantly to the growing efforts to push the boundaries of the simulability of quantum circuits with classical/probabilistic resources and comparing them with NISQ-era quantum computers. </p>

No description available.

No description available.

No description available.