Miracle-dz/UniFAR-FTUs huggingface dataset:
Sorting strings and constructing digital search trees in parallel

We describe two simple optimal-work parallel algorithms for sorting a list /spl Lscr/=(X/sub 1/,X/sub 2/,.,X/sub m/) of m strings over an arbitrary alphabet /spl Sigma/, where /spl Sigmasub i=1sup mspl verbar/X/sub ispl verbar/=n. The first algorithm is a deterministic algorithm that runs in O((log/sup 2/ m)/(log log m)) time and the second is a randomized algorithm that runs in O(log m) time. Both algorithms use O(m log(m)+n) operations. Compared to the best known parallel algorithms for sorting strings, the algorithms offer the following improvements: the total number of operations used by the algorithms is optimal while all previous parallel algorithms use a non-optimal number of operations; we make no assumption about the alphabet while the previous algorithms assume that the alphabet is restricted to /spl lcub/1,2,. , n/sup O(1/)/spl rcub/; the computation model assumed by the algorithms is the Common CRCW PRAM unlike the known algorithms that assume the Arbitrary CRCW PRAM; and the presented algorithms use O(m log m+n) space, while previous parallel algorithms use O(n/sup 1+/spl epsiv) space, where /spl epsiv/ is a positive constant. We also present optimal-work parallel algorithms to construct a digital search tree for a given set of strings and to search for a string in a sorted list of strings. We use the parallel sorting algorithms to solve the problem of determining a minimal starting point of a circular string with respect to lexicographic ordering. <<ETX>>
Towards an ideal network: Survivability issues in selected topologies

This paper presents analysis of network topologies from survivability point of view. Four kinds of network models including the Barabasi-Albert model and a new application of CRUG type models are examined and discussed. A new network topology generator (CRVG) is also evaluated. Modeling results proved that the proposed CRVG model offered a significant reduction in the number of articulation vertices compared to the other models. CRVG supports survivability better.
On the Computation of Fully Proportional Representation

We investigate two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe. Both systems assign a representative to each voter so that the "sum of misrepresentations" is minimized. The winner determination problem for both systems is known to be NP-hard, hence this work aims at investigating whether there are variants of the proposed rules and/or specific electorates for which these problems can be solved efficiently. As a variation of these rules, instead of minimizing the sum of misrepresentations, we considered minimizing the maximal misrepresentation introducing effectively two new rules. In the general case these "minimax" versions of classical rules appeared to be still NP-hard. We investigated the parameterized complexity of winner determination of the two classical and two new rules with respect to several parameters. Here we have a mixture of positive and negative results: e.g., we proved fixed-parameter tractability for the parameter the number of candidates but fixed-parameter intractability for the number of winners. For single-peaked electorates our results are overwhelmingly positive: we provide polynomial-time algorithms for most of the considered problems. The only rule that remains NP-hard for single-peaked electorates is the classical Monroe rule.
Barrier Dysfunction of the Corneal Endothelium in Response to TNF- (cid:1) : Role of p38 MAP Kinase

P URPOSE . TNF- (cid:1) is elevated in the cornea and aqueous humor during allograft rejection and anterior uveitis. The authors investigated the involvement of p38 MAP kinase in the TNF-(cid:1) –induced loss of barrier integrity in monolayers of cultured bovine corneal endothelial cells. M ETHODS . Transendothelial electrical resistance (TER), a mea- sure of barrier integrity, was determined by electrical cell-substrate impedance sensing. Barrier integrity was further assessed in terms of permeability to FITC dextran. Reorganization of the apical junctional complex (AJC) in response to TNF- (cid:1) was visualized by immunoﬂuorescence. The expression of TNF- (cid:1) receptors was conﬁrmed by RT-PCR. Activation of p38 MAP kinase in response to TNF- (cid:1) was determined by Western blot analysis. R ESULTS
c-Jun-N-Terminal Kinase Signaling Is Involved in Cyclosporine-Induced Epithelial Phenotypic Changes

Tubular epithelial cells play a central role in the pathogenesis of chronic nephropathies. Previous toxicogenomic studies have demonstrated that cyclosporine- (CsA-) induced epithelial phenotypic changes (EPCs) are reminiscent of an incomplete epithelial to mesenchymal transition (EMT) in a TGF-β-independent manner. Furthermore, we identified endoplasmic reticulum (ER) stress as a potential mechanism that may participate in the modulation of tubular cell plasticity during CsA exposure. Because c-jun-N-terminal kinase (JNK), which is activated during ER stress, is implicated in kidney fibrogenesis, we undertook the current study to identify the role of JNK signaling in EPCs induced by CsA. In primary cultures of human renal epithelial cells, CsA activates JNK signaling, and the treatment with a JNK inhibitor reduces the occurrence of cell shape changes, E-cadherin downregulation, cell migration, and Snail-1 expression. Our results suggest that CsA activates JNK signaling, which, in turn, may participate in the morphological alterations through the regulation of Snail-1 expression.
An Open Source Multi Agent System for Data Preprocessing of Online Software Bug Repositories

Software bug repositories contain lot of useful information related to software development, software design and software’s common error patterns. Most of the projects use bug tracking system to manage the bugs associated with the software. These bug tracking system works as an online bug repositories, which can be accessed by all of the project members situated at different locations. Researches can also access these online bug repositories for exploring knowledge from them. In order to extract knowledge from software repositories some preprocessing mechanism is required to extract, parse and save the data locally from these online repository. To address this problem an open source multi agent system is proposed in this paper for the preprocessing of online software defect repositories. The proposed system is also implemented using the open source technologies. Software agents are independent software units and works intelligently and also getting very popular for current and future research, and hence the concepts of agents are included for preprocessing task and multi agent system is implemented. The implementation is done using open source application programming interfaces (API's) and also performance is evaluated for the implementation in terms of bug data fetch and parse timings.
Nonlinear Adaptive PID Control for Greenhouse Environment Based on RBF Network

This paper presents a hybrid control strategy, combining Radial Basis Function (RBF) network with conventional proportional, integral, and derivative (PID) controllers, for the greenhouse climate control. A model of nonlinear conservation laws of enthalpy and matter between numerous system variables affecting the greenhouse climate is formulated. RBF network is used to tune and identify all PID gain parameters online and adaptively. The presented Neuro-PID control scheme is validated through simulations of set-point tracking and disturbance rejection. We compare the proposed adaptive online tuning method with the offline tuning scheme that employs Genetic Algorithm (GA) to search the optimal gain parameters. The results show that the proposed strategy has good adaptability, strong robustness and real-time performance while achieving satisfactory control performance for the complex and nonlinear greenhouse climate control system, and it may provide a valuable reference to formulate environmental control strategies for actual application in greenhouse production.
Autonomously reviewing and validating the knowledge base of a never-ending learning system

The amount of information available on the Web has been increasing daily. However, how one might know what is right or wrong? Does the Web itself can be used as a source for verification of information? NELL (Never-Ending Language Learner) is a computer system that gathers knowledge from Web. Prophet is a link prediction component on NELL that has been successfully used to help populate its knowledge database. However, during link prediction task performance Prophet classify some edges as misplaced edges, that is, edges that we can not assure if they are right or not. In this paper we use the Web itself, using question answer (QA) systems, as a Prophet extension to validate these edges. This is an important issue when working with a self-supervised system where inserted errors might be propagate and generate dangerous concept drifting.
Cloning, Chromosomal Localization and Functional Expression of the Gene Encoding the α‐Subunit of the cG‐MP‐Gated Channel in Human Cone Photoreceptors

Cyclic nucleotide‐gated (CNG) ion channels serve as final targets of signal transduction in vertebrate photoreceptors. While the basic mechanisms of phototransduction are similar in rod and cone photoreceptors, both cell types express distinct sets of components of the transduction pathway. We report here the cloning of the cDNA encoding the α‐subunit of the cGMP‐gated channel of human cone photoreceptors. The open reading frame predicts a polypeptide of 694 amino acid residues with conserved functional parts and amino acid positions typical for the α‐subunit of CNG‐channels. Heterologous expression of the cDNA in Xenopus oocytes gave rise to cGMP‐gated channel activity. Antiserum directed against the C‐terminus of the bovine cone CNG channel α‐subunit crossreacted specifically with the heterologously expressed polypeptide and stained cone photoreceptors and weakly also the outer plexiform layer in human retinal sections. Northern blot analysis detected a prominent mRNA species of ∼3.8 kb in human retina. The entire gene spans ∼30 kb of genomic sequence and is located on the pericentric band q11.2 of human chromosome 2. The gene is composed of seven exons, with introns located at positions which are preserved with respect to the human rod gene, indicating a common ancestral gene structure. RT‐PCR analysis gave no evidence for alternatively spliced transcripts.
Modeling and estimation of total leakage current in nano-scaled CMOS devices considering the effect of parameter variation

In this paper we have developed analytical models to estimate the mean and the standard deviation in the gate, the subthreshold, the reverse biased source/drain junction band-to-band-tunneling (BTBT) and the total leakage in scaled CMOS devices considering variation in process parameters like device geometry, doping profile, flat-band voltage and supply voltage. We have verified the model using Monte Carlo simulation using an NMOS device of 50nm effective length and analyzed the results to enumerate the effect of different process parameters on the individual components and the total leakage.
Proteomic analysis of aqueous humor from patients with primary open angle glaucoma

Purpose Primary open angle glaucoma (POAG) is a leading cause of irreversible blindness on a global level. Researchers have yet to specify the exact mechanisms of POAG; the respective relationships between POAG and elevated intraocular pressure (IOP), as well as optic neuropathy, remain particularly unclear. It is known, however, that the expression profile for some proteins in the aqueous humor (AH) changes in some diseases, and that AH changes play important roles in elevated IOP. To identify the possible roles of these AH proteins in POAG, a proteomic analysis of the AH compositions of POAG patients’ eyes was performed and compared with those derived from paired, non-POAG cataract (control) eyes. Methods We used Bradford’s method to determine total protein concentration in AH, and analyzed separation profiles via two-dimensional (2D) gel electrophoresis. We used silver stain to determine gel proteins, and analyzed separation profiles to assess spot density differences between POAG and non-POAG patients. These gel spots were isolated and identified via mass spectrometry. Prostaglandin H2 D-isomerase (PGDS) in AH were analyzed by western Blotting. Results There was no significant difference between the total protein concentration in AH of POAG patients and that in AH of non-POAG patients. A total of seven spots were increased in 2D gels from POAG patients. The spots were derived from PGDS, caspase 14 precursor, transthyretin, cystain C, albumin precursor, and tranferrin. And PGDS in AH from patients was more than from controls. Conclusions The protein composition in AH was significantly different in POAG patients versus non-POAG patients. The identified proteins could be a potential biomarker for POAG and may play a role in the mechanisms of elevated IOP and optic neuropathy in POAG.
A New Longitudinal End Effect Factor for Linear Induction Motors

The longitudinal end effect in a linear induction motor (LIM) is analysed assuming two travelling magnetic flux density waves in the airgap: the wave travelling with synchronous velocity and the wave representing end effect [1]. A simple equation for the end effect factor which modifies the airgap EMF is obtained, and a simple equivalent circuit incorporating the end effect factor is established. Analysis is compared with measurements from two largescale single-sided LIM's. The equation for the end effect factor is sufficiently accurate to be used for design studies of LIMs. Since end effects are negligible at low speeds, the end effect factor has application for medium and high-speed LIMs.
One‐Dimensional Plasmon Coupling by Facile Self‐Assembly of Gold Nanoparticles into Branched Chain Networks

prevailing phase. All these samples were used for the experiments by selecting individual microcrystals with an optical microscope inter-faced to a Raman spectrometer (Jobin Yvon T64000 triple monochro-mator) spanning the lattice-phonon region 10–200 cm –1 . The excitation wavelength was provided by a krypton laser at 752.5 nm to avoid pentacene fluorescence (either exciton-like or from impurities). The incoming power was kept low to avoid crystal damage: the actual power focused on the sample was about 1 mW. The spectra were recorded with the crystal placed on the microscope stage (Olympus BX40), interfaced to the spectrometer, with 10×, 50×, or 100× objectives, reaching a maximum spatial resolution of about 0.9 l m. Raman mapping was automatically achieved after selecting the crystal area to be sampled and the number of points to be checked. The point density was chosen for each experiment according to the size of the crystal and the microscope objective used.
Towards Understanding Software Evolution : One-Line Changes

Understanding the impact of software changes has been a challenge since software systems were first developed. With the increasing size and complexity of systems, this problem has become more difficult. There are many ways to identify change impact from the plethora of software artifacts produced during development and maintenance. We present the analysis of the software development process using change and defect history data. Specifically, we address the problem of one-line changes. The studies revealed that (1) there is less than 4 percent probability that a one-line change will introduce an error in the code; (2) nearly 10 percent of all changes made during the maintenance of the software under consideration were one-line change; (3) although the effort for changing one-line of code is smaller compared to larger changes, the vast number of changes result in a significant amount of effort.
Performance of Caching Algorithms for IPTV On-Demand Services

Due to its native return channel and its ability to easily address each user individually an IPTV system is very well suited to offer on-demand services. Those services are becoming more popular as there is an undeniable trend that users want to watch the offered content when and where it suits them best. Because multicast can no longer be relied upon for such services, as was the case when offering linear-programming TV, this trend risks to increase the traffic unwieldy over some parts of the IPTV network unless caches are deployed in strategic places within it. Since caches are limited in size and the popularity of on-demand content is volatile (i.e., changing over time), it is not straightforward to decide which objects to cache at which moment in time. This paper introduces and studies a caching algorithm that tracks the popularity of objects to make intelligent caching decisions. We will show that when its parameters are set equal or close to their optimal values this algorithm outperforms traditional algorithms as LRU (least-recently used) and LFU (least-frequently used). After a generic study of the algorithm fed by a user demand model that takes the volatility of the objects into account we will discuss two particular cases of an on-demand service, video-on-demand and catch-up TV, for each of which we give guidelines on how to dimension their associated caches.
Towards searching as a learning process: A review of current perspectives and future directions

We critically review literature on the association between searching and learning and contribute to the formulation of a research agenda for searching as learning. The paper begins by reviewing current literature that tends to characterize search systems as tools for learning. We then present a perspective on searching as learning that focuses on the learning that occurs during the search process, as well as search outputs and learning outcomes. The concept of ‘comprehensive search’ is proposed to describe iterative, reflective and integrative search sessions that facilitate critical and creative learning beyond receptive learning. We also discuss how search interaction data can provide a rich source of implicit and explicit features through which to assess search-related learning. In conclusion, we summarize opportunities and challenges for future research with respect to four agendas: developing a search system that supports sense-making and enhances learning; supporting effective user interaction for searching as learning; providing an inquiry-based literacy tool within a search system; and assessing learning from online searching behaviour.
Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processes

This work initiates a general study of learning and generalization without the i.i. d. assumption, starting from first principles. While the standard approach to statistical learning theory is based on assumptions chosen largely for their convenience (e.g., i.i.d. or stationary ergodic), in this work we are interested in developing a theory of learning based only on the most fundamental and natural assumptions implicit in the requirements of the learning problem itself. We specifically study universally consistent function learning, where the objective is to obtain low long-run average loss for any target function, when the data follow a given stochastic process. We are then interested in the question of whether there exist learning rules guaranteed to be universally consistent given only the assumption that universally consistent learning is possible for the given data process. The reasoning that motivates this criterion emanates from a kind of optimist’s decision theory, and so we refer to such learning rules as being optimistically universal. We study this question in three natural learning settings: inductive, self-adaptive, and online. Remarkably, as our strongest positive result, we find that optimistically universal learning rules do indeed exist in the self-adaptive learning setting. Establishing this fact requires us to develop new approaches to the design of learning algorithms. Along the way, we also identify concise characterizations of the family of processes under which universally consistent learning is possible in the inductive and self-adaptive settings. We additionally pose a number of enticing open problems, particularly for the online learning setting.
RecPlay: a fully integrated practical record/replay system

This article presents a practical solution for the cyclic debugging of nondeterministic parallel programs. The solution consists of a combination of record/replay with automatic on-the-fly data race detection. This combination enables us to limit the record phase to the more efficient recording of the synchronization operations, while deferring the time-consuming data race detection to the replay phase. As the record phase is highly efficient, there is no need to switch it off, hereby eliminating the possibility of Heisenbugs because tracing can be left on all the time. This article describes an implementation of the tools needed to support RecPlay.
Measurements of snow- and glacier-covered areas with single-polarization SAR

Climatological and hydrological investigations in mountainous regions frequently require delineation of the areas covered by snow and glacial ice. Active microwave sensors can discriminate snow and glacier from other targets, are effective under all weather conditions, and have a spatial resolution compatible with the topographic variation in alpine regions. Using data acquired with the NASA AIRSAR, which operates at three frequencies and four combinations of polarization, we examine the usage of synthetic aperture radar (SAR) to map snow- and glacier-covered areas. In order to assess the available SARs that operate from satellites, we analyze single-frequency, single-polarization data, and we compare our results with images from the Landsat Thematic Mapper obtained under clear conditions only a few days after the SAR flight. Single polarization, C-band (5.3 GHz) SAR data can discriminate between areas covered by wet snow from those that are ice-free, but do not easily separate glacier ice from snow and rock. L-band SAR (1.25 GHz) data cannot discriminate between snow and glacier ice. The accuracy (74%) of SAR is high enough to justify its use as the data source in areas that are too cloud-covered to obtain reliable data from the thematic mapper.
Systematic review and meta-analysis of the role of vascular resection in the treatment of hilar cholangiocarcinoma.

BACKGROUND The management of hilar cholangiocarcinoma has evolved over time and extended liver resection, including the caudate lobe, and major vascular resection and extended lymphadenectomy have become established practice. The benefit of vascular resection has not been investigated. METHODS A systematic search of the MEDLINE and EMBASE databases was used to identify studies. A systematic review and a meta-analysis of the available studies were conducted according to PRISMA guidelines. Odds ratios were calculated using the Mantel-Haenszel method. Primary outcome variables assessed included morbidity, mortality, vascular complications and the effect of vascular resection on longterm survival. RESULTS Of 411 search results, only 24 studies reported the results of vascular resection in hilar cholangiocarcinoma. Meta-analysis showed increased morbidity and mortality with hepatic artery resection. Portal vein resection was achievable with no impact on postoperative mortality. Vascular resection did not improve negative margin rates and had no impact on longterm survival. CONCLUSIONS Portal vein resection does not preclude curative resection; however, it is not routinely recommended unless there is suspicion of tumour invasion. There was no proven survival advantage with portal vein resection. Arterial resection results in higher morbidity and mortality with no proven benefit.