Miracle-dz/UniFAR-FTUs huggingface dataset:
The 170ms Response to Faces as Measured by MEG (M170) Is Consistently Altered in Congenital Prosopagnosia

Modularity of face processing is still a controversial issue. Congenital prosopagnosia (cPA), a selective and lifelong impairment in familiar face recognition without evidence of an acquired cerebral lesion, offers a unique opportunity to support this fundamental hypothesis. However, in spite of the pronounced behavioural impairment, identification of a functionally relevant neural alteration in congenital prosopagnosia by electrophysiogical methods has not been achieved so far. Here we show that persons with congenital prosopagnosia can be distinguished as a group from unimpaired persons using magnetoencephalography. Early face-selective MEG-responses in the range of 140 to 200ms (the M170) showed prolonged latency and decreased amplitude whereas responses to another category (houses) were indistinguishable between subjects with congenital prosopagnosia and unimpaired controls. Latency and amplitude of face-selective EEG responses (the N170) which were simultaneously recorded were statistically indistinguishable between subjects with cPA and healthy controls which resolves heterogeneous and partly conflicting results from existing studies. The complementary analysis of categorical differences (evoked activity to faces minus evoked activity to houses) revealed that the early part of the 170ms response to faces is altered in subjects with cPA. This finding can be adequately explained in a common framework of holistic and part-based face processing. Whereas a significant brain-behaviour correlation of face recognition performance and the size of the M170 amplitude is found in controls a corresponding correlation is not seen in subjects with cPA. This indicates functional relevance of the alteration found for the 170ms response to faces in cPA and pinpoints the impairment of face processing to early perceptual stages.
Numerical S imulation of M echanized T unnelling as P art of an I ntegrated

Mechanised tunnelling is characterised by a number of interacting components relevant for the excavation process (the soil including groundwater, the TBM, the linings, the support at the cutting face and the tail void) and by a staged process of excavation and lining erection. This imposes a considerable challenge for realistic modelling of the tunnelling process. The paper addresses recent advances in computational modelling of shield tunnelling. It is shown, how a three-dimensional finite element model, which is able to adequately represent the aforementioned components and their interactions, may be used for reliable predictions of the interactions between the excavation process and the soil within the design stage as well as in the construction stage. The paper also highlights the role of numerical simulations in the context of an integrated optimization Platform for Tunnelling (IOPT) currently being developed within the European research project “Technology Innovation in Underground Construction” (TUNCONSTRUCT). Since for more or less similar ground conditions different designs are often used and the selection of construction methods is often biased by personal experience, this platform shall finally constitute a decision support system providing a systematic guidance through the complete process of the design of machine-driven tunnels.
A Coarse-grained, Context-dependent Contact Potential for Protein Decoy Discrimination

Knowledge-based contact potentials have been popularly used in protein structure modeling. In this paper, we present a coarse-grained, context-dependent contact potential where the influences on inter-residue contacts from neighboring residues are taken into account. In particular, statistics of singlet-singlet, singlet-doublet, singlet-triplet, and doublet-doublet interactions are derived from known protein structures and then incorporated into the context-dependent contact potential. We use the Rosetta decoy set to test our context-dependent contact potential. In more than 83% targets, the context-dependent contact potential is able to successfully differentiate the near-native structures from the other decoys. The context-dependent contact potential yields comparable accuracy to the finegrained contact potentials, but does not require all atoms information, which is particularly suitable for coarsegrained protein structure modeling and design.
Performance and experience with LAPI-a new high-performance communication library for the IBM RS/6000 SP

LAPI is a low-level, high-performance communication interface available on the IBM RS/6000 SP system. It provides an active-message-like interface along with remote memory copy and synchronization functionality. It is designed primarily for use by experienced programmers in developing parallel subsystems, libraries and tools, but we also expect power programmers to use it in end-user applications. IBM developed LAPI as a part of a project with Pacific Northwest National Laboratory (PNNL) to optimize the performance of the Global Arrays (GA) toolkit and its applications on the IBM RS/6000 SP. We provide an overview of LAPI characteristics and discuss its differences from other models such as MPI-2. We present some base performance parameters of LAPI including latency and bandwidth and compare it with performance of the MPI/MPL. The Global Arrays library from PNNL was ported to LAPI to exploit the performance benefits of this new interface. Experience using LAPI to implement GA and the performance of the resulting library are presented.
Shortest-path queries for complex networks: exploiting low tree-width outside the core

We present new and improved methods for efficient shortest-path query processing. Our methods are tailored to work for two specific classes of graphs: graphs with small tree-width and complex networks. Seemingly unrelated at first glance, these two classes of graphs have some commonalities: complex networks are known to have a core--fringe structure with a dense core and a tree-like fringe. Our main contributions are efficient algorithms and data structures on three different levels. First, we provide two new methods for graphs with small but not necessarily constant tree-width. Our methods achieve new tradeoffs between space and query time. Second, we present an improved tree-decomposition-based method for complex networks, utilizing the methods for graphs with small tree-width. Third, we extend our method to handle the highly inter-connected core with existing exact and approximate methods. We evaluate our algorithms both analytically and experimentally. We prove that our algorithms for low-tree-width graphs achieve improved tradeoffs between space and query time. Our experiments on several real-world complex networks further confirm the efficiency of our methods: Both the exact and the hybrid method have faster preprocessing and query times than existing methods. The hybrid method in particular provides an improved tradeoff between space and accuracy.
On the Complexity of Learning Lexicographic Strategies

Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision making with limited resources. Take-the-best searches for a sufficiently good ordering of cues (or features) in a task where objects are to be compared lexicographically. We investigate the computational complexity of finding optimal cue permutations for lexicographic strategies and prove that the problem is NP-complete. It follows that no efficient (that is, polynomial-time) algorithm computes optimal solutions, unless P=NP. We further analyze the complexity of approximating optimal cue permutations for lexicographic strategies. We show that there is no efficient algorithm that approximates the optimum to within any constant factor, unless P=NP. The results have implications for the complexity of learning lexicographic strategies from examples. They show that learning them in polynomial time within the model of agnostic probably approximately correct (PAC) learning is impossible, unless RP=NP. We further consider greedy approaches for building lexicographic strategies and determine upper and lower bounds for the performance ratio of simple algorithms. Moreover, we present a greedy algorithm that performs provably better than take-the-best. Tight bounds on the sample complexity for learning lexicographic strategies are also given in this article.
A 24 GHz VCO with 20 % tuning range in 130-nm CMOS using SOP Technology

A 24 GHz System-on-Package (SOP) VCO is demonstrated. The core operates at 6 GHz and employs a high-Q on-carrier inductor. Using two cascaded on-chip frequency doublers the centre frequency is 24.6 GHz with a 20 % tuning range. The phase noise is below −107 dBc/Hz at 1 MHz offset over the tuning range, with a FOM between 188 and 192 dB at a power consumption of 6.9 mW.
Teacher Perspectives on the Consequences of Informally Labeling Children as Delinquent

The present study examined teacher perceptions of informal labeling. Research studies of labeling have either focused on the effects of formal labels on the lives of children with exceptionalities and mental health issues, or the effects of informal labeling by parents, peers and teachers. This study adds to the growing research by examining how teachers work to mitigate the harmful effects of students who have been ascribed a label. Data were gathered through semi-structures interviews conducted with 2 teachers who have personally experienced informal labels when they were young. The results show that teachers conceptualize delinquency as behaviour that is different from the norm and they recognize it as being something that requires additional attention. The implications of the study for policy makers and parents are discussed as well as some recommendations for parents and practitioners are offered.
Ultraorthodox Jewish Fathers in Israel: Predictors of Involvement and Acceptance

Based on Belsky’s model of parenting determinants, paternal involvement and acceptance were compared among 134 ultraorthodox Jewish fathers and 144 secular Jewish fathers. The predictors examined were experiences of care and control from own fathers, perceived parental competence, and social support and child characteristics as moderators. Results show that, although the two groups of fathers did not differ in their involvement with and acceptance of their children, experiences of care and control from own fathers had affected their paternal practices differently—yielding greater power among the ultraorthodox fathers. Finally, child difficulty moderated the link between perceived paternal competence and paternal involvement, as well as between experiences of control of own father and paternal acceptance. The findings were discussed in within the cultural context of the ultraorthodox family.
An approach to discovering temporal association rules

The goal of discovering association rules is to discover aH possible associations that accomplish certain restrictions (minimum support and confidence and interesting). However, it is possible to find interesting associations with a high confidence level hut with little support. This problem is caused by the way support is calculated, as the denominator represents the total number of transactions in a time period when the involved items may have not existed. If, on the other hand, we limit the total transactions to the ones belonging to the items' lifetime, those associations would be now discovered, as they would count on enough support. Another difficulty is the large number of rules that could be generated, tbr which many solutions have been proposed. Using age as an obsolescence tactor for rules helps reduce the number of rules to be presented to the user. In this paper we expand the notion of association rules incorporating time to the frequent itemsets discovered. The concept of temporal support is introduced and. as an example, the known algorithm A priori is modified to incorporate the temporal notions.
Towards performance monitoring overhead reduction

Continuous monitoring tools are designed to perform well under production workload with minimal performance overhead. Standard AOP frameworks are popular choice for development of instrumentation for Java software monitoring tools. Inevitable consequence of using these tools is the occurrence of performance overhead. The code they generate is guaranteed to be correct, but always has a slight overhead. On the other hand, if a low-level bytecode manipulation tools are chosen, they may have better performance, but development time is higher and code may not be correct. The paper demonstrates the use of a new framework that allows instrumentation of Java code using AOP-like syntax, but has less overhead than industry standard AOP tools. Already developed monitoring tool has been implemented using this new framework, with better results.
Lifetime gains of host-feeding in a synovigenic parasitic wasp

Understanding behavioural decisions relative to host use for feeding or reproduction by foraging parasitoids requires not only the study of metabolic pathways followed by nutrients, but also the quantification of lifetime fitness gains of each alternative behaviour. By using a combination of observational and manipulative approaches, the lifetime host-feeding gains are measured both in terms of fecundity and longevity in the parasitoid Eupelmus vuilletti. Host-feeding increases both egg production and longevity. The increase in fecundity is mainly determined by the amount of lipids obtained whereas the lifespan extension is mainly determined by carbohydrates. Proteins obtained through host-feeding have been implicated previously in egg production by parasitoids but protein intake has no effect on fecundity and longevity in E. vuilletti. The amount of nutrients gained through host-feeding and invested in eggs is variable and changes over the lifetime of the animal. Therefore, lifetime feeding gains are best understood through the construction of dynamical budgets running over the entire lifespan of an insect.
Enhanced Job Scheduling Algorithm for Cloud Computing Using Shortest Remaining Job First (SRJF

Cloud computing environments facilitate applications by providing virtualized resources that can be provisioned dynamically. Computing resources are delivered by Virtual Machines (VMs). In such a scenario, resource scheduling algorithms play an important role where the aim is to schedule applications effectively so as to reduce the turn-around time and improve resource utilization. The problem of this paper is how to dynamically allocate the submitted jobs to the available resources in order to complete the tasks within a minimum turn-around time as well as utilizing cloud resources effectively. The objective of this paper is to propose new scheduling algorithm on cloud computing environment using Shortest Remaining Job First (SRJF) algorithm. The methodology of this paper depends on simulation using cloudsim. The results of this paper revealed that the proposed algorithm (SRJF) performed better than the default scheduling algorithm.
A Reconfigurable Space-Filling-Based Slot Antenna for 2.4/5.2 GHz Band Applications

In this paper a reconfigurable microstrip-fed slot antenna for 2.4/5.2 GHz band applications is proposed. The design of these slots that form several "island-like" metal blocks in the ground are based on the use of space-filling curves, which endow the antenna with broadband performance, and here some modifications are implemented. By connecting several "islands" with some circuits to build bridge between them, the radiation properties can be changed, including the resonant frequency and radiation patterns. Here, a switch is added to achieve a reconfigurable antenna, and with the switch state changing, the radiation properties can be altered. The antenna structure proposed could be reconstructed in several manners, and in this paper, we give an easy way to realize the frequency hopping for 2.4/5.2 GHz band systems. The design and analysis for this antenna are accomplished by using HFSS (high frequency structure simulator), and its performance is calculated. Then the antenna prototype is fabricated and measured, the calculated and measured results show good agreements, which implies that such a type of antennas can achieve our design requirements.
Hermes: a semantic web-based news decision support system

The emergence of the Web has made more and more news items available, however only a small subset of these news items are relevant in a decision making process. Therefore decision makers need an information system that is capable of extracting a set of relevant news items automatically. This paper proposes a framework that provides decision makers with the ability to extract a set of news items related to specific concepts of interest. This is accomplished by creating a knowledge base and developing a system that classifies news with respect to the knowledge base.
An Innovative Time-Domain Simulation Technique for Strongly Nonlinear Heterogeneous RF Circuits Operating in Diverse Time-Scales

With the advent of wireless transceiver reconfigurability, a need has been felt to take profit of digital signal processing tools, this way increasing RF circuits' complexity and heterogeneity. Having this objective in mind, this paper presents an analytical formulation and a novel numerical method for simulating, in a very efficient way, strongly nonlinear heterogeneous RF circuits running in three different time-scales. In order to reduce the computational workload, a new multi-line double multi-rate shooting technique is proposed to operate within a multi-dimensional warped time framework. Obtained results of an illustrative circuit, reveal significant advantages in speed over previous methods recently proposed for the simulation of the same category of circuits.
Tensor calculus for supergravity on a manifold with boundary

Using the simple setting of 3D N=1 supergravity, we show how the tensor calculus of supergravity can be extended to manifolds with boundary. We present an extension of the standard F-density formula which yields supersymmetric bulk-plus-boundary actions. To construct additional separately supersymmetric boundary actions, we decompose bulk supergravity and bulk matter multiplets into co-dimension one submultiplets. As an illustration we obtain the supersymmetric extension of the York-Gibbons-Hawking extrinsic curvature boundary term. We emphasize that our construction does not require any boundary conditions on off-shell fields. This gives a significant improvement over the existing orbifold supergravity tensor calculus.
Off-trail SUSY

We present two distinct topics: I) We describe the propagation of a spin-3/2 state in a background which preserves invariance under space translations and rotations but not under Lorentz boost transformations. We start by building a generalisation of the Volkov-Akulov Lagrangian for a goldstino in a fluid. A super-Higgs mechanism leads to the modified Rarita-Schwinger Lagrangian describing a slow gravitino. We identify the physical propagating degrees of freedom and derive the corresponding equations of motion. This includes some new results. II) Fake Split Supersymmetry Models are proposed to alleviate some of the problems of the original Split SUSY. In particular it is no more necessary to restrict to a Mini-Split scenario as higher values of the supersymmetry breaking scale (Mega-Split) are now allowed. The FSSM relies on swapping the higgsinos for new states in identical gauge group representations but different Yukawa couplings.
Design and Analysis of Electro thermally Actuated Microgripper

Micro-Electro-Mechanical Systems (MEMS) technology offers the opportunity to produce mechanical, electromechanical, and electrochemical devices with the same unprecedented levels of miniaturization, and functionality as modern Very Large Scale Integrated (VLSI). Micro grippers are used for manipulation of biological samples, for assembling of micro parts and for micro assembly. Electro thermal micro grippers are promising tools enabling assembly and manipulation of nano-scale structures. In this paper MEMS based U-shaped thermally actuated micro-gripper is designed using two hot and one cold arm type thermal actuator. Then the effect of coefficient of thermal expansion and poisson’s ratio on stress for thermally actuated micro-gripper is analyzed and the results shows that the stress increases with the increase in coefficient of thermal expansion and the stress decreases with the increase in poisson’s ratio.
Estimate-Piloted Regularization and Fast ALS Algorithm for Collaborative Filtering

Regularized Low-rank approximation with missing data is an effective approach for Collaborative Filtering since it generates high quality rating predictions for recommender systems. Alternative LS (ALS) method is one of the commonly used algorithms for the CF problem. However, ALS did not work very well in some applications, due to the over-fitting to observations. This paper proposes a novel estimate-piloted regularization that uses a pre-estimate of the unobserved entries and uses the approximation errors to the pre-estimates as a regularize term. This new regularization can reduce the risk of over-fitting and improve the approximation accuracy of ALS. We also proposed a fast implementation of the modified ALS method, which is also very suitable for parallel computing. The proposed algorithm PALS has higher accuracy than ALS for original model in three real-world data sets.
Identification of Topping Responsive Proteins in Tobacco Roots

The process of topping elicits many responses in the tobacco plant, including an increase in nicotine biosynthesis, and the secondary growth of roots. Some topping responsive miRNAs and genes have been identified in our previous study, but the mechanism of the tobacco response to topping has not yet been fully elucidated. In this study, topping responsive proteins isolated from tobacco roots were screened using two-dimensional electrophoresis. Of the proteins identified, calreticulin and auxin-responsive protein indole acetic acid (IAA9) were involved in the secondary growth of roots; leucine-rich repeat disease resistance, heat shock protein 70, and farnesyl pyrophosphate synthase 1 were involved in the wounding stress response; and F-box protein played an important role in promoting the ability of nicotine synthesis after topping. In addition, we identified five tobacco bHLH proteins (NtbHLH, NtMYC1a, NtMYC1b, NtMYC2a, and NtMYC2b) related to nicotine biosynthesis. NtMYC2 was suggested to be the main positive transcription factor, with NtbHLH protein being a negative regulator in the jasmonic acid (JA)-mediated activation of nicotine biosynthesis after topping. Tobacco topping activates a comprehensive range of biological processes involving the IAA and JA signaling pathways, and the identification of proteins involved in these processes will improve our understanding of the topping response.
Semantic Word Clusters Using Signed Normalized Graph Cuts

Vector space representations of words capture many aspects of word similarity, but such methods tend to make vector spaces in which antonyms (as well as synonyms) are close to each other. We present a new signed spectral normalized graph cut algorithm, signed clustering, that overlays existing thesauri upon distributionally derived vector representations of words, so that antonym relationships between word pairs are represented by negative weights. Our signed clustering algorithm produces clusters of words which simultaneously capture distributional and synonym relations. We evaluate these clusters against the SimLex-999 dataset (Hill et al.,2014) of human judgments of word pair similarities, and also show the benefit of using our clusters to predict the sentiment of a given text.