VALIDITY LIMITS OF THE EXPRESSION FOR MEASURING SOIL RESISTIVITY BY THE WENNER METHOD ACCORDING TO IEEE STANDARD 81-1983

Za analizu rezultata i obavljanje mjerenja specifičnog otpora tla inženjerima su dane na raspolaganje smjernice i naputci različitih međunarodnih normi. Prilikom korištenja matematičkih izraza iz navedenih normi često nisu jasne okolnosti pod kojima su dobiveni navedeni izrazi. Jedan takav slučaj opisan je u ovom članku, a odnosi se na međunarodnu normu IEEE Std. 81-1983, izraz za prividni specifični otpor tla, a koji se odnosi na teorijski model i predviđanje mjernih rezultata dobivenih Wennerovim mjernim rasporedom elektroda. U IEEE Std. 81-1983 štapne elektrode su modelirane kao kuglaste, što u konačnici rezultira jednostavnim matematičkim izrazom za prividni specifični otpor tla. Zbog navedenog pojednostavljenja inženjeri nemaju uvid u granice valjanosti prema normi dobivenog izraza, odnosno njegovu točnost. Naime, pretpostavlja se da korisnik ima predznanje visokog obrazovanja, usmjeravajuće struke ili da je pohađao odgovarajuće tečajeve. Iz tog razloga u članku je detaljno prikazan izvod izraza za prividni specifični otpor tla u slučaju kada se mjerenje obavlja Wennerovom mjernom tehnikom. Izvodi su iscrpno komentirani kako bi iznesena građa bila razumljivija što širem krugu čitatelja. Dobiveni izraz uvažava stvarnu geometriju mjernih elektroda i utjecaj međusobne blizine elektroda na mjerenje. Na primjeru iz prakse uspoređeni su rezultati dobiveni izvedenim izrazom s predloženim izrazom prema međunarodnoj normi IEEE Std. 81-1983. Rezultati oba pristupa prikazani su grafički, analitički te diskutirani.For the analysis of soil resistivity results and measurement, engineers have guidelines and instructions from various international standards at their disposal. The circumstances under which the mathematical expressions in these standards were obtained are not always clear. One such case is described in this article and refers to the international IEEE Standard 81-1983, an expression for apparent soil resistivity, and refers to a theoretical model and the prediction and interpretation of measurement results obtained by using the Wenner method of electrode arrangement. In IEEE Std. 81-1983, rod electrodes are modeled as spherical, which ultimately results in a simplified mathematical expression for apparent soil resistivity. Due to this simplification, the expression in this standard does not provide engineers with insight into its validity limits, i.e. accuracy. It is assumed that the user is highly educated, specialized or has obtained the necessary training. Therefore, this article presents the derivation of the expression for apparent soil resistivity in detail when measurement is performed using the Wenner method. Exhaustive commentary on the derivations is provided so that the material presented will be understood by the widest possible circle of readers. The expression obtained takes the actual geometry of the measurement electrodes and the influence of the distance between the electrodes upon measurement into account. Using a practical example, the results obtained using the derived expression are compared to results obtained using the expression proposed according to the international IEEE Std. 81-1983. The results of both approaches are presented graphically and analytically, and are discussed

Reproductive Performance of Late Pregnant Gilts Treated with Baypamun© before Farrowing

The aim of this study was to investigate whether the production results of pregnant gilts, grown under commercial farm conditions and moved from the sow keeping unit to the prefarrowing unit, could be increased by non-specific immunization with Baypamun© (Bayer, Leverkusen, Germany; BPM), an immune response modifier (IRM). We used three groups of pregnant gilts that obtained different treatments. Non-treated group A served as control; two experimental groups were treated on Day 6, 4 and 2 (group B), or on Day 5, 3 and 1 (group C), respectively, before their transfer from the sow keeping unit to the prefarrowing unit. The experimental gilts received i.m. 2 ml of IRM BPM, i.e. inactivated Parapoxovis virus (1 x 106.75 TCID50). Throughout the trial, the numbers of liveborn and stillborn piglets and the duration of farrowing were recorded. Variance analysis with the type of treatment as independent variable showed a significant difference between control (group A) and experimental group B in the number of liveborn piglets (P < 0.0001) as well as between group A and group B (P < 0.0001) or group C (P < 0.0001) in the number of stillborn piglets, respectively. No differences in duration of farrowing between groups were recorded

Consensus recommendations for the diagnosis, treatment and follow-up of inherited methylation disorders

Inherited methylation disorders are a group of rarely reported, probably largely underdiagnosed disorders affecting transmethylation processes in the metabolic pathway between methionine and homocysteine. These are methionine adenosyltransferase I/III, glycine N-methyltransferase, S-adenosylhomocysteine hydrolase and adenosine kinase deficiencies. This paper provides the first consensus recommendations for the diagnosis and management of methylation disorders. Following search of the literature and evaluation according to the SIGN-methodology of all reported patients with methylation defects, graded recommendations are provided in a structured way comprising diagnosis (clinical presentation, biochemical abnormalities, differential diagnosis, newborn screening, prenatal diagnosis), therapy and follow-up. Methylation disorders predominantly affect the liver, central nervous system and muscles, but clinical presentation can vary considerably between and within disorders. Although isolated hypermethioninemia is the biochemical hallmark of this group of disorders, it is not always present, especially in early infancy. Plasma S-adenosylmethionine and S-adenosylhomocysteine are key metabolites for the biochemical clarification of isolated hypermethioninemia. Mild hyperhomocysteinemia can be present in all methylation disorders. Methylation disorders do not qualify as primary targets of newborn screening. A low-methionine diet can be beneficial in patients with methionine adenosyltransferase I/III deficiency if plasma methionine concentrations exceed 800 μmol/L. There is some evidence that this diet may also be beneficial in patients with S-adenosylhomocysteine hydrolase and adenosine kinase deficiencies. S-adenosylmethionine supplementation may be useful in patients with methionine adenosyltransferase I/III deficiency. Recommendations given in this article are based on general principles and in practice should be adjusted individually according to patient's age, severity of the disease, clinical and laboratory findings

Examining the validity of the Athlete Engagement Questionnaire (AEQ) within a Portuguese sport setting

Sport psychology literature suggests that understanding engagement levels is pivotal to promote positive sporting experiences among athletes. The purpose of this study was to examine the psychometric properties of the Athlete Engagement Questionnaire among Portuguese sport athletes. Two distinct samples of Portuguese athletes from different competitive levels were collected, and the results of a confirmatory factor analysis demonstrated a good fit of the model to the data. A review of the psychometric properties indicated that all factors showed good composite reliability, convergent validity, and discriminant validity. In addition, a multi-groups analysis showed the invariance of the model in two independent samples providing evidence of cross validity. Implications of these results for scholars and coaches are discussed and guidelines for future studies are suggested

Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage

Vector commitments with subvector openings (SVC) [Lai-Malavolta, Boneh-Bunz-Fisch; CRYPTO\u2719] allow one to open a committed vector at a set of positions with an opening of size independent of both the vector\u27s length and the number of opened positions. We continue the study of SVC with two goals in mind: improving their efficiency and making them more suitable to decentralized settings. We address both problems by proposing a new notion for VC that we call incremental aggregation and that allows one to merge openings in a succinct way an unbounded number of times. We show two applications of this property. The first one is immediate and is a method to generate openings in a distributed way. For the second one, we use incremental aggregation to design an algorithm for faster generation of openings via preprocessing. We then proceed to realize SVC with incremental aggregation. We provide two constructions in groups of unknown order that, similarly to that of Boneh et al. (which supports only one-hop aggregation), have constant-size public parameters, commitments and openings. As an additional feature, for the first construction we propose efficient arguments of knowledge of subvector openings which immediately yields a keyless proof of storage with compact proofs. Finally, we address a problem closely related to that of SVC: storing a file efficiently in completely decentralized networks. We introduce and construct verifiable decentralized storage (VDS), a cryptographic primitive that allows to check the integrity of a file stored by a network of nodes in a distributed and decentralized way. Our VDS constructions rely on our new vector commitment techniques

QTc and psychopharmacs: are there any differences between monotherapy and polytherapy

<p>Abstract</p> <p>Background</p> <p>Some psychotropic drugs are connected with prolongation of QT interval, increased risk of cardiac arrhythmias and greater incidence of sudden death, especially when used in combination. Concomitant use of antipsychotics and antidepressants is not rare in our clinical practice. The study compares the length of QT interval in patients on monotherapy with an antipsychotic or an antidepressant and patients taking polytherapy (an antipsychotic agent combined with an antidepressant).</p> <p>Methods</p> <p>Sixty-one hospitalized women who met the ICD-10 criteria for schizophrenia, schizoaffective psychosis, delusional disorder and mood disorder were included in the study. The monotherapy group was consisted of thirty-two women treated with an antipsychotic or an antidepressant while the polytherapy group was composed of twenty-nine women treated with an antipsychotic agent plus an antidepressant. Two electrocardiograms (ECGs) were obtained for each patient: the first was carried out before the treatment and the second after two weeks of treatment.</p> <p>Statistical analysis was carried out by SPSS program and included unpaired and paired t test and Fisher's exact test.</p> <p>Results</p> <p>Mean baseline QTc values did not differ between the groups (439 ± 22 ms was the same value found in the both groups; unpaired t test, p > 0.5). Mean QTc intervals after two weeks of treatment were also similar (439 ± 24 ms in the monotherapy group and 440 ± 20 ms in the polytherapy group; unpaired t test, p > 0.5). Fisher's exact test did not reveal significant difference in the number of patients with borderline (451–470 ms) or prolonged (> 470 ms) QTc between groups, neither before treatment nor after two weeks of treatment. Twenty two women of the total of sixty one patients (36%) had QTc > 450 ms before applying therapy.</p> <p>Conclusion</p> <p>We did not find significant QT prolongation in our patients after two weeks of treatment with antipsychotics and/or antidepressants. The QTc interval length did not differ significantly in the monotherapy and the polytherapy group. More than one third of included women exceeded the threshold value of borderline QTc interval (450 ms) before starting treatment. This finding calls for caution when prescribing drugs to female psychiatric patients, especially if they have other health problems.</p

Synchronized Aggregate Signatures from the RSA Assumption

In this work we construct efficient aggregate signatures from the RSA assumption in the synchronized setting. In this setting, the signing algorithm takes as input a (time) period $t$ as well the secret key and message. A signer should sign at most once for each $t$. A set of signatures can be aggregated so long as they were all created for the same period $t$. Synchronized aggregate signatures are useful in systems where there is a natural reporting period such as log and sensor data, or for signatures embedded in a blockchain protocol where the creation of an additional block is a natural synchronization event. We design a synchronized aggregate signature scheme that works for a bounded number of periods $T$ that is given as a parameter to a global system setup. The big technical question is whether we can create solutions that will perform well with the large $T$ values that we might use in practice. For instance, if one wanted signing keys to last up to ten years and be able to issue signatures every second, then we would need to support a period bound of upwards of $2^{28}$. We build our solution in stages where we start with an initial solution that establishes feasibility, but has an impractically large signing time where the number of exponentiations and prime searches grows linearly with $T$. We prove this scheme secure in the standard model under the RSA assumption with respect to honestly-generated keys. We then provide a tradeoff method where one can tradeoff the time to create signatures with the space required to store private keys. One point in the tradeoff is where each scales with $\sqrt{T}$. Finally, we reach our main innovation which is a scheme where both the signing time and storage scale with $\lg{T}$ which allows for us to keep both computation and storage costs modest even for large values of $T$. Conveniently, our final scheme uses the same verification algorithm, and has the same distribution of public keys and signatures as the first scheme. Thus we are able to recycle the existing security proof for the new scheme. We also show how to extend our results to the identity-based setting in the random oracle model, which can further reduce the overall cryptographic overhead. We conclude with a detailed evaluation of the signing time and storage requirements for various practical settings of the system parameters

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction

We prove a tight lower bound on the number of group operations required for batch verification by any generic-group accumulator that stores a less-than-trivial amount of information. Specifically, we show that $\Omega(t \cdot (\lambda / \log \lambda))$ group operations are required for the batch verification of any subset of $t \geq 1$ elements, where $\lambda \in \mathbb{N}$ is the security parameter, thus ruling out non-trivial batch verification in the standard non-interactive manner. Our lower bound applies already to the most basic form of accumulators (i.e., static accumulators that support membership proofs), and holds both for known-order (and even multilinear) groups and for unknown-order groups, where it matches the asymptotic performance of the known bilinear and RSA accumulators, respectively. In addition, it complements the techniques underlying the generic-group accumulators of Boneh, B{ü}nz and Fisch (CRYPTO \u2719) and Thakur (ePrint \u2719) by justifying their application of the Fiat-Shamir heuristic for transforming their interactive batch-verification protocols into non-interactive procedures. Moreover, motivated by a fundamental challenge introduced by Aggarwal and Maurer (EUROCRYPT \u2709), we propose an extension of the generic-group model that enables us to capture a bounded amount of arbitrary non-generic information (e.g., least-significant bits or Jacobi symbols that are hard to compute generically but are easy to compute non-generically). We prove our lower bound within this extended model, which may be of independent interest for strengthening the implications of impossibility results in idealized models