Miracle-dz/UniFAR-FTUs huggingface dataset:
CDK-dependent phosphorylation of Alp7–Alp14 (TACC–TOG) promotes its nuclear accumulation and spindle microtubule assembly

Alp7–Alp14 (TACC–TOG) is a microtubule-associated protein complex that undergoes nucleocytoplasmic shuttling. Alp7 and Alp14 have the NLS and NES responsible for the shuttling, respectively. At mitotic entry, the cyclin-dependent kinase phosphorylates Alp7, resulting in accumulation of the complex to the nucleus, which promotes spindle assembly.
Damages and injunctions in protecting intellectual property

We investigate how liability rules and property rules protect intellectual property. Infringement might not be deterred under any of the enforcement regimes available. However, counterintuitively, a credible threat of infringement can actually benefit the patentholder. We compare the two doctrines of damages, lost profit (lost royalty) and unjust enrichment, and argue that unjust enrichment protects the patentholder better than lost royalty in the case of proprietary research tools. Both can be superior to a property rule, depending on how much delay is permitted before infringement is enjoined. For other proprietary products (end-user products, cost-reducing innovations), these conclusions can be reversed.
Mutants in the S. cerevisiae PKC1 gene display a cell cycle-specific osmotic stability defect

The PKC1 gene of Saccharomyces cerevisiae encodes a homologue of the Ca(2+)-dependent isozymes of mammalian protein kinase C (Levin, D.cE., F. O. Fields, R. Kunisawa, J. M. Bishop, and J. Thorner. 1990. Cell. 62:213-224). Cells depleted of the PKC1 gene product display a uniform phenotype, a behavior indicating a defect in the cell division cycle (cdc). These cells arrest division after DNA replication, but before mitosis. Unlike most cdc mutants, which continue to grow in the absence of cell division, PKC1-depleted cells arrest growth with small buds. We created conditional alleles of PKC1 to explore the nature of this unusual cdc defect. In contrast to PKC1-depleted cells, all of the conditional pkc1 mutants isolated were suppressed by the addition of CaCl2 to the medium, suggesting that the mutant enzymes could be activated by Ca2+. Arrest of growth and cell division in the conditional mutants was accompanied by cessation of protein synthesis, rapid loss of viability, and release of cellular material into the medium, suggesting cell lysis. This conclusion was supported by the observation that a pkc1 deletion mutant was capable of proliferation in osmotically stabilized medium, but underwent rapid cell lysis when shifted to hypo-osmotic medium. We have incorporated these observations into a model to explain the cdc-specific arrest of pkc1 mutants.
Expresso : A user-friendly GUI for Designing, Training and Exploring Convolutional Neural Networks

With a view to provide a user-friendly interface for designing, training and developing deep learning frameworks, we have developed Expresso, a GUI tool written in Python. Expresso is built atop Caffe, the open-source, prize-winning framework popularly used to develop Convolutional Neural Networks. Expresso provides a convenient wizard-like graphical interface which guides the user through various common scenarios -- data import, construction and training of deep networks, performing various experiments, analyzing and visualizing the results of these experiments. The multi-threaded nature of Expresso enables concurrent execution and notification of events related to the aforementioned scenarios. The GUI sub-components and inter-component interfaces in Expresso have been designed with extensibility in mind. We believe Expresso's flexibility and ease of use will come in handy to researchers, newcomers and seasoned alike, in their explorations related to deep learning.
For TIME AND PROCESS IN NEUROPSYCHOLOGY

Temporal order in perception and memory has been conceived as realized within a mind/brain state or over a succession of states. Serial order might involve a concatenation of states with a blurring of the boundaries between them. However, succession alone cannot map directly to passage, i.e. perceived succession in the world does not give that in the mind, since objects and entities perish on actualization. The perception of temporal order re quires that past, nolonger existent objects recur in memory. However, to attribute serial recall to short-term, working or episodic memory merely re-states the problem without explaining it. A succession of perceptual states may be necessary for serial order but it is not a solution to the consciousness of succession. Moreover, succession is as essential to change as to stability. Object stability occurs when replacements are similar, change when recurrrences are novel. Serial order is required both to see a tree and hear a sonata. For epochal theory, events arise within non-temporal spatial wholes, with the simultaneity within a state replaced by its successor. This article argues that perception develops out of memory through the effects of sensory constraints on a memorial infrastructure. The state lapses to its precursors in the incomplete revival (decay) of perception in a series of replacements. The transition from simultaneity to succession within a state and the layering of the state in the graded revival of past states, i.e. the orderly regress from a prior object to a present image, transposed to a temporal series within the virtual present, is the basis of serial order in memory and perception.
Cloud MapReduce: A MapReduce Implementation on Top of a Cloud Operating System

Like a traditional Operating System (OS), a cloud OS is responsible for managing the low level cloud resources and presenting a high level interface to the application programmers in order to hide the infrastructure details. However, unlike a traditional OS, a cloud OS has to manage these resources at scale. If a cloud OS has already taken on the complexity to make its services scalable, we should be able to greatly simplify a large-scale system design and implementation if we build on top of it. Unfortunately, a cloud's scale comes at a price. For example, Amazon cloud not only relies on horizontal scaling, but it also adopts a weaker consistency model called eventual consistency. We describe Cloud MapReduce (CMR), which implements the MapReduce programming model on top of the Amazon cloud OS. CMR is a demonstration that it is possible to overcome the cloud limitations and simplify system design and implementation by building on top of a cloud OS. We describe how we overcome the limitations presented by horizontal scaling and the weaker consistency guarantee. Our experimental results show that CMR runs faster than Hadoop, another implementation of MapReduce, and that CMR is a practical system. We believe that the techniques we used are general enough that they can be used to build other systems on top of a cloud OS.
Measuring COOP Attack Surface Reduction

Nowadays control-flow hijacking attacks represents the highest software-based security threat [16]. We want to develop a tool that can measure the exact attack surface reduction w.r. t. the attack, Counterfeit Object-Oriented Programming (COOP) [8]. This attack is particularly hard to defend against since traditional Control Flow Integrity (CFI) [1] approaches and hardware based shadow stacks [17] are useless. In this research we want to measure the real attack surface reduction after a COOP mitigation tool [9] was applied to a program binary by rewriting the binary. The goal of this research is first, to determine how much the attack surface was reduced (available gadgets [18] (assembly code chunks)) quantitatively after binary hardening and second, which gadgets are still available for each indirect call site (qualitatively) before and after hardening. First, the tool [9] (code available) used for binary hardening will be modified such that it counts the locations in binary code where the tool inserts the checks. Second, we will use a LLVM pass [20] (code available) to detect all available COOP gadgets in the source of an open source application (the same programs as before) by recompiling those with the new pass in place. Third, the source will be compiled with LLVM and DWARF [19] information such that binary code can be easily mapped to source code lines. This information is useful for the previous step. Four, a series of open source gadget finding tools [13, 15, 14, 18] will be used. These will be tailored such that these can be used to detect the COOP gadgets in a binary file and compare those to the previously found gadgets in steps 2 and 3. Thus, the overall idea of these steps is to map the hardened binary parts to source code in order to measure quantitatively (in percent) and qualitatively (per call site) the attack surface reduction w.r. t. COOP. Finally, for completeness reasons we will test our approach with a series of server applications and web browsers (as in [9]) by measuring the attack surface reduction.
Capacidad de Absorción: Revisión Crítica y Proposición de un Modelo Teórico (Absorptive Capacity: Critical Review and Proposition of a Theoretical Model)

La capacidad de absorcion puede ser definida como aquella capacidad dinamica que permite a las empresas reconocer el valor del nuevo conocimiento externo, asimilarlo y aplicarlo con fines comerciales. Constituye un constructo multidimensional, cuyas dimensiones, de manera general, se suelen identificar con la adquisicion, asimilacion y aplicacion de conocimiento. Sin embargo, existen multitud de ambiguedades conceptuales que dificultan la descripcion del propio proceso de absorcion del conocimiento y las dimensiones que lo conforman. Por este motivo, el presente trabajo realiza una revision de las principales contribuciones acerca de este constructo, asi como de sus diferentes antecedentes y consecuencias. En base a la misma, se desarrollan algunas ideas teoricas y se propone una nueva configuracion para el proceso de absorcion. Este nuevo modelo pone un especial enfasis en la importancia que adquieren la identificacion y comprension del nuevo conocimiento como fase previa a su adquisicion y del papel que esta tiene dentro de dicho proceso de absorcion.English abstractAbsorptive capacity may be defined as a dynamic capability that allows firms to recognise the value of new external knowledge, assimilate and apply it with commercial purposes. It is a multidimensional construct whose dimensions are generally considered as knowledge acquisition, assimilation, transformation and application. Nevertheless, there are a number of ambiguities about the own concept, which make it difficult the depiction of the knowledge absorption process and its dimensions. Therefore, this paper revises the main contributions on this topic and construct, along with its antecedents and consequences. Based on this review, we develop a number of theoretical ideas and we propose a new configuration for knowledge absorptive process. This new model stresses the importance of knowledge identification and understanding process as previous stage for knowledge acquisition and its role in the entire absorptive process.
Radio Structures of Seyfert Galaxies. VIII. A Distance- and Magnitude-Limited Sample of Early-Type Galaxies

The VLA has been used at 3.6 and 20 cm to image a sample of about 50 early-type Seyfert galaxies with recessional velocities less than 7000 km s-1 and total visual magnitude less than 14.5. Emission-line ([O III] and Hα+[N II]) and continuum (green and red) imaging of this sample has been presented in a previous paper. In this paper, we present the radio results, discuss statistical relationships between the radio and other properties, and investigate these relationships within the context of unified models of Seyferts. The mean radio luminosities of early-type Seyfert 1's (i.e., Seyfert 1.0's, 1.2's, and 1.5's) and 2.0's are found to be similar (consistent with the unified scheme), and the radio luminosity is independent of morphological type within this sample. The fraction of resolved radio sources is larger in the Seyfert 2.0's (93%) than in the Seyfert 1's (64%). However, the mean radio extents of Seyfert 2.0's and 1's are not significantly different, although this result is limited by the small number of resolved Seyfert 1's. The nuclear radio structures of Seyfert 2.0's in the early-type sample tend to be aligned with the [O III] and Hα+[N II] structures, even though the radio extents are smaller than the [O III] and Hα+[N II] extents by a factor of ~2 to more than 5. This alignment, previously known for individual Seyferts with "linear" radio sources, is here shown to be characteristic of early-type Seyfert galaxies as a class. Seyfert 2.0's in the early-type sample also show a significant alignment between the emission-line ([O III] and Hα+[N II]) axes and the major axis of the host galaxy. These alignments are consistent with a picture in which the ionized gas represents ambient gas predominantly coplanar with the galaxy stellar disk. This ambient gas is ionized by nuclear radiation that may escape preferentially along and around the radio axis, and is compressed in shocks driven by the radio ejecta. We use this alignment to constrain the product of the velocity of the radio ejecta and the period of any large-angle precession of the inner accretion disk and jet: Vejecta × P ≥ 2 kpc. An investigation of a larger sample of Seyferts reveals the unexpected result that the Seyfert 1's with the largest radio extent (≥1.5 kpc) are all of type Seyfert 1.2. It appears that classification as this type of intermediate Seyfert depends on some factor other than the relative orientation of the nuclear-obscuring torus to the line of sight. Among all the other Seyferts, the distribution of radio extent with Seyfert intermediate type is consistent with the expectations of the unified scheme.
Is spousal caregiving associated with enhanced well-being? New evidence from the panel study of income dynamics.

OBJECTIVES We explore whether spousal caregiving is associated with enhanced well-being for older husbands and wives. METHOD We use time diary data from the 2009 Panel Study of Income Dynamics and Disability and Use of Time supplement. We measure experienced well-being as ratings of happiness and frustration during activities recalled for the previous day. We estimate separately for husbands and wives 3 distinct effects on experienced well-being: having a spouse with a disability; doing household or personal care tasks ("chores") for someone other than a spouse with a disability; and doing such tasks for a spouse with a disability ("care"). RESULTS For husbands, neither care status nor spouse's disability status are associated with experienced well-being. In contrast, for wives, carrying out chores is associated with lower reports of happiness compared with other activities and providing care to one's husband is associated with greater reports of happiness than carrying out chores. DISCUSSION For women, chores such as meal preparation, laundry, and cleaning--but not caregiving per se--are associated with worse experienced well-being than other activities. Findings underscore that there are positive aspects of spousal caregiving for older wives that offset the innately unpleasant nature of household tasks.
Comparative Investigation of BP and RBF Neural Network on Identifying Reliability of Communication Networks

In this paper, BP and RBF models for evaluating the running reliability of communication networks is presented on the basis of artificial neural network. The applicability of the two neural networks are investigated to the reliability of communication networks system. The study shows that the model established by BP network has a good general ability and a slow impending speed, on the other hand, the model established by RBF neural network has a bad general ability and a fast impending speed. The two models can provide well base to reliability of communication networks for analysis and calculation and the optimum of structure. The simulation results highly indicate the usefulness of the method pointed out in this study. The conclusion will provide theoretical guide for practice application.
For Personal Use. Only Reproduce with Permission from the Lancet Publishing Group

Background A sustained virological response (SVR) rate of 41% has been achieved with interferon alfa-2b plus ribavirin therapy of chronic hepatitis C. In this randomised trial, peginterferon alfa-2b plus ribavirin was compared with interferon alfa-2b plus ribavirin.
Portfolio Optimization When Expected Stock Returns are Determined by Exposure to Risk

It is widely recognized that when classical optimal strategies are applied with parameters estimated from data, the resulting portfolio weights are remarkably volatile and unstable over time. The predominant explanation for this is the difficulty of estimating expected returns accurately. In this paper, we modify the $n$ stock Black--Scholes model by introducing a new parametrization of the drift rates. We solve Markowitz' continuous time portfolio problem in this framework. The optimal portfolio weights correspond to keeping $1/n$ of the wealth invested in stocks in each of the $n$ Brownian motions. The strategy is applied out-of-sample to a large data set. The portfolio weights are stable over time and obtain a significantly higher Sharpe ratio than the classical $1/n$ strategy.
Splat-based Ray Tracing of Point Clouds

Point-based surface representations have gained increasing interest in the computer graphics community within the last decade. Surface splatting established as one of the main rendering techniques for point clouds. We present a ray-tracing approach for objects whose surfaces are represented by point clouds. Our approach is based on casting rays and intersecting them with splats. Since ray-tracing methods require smoothly changing surface normals for producing the desired photorealistic results, splat generation must include the derivation of such normals. We determine a neighborhood around each point of the point cloud, estimate the surface normal at each of the points, compute splats with varying radii that cover the surface, and use the normals of all points that are covered by each splat to generate a smoothly varying normal field for each splat. This part of the computation is view-independent and, thus, can be precomputed. During the rendering step, ray-splat intersections are performed, where the normal at the intersection point is interpolated using local coordinates of the splat’s normal field. Care has to be taken where splats overlap. We speed up the computations of the ray-splat intersections using an octree data structure.
Magnetic Resonant Image segmentation using trained K-means clustering

Magnetic Resonant Image segmentation is an indispensable process in the visualization of human tissues, particularly during clinical analysis. In this paper, we describe a method for segmentation of White matter and Gray matter from real MR images using a LM-k-means technique. After preprocessing, a simple unsupervised clustering system like k-means is taken and made into a supervised system by using Levenberg-Marquardt optimization technique. It was inferred that a k-means system does not arrive on its own at the means which will give a good segmentation. Hence the LM algorithm trains it for that purpose. The results are compared with that of a k-means system and they show a considerable improvement with a much higher precision.
ar X iv : g r-qc / 0 30 21 01 v 2 1 5 A pr 2 00 3 Conserved superenergy currents

We exploit once again the analogy between the energy-momentum tensor and the socalled “superenergy” tensors in order to build conserved currents in the presence of Killing vectors. First of all, we derive the divergence-free property of the gravitational superenergy currents under very general circumstances, even if the superenergy tensor is not divergencefree itself. The associated conserved quantities are explicitly computed for the ReissnerNordström and Schwarzschild solutions. The remaining cases, when the above currents are not conserved, lead to the possibility of an interchange of some superenergy quantities between the gravitational and other physical fields in such a manner that the total, mixed, current may be conserved. Actually, this possibility has been recently proved to hold for the Einstein-Klein-Gordon system of field equations. By using an adequate family of known exact solutions, we present explicit and completely non-obvious examples of such mixed conserved currents.
Behavior control for single and multiple autonomous agents based on hierarchical finite state machines

Complex behaviors for cooperative multi-agent applications pose a challenging task in highly dynamic environments as they are encountered in many real-world applications. Efficient methods are required for programming agent behaviors that are able to cope with necessary real-time requirements, only partial or noisy observability of the environment, and the unpredictability of dynamic environments. The goal of this work is to develop a behavior control architecture for autonomous agents in order to create complex robotic application in a comfortable and time efficient manner. Methodological extensions to an architecture based on hierachical finite state machines are presented. This results in the extended version of the behavior description architecture and language XABSL (Extensible Agent Behavior Specification Language).
DNA vaccination against oncoantigens

The emerging evidence that DNA vaccines elicit a protective immune response in rodents, dogs and cancer patients, coupled with the US Food and Drug Administration (FDA) approval of an initial DNA vaccine to treat canine tumors is beginning to close the gap between the optimistic experimental data and their difficult application in a clinical setting. Here we review a series of conceptual and biotechnological advances that are working together to make DNA vaccines targeting molecules that play important roles during cancer progression (oncoantigens) a promise with near-term clinical impact.
Expansions of pseudofinite structures and circuit and proof complexity

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a suitable expansion would imply that, assuming a one-way permutation exists, the computational class NP is not closed under complementation.
Constructing morpheme-based translation model for Mongolian-Chinese SMT

The data sparsity and the morphological difference between Chinese and Mongolian are the main problems in Mongolian-Chinese statistical machine translation (SMT). In this paper, we propose a novel method to construct morpheme-based translation model by using Mongolian morpheme as the pivot language. First, we train Mongolian-Morpheme SMT and Morpheme-Chinese SMT system, achieving a balance in the morphology of the language pair. Then we construct a new phrase table via these two systems to enrich translation knowledge without any additional bilingual resources, which is suitable for low-resource language pairs. Finally we incorporate this phrase table to our Mongolian-Chinese SMT system in two ways: by using multiple decoding paths and by the combination of two phrase tables. Experimental results demonstrate the effectiveness of our method with a maximum improvement of 1.37 BLEU points increment over baseline.