Miracle-dz/UniFAR-FTUs huggingface dataset:
Cells to Produce IL-12 T Lymphocytes Potentiate Murine Dendritic

Serge M. Candeias and Patrice N. MarcheAlexandra Rizzitelli, Rolande Berthier, Veronique Collin,http://www.jimmunol.org/content/169/8/4237J Immunol€2002; 169:4237-4245; ;Referenceshttp://www.jimmunol.org/content/169/8/4237.full#ref-list-1This article cites 38 articles, 23 of which you can access for free at: Subscriptionshttp://jimmunol.org/subscriptionsInformation about subscribing to The Journal of Immunology is online at: Permissionshttp://www.aai. org/ji/copyright.htmlSubmit copyright permission requests at: Email Alertshttp://jimmunol.org/cgi/alerts/etocReceive free email-alerts when new articles cite this article. Sign up at:
Discovering Flood Recession Pattern in Hydrological Time Series Data Mining during the Post Monsoon Period

his paper examines the flood recession pattern for the river discharge data in the river Brahmaputra basin. The months from October to December comes under the post monsoon season. In this paper, with the help of time series data mining techniques, the analysis has made for hydrological daily discharge time series data, measured at the Panchratna station during the post monsoon in the river Brahmaputra under Brahmaputra and Barak Basin Organization after the high flood. Statistical analysis has made for standardization of data. K-means clustering, Dynamic Time Warping(DTW), Agglomerative Hierarchical Clustering(AHC) and Ward's criterion are used to cluster and discover the discharge patterns in terms of the autoregressive model. A forecast model has been developed for the discharge process. For validation of the recession pattern, Gauge-Discharge Curve, Water Label Hydrographs, Rainfall Bar Graphs have been developed and also discharge recession coefficient has been calculated. This study gives the behavioral characteristics of rivers discharge during recession of high floods with the time series data mining.
Special Target Recognition and Location Using Differential Image Detection Technology

It is well known that the special objectives such as military cave storage is hard to be recognized and located by routine method because of camouflage technology. This paper presents a new algorithm basing on differential image detection and edge detection technology. Firstly, extracting some target images at different period while in the same position. Then using preprocessing technology to define the object region for analyzed. The third, adopting differential detection algorithm for image comparison, filtering the noise which may influence detection results by setting proper gray threshold. After excluding the interference factors such as working environment, phenophase, experimental instrument, light condition and so on, we can determine the shape feature of target’s boundary. Experimental results demonstrate that this algorithm can realize fast processing, high accuracy recognition, insensitive to the noise and is effective for increasing the capability of special target recognition and location such as military cave storage.
ActivitySpace: A Remembrance Framework to Support Interapplication Information Needs

Developers' daily work produces, transforms, and communicates cross-cutting information across applications, including IDEs, emails, Q&A sites, Twitter, and many others. However, these applications function independently of one another. Even though each application has their own effective information management mechanisms, cross-cutting information across separate applications creates a problem of information fragmentation, forcing developers to manually track, correlate, and re-find cross-cutting information across applications. In this paper, we present ActivitySpace, a remembrance framework that unobtrusively tracks and analyze a developer's daily work in separate applications, and provides various semantic and episodic UIs that help developers correlate and re-find cross-cutting information across applications based on information content, time and place of his/her activities. Through a user study of 8 participants, we demonstrate how ActivitySpace helps to tackle information fragmentation problem in developers' daily work.
Client-controlled slow TCP and denial of service

Denial of service attacks are becoming an increasing threat to our information infrastructure. By exploiting vulnerability in existing protocols and infrastructures, malicious attackers consume resources in networks and servers to block or degrade the service to legitimate users. TCP is the dominant network transport protocol. It relies on the participating hosts' cooperation to make data transmission successful. This kind of trust has been exploited in some DoS attacks, such as SYN-flooding attack. In this paper, we investigate how a TCP client can extend the duration of its connection with a server only by setting the pace of sending back acknowledgement packets. Our study shows that the duration of a TCP connection could be extended tens of times without incurring timeout retransmission. This mechanism can potentially be used by attackers to launch DoS attacks by generating simultaneous prolonged TCP connections with the victim servers. Unlike SYN-flooding attacks, the low rate property of slow TCP connections makes the detection of this kind of attack difficult, which calls for a further study on this issue.
A shooting algorithm for problems with singular arcs

In this article we propose a shooting algorithm for a class of optimal control problems for which all control variables appear linearly. The shooting system has, in the general case, more equations than unknowns and the Gauss-Newton method is used to compute a zero of the shooting function. This shooting algorithm is locally quadratically convergent if the derivative of the shooting function is one-to-one at the solution. The main result of this paper is to show that the latter holds whenever a sufficient condition for weak optimality is satisfied. We note that this condition is very close to a second order necessary condition. For the case when the shooting system can be reduced to one having the same number of unknowns and equations (square system) we prove that the mentioned sufficient condition guarantees the stability of the optimal solution under small perturbations and the invertibility of the Jacobian matrix of the shooting function associated to the perturbed problem. We present numerical tests that validate our method. Key-words: optimal control, Pontryagin Maximum Principle, singular control, constrained control, shooting algorithm, second order optimality condition, stability This work is supported by the European Union under the 7th Framework Programme FP7-PEOPLE-2010-ITN Grant agreement number 264735-SADCO ∗ CIFASIS-CONICET Argentina (aronna@cmap.polytechnique.fr) † INRIA-Saclay and CMAP, École Polytechnique, 91128 Palaiseau, France (Frederic.Bonnans@inria.fr) (Pierre.Martinon@inria.fr) in ria -0 06 31 33 2, v er si on 2 5 Ju n 20 12 Un algorithme de tir pour les problèmes de commande optimale avec des arcs singuliers Résumé : Dans ce travail on présente une condition suffisante pour que l’algorithme de tir soit localement convergent quand il est appliqué aux problèmes de commande optimale affines dans les commandes. On commence par étudier le cas avec des contraintes initiales-finales sur l’état et commande libre, et en suite on ajoute des contraintes sur la commande. L’algorithme de tir est localement quadratiquement convergent si la dérivée de la fonction de tir associée est injective dans la solution optimale. Le résultat principal de cet article montre une condition suffisante pour cette injectivité, qui est très proche de la condition nécessaire du second ordre. On montre que cette condition suffisante assure la stabilité de la solution optimale aux petites perturbations et qu’elle garantit aussi que l’algorithme de tir est convergent pour le problème perturbé. On présente des essais numériques qui valident notre méthode. Mots-clés : commande optimale, Principe de Pontryaguine, commande singulière, contraintes sur la commande, algorithme de tir, conditions d’optimalité du second ordre, stabilité in ria -0 06 31 33 2, v er si on 2 5 Ju n 20 12 A shooting algorithm for problems with singular arcs 3
A Resonance Approach to Cochlear Mechanics

Background How does the cochlea analyse sound into its component frequencies? In the 1850s Helmholtz thought it occurred by resonance, whereas a century later Békésy's work indicated a travelling wave. The latter answer seemed to settle the question, but with the discovery in 1978 that the cochlea emits sound, the mechanics of the cochlea was back on the drawing board. Recent studies have raised questions about whether the travelling wave, as currently understood, is adequate to explain observations. Approach Applying basic resonance principles, this paper revisits the question. A graded bank of harmonic oscillators with cochlear-like frequencies and quality factors is simultaneously excited, and it is found that resonance gives rise to similar frequency responses, group delays, and travelling wave velocities as observed by experiment. The overall effect of the group delay gradient is to produce a decelerating wave of peak displacement moving from base to apex at characteristic travelling wave speeds. The extensive literature on chains of coupled oscillators is considered, and the occurrence of travelling waves, pseudowaves, phase plateaus, and forced resonance in such systems is noted. Conclusion and significance This alternative approach to cochlear mechanics shows that a travelling wave can simply arise as an apparently moving amplitude peak which passes along a bank of resonators without carrying energy. This highlights the possible role of the fast pressure wave and indicates how phase delays and group delays of a set of driven harmonic oscillators can generate an apparent travelling wave. It is possible to view the cochlea as a chain of globally forced coupled oscillators, and this model incorporates fundamental aspects of both the resonance and travelling wave theories.
Model Driven Security Model Driven Security

We present Model Driven Security, a new approach to building secure systems. In Model Driven Security, designers specify high-level system models along with their security properties and use tools to automatically generate technology-specific system architectures from the models, including complete, configured security infrastructures. Initial experience with this approach using support tools suggests that Model Driven Security both simplifies the system development process and substantially improves the quality and maintainability of the resulting systems. Model Driven Security Security is an integral part of most modern IT systems and designing such systems requires properly identifying, integrating, and configuring different security technologies. Examples include access control for preventing unauthorized access to system resources, encryption to ensure the confidentiality of data during network transmissions, and digital signatures for electronic contract signing. Although a large number of security architectures and technologies are available, we hear daily accounts of security vulnerabilities and failures. Why is it so difficult to engineer robust, secure systems? A glance at the system development processes typically used suggests one reason: security is often managed in an ad-hoc fashion where requirements are analyzed and mechanisms are implemented shortly before, or even during, the system installation and deployment phase. Concerns are often separated and handled separately by software engineers and security specialists. This has technological reasons as well as cultural ones. In particular, there is a lack of methods and tools for tightly integrating security into the development process. The results are systems where security is often dealt with as an afterthought and where security mechanisms are poorly integrated into the system. The need to overcome this deficiency has been noted before, e.g. in [3]. We propose Model Driven Security as an approach to overcoming this deficiency. Model Driven Security provides methods and tools to tightly integrate security into the development process. The key idea is to use high-level, visual models that integrate system design and security design and to use generative techniques to automate the construction of systems from these designs. We have based Model Driven Security upon Model Driven Architecture, which is an emerging standard for model-centric and generative software development and is defined by the Object Management Group [4, 8]. Model Driven Architecture provides standards like the Meta-Object Facility [7] for defining modeling languages and the Unified Modeling Language (UML) [6] as
QTL Mapping of Domestication-related Traits in Soybean (Glycine max)

Background and Aims Understanding the genetic basis underlying domestication-related traits (DRTs) is important in order to use wild germplasm efficiently for improving yield, stress tolerance and quality of crops. This study was conducted to characterize the genetic basis of DRTs in soybean (Glycine max) using quantitative trait locus (QTL) mapping. Methods A population of 96 recombinant inbred lines derived from a cultivated (ssp. max) × wild (ssp. soja) cross was used for mapping and QTL analysis. Nine DRTs were examined in 2004 and 2005. A linkage map was constructed with 282 markers by the Kosambi function, and the QTL was detected by composite interval mapping. Key Results The early flowering and determinate habit derived from the max parent were each controlled by one major QTL, corresponding to the major genes for maturity (e1) and determinate habit (dt1), respectively. There were only one or two significant QTLs for twinning habit, pod dehiscence, seed weight and hard seededness, which each accounted for approx. 20–50 % of the total variance. A comparison with the QTLs detected previously indicated that in pod dehiscence and hard seededness, at least one major QTL was common across different crosses, whereas no such consistent QTL existed for seed weight. Conclusions Most of the DRTs in soybeans were conditioned by one or two major QTLs and a number of genotype-dependent minor QTLs. The common major QTLs identified in pod dehiscence and hard seededness may have been key loci in the domestication of soybean. The evolutionary changes toward larger seed may have occurred through the accumulation of minor changes at many QTLs. Since the major QTLs for DRTs were scattered across only six of the 20 linkage groups, and since the QTLs were not clustered, introgression of useful genes from wild to cultivated soybeans can be carried out without large obstacles.
Research on Ordinal Properties in Combinatorics Coding Method

Combinatorics coding is a new data coding method based on combinatorics. Ordinal computing is the core technology of in the combinatorics coding. Ordinal properties of combinatorics coding is studied in this paper. Firstly, the combinatorics coding theory and the correlative basic concepts are described. Then, the properties of the ordinal are revealed. The study indicates that the value of ordinal have a close relationship with the selection of benchmark sequence. The size of ordinal is correlative with the distributing of character frequency in the sequence.The length of the sequence should be longer than the length of the ordinal and this conclude is proved by the theory. Moreover, the difference of the initial sequence length and the whole max ordinal length is increased along with the increase of the initial sequence length pvoved by the experiment and theory. The research on ordinal properties is of great significance to the development of the combinatorics coding technology.
Decrease in resting calcium and calcium entry associated with slow‐to‐fast transition in unloaded rat soleus muscle

Using fura‐2 and the manganese quenching technique, we show here that sarcolemmal permeability to cations (SP‐Ca) of slow‐twitch muscles is greater than that of fast‐twitch ones. This appears to be related to a higher expression and/or activity of stretch‐activated channels, whereas leak channel activities are similar. During hindlimb suspension (HU), we found highly correlated decreases in SPCa and resting calcium of soleus muscle toward values of extensor digitorum longus (EDL) muscle. This was significant as soon as 3 days of suspension, contrary to soleus muscle caffeine sensitivity and responsiveness that were not modified after this HU period. After 14 days of HU, SP‐Ca, resting calcium, and caffeine response of soleus muscle became similar to that normally observed in EDL muscle. These results demonstrate that the correlated decreases in SP‐Ca and resting calcium precede most functional changes due to HU. Given the known shortening of HU soleus muscle, we proposed that this could induce a decrease of SP‐Ca and a consequent reduction of resting calcium. According to the crucial role of resting cytosolic free calcium in the maintenance and the adaptation of muscle phenotype, our results suggest that slow‐to‐fast transition of HU soleus muscle is calcium dependent.
Examination of optimizing information flow in networks “ The Dynamics of a model of a computer protocol ” problem presented

The central role of the Internet and the World-Wide-Web in global communications has refocused much attention on problems involving optimizing information flow through networks. The most basic formulation of the question is called the “max flow” optimization problem: given a set of channels with prescribed capacities that connect a set of nodes in a network, how should the materials or information be distributed among the various routes to maximize the total flow rate from the source to the destination [7]. This model applies to contexts from computer and telephone networks to shipping and distribution of commercial goods to electrical power and water supply systems. Theory in linear programming has been well developed to solve the classic max flow problem. Modern contexts have demanded the examination of more complicated variations of the max flow problem to take new factors or constraints into consideration; these changes lead to more difficult problems where linear programming is insufficient. In the workshop we examined models for information flow on networks that considered trade-offs between the overall network utility (or flow rate) and path diversity to ensure balanced usage of all parts of the network (and to ensure stability and robustness against local disruptions in parts of the network) [1]. While the linear programming solution of the basic max flow problem cannot handle the current problem, the approaches primal/dual formulation for describing the constrained optimization problem [7] can be applied to the current generation of problems, called network utility maximization (NUM) problems. In particular, primal/dual formulations have been used extensively in studies of such networks, see for example [1, 3–5,8]. In extending the optimization problem, modeling, theoretical consideration and interpretation must be given to the network properties being optimized. In [1], “path diversity” is described as an important consideration to maintain network robustness and to avoid some instabilities due to “route flapping” in path allocations; an “entropy” parameter is used to weight the importance of this factor. Other articles have also introduced concepts of “fairness” in allocating network resources [2, 9, 10]. Game theory and economic interpretations of network optimization also lead to important insights [2, 8]. A key feature of the traffic-routing model we are considering is its formulation as an economic system, governed by principles of supply and demand. Since we are generally dealing with channels of unequal capacity, a consumer-centered intuition might suggest that the higher-capacity channels would command the
Watta Satta: Bride Exchange and Women's Welfare in Rural Pakistan

In a setting where husbands wield considerable coercive power, forms of marriage should adapt to protect the interests of women and their families. The authors study the pervasive marriage custom of watta satta in rural Pakistan, a bride exchange between families coupled with a mutual threat of retaliation. They show that watta satta may be a mechanism to coordinate the actions of two sets of in-laws, each of whom wish to restrain their sons-in-law but who only have the ability to restrain their sons. The authors' empirical results support this view. The likelihood of marital inefficiency, as measured by estrangement, domestic abuse, and wife's mental health, is significantly lower in watta satta arrangements as compared with conventional marriages, but only after properly accounting for selection.
Insulin Signaling and the Regulation of Glucose Transport

Gaps remain in our understanding of the precise molecular mechanisms by which insulin regulates glucose uptake in fat and muscle cells. Recent evidence suggests that insulin action involves multiple pathways, each compartmentalized in discrete domains. Upon activation, the receptor catalyzes the tyrosine phosphorylation of a number of substrates. One family of these, the insulin receptor substrate (IRS) proteins, initiates activation of the phosphatidylinositol 3-kinase pathway, resulting in stimulation of protein kinases such as Akt and atypical protein kinase C. The receptor also phosphorylates the adapter protein APS, resulting in the activation of the G protein TC10, which resides in lipid rafts. TC10 can influence a number of cellular processes, including changes in the actin cytoskeleton, recruitment of effectors such as the adapter protein CIP4, and assembly of the exocyst complex. These pathways converge to control the recycling of the facilitative glucose transporter Glut4.
Energy-based routing metric for RPL

Saving power while ensuring acceptable service levels is a major concern in wireless sensor networks, since nodes are usually deployed and not replaced in case of breakdown. Several efforts have recently led to the standardization of a routing protocol for low power and lossy network. The standard provides various metrics, which can be used to guide the routing. Most protocol implementations use expected transmission count as the routing metric, thus focus on the link reliability. To our knowledge, there is no protocol implementation that uses the nodes remaining energy for next hop selection. This document discusses about the usage of the latter as the routing metric for RPL, the new standard for routing for Low power and Lossy Network (LLN). We design an objective function for that metric and compared experiments result with the most popular expected transmission count scheme.
Visual Object Tracking Based on Cross-Modality Gaussian-Bernoulli Deep Boltzmann Machines with RGB-D Sensors

Visual object tracking technology is one of the key issues in computer vision. In this paper, we propose a visual object tracking algorithm based on cross-modality featuredeep learning using Gaussian-Bernoulli deep Boltzmann machines (DBM) with RGB-D sensors. First, a cross-modality featurelearning network based on aGaussian-Bernoulli DBM is constructed, which can extract cross-modality features of the samples in RGB-D video data. Second, the cross-modality features of the samples are input into the logistic regression classifier, andthe observation likelihood model is established according to the confidence score of the classifier. Finally, the object tracking results over RGB-D data are obtained using aBayesian maximum a posteriori (MAP) probability estimation algorithm. The experimental results show that the proposed method has strong robustness to abnormal changes (e.g., occlusion, rotation, illumination change, etc.). The algorithm can steadily track multiple targets and has higher accuracy.