Observer Influence with Other Variables on the Accuracy of Ultrasound Estimation of Fetal Weight at Term

Background and Objectives: The accuracy with which the estimation of fetal weight (EFW) at term is determined is useful in order to address obstetric complications, since it is a parameter that represents an important prognostic factor for perinatal and maternal morbidity and mortality. The aim of this study was to determine the role of the experienced observers with other variables that could influence the accuracy of the ultrasound used to calculate EFW at term, carried out within a period of seven days prior to delivery, in order to assess interobserver variability. Materials and Methods: A cross-sectional study was performed including 1144 pregnancies at term. The validity of the ultrasound used to calculate EFW at term was analyzed using simple error, absolute error, percentage error and absolute percentage error, as well as the percentage of predictions with an error less than 10 and 15% in relation to maternal, obstetric and ultrasound variables. Results: Valid predictions with an error less than 10 and 15% were 74.7 and 89.7% respectively, with such precision decreasing according to the observer as well as in extreme fetal weights. The remaining variables were not significant in ultrasound EFW at term. The simple error, absolute error, percentage error and absolute percentage error were greater in cases of extreme fetal weights, with a tendency to overestimate the low weights and underestimate the high weights. Conclusions: The accuracy of EFW with ultrasound carried out within seven days prior to birth is not affected by maternal or obstetric variables, or by the time interval between the ultrasound and delivery. However, accuracy was reduced by the observers and in extreme fetal weights.

The uncertainty of CRUST1.0

As crustal structure models based on seismic and other data are frequently used as a-priori information for further geophysical and geological studies and interpretations (e. g., for gravity inversion), it is important to accurately document their qualities. For instance, the uncertainties in published crustal structures deeply affect the accuracies of produced Moho contour maps. The qualities in seismic crustal models arise from several factors such as the survey method, the spatial resolution of the survey (for example the spacing of the shot points and the recording stations), and the analytical techniques utilized to process the data. It is difficult to determine the uncertainties associated with seismic based crustal depth/Moho depth (MD) models, and even more difficult to use such data for estimating the Moho density contrast (MDC) and its accuracy. However, there is another important observable available today, namely global satellite gravitational data, which are fairly homogeneous v. r. t. accuracy and distribution over the planet. For instance, we find by simple error propagation, using the error covariance matrix of the GOCE TIM5 gravitational model, that this model can determine the MD to a global RMS error of 0.8 km with a resolution of about 1° for a known MDC of 200 kg / m 3 \text{kg}/{\text{m}^{3}} . However, the uncertainty in the MDC will further deteriorate the result. We present a new method for estimating the MD and MDC uncertainties of one model by comparing it with another (correlated or uncorrelated) model with known uncertainty. The method is applied in estimating the uncertainty for the CRUST1.0 MD model from four global models (CRUST19, MDN07, GEMMA1.0, KTH15C), yielding mean standard errors varying between 2 and 4.9 km in ocean regions and between 3.2 and 6.0 km on land regions with overall means of 3.8±0.4 and 4.8 ± 0.6 km 4.8\pm 0.6\hspace{0.1667em}\text{km} , respectively. Also, starting from the KTH15C MDC model, the mean standard error of CRUST1.0 MDC was estimated to 47.4 and 48.3 kg / m 3 \text{kg}/{\text{m}^{3}} for ocean and land regions, respectively.

Attribute-Based Fully Homomorphic Encryption Scheme from Lattices with Short Ciphertext

Attribute-based encryption (ABE) is a good choice for one-to-many communication and fine-grained access control of the encryption data in a cloud environment. Fully homomorphic encryption (FHE) allows cloud servers to make valid operations on encrypted data without decrypting. Attribute-based fully homomorphic encryption (ABFHE) from lattices not only combines the bilateral advantages/facilities of ABE and FHE but also can resist quantum attacks. However, in the most previous ABFHE schemes, the growth of ciphertext size usually depends on the total number of system’s attributes which leads to high communication overhead and long running time of encryption and decryption. In this paper, based on the LWE problem on lattices, we propose an attribute-based fully homomorphic scheme with short ciphertext. More specifically, by classifying the system’s attributes and using the special structure matrix in MP12, we remove the dependency of ciphertext size on system’s attributes ℓ and the ciphertext size is no longer increased with the total number of system’s attributes. In addition, by introducing the function G − 1 in the homomorphic operations, we completely rerandomize the error term in the new ciphertext and have a very tight and simple error analysis using sub-Gaussianity. Besides, performance analysis shows that when ℓ = 2 and n = 284 according to the parameter suggestion given by Micciancio and Dai et al., the size of ciphertext in our scheme is reduced by at least 73.3%, not to mention ℓ > 2 . The larger the ℓ , the more observable of our scheme. The short ciphertext in our construction can not only reduce the communication overhead but also reduce the running time of encryption and decryption. Finally, our scheme is proved to be secure in the standard model.

Does speed of recognition predict two-alternative forced-choice performance? Replicating and extending Starns, Dubé, and Frelinger (2018)

Does the speed of single-item recognition errors predict performance in subsequent two-alternative forced-choice (2AFC) trials that include an item with a previous error response? Starns, Dubé, and Frelinger found effects of this kind in two experiments and accounted for them in terms of continuous memory-strength signal guiding recognition decisions. However, the effects of error speed might just as well only reflect an artefact due to an error-correction strategy that uses response latency as a heuristic cue to guide 2AFC responses, elicited through confounding factors in their experimental design such as error-correction instructions and feedback. Using two conditions, a replication condition, replicating the procedure from Starns et al., and an extension condition (each n = 130), controlling for the named shortcomings, we replicated the error speed effect. In both conditions, speed of errors in a single-item recognition task was predictive of subsequent 2AFC performance, including the respective error item. To be more precise, fast errors were associated with decreased 2AFC performance. As there was no interaction with the factor condition, the results support the idea that speed of single-item recognition responses reflects the amount of memory information underlying the respective response rather than being used for a simple error-correction strategy to improve 2AFC performance.

An Exploration of Error-Driven Learning in Simple Two-Layer Networks From a Discriminative Learning Perspective

Error-driven learning algorithms, which iteratively adjust expectations based on prediction error, are the basis for a vast array of models in the brain and cognitive sciences that often differ widely in their precise form and application: historically, they range from simple models in psychology and cybernetics to current complex deep learning models dominating discussions in machine learning and artificial intelligence. However, despite the ubiquity of this mechanism, detailed theoretical analyses of its basic workings uninfluenced by existing theories or specific research goals are rare in the literature. To address this, we present an exposition and theoretical analysis of error-driven learning - focusing on its simplest form for clarity - and relate this to the historical development of error-driven learning models in the cognitive sciences. Although historically error-driven models have been thought of as associative, such that learning is thought to combine preexisting elemental representations, this analysis will highlight the discriminative nature of learning in these models and the implications of this for the way how learning is conceptualized. We complement our theoretical exposition of error-driven learning with a practical guide to the application of simple error-driven learning models in which we discuss a number of example simulations, that are presented in detail in an accompanying tutorial.

FRAGMENT KALENDARZA W JĘZYKU POLSKIM Z XIV/XV WIEKU ZE ZBIORÓW BIBLIOTEKI JAGIELLOŃSKIEJ W KRAKOWIE

A manuscript stored in the Jagiellonian Library (no. 1564 from 1404) holds a fragment of a Polish calendar, previously unpublished, from the late 14th century or the early 15th century. Written on the last, extra parchment page, it is a fragment of a much larger manuscript. The first 13 days of January have survived (1 to 13 January) and 13 days of February (4 to 19 February). The fragment contains 17 names, five of which are not included in the Słownik staropolskich nazw osobowych (Dictionary of Old Polish Proper Nouns, W. Taszycki, ed., vol. 1-7, Wrocław 1965-1987), namely Arkadyj, Emilijan, Iginij, Sotera, Wedast. The word january (January, in Polish styczeń) has not been recognised by dictionaries, either. There is no equivalent of the calendar in question in Poland or other European countries. It is impossible to indicate the diocese or a milieu where it could have been used. The document includes a few names of saints properly attributed to the days of their cult and names attributed to days not used in other known calendars. This leads to a conclusion that the calendar was either used in an unknown milieu or we are dealing with a simple error of the copyist. The latter theory best explains the peculiarity of this fragment of the calendar. This is confirmed by marking 4 nd 5 February as Ide rather than Nones, and 12 and 13 February as calends rather than Ides. The calendar was probably erroneously planned by the copyist who confused the days and affiliation of saints. Perhaps these errors were spotted early, the copying process was never completed and the parchment was recycled. Most probably, the intention behind the calendar (1564) was a large parchment “poster”, reminiscent of a scroll, used to inform the congregation about the holidays in the year. The calendar is unique because of the names of saints included in it and the fact that it is written in Polish.

Ideología y subjetivación desde una intervención filosófica materialista

El objetivo central de este trabajo es mostrar que la comprensión de la ideología desde su existencia material, propuesta por Althusser, a través de la práctica de la interpelación ideológica, permite dar cuenta de los procesos de subjetivación y sujeción. Sin embargo, existe en la propuesta de Althusser, un silencio teórico respecto al modo de producción de subjetividades generizadas. Para ello, en primer lugar, proponemos mostrar en qué consiste la intervención materialista de Althusser, en la que se formulan conceptos centrales que examinaremos, como el de contradicción sobredeterminada, el de causalidad estructural, el de nueva práctica filosófica y el de lectura sintomática. En segundo lugar, proponemos mostrar que la reformulación del concepto de ideología que propone Althusser constituye una demarcación con los tratamientos de tipo idealistas en los que la ideología es comprendida como simple error, y en los que se supone al "sujeto" como categoría central. Mostraremos que, en el nuevo marco, la ideología -con una naturaleza material e imaginaria- tiene por función central constituir individuos en sujetos mediante el complejo mecanismo de la interpelación ideológica. De manera que, la inscripción de la ideología en bases materialistas, implica también pasar a comprender al sujeto como una categoría derivada. Finalmente, proponemos mostrar un límite en la propuesta de Althusser: el de no dar cuenta de los mecanismos específicos que operan en los procesos de constitución de las subjetividades generizadas. Mostraremos que, si hacemos una lectura sintomática sobre el propio silencio de Althusser podemos dar lugar a una nueva problemática, la de la articulación entre ideología y género; una problemática que en la actualidad cobra cada vez mayor importancia.

Analog errors in quantum annealing: doom and hope

Quantum annealing has the potential to provide a speedup over classical algorithms in solving optimization problems. Just as for any other quantum device, suppressing Hamiltonian control errors will be necessary before quantum annealers can achieve speedups. Such analog control errors are known to lead to $$J$$J-chaos, wherein the probability of obtaining the optimal solution, encoded as the ground state of the intended Hamiltonian, varies widely depending on the control error. Here, we show that $$J$$J-chaos causes a catastrophic failure of quantum annealing, in that the scaling of the time-to-solution metric becomes worse than that of a deterministic (exhaustive) classical solver. We demonstrate this empirically using random Ising spin glass problems run on the two latest generations of the D-Wave quantum annealers. We then proceed to show that this doomsday scenario can be mitigated using a simple error suppression and correction scheme known as quantum annealing correction (QAC). By using QAC, the time-to-solution scaling of the same D-Wave devices is improved to below that of the classical upper bound, thus restoring hope in the speedup prospects of quantum annealing.

EVR: reconstruction of bacterial chromosome 3D structure models using error-vector resultant algorithm

Background More and more 3C/Hi-C experiments on prokaryotes have been published. However, most of the published modeling tools for chromosome 3D structures are targeting at eukaryotes. How to transform prokaryotic experimental chromosome interaction data into spatial structure models is an important task and in great need. Results We have developed a new reconstruction program for bacterial chromosome 3D structure models called EVR that exploits a simple Error-Vector Resultant (EVR) algorithm. This software tool is particularly optimized for the closed-loop structural features of prokaryotic chromosomes. The parallel implementation of the program can utilize the computing power of both multi-core CPUs and GPUs. Conclusions EVR can be used to reconstruct the bacterial 3D chromosome structure based on the contact frequency matrix derived from 3C/Hi-C experimental data quickly and precisely.

NEW CUBIC TIMMER TRIANGULAR PATCHES WITH C¹ AND G¹ CONTINUITY

In this study, a new cubic Timmer triangular patch is constructed by extending the univariate cubic Timmer basis functions. The best scheme that lies towards the control polygon is cubic Timmer curve and surface compared to the other methods. From the best of our knowledge, nobody has extended the univariate cubic Timmer basis to the bivariate triangular patch. The construction of the proposed cubic Timmer triangular patch is based on the main idea of the cubic Ball and cubic Bezier triangular patches construction. Some properties of the new cubic Timmer triangular patch are investigated. Furthermore, the composite cubic Timmer triangular patches with parametric continuity (C1) and geometric continuity (G1) are discussed. Simple error analysis between the triangular patches and one test function is provided for each continuity type. Numerical and graphical results are presented by using Mathematica and MATLAB.