Miracle-dz/UniFAR-FTUs huggingface dataset:
How Would You Say It? Eliciting Lexically Diverse Dialogue for Supervised Semantic Parsing

Building dialogue interfaces for real-world scenarios often entails training semantic parsers starting from zero examples. How can we build datasets that better capture the variety of ways users might phrase their queries, and what queries are actually realistic? Wang et al. (2015) proposed a method to build semantic parsing datasets by generating canonical utterances using a grammar and having crowdworkers paraphrase them into natural wording. A limitation of this approach is that it induces bias towards using similar language as the canonical utterances. In this work, we present a methodology that elicits meaningful and lexically diverse queries from users for semantic parsing tasks. Starting from a seed lexicon and a generative grammar, we pair logical forms with mixed text-image representations and ask crowdworkers to paraphrase and confirm the plausibility of the queries that they generated. We use this method to build a semantic parsing dataset from scratch for a dialog agent in a smart-home simulation. We find evidence that this dataset, which we have named SmartHome, is demonstrably more lexically diverse and difficult to parse than existing domain-specific semantic parsing datasets.
Postoperative acute kidney injury following intraoperative blood product transfusions during cardiac surgery

Introduction: This study explored the nature of the association between intraoperative usage of red blood cell, fresh frozen plasma, cryoprecipitate or platelet transfusions and acute kidney injury. Methods: A total of 1175 patients who underwent cardiac surgery between 2008 and 2013 were retrospectively analyzed. We assessed the association between: (1) preoperative patient characteristics and acute kidney injury, (2) intraoperative blood product usage and acute kidney injury, (3) acute kidney injury and 30-day mortality or re-hospitalization. Results: In our cohort of 1175 patients, 288 patients (24.5%) developed acute kidney injury. This included 162 (13.8%), 69 (5.9%) and 57 (4.9%) developing stage 1, stage 2 or stage 3 acute kidney injury, respectively. Increased red blood cell, fresh frozen plasma or platelet transfusions increased the odds of developing acute kidney injury. Specifically, every unit of red blood cells, fresh frozen plasma or platelets transfused was associated with an increase in the covariate-adjusted odds ratio of developing ⩾ stage 2 kidney injury of 1.18, 1.19 and 1.04, respectively. Conclusions: Intraoperative blood product transfusions were independently associated with an increased odds of developing acute kidney injury following cardiac surgery. Further randomized studies are needed to better define intraoperative transfusion criteria.
What details are needed for wireless simulations? - A study of a site-specific indoor wireless model

The wireless networking community continuously questions the accuracy and validity of simulation-based performance evaluations. The main reason is the lack of widely-accepted models that represent the real wireless characteristics, especially at the physical (PHY) layer. Hence, the trend in wireless networking is to rely more and more on testbeds, which on one hand bring more realism to network and protocol evaluation, but on the other hand present a high implementation barrier before an idea is ready to be tested. Therefore, realistic network simulators are still very much needed to reduce the time and effort for “concept testing” of novel ideas. In this case, the main question is how detailed should wireless simulators be to evaluate network and protocol performance. In this paper, we attempt a first answer to this question by using the Berlin Open Wireless Lab (BOWL) indoor model (BIM) in the ns-3 simulator. BIM includes several measurement-based models to characterize wireless communication such as frame detection ratio (FDR), frame error ratio (FER), capture and interference models. Through extensive measurements, we analyze the accuracy that we obtain with these PHY-layer models. Our experiments also show whether the detailed models at the PHY layer play an important role to represent transport layer performance in simulations.
Using randomization techniques to analyse behavioural data

Abstract Data from behavioural studies are frequently non-normally distributed and cannot be analysed with traditional parametric statistics. Instead, behaviourists must rely on rank-transformation tests, which lose potentially valuable information present in the data. Recently, however, biologists in other disciplines have resolved similar statistical difficulties by using resampling methods. Results from Kruskal–Wallis non-parametric ANOVA and randomization tests were compared for two behavioural data sets. It was found that randomization tests were more powerful than Kruskal–Wallis, and could thus detect smaller effect sizes present in the data. In addition, the variance was calculated around theP-value at eight levels of replication ranging from 500 to 10 000, to determine the optimal number of replications for the randomization test. The variance around theP-value decreased as the number of replications increased. TheP-value stabilized at 5000 replications, and thus it is recommended that at least 5000 replications be used for randomization tests on behavioural data.
Self-Adjusting Fuzzy Logic Control for Vehicle Lateral Control

This paper deals with the lateral control of vehicles in Automated Highway Systems with the main emphasis on the lane change maneuvers. The desired trajectory for the lane change maneuvers, called the Virtual Desired Trajectory (VDT), is designed considering passenger's comfort and required transition time for the maneuver. The Self-Adjusting Fuzzy Logic controller is proposed as the tracking controller to make the vehicle to follow the VDT. Simulations have been conducted to evaluate the performance of the closed loop system under various driving conditions, and the results is presented to show the feasibility of using the designed Self-Adjusting Fuzzy Logic control for the lane change maneuver.
Characterization of the binding properties and retrograde axonal transport of a monoclonal antibody directed against the rat nerve growth factor receptor

We have demonstrated in vitro and in vivo the specific binding of a monoclonal antibody to the rat nerve growth factor (NGF) receptor. Previous work had shown that this antibody, designated 192-IgG, does not compete with NGF for binding to the NGF receptor of PC12 cells, but instead interacts with the receptor to increase NGF binding to PC12 cells (Chandler, C. E., L. M. Parsons, M. Hosang, and E. M. Shooter, 1984, J. Biol. Chem., 259:6882-6889). In the present study, a solid- phase separation assay verified the specific formation of a ternary complex of 192-IgG, the NGF receptor, and NGF: 125I-labeled 192-IgG precipitated from solution only when incubated with both solubilized NGF receptor and NGF covalently linked to a solid phase (Sepharose 4B). Filtration assays using plasma membrane preparations of various tissues showed strict correlation of 125I-192-IgG and 125I-labeled NGF binding; only membranes obtained from superior cervical ganglion bound significant amounts of the monoclonal antibody and NGF. Injection of 125I-192-IgG into the rat anterior eye chamber led to accumulation of intact antibody molecules in the ipsilateral superior cervical ganglion, indicating retrograde axonal transport of 125I-192-IgG from the neuronal termini, located at the iris, to the cell bodies situated in the ganglion. The time course and saturation characteristics of 125I- 192-IgG retrograde transport were very similar to those previously reported for 125I-NGF transport, indicating that 192-IgG can be internalized and transported by the same mechanisms as is NGF. Consistent with results of the in vitro binding assays, 192-IgG and NGF failed to compete for retrograde transport and were actually co- transported. Retrograde axonal transport of 192-IgG appears to be species specific, since 125I-192-IgG was transported in the rat, but not in mice, gerbils, hamsters, or guinea pigs. These results establish monoclonal antibody 192-IgG as a specific probe for the rat NGF receptor in vitro and in vivo.
The Integration of Cognitive Levels

Cognition is no longer confined to the solitary musings of an armchair philosopher, but takes place, for instance, in problem-solving efforts of teams of people distributed around the world and involving various artifacts. The study of such cognition can unfold at multiple units of analysis. Here, three cases of problem solving by virtual math teams demonstrate the mix of individual, group and social levels of cognition. They show how a resource like a mathematical topic can bridge the different levels. Focusing on the under-researched phenomena of group cognition, the presentation highlights three pre-conditions for the constitution of group cognition: longer sequences of responses, persistent co-attention and shared understanding. Together, these structure a virtual analog of physical embodiment: being-there-together, where what is there is understood as co-experienced.
Video Error Concealment of P-frame Using Packets of the Following Frames

For real-time video streaming over unreliable networks, the losses or delay of the video packets may deteriorate the video quality at the receiver side. The traditional temporal error concealment methods try to guess the lost motion vectors (MVs) of the lost macro blocks (MBs) by exploiting the received motion information of the neighboring macroblocks, and that of the co-located macro block in the previous frames. The accuracy of this motion vector will affect the performance of the error concealment method. In this paper, instead of only exploiting the motion information in the current and previous frames, we also use the motion information in the following frames. In this case, more accurate estimation of the motion vector could be achieved, This leads to better concealment performance. Experimental results demonstrate that the proposed method can improve the performance in comparison with the traditional error concealment methods, for instance, the gain could be up to 0.6 dB for the "Foreman" video sequence.
A Supervised Classification Algorithm for Note Onset Detection

This paper presents a novel approach to detecting onsets in music audio files. We use a supervised learning algorithm to classify spectrogram frames extracted from digital audio as being onsets or nononsets. Frames classified as onsets are then treated with a simple peak-picking algorithm based on a moving average. We present two versions of this approach. The first version uses a single neural network classifier. The second version combines the predictions of several networks trained using different hyperparameters. We describe the details of the algorithm and summarize the performance of both variants on several datasets. We also examine our choice of hyperparameters by describing results of cross-validation experiments done on a custom dataset. We conclude that a supervised learning approach to note onset detection performs well and warrants further investigation.
Endocrinological Abnormalities Are a Main Feature of 17p13.1 Microduplication Syndrome: A New Case and Literature Review

To date, 5 cases of 17p13.1 microduplications have been described in the literature. Intellectual disability was reported as the core feature, together with minor facial dysmorphisms and obesity, but a characteristic phenotype for 17p13.1 microduplication has not been delineated. Here, we describe a patient with a 1.56-Mb de novo duplication in 17p13.1, affected by mild intellectual disability, facial dysmorphisms, obesity, and diabetes. By comparing the different phenotypes of currently described cases, we delineated the main clinical features of 17p13.1 microduplication syndrome. All patients described to date had variable facial dysmorphisms; therefore, it was difficult to define a common facial gestalt. Furthermore, we stress endocrinological abnormalities as important features and the need to monitor these over time.
Chaotic Motion of Europa and Ganymede and the Ganymede-Callisto Dichotomy

Europa and Ganymede may have undergone an episode of chaotic motion before the establishment of the current Laplace resonance involving the three inner Galilean satellites. During this episode, the orbital eccentricities of both satellites may have increased dramatically. As a result, the mechanical stresses due to tidal deformation of the satellites' icy lithospheres may have been large enough to result in extensive fracturing, and tidal heating may have melted water ice in the mantles of both satellites, triggering the geological activity that has modified their surfaces since the heavy cratering period. The tidal effects on Ganymede during this episode provide an explanation of the dichotomy between it and Callisto, which have similar bulk properties but very different geological histories.
The Growing Self-organizing Map for Clustering Algorithms in Programming Codes

The growing self-organizing map (GSOM) is a variation of the popular self-organizing map (SOM). It was developed to address the issue of identifying a suitable size of the SOM, which is usually concerned with vectorial items. To deal with algoritms implemented as programs, which are hardly represented by vectors, a new version of GSOM for clustering non-vectorial items (GSOM/NV) is proposed here. By syntax analysis, source codes of programs are converted into syntax trees, on a basis of which similarities between these codes are computed, so that the normal GSOM could be applied to clustering the algorithms that are implemented as the programs. An experiment shows that those whose implemented algorithms are the same, but coded differently each other, are gathered together on the visualization map generated by the proposed method.
Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication

Streaming applications are often implemented as task graphs, in which data is communicated from task to task over buffers. Currently, techniques exist to compute buffer capacities that guarantee satisfaction of the throughput constraint if the amount of data produced and consumed by the tasks is known at design-time. However, applications such as audio and video decoders have tasks that produce and consume an amount of data that depends on the decoded stream. This paper introduces a dataflow model that allows for data-dependent communication, together with an algorithm that computes buffer capacities that guarantee satisfaction of a throughput constraint. The applicability of this algorithm is demonstrated by computing buffer capacities for an H.263 video decoder.
Nonsurgical treatment of prominent ears with the Auri method.

OBJECTIVE To present and test a new method for conservative correction of prominent pinnae in children aged between 2 weeks and 5.5 years. DESIGN Prospective study on 56 pinnae from 44 children aged between 0.25 and 5.5 years, treated with the Auri method, which consists of a clip and a strip. The clip is a specially designed plastic clamp used during the night for an average of 4.3 hours per night. It squeezes the cartilage and makes a fold at the place of the missing anthelix. The strip is a double adhesive fixture used during daytime for an average of 8.9 hours per day. To test the efficiency of the treatment objective (thickness and stiffness of the pinna, cephaloauricular distance, and photo-documentation) and subjective (investigators' and parents' judgment of the shape and grade of the correction of the pinnae) parameters have been applied. RESULTS Of the children, 38 (86%) achieved good to fair correction of their pinnae. Of the parents, all 44 (100%) were satisfied with the treatment and 35 (80%) reported good to fair correction of their child's pinnae. Slight complications were observed in 13 children (30%): 10 (23%) had temporary irritation of the skin of the pinna and 3 (7%) had slight temporary squeeze marks of the pinnae. Of the 44 children, 31 were evaluated 10 months after completing treatment, and the pinnae of 38 children (86%) maintained their corrected shape. CONCLUSIONS Correction of the prominent pinna can be done by the new nonsurgical Auri method in children aged between 0.25 and 5.5 years, which provided good to fair results in 89% of pinnae in this study. The method is efficient in the short term and easy to use by the parents, but it requires long-term motivation of the parents as well as the child. The child can be treated at early age, avoiding psychosocial and cosmetic problems during school age.
Spatial organization of axonal microtubules

Several workers have found that axonal microtubules have a uniform polarity orientation. It is the "+" end of the polymer that is distal to the cell body. The experiments reported here investigate whether this high degree of organization can be accounted for on the basis of structures or mechanisms within the axon. Substantial depolymerization of axonal microtubules was observed in isolated, postganglionic sympathetic nerve fibers of the cat subjected to cold treatment; generally less than 10% of the original number of microtubules/micron 2 remained in cross section. The number of cold stable MTs that remained was not correlated with axonal area and they were also found within Schwann cells. Microtubules were allowed to repolymerize and the polarity orientation of the reassembled microtubules was determined. In fibers from four cats, a majority of reassembled microtubules returned with the original polarity orientation. However, in no case was the polarity orientation as uniform as the original organization. The degree to which the original orientation returned in a fiber was correlated with the number of cold-stable microtubules in the fiber. We suggest that stable microtubule fragments serve as nucleating elements for microtubule assembly and play a role in the spatial organization of neuronal microtubules. The extremely rapid reassembly of microtubules that we observed, returning to near control levels within the first 5 min, supports microtubule elongation from a nucleus. However, in three of four fibers examined this initial assembly was followed by an equally rapid, but transient decline in microtubule number to a value that was significantly different than the initial peak. This observation is difficult to interpret; however, a similar transient peak has been reported upon repolymerization of spindle microtubules after pressure induced depolymerization.
Why is facial expression analysis in the wild challenging?

In this paper, we discuss the challenges for facial expression analysis in the wild. We studied the problems exemplarily on the Emotion Recognition in the Wild Challenge 2013 [3] dataset. We performed extensive experiments on this dataset comparing different approaches for face alignment, face representation, and classification, as well as human performance. It turns out that under close-to-real conditions, especially with co-occurring speech, it is hard even for humans to assign emotion labels to clips when only taking video into account. Our experiments on automatic emotion classification achieved at best a correct classification rate of 29.81% on the test set using Gabor features and linear support vector machines, which were trained on web images. This result is 7.06% better than the official baseline, which additionally incorporates time information.
Managing Kernel Memory Resources from User Level

In order to implement abstractions like threads or address s paces, operating system kernels need to maintain the corresponding metadata. Th is metadata is usually stored in kernel memory, i.e. in a region of physical memory t hat is reserved for kernel use. As the amount of available kernel memory is limit ed, its allocation must be controlled carefully; otherwise, applications can ru a denial-of-service attack against the kernel by consuming all of its resources. Some operating system kernels have addressed this problem b y providing powerful management policies. However, with a single globa l policy, it is difficult to accommodate multiple domains with different requi rements at the same time. Also, existing solutions allow only limited control o ver kernel memory; for example, it is often not possible to reduce an allocation , except by killing the task that currently holds it. This makes it difficult to respo nd to changing load situations or suspected denial-of-service attacks. In this thesis, we present a new scheme which uses paged virtu al memory to control kernel memory resources from user level. Memory can be preempted from the kernel and restored later; any kernel metadata affected by this is converted into an external representation, which can be safely export ed. To demonstrate our approach, we apply it to an existing kernel, the L4 microkern el. We also present an experimental implementation.
S-1 and oxaliplatin (SOX) plus bevacizumab versus mFOLFOX6 plus bevacizumab as first-line treatment for patients with metastatic colorectal cancer: updated overall survival analyses of the open-label, non-inferiority, randomised phase III: SOFT study

Objective The SOFT study previously demonstrated that S-1 and oxaliplatin (SOX) plus bevacizumab was non-inferior to l-leucovorin, fluorouracil and oxaliplatin (mFOLFOX6) plus bevacizumab in terms of the primary end point of progression-free survival (PFS) as first-line chemotherapy for metastatic colorectal cancer (mCRC). The overall survival (OS) data were immature at the time of the primary analysis. Methods A total of 512 patients were enrolled and randomly assigned to receive either mFOLFOX6 plus bevacizumab (5 mg/kg of bevacizumab, followed by 200 mg/m2 of l-leucovorin given simultaneously with 85 mg/m2 of oxaliplatin, followed by a 400 mg/m2 bolus of 5-FU on day 1 and then 2400 mg/m2 of 5-FU as an intravenous infusion over the course of 46 hours, every 2 weeks) or SOX plus bevacizumab (7.5 mg/kg of bevacizumab, 130 mg/m2 of oxaliplatin on day 1 and 40–60 mg of S-1 two times per day for 2 weeks, followed by a 1-week rest). The primary end point was PFS. After the primary analysis, the follow-up survey was cut-off on 30 September 2013, and the final OS data were analysed. Results With a median follow-up of 37.7 months, the median survival time (MST) was 29.7 months with mFOLFOX6 plus bevacizumab and 29.6 months with SOX plus bevacizumab (HR, 1.018; 95% CI 0.823 to 1.258). Median PFS was 11.7 months in the mFOLFOX6 plus bevacizumab group and 12.2 months in the SOX plus bevacizumab group (HR, 1.051; 95% CI 0.876 to 1.262; pnon-inferiority=0.0115). Conclusion Our results reconfirmed that SOX plus bevacizumab is non-inferior to mFOLFOX6 plus bevacizumab in terms of PFS. MST did not differ between the groups. SOX plus bevacizumab is considered an effective regimen for first-line chemotherapy in patients with mCRC and can be used instead of mFOLFOX6 plus bevacizumab. Trial registration number JapicCTI-090699.
Scheduling Algorithm for Tasks with Multiple Parallelization Options on Multiprocessor Systems

The purpose of this paper is to study the task scheduling problem of task sets on multiprocessor systems. In the task set there are parallel tasks and sequential tasks. Parallel tasks can not meet their deadlines if they are executed by one unique thread. We propose the Worst-Fit based on Equal Slack (WFES) algorithm for deadline setting and task assignment. To derive a feasible task assignment, we must select a proper parallelization level from the available parallelization options for each parallel task. Then the parallel task will be split into several subtasks. Finally, sequential tasks and generated subtasks for parallel tasks are assigned to processors. A series of experiments were conducted to evaluate the proposed algorithm. From the experimental results, we can observe that the proposed algorithm had better performance the compared algorithms. The experimental results demonstrate that the performance of the algorithms using the Equal Slack strategy is better than that using the Equal Flexibility strategy.