Miracle-dz/UniFAR-FTUs huggingface dataset:
Evans Functions for Integral Neural Field Equations with Heaviside Firing Rate Function

In this paper we show how to construct the Evans function for traveling wave solutions of integral neural field equations when the firing rate function is a Heaviside. This allows a discussion of wave stability and bifurcation as a function of system parameters, including the speed and strength of synaptic coupling and the speed of axonal signals. The theory is illustrated with the construction and stability analysis of front solutions to a scalar neural field model, and a limiting case is shown to recover recent results of Zhang [Differential Integral Equations, 16 (2003), pp. 513--536]. Traveling fronts and pulses are considered in more general models possessing either a linear or piecewise constant recovery variable. We establish the stability of coexisting traveling fronts beyond a front bifurcation and consider parameter regimes that support two stable traveling fronts of different speeds. Such fronts may be connected, and depending on their relative speed the resulting region of activity can widen o.
A Social Space Approach to Testing Complex Hypotheses: The Case of Hispanic Marriage Patterns in the United States

Where do individuals identifying as Hispanic fit in the racial landscape of the United States? The answer offered by past work is complex: The empirical results do not lend themselves to simple interpretation as no single hypothesis fits the Hispanic case very well. Instead, Hispanic integration is described as mixtures of different archetypical hypotheses, like panethnic formation, white assimilation, and racialized assimilation. My goal is to develop a formal framework to help make sense of this complex picture. I extend past work by showing which combination of integration processes (panethnic formation, white assimilation, etc.) best characterizes Hispanic marriage patterns. I make two analytical contributions. First, I organize past Hispanic hypotheses, both archetypical and blended, into a single theoretical framework defined by the salience of race and Hispanic ethnicity. Second, I parametize this theoretical framework using latent social space models. In this way, I am able to specify a set of interconnected, complex hypotheses in a tractable manner. I follow past work and use marriage/cohabitation data to test the hypotheses. Using American Community Survey data (2010–2012), I find that Hispanic marriage/cohabitation patterns suggest high salience on both race and Hispanic ethnicity. Thus, categories like black-Mexican or white-Cuban represent relationally distinct social categories—distinct from both non-Hispanic racial categories (e.g., black or white) and Hispanic categories of a different racial identity.
Towards a cognitive-sociological theory of subjectivity and habitus formation in neoliberal societies

Disconcerting findings from nascent sociological research suggest that Western youth are developing subjectivities that reflect neoliberal discursive formations of self-interest, competitiveness, and materialism. However, propositions about: (1) the cognitive-affective mechanisms that explain how youth acquire and reproduce neoliberal ideology, or (2) the dispositions and behaviours that typify a neoliberal subject, remain vague. Therefore, this article provides a novel conceptualization of these two psychosocial facets that can help advance understandings and investigations of the emerging modes and societal consequences of neoliberal subjectification, Specifically, it reviews major theoretical tenets from the respective literatures on neurocognitive development, social cognition, neoliberalism, and neoliberal hegemony. It then synthesizes these tenets within a modified habitus formulation to sketch a testable cognitive-sociological model to explain and explore some of the distinct dispositional values, attitudes, and practices that youth raised in societies with institutionally and culturally prevalent neoliberal norms and discourses potentially may develop and enact.
A Prefix-Correct Earley Recognizer for Multiple Context-Free Grammars

We present a method for deriving an Ear-ley recognizer for multiple context-free grammars with the correct preﬁx property. This is done by representing an MCFG by a Datalog program and applying generalized supplementary magic-sets rewriting. To secure the correct preﬁx property, a simple extra rewriting must be performed before the magic-sets rewriting. The correctness of the method is easy to see, and a straightforward application of the method to tree-adjoining grammars yields a recognizer whose running time is O ( n 6 ).
Statistical QoS Provisioning in Mobile Ad Hoc Networks

In this work, we establish a general framework for investigating statistical QoS provisioning in mobile ad hoc networks. Though the throughput and average delay in wireless ad hoc works have been has been intensively studied in the literature, statistical delay guarantee provisioning in large scale ad hoc networks has not received enough attention. A real time application, e.g., interactive game and real time video, requires stringent delay (delay bound) but may allow a small probability of outage (deadline violation probability). This motivates us to study the relationship among throughput, delay bound and deadline violation probability. We propose to use a triplet $(T, B, R)$, where $T,B,R$ denote throughput, delay bound and deadline violation probability (or, equivalently, the reliability index) respectively, to describe the delay constrained performance of a mobile ad hoc network. Both i.i. d. mobility model and random walk model are adopted to illustrate the tradeoffs among these performance metrics. Since the relation between delay bound and deadline violation probability can be interpreted as a description of the reliability of delay-sensitive communications, our results provide insights into understanding the delay constrained performance of large scale wireless ad hoc networks.
HapticAid: wearable haptic augmentation system for enhanced, enchanted and empathised haptic experiences

We present HapticAid, a wearable system that enhances haptic sensations. The system consists of a wearable skin vibration sensor that is placed at the middle phalanx of a finger, a processor that processes haptic information, and a wrist-worn haptic actuator that provides haptic feedback. We envision three application areas with the HapticAid system: enhance, i.e., amplify and enhance haptic sensations; enchant. i.e., experience new haptic feedback when interacting with passive objects; and empathise, i.e., communication of haptic experiences that allows connecting and empathising with others'haptic sensations.
Improve Parallelism of Task Execution to Optimize Utilization of MapReduce Cluster Resources

MapReduce, as a programming model, has become an important solution to large-scale data-intensive processing. It has been widely used in various fields such as Web search, machine learning and e-commerce. Hadoop, as an open-source implementation of MapReduce, is widely used for offline massive data job. It consists of MapReduce and HDFS. In the study of Hadoop, we found data parallel in Hadoop is coarse grained, and it cannot take full advantage of multi-core system. Eventually, this would lower utilization and efficiency of the whole cluster. To improve Hadoop into a fine grained data-parallel frame, we propose a strategy that scales the parallelism of task execution in map/reduce task. We implement our strategy as a new feature for Hadoop. And our experiments show that strategy can not only optimize utilization of MapReduce cluster resources, but also speedup job completion time up to 3x.
Constructing Boundary and Interface Parametrizations for Finite Element Solvers

simplicial complex exclusively. The decision of whether or not two two-dimensional simplicial complexes have the same topological type is as hard as deciding whether or not two graphs are isomorphic [61]. No polynomial time algorithm for this is known, but it is also unknown whether the graph isomorphism problem is NP-complete [32]. Edelsbrunner [28] gives sufficient local conditions for the preservation of the topological type when simplifying surfaces by contracting edges. Since our implementation works with the point removal primitive, we need different conditions. We found the following condition to work well in practice. We prove it for the case of a manifold surface. Lemma 3.1 Let K = (V, F ) be a two-dimensional abstract simplicial complex, and assume that K is a manifold. Remove a vertex v ∈ V of degree n together with its star St v from K and choose a retriangulation of the resulting hole. That retriangulation will add n−3 one-faces to the complex which are not part of Lk v. Call the set of those one-faces E = {e1, . , en−3}. Then the following holds: If no ej ∈ E, j = 1, . , n− 3 is a one-face in F \ St v then K′ = (V \ {v}, F \ St v) together with the retriangulation is a manifold. Proof: Since K is a manifold, for each vertex v ∈ V , Lk v is a simple closed cycle. Assume that a point removal step has removed vertex v of degree n and that a retriangulation of the resulting hole is given. This retriangulation contains a set of one-faces. We denote the subset of those one-faces (we shall call them edges in the following), which were not part of Lk v, as E = {e1, . , en−3}. We assume that no edge ej ∈ E exists already in K.
USING GRAMMAR-ORIENTED OBJECT DESIGN TO SEAMLESSLY MAP BUSINESS MODELS TO COMPONENT-BASED SOFTWARE ARCHITECTURES

Although current object-oriented analysis and design methods and modeling languages have each a rich set of semantics and syntax to support the modeling of software systems, their support for business modeling has been more limited. In addition, there is no full lifecycle support for the challenges posed by componentbased development and integration (CBDI). The transition and traceability from business models to software component architectures is by no means smooth. This paper explores extensions to current methods to fully support CBDI across the life cycle starting from business modeling and throughout the software development lifecycle. We propose Grammar-oriented Object Design (GOOD) as a method of identifying and mapping reusable subsystems in a business model to a well-mannered component-first software architecture. The latter architecture assumes the modeling and design process is based on an assembly-based paradigm of wiring prebuilt or customized components that have been designed for change and with the intent of repeated long-term reuse and customization.
Species-Dependent Splice Recognition of a Cryptic Exon Resulting from a Recurrent Intronic CEP290 Mutation that Causes Congenital Blindness

A mutation in intron 26 of CEP290 (c.2991+1655A>G) is the most common genetic cause of Leber congenital amaurosis (LCA), a severe type of inherited retinal degeneration. This mutation creates a cryptic splice donor site, resulting in the insertion of an aberrant exon (exon X) into ~50% of all CEP290 transcripts. A humanized mouse model with this mutation did not recapitulate the aberrant CEP290 splicing observed in LCA patients, suggesting differential recognition of cryptic splice sites between species. To further assess this phenomenon, we generated two CEP290 minigene constructs, with and without the intronic mutation, and transfected these in cell lines of various species. RT-PCR analysis revealed that exon X is well recognized by the splicing machinery in human and non-human primate cell lines. Intriguingly, this recognition decreases in cell lines derived from species such as dog and rodents, and it is completely absent in Drosophila. In addition, other cryptic splicing events corresponding to sequences in intron 26 of CEP290 were observed to varying degrees in the different cell lines. Together, these results highlight the complexity of splice site recognition among different species, and show that care is warranted when generating animal models to mimic splice site mutations in vivo.
Multistability and Instability of Neural Networks With Discontinuous Nonmonotonic Piecewise Linear Activation Functions

In this paper, we discuss the coexistence and dynamical behaviors of multiple equilibrium points for recurrent neural networks with a class of discontinuous nonmonotonic piecewise linear activation functions. It is proved that under some conditions, such n-neuron neural networks can have at least 5n equilibrium points, 3n of which are locally stable and the others are unstable, based on the contraction mapping theorem and the theory of strict diagonal dominance matrix. The investigation shows that the neural networks with the discontinuous activation functions introduced in this paper can have both more total equilibrium points and more locally stable equilibrium points than the ones with continuous Mexican-hat-type activation function or discontinuous two-level activation functions. An illustrative example with computer simulations is presented to verify the theoretical analysis.
A multi-resolution 4-D FFT approach to parametric boundary Integral Equations for helical structures

This paper gives a report of an ongoing research to develop parametric boundary integral equations for helical structures and their application in the computation of induced currents and losses in three-phase power cables. The proposed technique is formulated in terms of the Electric Field Integral Equation (EFIE) or the Magnetic Field Integral Equation (MFIE) for a penetrable object together with the appropriate periodic Green's functions and a suitable parameterization of the helical structure. A simple and efficient numerical scheme is proposed for the computation of the impedance matrix in the Method of Moments (MoM) which is based on a multi-resolution 4-D FFT computation followed by polynomial extrapolation. Numerical examples are included demonstrating that the singular integrals have almost linear convergence and hence that linear or quadratic extrapolation can be used to yield accurate results.
BELA, PANAFORIZADA E DO LAR: REFLEXÕES SOBRE UM CASO DE AFORIZAÇÃO

Neste trabalho, analisamos o processo de aforizacao do titulo do perfil “Marcela Temer: bela, recatada e ‘do lar’”, publicado pela Revista Veja Online em 18 de abril de 2016. O periodo, marcado por polarizacoes politicas e sociais e pelo processo de impeachment da Presidente Dilma Rousseff, mostrou-se proficuo para a (con/di)vergencia das memorias instituidas pela triade “bela, recatada e do lar” e, em consequencia, para a discussao do sexismo brasileiro que repercutiu, entre outros, em noticias, criticas e textos humoristicos. Buscamos verificar como o titulo do perfil e construido pelo processo de remissao, constituindo-se em uma aforizacao-eco, como ele e panaforizado e metaforizado. Para a analise, fazemos uso de conceitos de Analise do Discurso, principalmente os propostos por Maingueneau (2010, 2012 e 2014) e Baronas (2013).
Automated Cryptanalysis of Plaintext XORs of Waveform Encoded Speech

Keystream reuse also known as the "two time pad" problem in case of stream ciphered data has been the focus of cryptanalysts for several decades. All heuristics presented so far assume the underlying plaintext to be uncompressed text based data encoded through conventional encoding mechanisms such as ASCII Coding. This paper presents the use of hidden Markov model (HMM) based automatic speech recognition (ASR) approach to cryptanalysis of stream-ciphered waveform-encoded speech in a keystream reuse situation. We present that an adversary can automatically recover the digitized speech signals from their plaintext XORs obtained from two different speech signals stream ciphered with the same keystream. The proposed technique can be practically employed with the existing HMM based probabilistic speech recognition techniques with some modification in the selection of HMMs, their training and the maximum likelihood decoding procedures. Simulation experiments using such modified speech recognition tools have been presented.
A 2-GHz Low Power Differentially Tuned CMOS Monolithic LC-VCO

A 2 GHz differentially tuned CMOS monolithic LC-VCO was designed and fabricated in 0.18-mum CMOS process. The VCO has a 16.15% tuning range (from 1.8998 GHz to 2.2335 GHz) due to a combination of analog and digital tuning technique (4-bit binary switch-capacitor array). The measured phase noise is -118.17 dBc/Hz at 1 MHz offset from 2.158 GHz carrier. With the presented smart switch, the phase noise varies no more than 3 dB at different digital control bits. The phase noise changes only about 2 dB in the tuning range due to the pn-junctions as the varactors. The VCO draws about 2.1 mA current from the 1.8 V power supply and could work in 1.5 V power supply
Computational Model Of Social Intelligence Based On Emotional Learning In The Amygdala

Today, neural systems are being applied as a powerful tool to solve a host of problems. The more computational model of the presented neural system and the neural system of animals look alike, the more powerful the computational model would be. The brain emotional learning algorithm in the Amygdala inspired by Limbic of mammalian brains was put forward originally by Mor ́en. A combination of some Limbic systems as some living creatures will be applied in this paper. The gathering of these living creatures and output summation of each Limbic system in accordance with the relevant applied coefficient will result in social intelligence. The proposed model has been compared with feed-forward back propagation network, Elman back propagation network, and a computational model of emotional learning in the Amygdala to forecast Mackey-Glass Chaotic Time Series. The results of the above mentioned comparison concludes that in forecasting Mackey-Glass Chaotic Time Series, the computational model of social intelligence based on the emotional learning in the Amygdala has shown fewer errors in not only training patterns but also testing patterns.
A fast and secure way to prevent SQL injection attacks

As most of the web applications are associated with database as back end so there are possibilities of SQL injection attacks (SQLIA) on it. Even SQLIA is among top 10 attacks according to Open Web Application Security Project but still approaches are not able to give proper solution to this problem. Number of measures are also discovered to overcome this attack, but which measure is more convenient and can also provide fast access to application without compromising the security is also a major concern. Some existing approaches are good in security but they are not efficient to handle large user's requests. To overcome these two issues at the same moment we have used Bitslice AES encryption to prevent this attack. This implementation uses a non-standard representation, and view the processor as a SIMD computer, i.e. as 64 parallel one-bit processors computing the same instruction.
Reproducibility of Dynamic Contrast-Enhanced MRI in Renal Cell Carcinoma

Abstract The objective of this study was to investigate the intra- and interobserver as well as scan–rescan reproducibility of quantitative parameters of renal cell carcinomas (RCCs) with dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI). A total of 21 patients with clear cell RCCs (17 men, 4 woman; age 37–69 years, mean age 54.6 years, mean size, 5.0 ± 2.2 cm) were prospectively recruited from September 2012 to November 2012. Patients underwent paired DCE-MRI studies on a 3.0 T MR system with an interval of 48 to 72 hours. The extended-Tofts model and population-based arterial input function were used to calculate kinetic parameters. Three observers defined the 2-dimensional whole-tumor region of interest at the slice with the maximum diameter of the RCC. Intraobserver and scan–rescan differences were assessed using paired t tests, whereas interobserver differences using two-way analysis of variance. Intra- and interobserver reproducibility and scan–rescan reproducibility were evaluated using within-subject coefficient of variation (wCoV) and intraclass correlation coefficient (ICC). There were no significant intra-, interobserver, or scan–rescan differences in parameters (all P > 0.05). All ICCs for intra- and interobserver agreements were >0.75 (P < 0.05), whereas the scan–rescan agreement was moderate to good; V e (0.764, 95% confidence interval [CI]: 0.378–0.925) and K ep (0.906, 95% CI: 0.710–0.972) had higher ICC than K trans (0.686; 95% CI: 0.212–0.898) and V p (0.657; 95% CI: 0.164–0.888). In intra- and interobserver variability analyses, all parameters except V p had low wCoV values. K trans and V e had slightly lower intraobserver wCoV (1.2% and 0.9%) compared with K ep (3.7%), whereas all 3 of these parameters had similar interobserver wCoV values (2.5%, 3.1%, and 2.9%, respectively). Regarding scan–rescan variability, K trans and K ep showed slightly higher variation (15.6% and 15.4%) than V e (10.1%). V p had the largest wCoV in all variability analyses (all >30%). DCE-MRI demonstrated good intra- and interobserver reproducibility and moderate to good scan–rescan performance in the assessment of RCC using K trans, K ep, and V e as parameters under noncontinuous scanning mode. V p showed poor reproducibility, and thus may not be suitable for this scanning protocol.
Noninterference through Secure Multi-execution

A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this property (or closely related properties) can be achieved through information flow analysis, using either a static analysis (with a type system or otherwise), or using a dynamic monitoring system. We propose an alternative approach, based on a technique we call secure multi-execution. The main idea is to execute a program multiple times, once for each security level, using special rules for I/O operations. Outputs are only produced in the execution linked to their security level. Inputs are replaced by default inputs except in executions linked to their security level or higher. Input side effects are supported by making higher-security-level executions reuse inputs obtained in lower-security-level threads. We show that this approach is interesting from both a theoretical and practical viewpoint. Theoretically, we prove for a simple deterministic language with I/O operations, that this approach guarantees complete soundness (even for the timing and termination covert channels), as well as good precision (identical I/O for terminating runs of termination-sensitively noninterferent programs). On the practical side, we present an experiment implementing secure multi-execution in the mainstream Spider-monkey Javascript engine, exploiting parallelism on a current multi-core computer. Benchmark results of execution time and memory for the Google Chrome v8 Benchmark suite show that the approach is practical for a mainstream browser setting. Certain programs are even executed faster under secure multi-execution than under the standard execution. We discuss challenges and propose possible solutions for implementing the technique in a real browser, in particular handling the DOM tree and browser callback functions. Finally, we discuss how secure multi-execution can be extended to handle language features like exceptions, concurrency or no determinism.