Miracle-dz/UniFAR-FTUs huggingface dataset:
A High-throughput Screening Approach to Discovering Good Forms of Biologically-inspired Visual Representation. Text S2: Technical Details of the Computational Framework

The high-throughput search described in this paper takes advantage of multiple levels of parallelism, from coarse to fine-grained. Roughly speaking, fine-grained parallelism is exploited by allocating one core (of which modern graphics hardware have many; and their number is exponentially growing over the years) to one or more virtual neurons, while coarse-scale parallelism is achieved by allocating one model instantiation to each of many multi-core pools (i.e. CPUs, Cell Processors, GPUs). Because we evaluated thousands of model instantiations, it was straightforward to spread these evaluations across a cluster of GPU-enabled nodes, with the throughput of each node maximized by taking full advantage of fine-grained parallelism. In practice, as a general rule in modern high-performance computing, the level of speed-up that is achievable depends more fundamentally on the ability to bring relevant memory fetches to the parallel arithmetic processing units, than on the number of these units per se. For this reason, stream processing architectures contain special mechanisms for explicit manipulation of fast local caches (e.g. the Local Stores on the Cell processor and Shared Memory on NVIDIA GPUs). Importantly for maximizing the usage of the parallel resources in these processors, some of the largest computational bottlenecks present in our model class (e.g. filtering operations), lend themselves to the usage of such caches by loading small tiles of data into local caches. More broadly, because each layer of each model maintains a notion of x-y space, and because most of the operations operate over spatially local regions (e.g. normalization occurs within a spatially-restricted neighborhood), our coarseto-fine-grain parallelism can be exploited throughout a large portion of our model implementation. The use of commodity graphics hardware has drastically reduced the cost
MISO Capacity with Per-Antenna Power Constraint

We establish in closed-form the capacity and the optimal signaling scheme for a MISO channel with per-antenna power constraint. Two cases of channel state information are considered: constant channel known at both the transmitter and receiver, and Rayleigh fading channel known only at the receiver. For the first case, the optimal signaling scheme is beamforming with the phases of the beam weights matched to the phases of the channel coefficients, but the amplitudes independent of the channel coefficients and dependent only on the constrained powers. For the second case, the optimal scheme is to send independent signals from the antennas with the constrained powers. In both cases, the capacity with per-antenna power constraint is usually less than that with sum power constraint.
Video helps remote work: speakers who need to negotiate common ground benefit from seeing each other

More and more organizations are forming teams that are notco-located. These teams communicate via email, fax, telephone andaudio conferences, and sometimes video. The question often ariseswhether the cost of video is worth it. Previous research has shownthat video makes people more satisfied with the work, but it doesnthelp the quality of the work itself. There is one exception;negotiation tasks are measurably better with video. In this study,we show that the same effect holds for a more subtle form ofnegotiation, when people have to negotiate meaning in aconversation. We compared the performance and communication ofpeople explaining a map route to each other. Half the pairs havevideo and audio connections, half only audio. Half of the pairswere native speakers of English; the other half were non-nativespeakers, those presumably who have to negotiate meaning more. Theresults showed that non-native speaker pairs did benefit from thevideo; native speakers did not. Detailed analysis of theconversational strategies showed that with video, the non-nativespeaker pairs spent proportionately more effort negotiating commonground.
Electronic and atomic structures of edge and screw dislocations in rock salt structured ionic crystals

ABSTRACT First-principles calculations were performed to investigate electronic and atomic structures of edge and screw dislocations in NaCl and AgCl. 1/2<110> edge and 1/2<110> screw dislocations, which are the ones due to the easiest slip system of these crystals, were treated in a first-principles manner. It was found that the edge dislocation has extended core structures over several atomic planes in both NaCl and AgCl. In contrast, the screw dislocation in AgCl showed the different shear strain around the dislocation core from that in NaCl although the one has a similar atomic structure in the two crystals. Local electronic structures around the dislocation cores in AgCl exhibit larger bonding interactions between atomic orbitals than those in NaCl, indicating that covalent interactions are more significant at the dislocation cores of AgCl. From excess dislocation energies, it was found that the dislocations in AgCl are much more stable than those in NaCl. Especially, the screw dislocation of AgCl has much smaller core energy than that of the edge dislocations. This suggests that the screw dislocations can be easily formed and multiplied in AgCl, which may be closely related to the observed ductility of AgCl.
MHP1, an essential gene in Saccharomyces cerevisiae required for microtubule function

The gene for a microtubule-associated protein (MAP), termed MHP1 (MAP- Homologous Protein 1), was isolated from Saccharomyces cerevisiae by expression cloning using antibodies specific for the Drosophila 205K MAP. MHP1 encodes an essential protein of 1,398 amino acids that contains near its COOH-terminal end a sequence homologous to the microtubule-binding domain of MAP2, MAP4, and tau. While total disruptions are lethal, NH2-terminal deletion mutations of MHP1 are viable, and the expression of the COOH-terminal two-thirds of the protein is sufficient for vegetative growth. Nonviable deletion- disruption mutations of MHP1 can be partially complemented by the expression of the Drosophila 205K MAP. Mhp1p binds to microtubules in vitro, and it is the COOH-terminal region containing the tau-homologous motif that mediates microtubule binding. Antibodies directed against a COOH-terminal peptide of Mhp1p decorate cytoplasmic microtubules and mitotic spindles as revealed by immunofluorescence microscopy. The overexpression of an NH2-terminal deletion mutation of MHP1 results in an accumulation of large-budded cells with short spindles and disturbed nuclear migration. In asynchronously growing cells that overexpress MHP1 from a multicopy plasmid, the length and number of cytoplasmic microtubules is increased and the proportion of mitotic cells is decreased, while haploid cells in which the expression of MHP1 has been silenced exhibit few microtubules. These results suggest that MHP1 is essential for the formation and/or stabilization of microtubules.
A Real-Time Fatigue Driving Recognition Method Incorporating Contextual Features and Two Fusion Levels

Though experimental results have shown a strong correlation between contextual features and the driver’s fatigue state, contextual features have been applied only offline to evaluate a driver’s fatigue state. This paper identifies three of the most effective contextual features, i.e., continuous driving time, sleep duration time, and current time, to facilitate the real-time (online) recognition of fatigue state. By applying gray relational analysis, the three contextual features, together with the most effective facial and vehicle behavior features, are introduced in a two-level fusion structure to improve fatigue driving recognition. In the first level of fusion, labeled the feature-level fusion, three separate multiclass support vector machine (MCSVM) classifiers are used for the three feature sources, i.e., contextual features, driver’s facial features, and vehicle behavior features, to fuse information. These three MCSVM classifiers output probabilities as inputs for the three real-time dynamic basic probability assignments (BPAs) at the second level of fusion, labeled decision-level fusion. These BPAs, and the fusion result of the previous time step, are fused in the decision-level fusion based on the Dempster–Shafer evidence theory. This includes modifying the BPAs to accommodate the decision conflict among the different feature sources. Field experiments show that the proposed recognition method can outperform the single-fatigue-feature method and the single-source fusion-based method.
Simulating and optimising worm propagation algorithms

This paper describes a series of simulations run to estimate various worm growth patterns and their corresponding propagation algorithms. It also tests and verifies the impact of various improvements, starting from a trivial simulation of worm propagation and the underlying network infrastructure to more refined models, it attempts to determine the theoretical maximum propagation speed of worms and how it can be achieved. It also estimates the impact a malicious worm could have on the overall infrastructure.
Influence of the interface on the strength of fiber reinforced polymers

The debonding of fibers under mixed-mode loading is studied on model composites containing fibers with different orientations with respect to the loading direction. The spacing of the fibers is large, accordingly no significant fiber interaction takes place. For any fiber orientation, interfacial debonding occurs, even though at different load levels. Only for the low off-axis angle, additional fiber fracture is found. Using a rectangular specimen, the interface crack starts at the edges propagating into the center at low speed. In the first phase, only the central part of the interface debonds. After the whole fiber is debonded, the crack propagates in circumferential direction. The superimposition of fiber breakage and debonding shows that the restriction of two potential failure planes - perpendicular or parallel to the fibers - has to be put in question.
Structure preserving anonymization of router configuration data

A repository of router configuration files from production networks would provide the research community with a treasure trove of data about network topologies, routing designs, and security policies. However, configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router configuration files by removing all information that connects the data to the identity of the underlying network, while still preserving the structure of information that makes the data valuable to networking researchers. Anonymizing configuration files has unusual requirements, including preserving relationships between elements of data, anonymizing regular expressions, and robustly coping with more than 200 versions of the configuration language. Conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the configuration files of thousands of routers in hundreds of networks. Through example analysis, we demonstrate that the anonymized data retains the key properties of the network design. The paper sets out techniques that could be used in an attempt to break the anonymization, and it concludes our anonymization techniques are most applicable to enterprise networks, because the large number of enterprises and the difficulty of probing them from the outside make it hard to recognize an anonymized network based solely on publicly-available information about its topology or configuration. When applied to backbone networks, which are few in number and many of whose properties can be publicly measured, the anonymization might be broken by fingerprinting techniques described in this paper.
A Forward end-to-end delays Analysis for packet switched networks

Packet switched networks such as AFDX (Avionics Full Duplex Switched Ethernet) are a major upgrade for avionics systems communication. The computation of a guaranteed upper bound on End-to-end delay of all flows transmitted in the network is mandatory for certification reasons. Considering existing methods, we define a forward End-to-End delay analysis that can scale to large configurations and high loads. The proposed approach is compared with Network Calculus and Trajectory approach on an AFDX configuration.
Pervasive developmental disorders in children of hyperandrogenic women with polycystic ovary syndrome: a longitudinal case–control study

Foetal exposure to high testosterone concentrations seems to be involved in the development of mammalian brain and related to pervasive developmental disorders (PDDs). The aim of the current study was to test the hypothesis that children born from hyperandrogenic women with polycystic ovary syndrome (PCOS) are at higher risk of PDDs.
A Formal Model for Classical Planning

In this paper, we describe a formal semantic model that applies to many "classical" planning systems. This gives a unifying framework in which to study diverse planners, and motivates formal logics that can be used to study their properties. As an example of the model's ut i l ­ ity, we present a general t ruth criterion which tests for the necessary t ruth of a proposition at arbitrary points in the planning process. 1 I n t r o d u c t i o n In this paper we investigate a formal model for a broad class of A . I . planning systems. We define the range of applicability of our model later; here, we simply note that it is relevant to such well-known "classical" planners as STRIPS [Fikes and Nilsson, 1971], NOAH [Sacerdoti 1977], NONLIN [Tate, 1977], T W E A K [Chapman, 1987 and SIPE [Wilkins, 1988]. Each of these planners has its own very distinctive features. But there are also many similarities, and we can define a useful formal model of the concept of "plan" used by all of them. The model can be used to provide semantics for much of the planning process. That is, we can develop a logic which is interpreted as making assertions about plans. Relative to the model and the logic, claims about particular plans or planning systems can be proven true or false. Section 3 gives a concrete application of this: we develop a truth criterion for a broad class of planning systems. The concept of a t ru th criterion (TC) is due to Chapman [Chapman, 1987]. In fact, many of the ideas in this paper were inspired by Chapman's work and so we spend the rest of this introduction contrasting the goals of his work and ours. In general, a planner's t ru th criterion is the test it uses to check whether a particular proposition holds at some point in a proposed plan. It is easy to see how impor­ tant this test is. For example, we are always interested *The first author was partially supported by NASA Grant NCC2-494 and by Texas Instruments Contract No. 7554900. The second author is supported by an IBM Grad­ uate Fellowship. Present address: Teknekron, 530 Lytton Ave, Palo Alto, CA 94301. 246 Automated Reasoning Classical Planning*
On Transformations between Probability and Spolinian Disbelief Functions

In this paper, we analyze the relationship between probability and Spohn's theory for representation of uncertain beliefs. Using the intuitive idea that the more probable a proposition is, the more believable it is, we study transformations from probability to Spohnian disbelief and vice-versa. The transformations described in this paper are different from those described in the literature. In particular, the former satisfies the principles of ordinal congruence while the latter does not. Such transformations between probability and Spohn's calculi can contribute to (1) a clarification of the semantics of nonprobabilistic degree of uncertain belief, and (2) to a construction of a decision theory for such calculi. In practice, the transformations will allow a meaningful combination of more than one calculus in different stages of using an expert system such as knowledge acquisition, inference, and interpretation of results.
A longitudinal investigation of the role of parental responses in predicting children's post‐traumatic distress

Background While parental post‐trauma support is considered theoretically important for child adjustment, empirical evidence concerning the specific aspects of parental responding that influence child post‐traumatic distress, or the processes via which any such impacts occur, is extremely limited. We conducted a longitudinal examination of whether parental post‐trauma appraisals, trauma‐specific support style and general parenting style predicted child post‐traumatic stress symptom severity (PTSS) following trauma; and whether such influences operated via the child's own appraisals and coping style. Method We recruited 132 parent–child pairs following children's experience of acute trauma. We examined whether parental responses assessed at 1‐month post‐trauma, predicted child PTSS at 6‐month follow‐up. Parental trauma‐specific appraisals and responses, and general parenting style, were assessed via both self‐report and direct observations. Child‐report questionnaires were used to assess PTSS and potential mediators. Results Initial parent negative appraisals and encouragement of avoidant coping were associated with higher child‐reported PTSS at 6‐month follow‐up. Predictive effects were maintained even when controlling for initial child symptom levels. Observational assessments broadly supported conclusions from self‐report. There was evidence that parental influences may operate, in part, by influencing the child's own appraisals and coping responses. In contrast, there was no evidence for an influence of more “adaptive” support or general parenting style on child PTSS. Conclusions Findings provide important insight into how elements of social support may influence child post‐trauma outcomes.
Technique of increasing the accuracy of GTE parts manufactured by selective laser melting

Among the complex profile components of modern gas turbine engines, special attention is paid to the impellers and its blades, and their surfaces have the most strict requirements for geometric precision. At the present time, additive technologies are becoming increasingly widespread, through which it is possible to obtain complex shape parts in a short time with minimal post-processing. However, the process of selective laser melting (SLM) is accompanied by a constantly changing redistribution of temperature stresses in the fusion zone and in the entire part, which can lead to significant deflections of geometry. The authors propose a technique that allows reducing the drawbacks that occurs during the printing process. The technique is based on the use of computer simulation of the selective laser process for predicting deflections and subsequent pre-correction of the input triangulation model by moving the nodes of its surfaces. Based on the results of the approbation, control and analysis of the batch parts obtained by SLM, an additional algorithm for compensating for discrepancies that exist due to instability of the process was implemented with MATLAB.
No association between plant mating system and geographic range overlap

Premise of the Study Automatic self-fertilization may influence the geography of speciation, promote reproductive isolation between incipient species, and lead to ecological differentiation. As such, selfing taxa are predicted to co-occur more often with their closest relatives than are outcrossing taxa. Despite suggestions that this pattern may be general, the extent to which mating system influences range overlap in close relatives has not been tested formally across a diverse group of plant species pairs. Methods We test for a difference in range overlap between species pairs where zero, one, or both species are selfers, using data from 98 sister species pairs in 20 genera across 15 flowering plant families. We also use divergence time estimates from time-calibrated phylogenies to ask how range overlap changes with divergence time and whether this effect depends on mating system. Key Results We find no evidence that automatic self-fertilization influences range overlap of closely related plant species. Sister pairs with more recent divergence times had modestly greater range overlap, but this effect did not depend on mating system. Conclusions The absence of a strong influence of mating system on range overlap suggests that mating system plays a minor or inconsistent role compared to many other mechanisms potentially influencing the co-occurrence of close relatives.
Using Q&A Websites as a Method for Assessing Systematic Reviews

Questions and Answers (Q&A) websites maintain a long history of needs, problems, and challenges that software developers face. In contrast to Q&A websites, which are strongly tied to practitioners' needs, there are systematic reviews (SRs), which, according to recent studies, lack a connection with software engineering practice. In this paper, we investigate this claim by assessing to what extent systematic reviews help to solve questions posted on Q&A websites. To achieve this goal, we propose and evaluate a coverage method. We applied this method to a set of more than 600 questions related to agile software development. Results suggest that 12% of the related questions were covered. When considering specific agile methods, the majority of them have coverage below 50% or were not covered at all. We also identified 27 recurrent questions.
Error Probability of Space-Time Block Coded Systems in Multipath Rayleigh Channel: MLSE and suboptimum Decoding

In this paper, we address the error probability performance of space-time block coded system (STBC) in multipath Rayleigh fading channel. We consider STBC with rate one for two transmit antennae and rate half for three transmit antennae, and present an optimal maximum-likelihood-sequence-estimation (MLSE) and a block-by-block suboptimum decoding receiver structures. The proposed receiver schemes are suitable for short-range wireless communication or wireless personal area network (WPAN), where the delay spread is usually smaller than one symbol period. A reduced-state MLSE receiver with new trellis structure is first developed for the multiple-input multiple-output (MIMO) scenario assuming availability of ideal channel state information (CSI). Then a less complex block-by-block suboptimum decoding algorithm is also developed for the unequalized multipath fading channel, as an alternative to the computationally intensive MLSE. The suboptimum receiver symbol timing is optimized in order to obtain minimum error probability for the general multipath power delay profiles. From our simulation results, we show that our proposed MLSE receiver can mitigate the multipath induced intersymbol interference (ISI) effectively and at bit error rate (BER) of 10-3, a two-transmit and two-receive (2, 2) STBC system gains as much as 11.5 dB in SNR over a single-antenna uncoded system. We also verify that the MLSE receiver always outperforms the suboptimum receiver, as expected. Error floors appear in the BER performance curves of the suboptimum receiver because ISI is not equalized, whereas no such floors appear with the MLSE receiver.