Miracle-dz/UniFAR-FTUs huggingface dataset:
MapGraph: A High Level API for Fast Development of High Performance Graph Analytics on GPUs

High performance graph analytics are critical for a long list of application domains. In recent years, the rapid advancement of many-core processors, in particular graphical processing units (GPUs), has sparked a broad interest in developing high performance parallel graph programs on these architectures. However, the SIMT architecture used in GPUs places particular constraints on both the design and implementation of the algorithms and data structures, making the development of such programs difficult and time-consuming. We present MapGraph, a high performance parallel graph programming framework that delivers up to 3 billion Traversed Edges Per Second (TEPS) on a GPU. MapGraph provides a high-level abstraction that makes it easy to write graph programs and obtain good parallel speedups on GPUs. To deliver high performance, MapGraph dynamically chooses among different scheduling strategies depending on the size of the frontier and the size of the adjacency lists for the vertices in the frontier. In addition, a Structure Of Arrays (SOA) pattern is used to ensure coalesced memory access. Our experiments show that, for many graph analytics algorithms, an implementation, with our abstraction, is up to two orders of magnitude faster than a parallel CPU implementation and is comparable to state-of-the-art, manually optimized GPU implementations. In addition, with our abstraction, new graph analytics can be developed with relatively little effort.
A highly sensitive search for magnetic fields in B, A and F stars

Circular spectropolarimetric observations of 74 stars were obtained in an attempt to detect magnetic fields via the longitudinal Zeeman eect in their spectral lines. The sample observed includes 22 normal B, A and F stars, four emission-line Ba nd As tars, 25 Am stars, 10 HgMn stars, two Boo stars and 11 magnetic Ap stars. Using the Least-Squares Deconvolution multi-line analysis approach (Donati et al. 1997), high precision Stokes I and V mean signatures were extracted from each spectrum. We find absolutely no evidence for magnetic fields in the normal, Am and HgMn stars, with upper limits on longitu- dinal field measurements usually considerably smaller than any previously obtained for these objects. We conclude that if any magnetic fields exist in the photospheres of these stars, these fields are not ordered as in the magnetic Ap stars, nor do they resemble the fields of active late-type stars. We also detect for the first time a field in the A2pSr star HD 108945 and make new precise measurements of longitudinal fields in five previously known magnetic Ap stars, but do not detect fields in five other stars classified as Ap SrCrEu. We also report new results for several binary systems, including a newv sini for the rapidly rotating secondary of the Am- Del SB2 HD 110951.
Distinguishing the Forest from the TREES: A Comparison of Tree Based Data Mining Methods

In recent years a number of "data mining" approaches for modeling data containing nonlinear and other complex dependencies have appeared in the literature. One of the key data mining techniques is decision trees, also referred to as classification and regression trees or CART (Breiman et al, 1993). That method results in relatively easy to apply decision rules that partition data and model many of the complexities in insurance data. In recent years considerable effort has been expended to improve the qualit 3" of the fit of regression trees. These new methods are based on ensembles or networks of trees and cart 3, names like TREENET and Random Forest. Viaene et al (2002) compared several data mining procedures, including tree methods and logistic regression, for prediction accuracy on a small fixed data set of fraud indicators or "red flags". They found simple logistic regression did as well at predicting expert opinion as the more sophisticated procedures. In this paper we will introduce some available regression tree approaches and explain how they are used to model nonlinear dependencies in insurance claim data. We investigate the relative performance of several software products in predicting the key claim variables for the decision to investigate for excessive and/or fraudulent practices, and the expectation of favorable results from the investigation, in a large claim database. Mnong the software programs we will investigate are CART, S-PLUS, TREENET, Random Forest and Insightful Miner Tree procedures. The data used for this analysis are the approximately 500,000 auto injury claims reported to the Detailed Claim Database (DCD) of the Automobile Insurers Bureau of Massachusetts from accident years 1995 through 1997. The decision to order an independent medical examination or a special investigation for fraud, and the favorable outcomes of such decisions, are the modeling targets. We find that the methods all provide some predictive value or lift from the available DCD variables with significant differences among the methods and the four targets. All modeling outcomes are compared to logistic regression as in Viaene et al. with some model/software combinations doing significantly betxer than the logistic model.
Interfacial dislocation networks around γ′ precipitates in nickel-base alloys

Abstract The three-dimensional dislocation network covering the γ–γ′ interface in a nickel-base superalloy was observed and identified by transmission electron microscopy. Estimates of the lattice misfit yielded about – 0·3% in the alloy considered. Assuming all dislocations to be of pure edge character the complete network could be analysed as formed by a/2〈110〉 dislocation loops extending over a tetrakaiUdecahedron: the eight {111} faces are covered with hexagonal dislocation networks, while the six {001} faces exhibit square and octagonal dislocation arrangements resulting from the interaction of dislocations with orthogonal Burgers vectors. The importance of interfacial dislocation networks and the role of the lattice misfit in oriented γ′ coalescence during creep are pointed out.
Adaptive AR modeling of nonstationary time series by means of Kalman filtering

An adaptive on-line procedure is presented for autoregressive (AR) modeling of nonstationary multivariate time series by means of Kalman filtering. The parameters of the estimated time-varying model can be used to calculate instantaneous measures of linear dependence. The usefulness of the procedures in the analysis of physiological signals is discussed in two examples: first, in the analysis of respiratory movement, heart rate fluctuation, and blood pressure, and second, in the analysis of multichannel electroencephalogram (EEG) signals. It was shown for the first time that in intact animals the transition from a normoxic to a hypoxic state requires tremendous short-term readjustment of the autonomic cardiac-respiratory control. An application with experimental EEG data supported observations that the development of coherences among cell assemblies of the brain is a basic element of associative learning or conditioning.
Bis(1,3-benzothiazole-2-thiolato)[(Z)-methyl 2-(2-amino-1,3-thiazol-4-yl)-2-(methoxyimino)acetate]nickel(II)

In the title compound, [Ni(C7H4NS2)2(C7H9N3O3S)], the NiII ion is in a slightly distorted N4S2 octahedral coordination environment. The two benzothiazole-2-thiolate ligands chelate via their thiazole N and thiolate S atoms while the methyl 2-(2-aminothiazol-4-yl)-2-(methoxyimino)acetate also acts as a chelate ligand binding through the thiazole and imino N atoms. Intramolecular N—H⋯N, C—H⋯N and C—H⋯O interactions contribute to the molecular conformation. In the crystal structure, intermolecular N—H⋯O hydrogen bonds produce R 1 2(6) rings and generate chains along the c axis. An extensive one-dimensional supramolecular network of N—H⋯O hydrogen bonds and C—H⋯π interactions is responsible for the crystal structure stabilization.
Approximation Algorithms for Geometric Networks

The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. A geometric network is, in its abstract form, a set of vertices, pairwise connected with an edge, such that the weight of this connecting edge is the Euclidean distance between the pair of points connected. Such a network may be used to represent a multitude of real-life structures, such as, for example, a set of cities connected with roads. Considering the case that a specific network is given, we study three separate problems. In the first problem we consider the case of interconnected `islands' of well-connected networks, in which shortest paths are computed. In the second problem the input network is a triangulation. We efficiently simplify this triangulation using edge contractions. Finally, we consider individual movement trajectories representing, for example, wild animals where we compute leadership individuals. Next, we consider the case that only a set of vertices is given, and the aim is to actually construct a network. We consider two such problems. In the first one we compute a partition of the vertices into several subsets where, considering the minimum spanning tree (MST) for each subset, we aim to minimize the largest MST. The other problem is to construct a $t$-spanner of low weight fast and simple. We do this by first extending the so-called gap theorem. In addition to the above geometric network problems we also study a problem where we aim to place a set of different sized rectangles, such that the area of their corresponding bounding box is minimized, and such that a grid may be placed over the rectangles. The grid should not intersect any rectangle, and each cell of the grid should contain at most one rectangle. All studied problems are such that they do not easily allow computation of optimal solutions in a feasible time. Instead we consider approximation algorithms, where near-optimal solutions are produced in polynomial time. In addition to the above geometric network problems we also study a problem where we aim to place a set of different sized rectangles, such that the area of their corresponding bounding box is minimized, and such that a grid may be placed over the rectangles. The grid should not intersect any rectangle, and each cell of the grid should contain at most one rectangle. All studied problems are such that they do not easily allow computation of optimal solutions in a feasible time. Instead we consider approximation algorithms, where near-optimal solutions are produced in polynomial time.
Designing games for distributed optimization

The central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to a given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent's control law on the least amount of information possible. Unfortunately, there are no existing methodologies for addressing this design challenge. The goal of this paper is to address this challenge using the field of game theory. Utilizing game theory for the design and control of multiagent systems requires two steps: (i) defining a local objective function for each decision maker and (ii) specifying a distributed learning algorithm to reach a desirable operating point. One of the core advantages of this game theoretic approach is that this two step process can be decoupled by utilizing specific classes of games. For example, if the designed objective functions result in a potential game then the system designer can utilize distributed learning algorithms for potential games to complete step (ii) of the design process. Unfortunately, designing agent objective functions to meet objectives such as locality of information and efficiency of resulting equilibria within the framework of potential games is fundamentally challenging and in many case impossible. In this paper we develop a systematic methodology for meeting these objectives using a broader framework of games termed state based potential games. State based potential games is an extension of potential games where an additional state variable is introduced into the game environment hence permitting more flexibility in our design space. Furthermore, state based potential games possess an underlying structure that can be exploited by distributed learning algorithms in a similar fashion to potential games hence providing a new baseline for our decomposition.
Sparse Random Linear Codes are Locally Decodable and Testable

We show that random sparse binary linear codes are locally testable and locally decodable (under any linear encoding) with constant queries (with probability tending to one). By sparse, we mean that the code should have only polynomially many codewords. Our results are the first to show that local decodability and testability can be found in random, unstructured, codes. Previously known locally decodable or testable codes were either classical algebraic codes, or new ones constructed very carefully. We obtain our results by extending the techniques of Kaufman and Litsyn [11] who used the MacWilliams Identities to show that "almost-orthogonal" binary codes are locally testable. Their definition of almost orthogonality expected codewords to disagree in n/2 plusmn O(radicn) coordinates in codes of block length n. The only families of codes known to have this property were the dual-BCH codes. We extend their techniques, and simplify them in the process, to include codes of distance at least n/2 - O(n1-gamma) for any gamma > 0, provided the number of codewords is O(nt) for some constant t. Thus our results derive the local testability of linear codes from the classical coding theory parameters, namely the rale and the distance of the codes. More significantly, we show that this technique can also be used to prove the "self-correctability" of sparse codes of sufficiently large distance. This allows us to show that random linear codes under linear encoding functions are locally decodable. This ought to be surprising in that the definition of a code doesn't specify the encoding function used! Our results effectively say that any linear function of the bits of the codeword can be locally decoded in this case.
A global analysis of trends in the quality of HIV sero-surveillance

Objective: To examine the quality of HIV sero-surveillance systems in countries by 2002, as well as trends between 1995 and 2002. Methods: The quality of countries’ surveillance systems was scored for five years: 1995, 1997, 1999, 2001, and 2002. Sero-surveillance data were compiled from the US Census Bureau’s HIV/AIDS Surveillance Database, the EuroHIV database, and from countries’ national HIV surveillance reports that were available to WHO/UNAIDS. The quality of systems was scored according to the level of the countries’ epidemic. Results: There has been a large variation in the quality of HIV surveillance systems across the 132 countries by type of the epidemic and over time from 1995 to 2002. Over the 1995–2002 period the number of countries with a fully implemented system decreased from 57 (43%) in 1995 to 48 (36%) in 2002. The proportion of countries with a fully implemented system was 58%, 34%, and 10% in countries with a generalised, concentrated, and low level epidemic, respectively. In the 53 countries with generalised epidemics the number of countries with a fully implemented system increased from 24 (45%) in 2001 to 31 (58%) in 2002. Conclusion: Many countries still have poor functioning HIV surveillance systems and require urgent strengthening. Countries should monitor and evaluate their own HIV surveillance systems and examine whether the systems are appropriate and adequate.
Carotid Artery Diameters, Carotid Endarterectomy Techniques and Restenosis

Background: Restenosis of the carotid artery is a major complication of carotid endarterectomy (CEA). The purpose of this study was to examine the role of CEA techniques on carotid dimensions variation, postoperative versus preoperative multi-segmental diameters and its impact on the development of restenosis at 12 months follow up. Methods: 175 consecutive patients eligible for carotid surgery were included in the study. 75 underwent CEA by patch reconstruction (PR), 53 by eversion (EV) and 47 by primary closure (PC). Before the procedures and at discharge, carotid diameters were measured at four reference points (common carotid, CC; carotid bulb, CB; proximal internal carotid artery, PICA; distal internal carotid artery, DICA) by ultrasonography. The rate of minor (< 50%) and major (≥ 50%) restenosis was evaluated at 12 months follow up. Results: PR produced an increase in all carotid diameters while PC and EV produced a decrease in carotid diameters, having PC affected all diameters while EV affected CB and PICA diameter. However, postoperative diameters had comparable dimension independently of the surgical technique used. The rate of overall and major restenosis did not differ significantly between the three types of surgery. Logistic regression analysis showed that female gender was associated with major restenosis (OR 6.9, 95% CI 1, 23 – 38, 49) irrespective of surgical technique. Conclusion: This study shows that carotid diameters and restenosis rate after CEA are comparable whatever is the surgical technique adopted, and that women are at high risk of major restenosis.
The detection of Shiga toxin-producing Escherichia coli in diagnostic bovine faecal samples using vancomycin-cefixime-cefsulodin blood agar and PCR.

The prevalence of complex Shiga toxin-producing Escherichia coli (STEC), i.e. STEC containing accessory virulence factors intimin (eaeA) and/or enterohaemorrhagic E. coli haemolysin (ehxA) and their serotypes were determined in diagnostic bovine faecal samples processed during a 3 months period. The presence of complex STEC was determined using PCR and vancomycin-cefixime-cefsulodin blood agar (BVCCA) using a dual approach which involved (i) direct culture of faecal samples on BVCCA followed by mutiplex PCR of BVCCA positive colonies and (ii) culture of faecal samples enriched in modified EC (mEC) broth (with a complex STEC profile determined by PCR) on BVCCA followed by multiplex PCR of BVCCA positive colonies. Using both techniques complex STEC were isolated from 23 (18.7%) of the 123 faecal samples. Complex STEC were isolated from 14 faecal samples by direct culture on BVCCA and 13 faecal samples yielded complex STEC by culture of mEC broths with a complex STEC profile on BVCCA. Only four samples were positive using both techniques. The serotypes isolated included O5:H-, O26:H-, O26:H11, O91:H21, O111:H-, O111:H8, O104:H11, O113:H21 and O157:H8. This study confirms that non-O157 STEC can be isolated from bovine faeces and that they carry types associated with human disease. This work also demonstrates that the use of a dual approach is advisable to increase the likelihood of isolating complex STEC.
Generating Novel Allelic Variation Through Activator Insertional Mutagenesis in Maize

The maize transposable element Activator (Ac) has been exploited as an insertional mutagen to disrupt, clone, and characterize genes in a number of plant species. To develop an Ac-based mutagenesis platform for maize, a large-scale mutagenesis was conducted targeting the pink scutellum1 locus. We selected 1092 Ac transposition events from a closely linked donor Ac, resulting in the recovery of 17 novel ps1 alleles. Multiple phenotypic classes were identified corresponding to Ac insertions in the 5′-UTR and coding region of the predicted Ps1 gene. To generate a stable allelic series, we employed genetic screens and identified 83 germinally heritable ps1 excision alleles. Molecular characterization of these excision alleles revealed a position-dependent bias in excision allele frequencies and the predominance of 7- and 8-bp footprint products. In total, 19 unique ps1 excision alleles were generated in this study, including several that resulted in weak mutant phenotypes. The analysis of footprint alleles suggests a model of Ac excision in maize that is consistent with recent in vitro studies of hAT element excision. Importantly, the genetic and molecular methods developed in this study can be extended to generate novel allelic variation at any Ac-tagged gene in the genome.
Efficiency of drug delivery enhanced by acoustic pressure during blood–brain barrier disruption induced by focused ultrasound

Purpose We evaluated the delivery efficiency of intravenously injected large molecular agents, before and after disruption of the blood–brain barrier (BBB-D), induced by focused ultrasound (FUS) using various acoustic parameters. Materials and methods Male Sprague-Dawley rats were injected intravenously with Evans blue (EB) before or after BBB-D induction by pulsed FUS. We used a 1.0 MHz pulsed FUS with four acoustic power settings and an ultrasound contrast agent (UCA) at four different doses to induce BBB-D resulting from cavitation. The permeability of the BBB was assessed quantitatively based on the extravasation of EB. Contrast enhanced magnetic resonance imaging (MRI) was used to monitor the gadolinium deposition associated with FUS. Histological analysis was performed to examine tissue damage. Results The accumulation of EB in rat brain was found to be dependent on acoustic power and UCA dosage, regardless of whether EB administration occurred before or after FUS-induced BBB-D. Administration of EB followed by sonication resulted in greater EB extravasation than that for rats subjected to sonication prior to EB injection. To reduce tissue damage, EB extravasation was enhanced by first administering EB by intravenous injection, followed by sonication at reduced acoustic power or UCA dosage. The normalized signal intensity change in rat brains that received the same dose of UCA and sonicated after gadolinium injection was significantly greater than in rats undergoing sonication followed by gadolinium administration. Moreover, contrast enhanced MRI showed a more precise distribution of gadolinium in the brain when gadolinium was administered before sonication. Conclusion We demonstrated that a compound administered prior to sonication treatment promotes extravasation of the sonicated region. Thus, it is possible to optimize ultrasound parameters for lower sonication and reduced UCA doses, to induce BBB-D while minimizing damage to normal brain tissue.
Microstructure Simulation of Aluminum Alloy Using Parallel Computing Technique

The formation and evolution of the microstructure of casting are important research areas in the field of material science and engineering. The solidified microstructure of aluminum alloy was simulated by combining the CA (Cellular Automaton) model with macro heat transfer. A modified CA (MCA) model, which uses a more similar shape to the actual dendrite to describe the growth grain, was proposed and studied. Because of the huge computational capacity to simulate the microstructure of casting, a relevant parallel computing technique based on the serial arithmetic was developed, which can greatly improve the computing scale and efficiency and can also ensure the computing accuracy as well. The simulation results are compared with the experimental results and agreed quite well.
Fortune Teller: Predicting Your Career Path

People go to fortune tellers in hopes of learning things about their future. A future career path is one of the topics most frequently discussed. But rather than rely on "black arts" to make predictions, in this work we scientifically and systematically study the feasibility of career path prediction from social network data. In particular, we seamlessly fuse information from multiple social networks to comprehensively describe a user and characterize progressive properties of his or her career path. This is accomplished via a multi-source learning framework with fused lasso penalty, which jointly regularizes the source and career-stage relatedness. Extensive experiments on real-world data confirm the accuracy of our model.