Miracle-dz/UniFAR-FTUs huggingface dataset:
Heterologous expression and characterization of the human R-ras gene product

We directly expressed human R-ras 23,000-dalton protein (p23) cDNA in Escherichia coli under the control of the trp promoter. GTP-dependent phosphorylation of a p23 threonine 85 substitution mutant was observed. This result is in direct analogy to the autokinase activity of H-ras and K-ras threonine 59 substitution mutants. Normal p23 protein was detected in the human fibrosarcoma cell line HT1080 by immunoprecipitation with rabbit antibodies raised against an E. coli-expressed R-ras fusion protein. The R-ras p23 protein was found to be 3H labeled in the presence of [9,10(n)-3H]palmitic acid and is associated with the P100 membrane fraction of HT1080 cells. These data suggest that human R-ras p23 has biochemical properties very similar to those of the p21 products of the H-, K-, and N-ras proto-oncogenes. We constructed an R-ras minigene and engineered the expression of normal and mutant alleles from the simian virus 40 early region promoter. Normal and mutant R-ras gene products were authenticated by transient expression in COS-7 cells and immunoprecipitation. The valine 38-substituted R-ras p23 displayed reduced electrophoretic mobility. R-ras p21-like proteins, made by eliminating the first 26 R-ras codons, displayed evident mobility differences between the pro form and mature form, along with a valine 12 substitution-dependent change in electrophoretic mobility. Rat-1 fibroblasts were transfected with normal and mutant R-ras alleles and normal and activated H-ras alleles. Unlike the human T24 bladder oncogene-encoded p21, mutant R-ras alleles do not cause monolayer focus formation or growth in soft agar of rat fibroblasts.
Reconstructing ddc for interactive classification

The automated text categorization (TC) has made prominent progress in recent years. However, seldom work is done on automatic classification with library classification systems, the largest and most sophisticated classification systems people ever built, such as the Dewey Decimal classification (DDC). The library classification is a very laborious and time-consuming job that requires qualification and good training. The large-scale classification schemes, such as the DDC, impose several obstacles to the state-of-art TC technologies, including very deep hierarchy, data sparseness, and skewed category distribution. These problems characterize large corpora of real-world applications and it is very hard, if not impossible, to obtain satisfactory results. In this paper, we propose a novel algorithm to reconstruct classification schemes according to the document density and category distribution, and to transform the category hierarchy into a balanced virtual taxonomy by merging sparse categories, lopping dense branches and flattening the hierarchy. To make the classification performance acceptable to real-world applications, we also propose an interactive classification model that only needs two or three times of user interaction. Extensive experiments are conducted on a 10-year bibliographic data collection of the Library of Congress to verify the proposed methodology.
In Situ Metal Matrix Composite Surfacing by Laser Surface Alloying

Laser as a source of focused energy may be applied for the modification of microstructure and/or composition of the near surface region of a component. The technique may be applied for the development of a ceramic/intermetallics/interstitial compound dispersed metal matrix composite layer on the surface of metallic substrate by melting the substrate with a high power laser and simultaneous addition of alloy powders for the development of metal matrix composite layer by in-situ reactions. In the present contribution, development of metal-dispersed and intermetallic-dispersed matrix composite layer on the surface of metallic matrix has been discussed with a suitable example of its application.
On the importance of local connectivity for Internet topology models

Existing models for Internet Autonomous System (AS) topology generation make structural assumptions about the AS graph. Those assumptions typically stem from beliefs about the true properties of the Internet, e.g. hierarchy and power-laws, which arise from incorrect interpretations of incomplete observations of the AS topology. In this paper we compare AS topology generation models with several observed AS topologies without making assumptions as to the relative importance of different topological characteristics. We find that although existing AS topology models capture degree-based properties well, they fail to capture the complexity of the local interconnection structure between ASes. We use a wide range of metrics including the weighted spectral distribution and make it available as toolbox. We show that the shortcomings of existing models stem from underestimating the complexity of connectivity in the core due to incomplete understanding of collected data limitations, and narrow focus on particular aspects of the AS topology structure.
The MRC OX-62 antigen: a useful marker in the purification of rat veiled cells with the biochemical properties of an integrin

A mouse immunoglobulin G1 monoclonal antibody (mAb), MRC OX-62 (OX-62), was raised against density gradient-enriched rat veiled (dendritic) cells obtained from lymph. In suspensions of lymphoid cells, the OX-62 mAb only labeled cells with the characteristics of veiled cells. The OX- 62 mAb was used with a magnetic cell sorter to enrich or deplete veiled cells, and the enriched veiled cells were potent stimulators in the primary allogeneic mixed leukocyte reaction. Immunohistochemical staining of tissue sections showed that the OX-62 mAb did not label all classical dendritic cells and was not restricted to this cell type. In lymphoid tissues, the labeling correlated with dendritic cells, but in skin, major histocompatibility complex class II+ cells were OX-62-, while another CD3+ cell with dendritic morphology was strongly OX-62+. It seems that the OX-62 mAb may be restricted to dendritic cells and probably to gamma/delta T cells. The OX-62 mAb will be of use in delineating minor subsets of cells with dendritic morphology in various tissues. Sodium dodecyl sulfate-polyacrylamide gel electrophoresis analysis of veiled cell-enriched populations immunoprecipitated with the OX-62 mAb gave bands with the biochemical characteristics of an integrin. The OX-62 mAb recognized the alpha-like subunit.
Removal of Image Advertisement from Web Page

With the phenomenal growth of the web, there is an ever increasing volume of data and information published in numerous web-pages. It is said that web is noisy. A web page typically contains a mixture of many kind of information e.g. main contains, advertisements, navigational panels, copy right blocks etc. for a particular application only part of information is useful and the rest are noise. These all seriously harm web mining. Advertisements and Sponsor images are not much important in surfing. As there is a need of technique that keep common navigation structure as it is but removes image advertisement and improve surfing efficiency. In this paper a small application HTML Tag Differentiator is created which removes image advertisement using rule based classifier. General Terms Data Mining, Web Content Mining, Image Advertisement
CogALex-V Shared Task: LexNET - Integrated Path-based and Distributional Method for the Identification of Semantic Relations

We present a submission to the CogALex 2016 shared task on the corpus-based identification of semantic relations, using LexNET (Shwartz and Dagan, 2016), an integrated path-based and distributional method for semantic relation classification. The reported results in the shared task bring this submission to the third place on subtask 1 (word relatedness), and the first place on subtask 2 (semantic relation classification), demonstrating the utility of integrating the complementary path-based and distributional information sources in recognizing concrete semantic relations. Combined with a common similarity measure, LexNET performs fairly good on the word relatedness task (subtask 1). The relatively low performance of LexNET and all other systems on subtask 2, however, confirms the difficulty of the semantic relation classification task, and stresses the need to develop additional methods for this task.
Characterization of polymer silver pastes for screen printed flexible RFID antennas

Radio Frequency Identification (RFID) systems have become more and more popular in the last few years because of their wide application fields, such as supply chain management and logistics. To continue their development further investigations of new conductive materials for fabrication of RFID transponders’ antennas are necessary to be carried out. These materials should provide high flexibility and good radiation performance of printed antennas. In this paper, two polymer silver pastes based on silver flakes were characterized with regard to manufacturing of flexible RFID antennas with screen printing technique. Foil and paper were used as a substrate materials. Surface profile of the printed antennas was measured using an optical profilometer and their resistance was measured with a four-point-probe method. Antenna flexibility was evaluated in cyclic bending tests and its performance with reflection coefficient measurements with the use of differential probe connected to a vector network analyzer. In addition, a maximum read distance of a fabricated RFID transponder was measured.
Is IgG4-Related Disease a Cause of Xerostomia? A Cohort Study of 60 Patients

Objective. Immunoglobulin-G4-(IgG4-) related disease (IgG4 RD) is a fibrosing process characterized by a significant infiltration of IgG4-secreting plasma cells. IgG4 RD can affect almost all organs including salivary glands. Whether IgG4 RD plays a role in the development of sicca syndrome and particularly dry mouth syndrome remains to be investigated. Methods. We conducted a monocentric cohort study for two years to search for IgG4 RD features in patients with dry mouth syndrome using immunostainings of labial salivary gland specimens with anti-IgG4 antibody. Results. Among 60 patients presenting with dry mouth syndrome who underwent labial salivary gland biopsy, 18 showed positive immunostaining with the anti-IgG4 antibody including 4 patients with typical systemic IgG4 RD. Five also fulfilled criteria for Sjögren's syndrome. Conclusion. These findings suggest that clinical forms of IgG4 RD salivary involvement without salivary swelling may occur. This salivary involvement is probably overlooked in everyday practice and could represent a mild form of IgG4 RD.
Steep conversion ration Ćuk, Zeta, and sepic converters based on a switched coupled-inductor cell

By replacing the input inductor of the Cuk (respectively Sepic, and Zeta) converter with a cell formed by a coupled inductor and one diode, a new family of converters with high voltage ratio is obtained. The energy accumulated in the leakage inductance is transferred to the load. The voltage stresses across the switching elements are kept at a moderate value. The reverse-recovery problem of the rectifier diode is alleviated. A DC analysis allows for the formulation of the DC gain as a function of the turns ratio and coupling coefficient of the coupled inductor, as well of the load. Experimental results confirm the theoretical expectations.
Scaling up controller synthesis for linear systems and safety specifications

In this paper we revisit the problem of automatically synthesizing control software enforcing formal specifications given in temporal logic. Existing approaches to solve this problem rely on the explicit or implicit construction of finite abstractions of control systems. Unfortunately, the existing abstraction techniques do not scale beyond a small number of state variables. The objective of this paper is to scale up the construction of such abstractions by focusing on linear control systems and safety specifications. In this more restricted scenario the controller synthesis problem can be reduced to the computation of control invariant subsets. Hence, we focus on the control invariance problem and propose a computational technique exploiting controllability. We illustrate the proposed methods on several synthetic examples illustrating the computational limits of our algorithm.
Ultrasound characteristics of the patellar and quadriceps tendons among young elite athletes

Tendons adapt in response to sports‐specific loading, but sometimes develop tendinopathy. If the presence of ultrasound changes like hypoechoic areas and neovascularization in asymptomatic tendons precede (and predict) future tendon problems is unknown. The aim of this prospective cohort study was to investigate the relationship between the development of ultrasound changes in the patellar and quadriceps tendons and symptoms of jumper's knee, as well to examine the medium‐term effects of intensive training on tendon thickness among adolescent athletes. Elite junior volleyball athletes were followed with semi‐annual ultrasound and clinical examinations (average follow‐up: 1.7 years). Of the 141 asymptomatic athletes included, 22 athletes (35 patellar tendons) developed jumper's knee. In a multivariate logistic regression analysis, a baseline finding of a hypoechoic tendon area (odds ratio 3.3, 95% confidence interval 1.1 to 9.2) increased the risk of developing symptoms of jumper's knee. Patellar tendon thickness among healthy athletes did not change (Wilk's lambda, P = 0.07) while quadriceps tendon thickness increased (P = 0.001). In conclusion, ultrasound changes at baseline were risk factors for developing symptoms of jumper's knee. Also, among healthy athletes, we observed a 7–11% increase in quadriceps tendon thickness, while there was no increase in patellar tendon thickness.
Information Theory and Coding

(a) Let X and Y be two discrete random variables whose respective sets of possible outcomes {x} and {y} are described by probability distributions p(x) and p(y), and by a joint probability distribution p(x, y). (i) Give an expression for the mutual information I(X; Y) between X and Y , using only the probability distributions p(x), p(y), and p(x, y). [2 marks] (ii) In case X and Y are independent random variables, what becomes of their mutual information, and why? [1 mark] (iii) Let the marginal entropy of random variable X be H(X), and suppose that the two random variables X and Y are perfectly correlated with each other. In that case, prove that I(X; Y) = H(X). [2 marks] (iv) What is I(X; X), the mutual information of a random variable with itself, in terms of H(X)? [1 mark] (b) Prove that the information measure is additive: that the information gained from observing the combination of N independent events, whose probabilities are p i for i = 1.N , is the sum of the information gained from observing each one of these events separately and in any order. [3 marks] (c) An invertible transform generates projection coefficients by integrating the product of a signal onto each of a family of functions. In a reverse process, expansion coefficients can be used on those same functions to reproduce the signal. If the functions in question happen to form an orthonormal set, what is the consequence for the projection coefficients and the expansion coefficients? What penalty must be paid in the absence of orthogonality? Name one such penalised transform. [3 marks] (d) In the Information Diagram (a plane whose axes are time and frequency), why does the Gabor–Heisenberg–Weyl Uncertainty Principle imply that information is quantised even in continuous signals – i.e., that a signal's information content consists of a countable, limited number of independent quanta? [3 marks] (e) Define the Kolmogorov algorithmic complexity K of a string of data. For a string of length N bits, how large might its Minimal Description Length be, and why? Comment on how, or whether, you can know that you have truly determined the Minimal Description Length for a set of data. Give a reasonable estimate of the Kolmogorov complexity K of a fractal, and explain why it is reasonable.
Efficient liquid schedule search strategies for collective communications

The upper limit of a network's capacity is its liquid throughput. The liquid throughput corresponds to the flow of a liquid in an equivalent network of pipes. However, the aggregate throughput of a collective communication pattern (traffic) scheduled according to network topology unaware techniques may be several times lower than the maximal potential throughput of the network. In most of the cut-through, wormhole and wavelength division optical networks, there is a loss of performance due to congestions between simultaneous transfers sharing a common communication resource. We propose to schedule the transfers of a traffic according to a schedule yielding the liquid throughput. Such a schedule, called liquid schedule, relies on the knowledge of the underlying network topology and ensures an optimal utilization of all bottleneck links. To build a liquid schedule, we partition the traffic into time frames comprising mutually non-congesting transfers keeping all bottleneck links busy during all time frames. The search for mutually non-congesting transfers utilizing all bottleneck links is of exponential complexity. We present an efficient algorithm which non-redundantly traverses the search space and limits the search to only those sets of transfers, which are non-congesting and use all bottleneck links.
Optimal Investment Decision of the Recycle Economic Projects Based on Game Options

In this paper, apply option game theory methods compensate for the inherent limitations of traditional NPV, derived the optimal preempt invest cycle economic projects critical value and the expression of the value function in under incomplete information oligopoly competition, give investors the preempt investment strategy rules, and analyze the relationship between critical value of investment and risks rate. Research shows that the larger face risk of being the first to competitors, the more investors will invest earlier. CLC：F424.7 Document code：A
Estimation of linear, non-gaussian causal models in the presence of confounding latent variables

The estimation of linear causal models (also known as structural equation models) from data is a well-known problem which has received much attention in the past. Most previous work has, however, made an explicit or implicit assumption of gaussianity, limiting the identifiability of the models. We have recently shown (Shimizu et al, 2005; Hoyer et al, 2006) that for non-gaussian distributions the full causal model can be estimated in the no hidden variables case. In this contribution, we discuss the estimation of the model when confounding latent variables are present. Although in this case uniqueness is no longer guaranteed, there is at most a finite set of models which can fit the data. We develop an algorithm for estimating this set, and describe numerical simulations which confirm the theoretical arguments and demonstrate the practical viability of the approach. Full Matlab code is provided for all simulations.
The monodromy pairing and discrete logarithm on the Jacobian of finite graphs

Abstract Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this group closely mirrors the construction of the Jacobian variety of an algebraic curve. Motivated by this analogy, it was recently suggested by Norman Biggs that the critical group of a finite graph is a good candidate for doing discrete logarithm based cryptography. In this paper, we study a bilinear pairing on this group and show how to compute it. Then we use this pairing to find the discrete logarithm efficiently, thus showing that the associated cryptographic schemes are not secure. Our approach resembles the MOV attack on elliptic curves.
A fast segmentation scheme based on level set for SAR images

In this paper, we propose a modified segmentation algorithm based on level set for synthetic aperture radar (SAR) images. The segmentation of SAR images is a difficult problem due to the presence of speckle which can be modeled as strong, multiplicative noise. One main drawback of previous the SAR image segmentation algorithm based on active contour model and level set is the computational expense inherent to solving the proposed nonlinear parabolic partial differential equation. The proposed algorithm is faster than the previous SAR image segmentation via standard curve evolution model. Experimental results are shown on both synthetic and real SAR images.
Long-Term Trimethoprim-Sulphamethoxazole in the Management of Recurrent Urinary Infection

Nineteen patients with recurring urinary infections were treated with trimethoprim-sulphamethoxazole in full dosage for 6 months. In 14 (Group I) the upper urinary tract was structurally abnormal and in 5 (group II), the I.V. P. showed no abnormality. In Group I the response rate was initially 70 per cent but had fallen to 30 per cent by the end of the treatment period. In group II all patients responded initially and 4 out of the 5 maintained sterile cultures over the period of treatment. Side effects were not serious and in particular, no haematological anomalies were noted in any patient throughout the 6 months of treatment.
Position vs. velocity control for tilt-based interaction

Research investigating factors in the design of tilt-based interfaces is presented. An experiment with 16 participants used a tablet and a 2D pointing task to compare position-control and velocity-control using device tilt to manipulate an on-screen cursor. Four selection modes were also evaluated, ranging from instantaneous selection upon hitting a target to a 500-ms time delay prior to selection. Results indicate that position-control was approximately 2× faster than velocity-control, regardless of selection delay. Position-control had higher pointing throughput (3.3 bps vs. 1.2 bps for velocity-control), more precise cursor motion, and was universally preferred by participants.
Adaptive trajectory tracking control for a four-rope crane

In practice, overhead cranes often suffer from uncertain system parameters such as the payload mass and friction-related coefficients. These uncertainties may seriously degrade the performance of corresponding controllers. Multi-rope cranes may encounter such problem as well. To solve this problem, we develop an adaptive trajectory tracking controller for a four-rope crane in this paper. The proposed method can achieve fast trolley positioning and rapid payload swing elimination even in the presence of uncertain system parameters. The performance of the closed-loop system is theoretically ensured by Lyapunov techniques and Barbalat's lemmas. Furthermore, simulation results are subsequently provided to demonstrate the feasibility and efficiency of the designed controller.
QoS-Aware Multi-armed Bandits

Motivated by runtime verification of QoS requirements in self-adaptive and self-organizing systems that are able to reconfigure their structure and behavior in response to runtime data, we propose a QoS-aware variant of Thompson sampling for multi-armed bandits. It is applicable in settings where QoS satisfaction of an arm has to be ensured with high confidence efficiently, rather than finding the optimal arm while minimizing regret. Preliminary experimental results encourage further research in the field of QoS-aware decision making.