Miracle-dz/UniFAR-FTUs huggingface dataset:
Effect of Temperature Cycling and Exposure to Extreme Temperatures on Reliability of Solid Tantalum Capacitors

In this work, results of multiple temperature cycling (TC) (up to 1,000 cycles) of different types of solid tantalum capacitors are analyzed and reported. Deformation of chip tantalum during temperature variations simulating reflow soldering conditions was measured to evaluate the possibility of the pop-corning effect in the parts. To simulate the effect of short-time exposures to solder reflow temperatures on the reliability of tantalum capacitors, several part types were subjected to multiple cycles (up to 100) between room temperature and 240 C with periodical measurements of electrical characteristics of the parts. Mechanisms of degradation caused by temperature cycling and exposure to high temperatures, and the requirements of MIL-PRF-55365 for assessment of the resistance of the parts to soldering heat are discussed.
Melanoma recurrence after adjuvant targeted therapy: A multicenter analysis.

10016 Background: Adjuvant targeted therapy (TT) improves relapse free survival (RFS) in patients (pts) with BRAF mutant stage 3 melanoma. The outcomes and optimal management of pts who relapse after adjuvant TT is unknown. Methods: Pts from 21 centres with recurrent melanoma after adjuvant TT were included. Disease characteristics, adjuvant therapy, recurrence, treatment at relapse and outcomes were examined. Results: 87 pts developed recurrent melanoma; 21 (24%) during and 66 (76%) after cessation of adjuvant TT. Median time to 1st recurrence was 16.3 months with median follow up after 1st recurrence of 31 months. 30 (34%) pts recurred locoregionally, 51 (59%) pts developed distant recurrence and 6 (7%) pts had both. Of those who recurred locoregionally, 23/30 (77%) pts underwent surgery to no evidence of disease, only 3 (13%) of which received adjuvant anti-PD1 therapy, and 15/30 (50%) subsequently developed distant disease. 29 (33.3%) pts have died. 75 (86%) pts received systemic therapy at either 1st or subsequent recurrence. 40 (46%) pts received 1st line anti-PD1 based therapy (single agent anti-PD1, anti-PD1 with ipilimumab or anti-PD1 with investigational agent), 12 (14%) pts received ipilimumab monotherapy, 18 (21%) pts received retreatment with combination BRAF/MEK inhibitors and 5 (6%) pts received other agents (chemotherapy, TVEC). 57 (66%) pts had disease that was assessable for response rate (RR). RR after relapse was 69.7% (23/33) to 1st line anti-PD-1 based therapy, 46% (6/13) to TT and 9% (1/11) to ipilimumab monotherapy (Table). Median overall survival (OS) from date of 1st recurrence for all pts was not reached. OS varied by drug class received as 1st line systemic therapy after relapse. 3 year OS was 79% for anti-PD-1 based therapy, 55% for TT and 25% for ipilimumab. Conclusions: This study demonstrates that pts who relapse after adjuvant TT may respond to subsequent immunotherapy at similar rates to the treatment naïve setting. [Table: see text]
Secure Data Transmission with BLAKE 2 Algorithm in E-Health care System

The body sensor sort out (BSN) development is a champion among the most fundamental headways used as a piece of IoT-based present day human administrations system. In this Procedure, at first we address the few security requirements in BSN based present day human administrations system. By then, we propose a safe IoT based social protection structure using BSN, called BSN-Care, which can guarantee to successfully complete those requirements.BSN configuration made out of wearable and implantable sensors. Each sensor center is composed with bio-sensors, for instance, Electrocardiogram (ECG)Electromyography (EMG), Electroencephalography (EEG), Circulatory strain (BP), et cetera. These sensors accumulate the physiological parameters and forward them to a facilitator called Nearby Handling Unit (LPU). The LPU goes about as a switch between the BSN center points and the central server called BSN-Care server, using the remote correspondence mediums, for instance, compact frameworks 3G/CDMA/GPRS. In addition, when the LPU perceives any varieties from the standard then it gives provoke alert to the person that wearing the bio-sensors. In this wander, we delineate the key security necessities in IoT based social protection system using BSN.
Stephania glabra ( Menispermaceae )-Phytochemical Perspective

BackgroundStephania glabra (Roxb) has long been used for the treatment of asthma with several other valuable uses. Over 150 alkaloids together with Flavonoids lignans, steroids, Terpenoids and coumarins have been identified in genus stephania. About 30 types of alkaloids are alone identified in S. glabra out of that Gindarudine and tetrahydropalmitine being the major one. Several other chemical constituents from the plant has been evaluated by using different chromatographic and Spectroscopical methods. Method-In the present study the ethanolic extract from the leaves of Stephania glabra was extracted by soxhlet apparatus. So obtained extract was redissolved in ethanol and evaluated for UV for 1, 0.1 and 0.01 % of after redissolving in ethanol also the FTIR spectroscopy was checked. Result-The UV Wavelength for 1%,0.1% and 0.01% dilutions was recorded between 92.15 and 92. 2 which was considered as 92. Gindarudine was its structural moiety with atropine the constituent used for the treatment of asthma. Again, the ftir data confirms the presence of Gindarudine and Tetrahydropalmitine after interpretion. Conclusion-From the whole study it is concluded that S. glabra can be used to formulate novel drug for the treatment of analgesia, inflammation and arthritis. Key WordsStephania glabra,, UV, FTIR, Gindarudine, Tetrahydropalmitine, Novel drug, Analgesia, Arthritis. -------------------------------------------------------------------------------------------------------------------------------------Date of Submission: 26-11-2018 Date of acceptance: 07-12-2018 -------------------------------------------------------------------------------------------------------------------------------------
Tactile Acuity and Pain Intensity on Chronic Low Back Pain Subjects : An Observational Study

DOI: 10.21276/sjams.2018. 6.9. 84 Abstract: Tactile acuity refers to the precision with which we can sense touch, 1 and this precision is thought to be impaired in some chronic pain conditions 2 . Recent neuroscientific researches have suggested that chronic pain is accompanied by cortical reorganization and may serve an important function in the persistence of the pain experience. Discriminative ability is dependent on the integrity of primary somatosensory cortex; hence, in some chronically painful conditions, cortical reorganization appears to manifest as reduced tactile acuity at the affected body region. This cortical reorganization influences the cognitive and behavioural changes to the chronic pain sufferers. Two point discrimination is one of the measures to find out the cortical tactile acuity in the human body. The aim of this study to find out the deficits in tactile acuity related to pain intensity. To find out the relationship between the tactile acuity and the pain intensity on chronic low back pain patients. This is a crosssectional investigation on the non-neuropathic chronic low back pain patients. SPSS Version 16 will be used for data analysis. A Spearman‟s correlation coefficient (rS) was calculated to estimate the overall relationship between tactile acuity and the pain intensity. The significance value for spearman‟s correlations of pain intensity with two point discrimination positively correlated (rs = 0.550 and p < 0.001). In summary, the main findings described in this study suggested that decreased tactile acuity coincided with the pain intensity with chronic non-neuropathic back pain subjects.
Unification with extended

An extension of Miller’s algorithm for &unification of typed L-terms is presented. The extension considered is the addition of products and polymorphism to &unification; the new unification problem is termed /&n-unification. Miller’s pattern restriction is generalized by allowing repeated occurrences of variables to appear as arguments to free function variables, provided such variables are prefixed by distinct sequences of projections. This extended pattern restriction has several applications, including the definition of higher-order explicit substitutions. The algorithm is verified to terminate, and is shown to be sound and complete. @ 1998 Published by Elsevier Science B.V. All rights reserved
Explaining Changes in the Distribution of Annual Dairy Farm Income over Time

This paper identifies factors affecting the distribution of farm income among dairy producers over time. Using data from participants in Cornell's Dairy Farm Record Program, we decompose differences of farm income distributions into those due to: differences in means of observable farm characteristics, differential marginal effects of characteristics and unobserved random error. The distribution of farm income is affected by factors reflecting the operators' experience and investment in human capital and indicators of management efficiency and level of capital investment. The marked changes in marginal contributions of these factors explain most of the total change in the distribution of income.
Scenario Aggregation and Analysis via Mean-Shift Methodology

A new generation of dynamic methodologies is being developed for nuclear reactor probabilistic risk assessment (PRA) which explicitly account for the time element in modeling the probabilistic system evolution and use numerical simulation tools to account for possible dependencies between failure events. The dynamic event tree (DET) approach is one of these methodologies. One challenge with dynamic PRA methodologies is the large amount of data they produce which may be difficult to analyze without appropriate software tools. The concept of “data mining” is well known in the computer science community and several methodologies have been developed in order to extract useful information from a dataset with a large number of records. Using the dataset generated by the DET analysis of the reactor vessel auxiliary cooling system (RVACS) of an ABR-1000 for an aircraft crash recovery scenario and the Mean-Shift Methodology for data mining, it is shown how clusters of transients with common characteristics can be identified and classified.
Association of Polymorphisms in the DNA Repair Genes XRCC1 and XRCC3 with Systemic Lupus Erythematosus

Evidence suggests that DNA damage is implicated in the development of Systemic Lupus Erythematosus (SLE). Investigate the possible association of polymorphisms in the DNA repair genes XRCC1 and XRCC3 with SLE and its clinical and laboratory features. This is a case-control study comparing the polymorphisms in the DNA repair genes XRCC1 and XRCC3 in SLE patients and control individuals. Genotyping for DNA repair genes was performed by polymerase chain reaction-restriction fragment length polymorphism in 76 patients and 82 healthy control individuals. Our data indicated that the genotype frequencies in patients with the XRCC1 Arg399Gln and XRCC3 Thr241Met polymorphisms were similar to those observed in the control group (p > 0.05). However, the frequencies of the 399Gln allele (p = 0.023, OR = 0.58, 95% CI = 0.36–0.93) and 241Met allele (p = 0.0039, OR = 0.59, 95% CI = 0.36–0.98) were significantly lower in the patients than those in the control subjects. We demonstrated that 399Gln and 241Met alleles may play a protective role in SLE susceptibility.
Feature Extraction of Real-Time Image Using SIFT Algorithm

This paper deals with image processing and feature extraction. Feature extraction plays a vital role in the field of image processing. There exist different image pre-processing approaches for feature extraction such as binarization, thresholding, resizing, normalisation so on.Then after these techniques are applied to obtain high clarity images. In Feature extraction object recognition and stereo matching are at the base of many computer vision problems. The descriptor generator module is changed for increasing the performance of algorithm. SIFT algorithm consist of two modules such as key point detection module and descriptor generation module. When compared to recent solution, the descriptor generation module speed is fifteen times faster and the time for feature extraction is also reduced.
Therapeutic properties of extracts of leucas aspera and anisomeles malabarica

Leaves of two plant extracts from Leucas aspera and Anisomeles malabarica are studied for their therapeutic activity. These plants have been evaluated for antibacterial property against Bacillus cereus and Pseudomonas aeruginosa. The plant extracts showed low antibacterial effects on the selected microbes. However, the methanol leaf extracts showed significant antibacterial activity. The determination of anticancer activity showed that the plants are poor in substances with appreciable therapeutic potential.
Explorer Exploiting Action Categories in Learning Complex Games

This paper presents a model for planning in a highly complex game, where certain action types are more common than others and cyclic behaviour can also easily arise. These issues are addressed by exploiting the inherent structure among the possible options to enhance the online learning algorithm: sampling during Monte Carlo Tree Search becomes a two step process, by first sampling from a distribution over the types of legal actions followed by sampling from individual actions of the chosen type. This policy drastically reduces the breadth of the rollout as well as its depth by avoiding redundant sampling behaviour. The result is a large increase in both the performance and efficiency of the model. Another contribution of this paper is assessing the benefits of a parallel implementation and afterstates in complex games. Evaluation is done via agent simulations in the board game Settlers of Catan. The resulting agent is the first based on purely online learning strategies that can handle the full set of legal actions of the game. The evaluation shows that our model outperforms previous state-of-the-art agents while taking decisions in a time threshold tolerated by human opponents. Keywords—model-based reinforcement learning; Monte Carlo Tree Search; complex games; hierarchical sampling; online learning; Settlers of Catan;
Commutative and noncommutarive stochastic calculus : theory and applications

My PhD work is composed of two parts, the first part is dedicated to the discrete-time stochastic analysis for obtuse random walks as to the second part, it is linked to free probability. In the first part, we present a construction of the stochastic integral of predictable square-integrable processes and the associated multiple stochastic integrals ofsymmetric functions on Nn (n_1), with respect to a normal martingale. [. ] In a second step, we revisited thedescription of the marginal distribution of the Brownian motion on the large-size complex linear group. Precisely, let (Z(d)t )t_0 be a Brownian motion on GL(d,C) and consider nt the limit as d ! ¥ of the distribution of (Z(d)t/d)⋆Z(d)t/d with respect to E×tr.
Incomplete Judgments Metrics Non-Relevant Condense Infer Relevance Residual Score Adjustment System Bias Limited Pooling Budget

Batched evaluations in IR experiments are commonly built using relevance judgments formed over a sampled pool of documents. However, judgment coverage tends to be incomplete relative to the metrics being used to compute effectiveness, since collection size often makes it financially impractical to judge every document. As a result, a considerable body of work has arisen exploring the question of how to fairly compare systems in the face of unjudged documents. Here we consider the same problem from another perspective, and investigate the relationship between relevance likelihood and retrieval rank, seeking to identify plausible methods for estimating document relevance and hence computing an inferred gain. A range of models are fitted against two typical TREC datasets, and evaluated both in terms of their goodness of fit relative to the full set of known relevance judgments, and also in terms of their predictive ability when shallower initial pools are presumed, and extrapolated metric scores are computed based on models developed from those shallow pools.
Prepared for submission to JHEP Scattering Amplitudes For All Masses and Spins

We introduce a formalism for describing four-dimensional scattering amplitudes for particles of any mass and spin. This naturally extends the familiar spinor-helicity formalism for massless particles to one where these variables carry an extra SU(2) little group index for massive particles, with the amplitudes for spin S particles transforming as symmetric rank 2S tensors. We systematically characterise all possible three particle amplitudes compatible with Poincare symmetry. Unitarity, in the form of consistent factorization, imposes algebraic conditions that can be used to construct all possible four-particle tree amplitudes. This also gives us a convenient basis in which to expand all possible four-particle amplitudes in terms of what can be called “spinning polynomials”. Many general results of quantum field theory follow the analysis of four-particle scattering, ranging from the set of all possible consistent theories for massless particles, to spin-statistics, and the Weinberg-Witten theorem. We also find a transparent understanding for why massive particles of sufficiently high spin can not be “elementary”. The Higgs and Super-Higgs mechanisms are naturally discovered as an infrared unification of many disparate helicity amplitudes into a smaller number of massive amplitudes, with a simple understanding for why this can’t be extended to Higgsing for gravitons. We illustrate a number of applications of the formalism at one-loop, giving few-line computations of the electron (g − 2) as well as the beta function and rational terms in QCD. “Off-shell” observables like correlation functions and form-factors can be thought of as scattering amplitudes with external “probe” particles of general mass and spin, so all these objects–amplitudes, form factors and correlators, can be studied from a common on-shell perspective. ar X iv :1 70 9. 04 89 1v 1 [ he pth ] 1 4 Se p 20 17
Dynamic Slicing of Service-Oriented Software

SoaML (Service oriented architecture Modeling Language) diagrams are the basic modeling artifacts for ServiceOriented Architecture (SOA). These SoaML models can also be used for testing Service-Oriented Software (SOS). Testing can be planned at design phase of software development life cycle. With this context, we present a novel technique to compute dynamic slices for Service-Oriented Software (SOS) based on SoaML Sequence Diagram. In our technique, we first map each message in sequence diagram with the corresponding web service messages. This mapping is observable. After that we construct an intermediate representation of SoaML sequence diagram which we called as Service-Oriented Software Dependence Graph (SOSDG) which is an intermediate representation that needs to be stored and traversed to get dynamic slice as and when web service gets executed. This SOSDG identifies data, control, intra-service and interservice dependencies from SoaML sequence diagram and from web service execution. For a given slicing criterion our algorithm computes global dynamic slice from SOSDG and identifies the affected service. The novelty of our work lies in computation of global dynamic slice based on SOSDG, it’s dependencies induced within or across organizations and small slices.
Flexibility of the Natural Source of Attribute Based Encryption Based on the Network

Attribute based encryption (ABE) is a famous cryptographic generation to protect the security of users’ data. However, the decryption cost and cipher text size restriction the utility of ABE in exercise. For most present ABE schemes, the decryption price and cipher text size develop linearly with the complexity of access structure. This is unwanted to the gadgets with restrained computing functionality and garage area. Outsourced decryption is taken into consideration as a possible method to lessen the consumer's decryption overhead, which allows a person to outsource a big variety of decryption operations to the cloud provider issuer (CSP). However, outsourced decryption cannot guarantee the correctness of transformation finished by means of the cloud, so it's far vital to test the correctness of outsourced decryption to make certain safety for users’ facts. Current research mainly specializes in verifiability of outsourced decryption for the legal users. It nonetheless stays a hard difficulty that a way to guarantee the correctness of outsourced decryption for unauthorized users. In this paper, we recommend an ABE scheme with verifiable outsourced decryption (called full verifiability for outsourced decryption), that could simultaneously test the correctness for transformed cipher text for the authorized customers and unauthorized customers. The proposed ABE scheme with verifiable outsourced decryption is proved to be selective CPA at ease within the standard version. Keywords---Attribute based encryption,outsourced decyrption,CPA-secure.
Information Secure Over Unauthorized Attack In Cloud Environment

Cloud computing is a platform to provide different services to the cloud users. User shared the sensitive data over the cloud which gives rise to security issues in cloud computing. So, to protect user’s data a secure methodology fragmentation and replication of data is used in this paper. The data is fragmented into pieces and then replicate them over the cloud nodes for maintaining the availability, performance level and backing up the data. T-coloring term is used here which is not giving any idea about locations of the fragments to an attacker. T-coloring method is used to assign the fragments and their replicas to improve the security. Three fish encryption algorithm used to provide high security. Data owner can use their secret key for encrypt the data. Then the files are in ciphertext form. These files are decrypted by the same key that is used for encryption on the receiver end. This system mainly focuses on the data and authentication system with good performance. KeywordsTColoring Algorithm, Threefish Encryption, DROPS Methodology.
Using an Isohaline Flux Analysis to Predict the Salt Content in an Unsteady Estuary

AbstractAn estuary is classified as unsteady when the salinity adjustment time is longer than the forcing time scale. Predicting salt content or salt intrusion length using scaling arguments based on a steady-state relationship between flow and salinity is inaccurate in these systems. We have used a time-dependent salinity box-model based on an unsteady Knudsen balance to demonstrate the effects of river flow, inward total exchange flow (tidal plus steady), and the salinity difference between inflow and outflow on the salt balance. A key component of the box-model is a relationship we present linking the normalized difference between inflowing and outflowing salinity at the mouth and the mean salinity content. We show that the normalized salinity difference is proportional to the mean salinty squared based on theoretical arguments from the literature. We demonstrate the validity of the box-model by hindcasting five years of mean salinity in Galveston Bay (estimated from coarse observations) in response to.