Miracle-dz/UniFAR-FTUs huggingface dataset:
Trastuzumab induces antibody-dependent cell-mediated cytotoxicity (ADCC) in HER-2-non-amplified breast cancer cell lines.

BACKGROUND Antibody-dependent cell-mediated cytotoxicity (ADCC) mediated by CD56+natural killer (NK) cells may contribute to the activity of trastuzumab in HER-2-amplified tumours. In this study, we investigated the possibility that trastuzumab might induce ADCC against HER-2-non-amplified breast cancer cells. METHODS Induction of NK cell-mediated ADCC was examined in trastuzumab-treated HER-2-non-amplified breast cancer cell lines. HER-2 protein levels were also determined in tumour and autologous normal tissue samples from patients with HER-2 negative breast cancer. RESULTS Trastuzumab induced a significant ADCC response in the HER-2-amplified HCC1954 and SKBR3 cell lines, and in all five of the non-amplified cell lines, which had low levels of detectable HER-2 by western blot (CAL-51, CAMA-1, MCF-7, T47D, and EFM19). Trastuzumab did not induce ADCC in the K562 control cell line or MDA-MB-468, which has very low levels of HER-2 detectable by enzyme-linked immunosorbent assay (ELISA) only. HER-2 protein was detected by ELISA in 14/15 patient tumour samples classified as HER-2-non-amplified. Significantly lower levels of HER-2 were detected in normal autologous tissue compared with tumour samples from the same patients. CONCLUSION Our results suggest that HER-2-non-amplified breast cancer cells, with low but detectable levels of HER-2 protein, can bind trastuzumab and initiate ADCC.
Compa backend: A dynamic runtime for the execution of dataflow programs onto multi-core platforms

In this demo we will present a design flow for multi-core based embedded systems. Namely, we implement a kernel capable of modifying the system at run time to increase data throughput. The design flow starts with the Dynamic Dataflow and RVC-CAL (Reconfigurable Video Coding Cal Actor Language) descriptions of an application and goes up to the deployment of the system onto the hardware platform. As a use case, we implement an MPEG-4 decoder algorithm onto a multi-core heterogeneous system deployed onto the Zynq platform from Xilinx.
Do transformational-oriented leadership and transactional-oriented leadership have an impact on whistle-blowing attitudes? A longitudinal examination conducted in US federal agencies

ABSTRACT The benefits of effective leadership practices have often been examined. However, little is known about how these practices impact the perceptions of agency employees regarding whistle-blowing. For instance, only two cross-sectional studies were found to examine an association between transformational leadership (the most often studied leadership practice) and whistle-blowing attitudes. To extend these studies, we examined the relationship between transformational-oriented leadership behaviours and whistle-blowing attitudes using panel data. The findings revealed that transformational-oriented leadership increased the extent to which employees in agencies felt they could disclose wrongdoing without facing retaliation. Transactional-oriented leadership was also found to have a positive effect on these whistle-blowing behaviours; however, the effect size was smaller. The implications of these findings are thoroughly discussed in the article.
New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects

For $\cal C$ a collection of $n$ objects in $R^d$, let the packing and piercing numbers of $\cal C$, denoted by $Pack({\cal C})$, and $Pierce({\cal C})$, respectively, be the largest number of pairwise disjoint objects in ${\cal C}$, and the smallest number of points in $R^d$ that are common to all elements of ${\cal C}$, respectively. When elements of $\cal C$ are fat objects of arbitrary sizes, we derive sub-exponential time algorithms for the NP-hard problems of computing ${Pack}({\cal C})$ and $Pierce({\cal C})$, respectively, that run in $n^{O_d({{Pack}({\cal C})}^{d-1\over d})}$ and $n^{O_d({{Pierce}({\cal C})}^{d-1\over d})}$ time, respectively, and $O(n\log n)$ storage. Our main tool which is interesting in its own way, is a new separation theorem. The algorithms readily give rise to polynomial time approximation schemes (PTAS) that run in $n^{O({({1\over\epsilon})}^{d-1})}$ time and $O(n\log n)$ storage. The results favorably compare with many related best known results. Specifically, our separation theorem significantly improves the splitting ratio of the previous result of Chan, whereas, the sub-exponential time algorithms significantly improve upon the running times of very recent algorithms of Fox and Pach for packing of spheres.
Sensorimotor adaptation of speech using real-time articulatory resynthesis

Sensorimotor adaptation is an important focus in the study of motor learning for non-disordered speech, but has yet to be studied substantially for speech rehabilitation. Speech adaptation is typically elicited experimentally using LPC resynthesis to modify the sounds that a speaker hears himself producing. This method requires that the participant be able to produce a robust speech-acoustic signal and is therefore not well-suited for talkers with dysarthria. We have developed a novel technique using electromagnetic articulography (EMA) to drive an articulatory synthesizer. The acoustic output of the articulatory synthesizer can be perturbed experimentally to study auditory feedback effects on sensorimotor learning. This work aims to compare sensorimotor adaptation effects using our articulatory resynthesis method with effects from an established, acoustic-only method. Results suggest that the articulatory resynthesis method can elicit speech adaptation, but that the articulatory effects of the two methods differ.
Policing Urban Burglary - T&I 213

http://www.aic. gov.au Adam Graycar Director Burglary is a significant issue in most urban areas and many agencies are involved in efforts to combat the problem. The police are one such agency that relies on accurate and rigorous analysis of crime and offender data to focus their available resources. The Australian Institute of Criminology has been working with a number of police services to better understand patterns of offending and criminal behaviour across Australia. This paper presents a spatial and temporal analysis of burglary patterns in the Australian Capital Territory and then discusses issues surrounding Operation Anchorage, a burglary reduction operation recently conducted by the Australian Federal Police. Some of the complexities in developing an effective crime reduction strategy are discussed in relation to both Operation Anchorage and other policing initiatives.
Counterterms in dimensionally continued AdS gravity

We revise two regularization mechanisms for Lovelock gravity with AdS asymptotics. The first one corresponds to the Dirichlet counterterm method, where local functionals of the boundary metric are added to the bulk action on top of a Gibbons-Hawking-Myers term that defines the Dirichlet problem in gravity. The generalized Gibbons-Hawking term can be found in any Lovelock theory following the Myers' procedure to achieve a well-posed action principle for a Dirichlet boundary condition on the metric, which is proved to be equivalent to the Hamiltonian formulation for a radial foliation of spacetime. In turn, a closed expression for the Dirichlet counterterms does not exist for a generic Lovelock gravity. The second method supplements the bulk action with boundary terms which depend on the extrinsic curvature (Kounterterms), and whose explicit form is independent of the particular theory considered. In this paper, we use Dimensionally Continued AdS Gravity (Chern-Simons-AdS in odd and Born-Infeld-AdS in even dimensions) as a toy model to perform the first explicit comparison between both regularization prescriptions. This can be done thanks to the fact that, in this theory, the Dirichlet counterterms can be readily integrated out from the divergent part of the Dirichlet variation of the action. The agreement between both procedures at the level of the boundary terms suggests the existence of a general property of any Lovelock-AdS gravity: intrinsic counterterms are generated as the difference between the Kounterterm series and the corresponding Gibbons-Hawking-Myers term.
Implementation of a 4 4 Switch With Passive Interconnects

We designed and fabricated a 4 4 switch in which all interconnections were implemented using passive transmission lines (PTLs). The switch consisted of four identical 2 2 switches connected using PTLs. The 2 2 switch was designed using gate-to-gate passive interconnections. Using the on-chip testing method, we demonstrated 40-GHz operation of the 4 4 switch. To verify the effectiveness of passive interconnection, we compared the 4 4 switch with an identical switch that was designed using Josephson transmission lines (JTLs) for interconnections. The comparison showed that the PTL-version 4 4 switch had 50% fewer junctions and required 55% less powering current. The latency and the largest jitter in the PTL-version 4 4 switch were estimated to be 36% and 61%, respectively, of those of the JTL version.
Comparison of Different Graph Distance Metrics for Semantic Text Based Classification

Nowadays semantic information of text is used largely for text classification task instead of bag-of-words approaches. This is due to having some limitations of bag of word approaches to represent text appropriately for certain kind of documents. On the other hand, semantic information can be represented through feature vectors or graphs. Among them, graph is normally better than traditional feature vector due to its powerful data structure. However, very few methodologies exist in the literature for semantic representation of graph. Error tolerant graph matching techniques such as graph similarity measures can be utilised for text classification. However, the techniques like Maximum Common Subgraph (mcs) and Minimum Common Supergraph (MCS) for graph similarity measures are computationally NP-hard problem. In the present paper summarized texts are used during extraction of semantic information to make it computationally faster. The semantic information of texts are represented through the discourse representation structures and later transformed into graphs. Five different graph distance measures based on Maximum Common Subgraph (mcs) and Minimum Common Supergraph (MCS) are used with k-NN classifier to evaluate text classification task. The text documents are taken from Reuters21578 text database distributed over 20 classes. Ten documents of each class for both training and testing purpose are used in the present work. From the results, it has been observed that the techniques have more or less equivalent potential to do text classification and as good as traditional bag-of-words approaches.
Thrombolyse des akuten Schlaganfalls – Eine deutschlandweite Analyse der regionalen Versorgung

Zusammenfassung Hintergrund: Anhand von Sekundärdaten soll die Versorgungssituation von Schlaganfallpatienten mit einer zerebralen Ischämie in Deutschland näher betrachtet werden. Ein Schwerpunkt liegt auf der Betrachtung der dokumentierten Thrombolysen. Methode: Datenbasis sind die Krankenhausdaten aus den gesetzlichen Qualitätsberichten. Es wurden alle Krankenhäuser berücksichtigt (n = 1302), die Schlaganfallpatienten mit einer zerebralen Ischämie auf einer neurologischen, internistischen, geriatrischen oder intensivmedizinischen Fachabteilung behandelt haben. Die Versorgungssituation hinsichtlich der Thrombolyseerfahrung der Krankenhäuser wurde kartografisch dargestellt. Mögliche Einflussfaktoren auf die Thrombolyseraten wurden analysiert. Ergebnis: 78 % der ca. 198 500 ischämischen Schlaganfälle wurden auf einer auf die Behandlung von Schlaganfallpatienten spezialisierten Station (Stroke-Unit) behandelt. Die durchschnittliche Thrombolyserate der neurologischen Fachabteilungen lag bei 9,1 % im Jahr 2010. Die Thrombolyseraten der einzelnen Krankenhäuser wichen stark voneinander ab und lagen zwischen 0 und 38 %. Signifikante Einflussfaktoren auf die Thrombolyserate waren die Anzahl der behandelten ischämischen Schlaganfälle und das Vorhandensein einer Stroke-Unit. Diskussion: Deutschland weist eine regional unterschiedliche Verteilung von Versorgungsstrukturen für Schlaganfallpatienten auf. Krankenhäuser mit Erfahrung in der Behandlung von Schlaganfallpatienten und Stroke-Unit zeigen höhere Thrombolyseraten. Die Daten legen nahe, dass es weiter Verbesserungsbedarf gibt, damit alle Schlaganfallpatienten eine leitliniengerechte Schlaganfalltherapie erhalten.
Centrality metrics of importance in access behaviors and malware detections

System objects play different roles in a computer system and exhibit different degrees of importance with respect to system security. Identifying importance metrics can help us to develop more effective and efficient security protection methods. However, there is little previous work on evaluating the importance of objects from the perspective of security. In this paper, we propose a novel approach to evaluate the importance of various system objects based on a bipartite dependency network representation of access behaviors observed in a computer system. We introduce centrality metrics from network science to quantitatively measure the relative importance of system objects and reveal their inherent connections to security properties such as integrity and confidentiality. Furthermore, we propose importance-metric based models to characterize process behaviors and identify abnormal access patterns with respect to confidentiality and integrity. Extensive experimental results on one real-world dataset demonstrate that our model is capable of detecting 7,257 malware samples from 27,840 benign processes at 93.94% TPR under 0.1% FPR. Moreover, a selective protection scheme based on a partial behavioral model of important objects achieves comparable or even better results in malware detection when compared with complete behavior models. This demonstrates the feasibility of the devised importance metrics and presents a promising new approach to malware detection.
Personal software process (PSP) assistant

The personal software process (PSP) is a process and performance improvement method aimed at individual software engineers. The use of PSP has been shown to result in benefits such as improved estimation accuracy and reduced defect density of individuals. However, the experience of our institute and of several others is that recording various size and defect data can be onerous, which in, turn can lead to adoption and data quality problems. This paper describes a system that we have developed that performs automatic size and defect recording, aside from providing facilities for viewing and editing the usual PSP logs and reports. Moreover, the system automatically classifies and ranks defects, and then consolidates schedules and defect lists of individual developers into a schedule and defect library for the developers' team.
User adjustable process scheduling mechanism for a multiprocessor embedded system

The multiprocessor computer systems become more popular for the improvement of the processor's design and fabrication's evolution. In the past, the multiprocessors systems are usually adopted in server systems. Nowadays, the configurations of multiprocessor are also adopted in the personal computers or embedded systems. But we cannot achieve the optimal performance of the multiprocessor systems efficiently because task-scheduling mechanism cannot be adjusted for the real performing situation. Even the task-scheduler of the operating system cannot handle this problem. Also, the parallel program is hard to develop for the specific system to improve performance. In this paper, we provide a tool, called MONOPOLY, for users to adjust the scheduling policies of OS dynamically. It can improve the utilization of the multiple processors' resources by allowing user to occupy a processor to make the specified program execute solely. In our experiment, the results show that the program will finish faster by using MONOPOLY. When the system is fully loaded, the execution time of the program with MONOPOLY will be much shorter then the program without this tool.
Proposal for ESSLI course : Propositions as Types

The principle of Propositions as Types describes a fundamental connection between logic and computation which views propositions as types, proofs as programs, and normalisation of proofs as evaluation of programs. The proposed course is intended to begin at the foundations and introduce students to a few intermediate or advanced topics. It is suitable for students in both logic and computing, presuming no previous knowledge of either, though familiarity with logic and computing will be helpful. Motivation and description [Taken from the introduction to Wadler [2015]. ] Powerful insights arise from linking two fields of study previously thought separate. Examples include Descartes’s coordinates, which links geometry to algebra, Planck’s Quantum Theory, which links particles to waves, and Shannon’s Information Theory, which links thermodynamics to communication. Such a synthesis is offered by the principle of Propositions as Types, which links logic to computation. At first sight it appears to be a simple coincidence—almost a pun—but it turns out to be remarkably robust, inspiring the design of theorem provers and programming languages, and continuing to influence the forefronts of computing. Propositions as Types is a notion with many names and many origins. It is closely related to the BHK Interpretation, a view of logic developed by the intuitionists Brouwer, Heyting, and Kolmogorov in the 1930s. It is often referred to as the Curry-Howard Isomorphism, referring to a correspondence observed by Curry in 1958 and refined by Howard in 1969 (though not published until 1980, in a Festschrift dedicated to Curry). Others draw attention to significant contributions from de Bruijn’s Automath and MartinLöf’s Type Theory in the 1970s. Many variant names appear in the literature, including Formulae as Types, Curry-Howard-de Bruijn Correspondence, Brouwer’s Dictum, and others.
Using Polygon Analysis for Contrast Mining in Spatial Data

Detecting changes in spatial datasets is important for many fields. In this paper, we introduce a methodology for change analysis in spatial datasets that combines contouring algorithms with supervised density estimation techniques. The methodology allows users to define their own criteria for features of interest and to identify changes in those features between two datasets. Change analysis is performed by comparing interesting regions that have been derived using contour clustering. A novel clustering algorithm called DCONTOUR is introduced for this purpose that computes contour polygons that describe the boundary of a supervised density function at a given density threshold. Relationships between old and new data are analyzed relying on polygon operations. We evaluate our methodology in case studies that analyze changes in earthquake patterns. 1 Chen, C.S, Rinsurongkawong V. and C.F. Eick are with Department of Computer Science, University of Houston 2 Twa, M.D. is with Department of Optometry, University of Houston Using Polygon Analysis for Contrast Mining in Spatial Data Chun Sheng Chen,Vadeerat Rinsurongkawong, Christoph F. Eick, and Michael D. Twa
Group-Based Neighbor Discovery in Low-Duty-Cycle Mobile Sensor Networks

Wireless sensor networks have been used in many mobile applications such as wildlife tracking and participatory urban sensing. Because of the combination of high mobility and low-duty-cycle operations, it is a challenging issue to reduce discovery delay among mobile nodes, so that mobile nodes can establish connection quickly once they are within each other's vicinity. Existing discovery designs are essentially pairwise based, in which discovery is passively achieved when two nodes are prescheduled to wake up at the same time. In contrast, this work reduces discovery delay significantly by proactively referring wake-up schedules among a group of nodes. Since proactive references incur additional overhead, we introduce a novel selective reference mechanism based on spatiotemporal properties of neighborhood and the mobility of nodes. Our quantitative analysis indicates that the discovery delay of our group-based mechanism is significantly smaller than that of the pairwise one. Our testbed experiments using 40 sensor nodes and extensive simulations confirm the theoretical analysis, showing one order of magnitude reduction in discovery delay compared with legacy pairwise methods in dense, uniformly distributed sensor networks with at most 8.8 percent increase in energy consumption.
Decision of double-talk and time-variant echo path for acoustic echo cancellation

A new double-talk detection (DTD) method is proposed for acoustic echo cancellation (AEC) using the iterative maximal-length-correlation (IMLC) algorithm. Based on the assumption of uniformly distributed time-variant echo-path-change, we develop a simplified likelihood ratio test and plot the detection performance by a receiver operating characteristic. Computer simulation shows the proposed DTD method is effective in discriminating double-talk from time-variant echo-path-change.
Complete DNA Sequence and Analysis of the Large Virulence Plasmid of Shigella flexneri

ABSTRACT The complete sequence analysis of the 210-kb Shigella flexneri 5a virulence plasmid was determined.Shigella spp. cause dysentery and diarrhea by invasion and spread through the colonic mucosa. Most of the knownShigella virulence determinants are encoded on a large plasmid that is unique to virulent strains of Shigella and enteroinvasive Escherichia coli; these known genes account for approximately 30 to 35% of the virulence plasmid. In the complete sequence of the virulence plasmid, 286 open reading frames (ORFs) were identified. An astonishing 153 (53%) of these were related to known and putative insertion sequence (IS) elements; no known bacterial plasmid has previously been described with such a high proportion of IS elements. Four new IS elements were identified. Fifty putative proteins show no significant homology to proteins of known function; of these, 18 have a G+C content of less than 40%, typical of known virulence genes on the plasmid. These 18 constitute potentially unknown virulence genes. Two alleles of shet2 and five alleles ofipaH were also identified on the plasmid. Thus, the plasmid sequence suggests a remarkable history of IS-mediated acquisition of DNA across bacterial species. The complete sequence will permit targeted characterization of potential new Shigellavirulence determinants.
Understanding the Mechanisms Through Which an Influential Early Childhood Program Boosted Adult Outcomes

A growing literature establishes that high quality early childhood interventions targeted toward disadvantaged children have substantial impacts on later life outcomes. Little is known about the mechanisms producing these impacts. This paper uses longitudinal data on cognitive and personality traits from an experimental evaluation of the influential Perry Preschool program to analyze the channels through which the program boosted both male and female participant outcomes. Experimentally induced changes in personality traits explain a sizable portion of adult treatment effects.