Miracle-dz/UniFAR-FTUs huggingface dataset:
Fast Optimal Clearing of Capped-Chain Barter Exchanges

Kidney exchange is a type of barter market where patients exchange willing but incompatible donors. These exchanges are conducted via cycles---where each incompatible patient-donor pair in the cycle both gives and receives a kidney---and chains, which are started by an altruist donor who does not need a kidney in return. Finding the best combination of cycles and chains is hard. The leading algorithms for this optimization problem use either branch and price — a combination of branch and bound and column generation — or constraint generation. We show a correctness error in the leading prior branch-and-price-based approach [Glorie et al. 2014]. We develop a provably correct fix to it, which also necessarily changes the algorithm's complexity, as well as other improvements to the search algorithm. Next, we compare our solver to the leading constraint-generation-based solver and to the best prior correct branch-and-price-based solver. We focus on the setting where chains have a length cap. A cap is desirable in practice since if even one edge in the chain fails, the rest of the chain fails: the cap precludes very long chains that are extremely unlikely to execute and instead causes the solution to have more parallel chains and cycles that are more likely to succeed. We work with the UNOS nationwide kidney exchange, which uses a chain cap. Algorithms from our group autonomously make the transplant plans for that exchange. On that real data and demographically-accurate generated data, our new solver scales significantly better than the prior leading approaches.
Earthquake damage detection in the Imperial County Services Building II: Analysis of novelties via wavelets

The former Imperial County Services Building is a rare case of an instrumented building damaged by an earthquake. In this paper, it is used to test a structural health monitoring method, based on detecting novelties in the recorded seismic response, by examining the correlation between their occurrence, spatial distribution and magnitude with the degree of the observed damage. The novelties are detected using expansion in a basis of bi‐orthogonal wavelets. For this building, most of the larger novelties can be associated with the observed damage. The novelties suggest that damage first occurred at about 6.4 s, proceeded between 8.2 and 9.2 s, and culminated at about 11.2 s with the collapse of the first story columns at the east end of the building. These times are consistent with large inter‐story drifts, and significant drops in the NS and EW system frequencies, reported previously. The major damage followed large pulses of input power within about 2 s. The time delays between novelties in different recording channels indicate velocity of propagation of the disturbances within the structure, consistent with other independent estimates. Copyright © 2009 John Wiley & Sons, Ltd.
DVC coding and CUDA decoding acceleration scheme for network multi-view stereoscopic TV

Network multi-view stereoscopic TV remains an unfilled blank, because multi-view stereoscopic TV is characterized by high bit rate and low tolerance for bit error which are the restriction of the development of network multi-view stereoscopic TV. This paper aims to solve the problem by distributed video coding (DVC) and GPU acceleration. Distributed video coding is an effective approach of Wyner-Ziv video coding for multi-view stereoscopic video encoded by LDPC. The distributed video coding based on channel coding offers flexible partitioning of the complexity between the encoder and the decoder to achieve a low complexity encoder for some applications, which are limited on calculation capability, memory capability and power consumption. Therefore, the DVC is suitable for wireless video capturing device, camera and so forth which the computation ability, memory size, power consumption are limited. The DVC decrease the complexity of encoding process, but increase the complexity of decoding process. To guarantee the fluent of the multi-view stereoscopic TV play, GPU is employed to accelerate the decoding process. The experiment result shows that joint decoding of eight views to generate the side information is more effective than conventional decoding of single view. And the CUDA could accelerate the decoding process efficiently.
Excitation of stellar p-modes by turbulent convection - II. The Sun

Acoustic power and oscillation amplitudes of radial oscillations computed for a solar model are compared with solar seismic observations. The oscillations are assumed stochastically excited by turbulence. The numerical computations are based upon a theoretical formulation of the power going into solar like oscillation modes as proposed by Samadi et al. (2000) in a companion paper. This formulation allows to investigate several assumptions concerning properties of the stellar turbulence. We find that the entropy source plays a dominant role in the stochastic excitation compared with the Reynold stress source in agreement with Goldreich et al. (1994). We consider several turbulent kinetic energy spectra suggested by different observations of the solar granulation. Differences between turbulent spectra manifest themselves by large differences in the computed oscillation powers at high oscillation frequency. Two free parameters which are introduced in the description of the turbulence enter the expression for the acoustic power. These parameters are adjusted in order to fit to the solar observations of the surface velocity oscillations. The best fit is obtained with the kinetic energy spectrum deduced from the observations of the solar granulation by Nesis et al. (1993); the corresponding adjusted parameters are found to be compatible with the theoretical upper limit which can be set on these parameters. The adopted theoretical approach improves the agreement between solar seismic observations and numerical results.
Packing optimization for automated generation of complex system's initial configurations for molecular dynamics and docking

Molecular Dynamics is a powerful methodology for the comprehension at molecular level of many chemical and biochemical systems. The theories and techniques developed for structural and thermodynamic analyses are well established, and many software packages are available. However, designing starting configurations for dynamics can be cumbersome. Easily generated regular lattices can be used when simple liquids or mixtures are studied. However, for complex mixtures, polymer solutions or solid adsorbed liquids (for example) this approach is inefficient, and it turns out to be very hard to obtain an adequate coordinate file. In this article, the problem of obtaining an adequate initial configuration is treated as a “packing” problem and solved by an optimization procedure. The initial configuration is chosen in such a way that the minimum distance between atoms of different molecules is greater than a fixed tolerance. The optimization uses a well‐known algorithm for box‐constrained minimization. Applications are given for biomolecule solvation, many‐component mixtures, and interfaces. This approach can reduce the work of designing starting configurations from days or weeks to few minutes or hours, in an automated fashion. Packing optimization is also shown to be a powerful methodology for space search in docking of small ligands to proteins. This is demonstrated by docking of the thyroid hormone to its nuclear receptor. © 2003 Wiley Periodicals, Inc. J Comput Chem 24: 819–825, 2003
Stochastic capacity planning in a Global Mining Supply Chain

The strategic planning problem, when applied to a Global Mining Supply Chain, aims at developing the necessary capacity — through either incrementing capacity on existing assets (facilities or logistics channels), or establishing new capacity in the form of new assets — in order to satisfy increasing demand. Hence, throughout the planning horizon, decisions about which new assets to establish and where to increment capacity must be taken at minimal cost (or minimal risk) and in a timely manner. However, when demand varies non-monotonically, decisions about which assets to temporarily shut down in times of decreasing demand and which of those to reopen when market conditions improve must also be taken into account. In order to respond to the risky nature of commodity markets, we propose a multi-stage stochastic programming approach to deal with the capacity planning problem in a realistic Global Mining Supply Chain. A discrete probability scenario tree defines a large-scale integer program which is hard to solve even for modern optimization software and powerful workstations. An analysis of specific software configurations indicates a series of alternative solution approaches — from exact methods such as cutting planes to approximate methods such as local search — that can be further explored in order to develop more efficient algorithms.
UvA-DARE ( Digital Academic Repository ) Binaries discovered by the SPY project-IV . Five single-lined DA double white dwarfs

We present results from our ongoing follow-up observations of double white dwarf binaries detected in the ESO SN Ia Progenitor SurveY (SPY). We discuss our observing strategy and data analysis and present the orbital solutions of five close double white dwarf binaries: HE0320−1917, HE1511−0448, WD0326−273, WD1013−010 and WD1210+140. Their periods range from 0.44 to 3.22 days. In none of these systems we find any spectral lines originating from the companion. This rules out main sequence companions and indicates that the companion white dwarfs are significantly older and cooler than the bright component. Infrared photometry suggests the presence of a cool, helium-rich white dwarf companion in the binary WD 0326−273. We briefly discuss the consequences of our findings for our understanding of the formation and evolution of double white dwarfs.
Path planning for unmanned aerial vehicle under geo-fencing and minimum safe separation constraints

UAV works under a complex environment and features a high flight freedom in low altitude flight, and path planning is a difficult point in guaranteeing economy and safety of flight. This paper abstracts the path planning of UAV into multi-objective optimization and puts forward a path representing method with a multi-gene structure. On this basis, the paper puts forward a path planning method based on self-adapted difference multi-objective optimization algorithm and achieves a comprehensive assessment of path flight. The simulation result indicates that the path planning algorithm can effectively create a 3D optimal path that meets constraint conditions and each performance index of UAV and fulfill the function of obstacles sensing and avoidance under a complex low altitude.
Graduate Students’ Perspectives on Effective Teaching

This study employed data collected over an 8-year period in which graduate students’ perspectives on effective teaching were collected during a class exercise. The data were organized into three categories: (a) teaching competence (knowledge of content and teaching), (b) relationships with students (having the best interests of students at heart), and (c) teacher attitudes (with respect to teaching and learning). Students appear to concur with the literature in adult and higher education that effective teaching involves far more than presenting content and the methods used to convey that content to students. Equally important are the affective or emotional processes involved in learning, forming a relationship with students, and caring about students’ learning and ability to integrate and apply new information. Therefore, adult and higher education courses that address teaching need to go further than merely addressing course design and techniques. Unless students have direct instruction in teaching and an opportunity to practice, they will often uncritically reproduce the teaching models they have experienced. This article can serve as a way to introduce information about effective teaching that emanates from a source with which students can easily identify and serve as a platform to engage students in the study of teaching.
Adding variability management to UML-based software product lines 1

The software product line (PL) approach promotes the generation of specific products from a set of core assets for a given domain. This approach is applicable to domains in which products have well-defined commonalities and variation points. Variability management is concerned with the management of the differences between products throughout the PL lifecycle. This paper presents a UML-based process for variability management that allows identification, representation and delimitation of variabilities; and, identification of mechanisms for variability implementation. The evaluation of the process was carried out as a case study within the context of an existing PL for the Workflow Management System (WfMS) domain. The results have shown that the proposed process includes well-defined control mechanisms that increase the possibility of identifying and tracing variabilities.
Expression of two recombinant chloramphenicol acetyltransferase variants in highly reduced genome Escherichia coli strains

Highly reduced E. coli strains, MDS40, MDS41, and MDS42, lacking approximately 15% of the genome, were grown to high cell densities to test their ability to produce a recombinant protein with high yields. These strains lack all transposons and insertion sequences, cryptic prophage and many genes of unknown function. In addition to improving genetic stability, these deletions may reduce the biosynthetic requirements of the cell potentially allowing more efficient production of recombinant protein. Basic growth parameters and the ability of the strains to produce chloramphenicol acetyltransferase (CAT) under high cell density, batch cultivation were assessed. Although growth rate and recombinant protein production of the reduced genome strains are comparable to the parental MG1655 strain, the reduced genome strains were found to accumulate significant amounts of acetate in the medium at the expense of additional biomass. A number of hypotheses were examined to explain the accumulation of acetate, including oxygen limitation, carbon flux imbalance, and metabolic activity of the recombinant protein. Use of a non‐catalytic CAT variant identified the recombinant protein activity as the source of this phenomenon; implications for the metabolic efficiency of the reduced genome strains are discussed. Biotechnol. Bioeng. 2007;98: 1056–1070. © 2007 Wiley Periodicals, Inc.
Phrase Ranking and Wikipedia Based Cluster Labeling

Automatically labeling document clusters with words which indicate their topics is a relatively new and active research field. The most frequently used process, labeling with the most frequent words in the clusters, turns out using several words that are virtually void of descriptive power even after traditional stop words are eliminated. Another procedure, labeling with the most anticipated words, often include rather obscure results. We present Phrase Rank, a variation of the Page Rank algorithm based on relational graph representation of the content of web document collections. Phrase Rank achieves segregation and ranking of discriminative phrases higher than the ambiguous Phrases followed by common phrases. Thus a set of important text features are first extracted from the cluster documents. Further we use these features to extract cluster labels from the external knowledge sources such as pre-categorized knowledge of Wikipedia. We experiment with a test dataset to demonstrate the efficacy of Phrase Rank algorithm.
Real-time detection and classification of traffic jams from probe data

In this paper we present our experience on detecting and classifying traffic jams in real time from probe data. We classify traffic jams at two levels. At a higher level, we classify traffic jams into recurring and non-recurring jams. Then at a lower level we identify accidents out of non-recurring jams based on features that characterize upstream and downstream traffic patterns. Accidents are highly unpredictable and usually create heavy and long lasting congestion, and therefore are particularly worth detecting. We discuss the challenges of detecting accidents in real time as well as our approaches and results.
Fuzzy based Priority Scheduler for WiMAX with Improved QoS constraints

---------------------------------------------------------------------- ABSTRACT ------------------------------------------------------------ Wireless Interoperability for Microwave Access (WiMAX) is one of the most familiar broadband wireless access technologies that support multimedia transmission. IEEE802.16 Medium Access Control (MAC) covers a large area for bandwidth allocation and Quality of Service (QoS) mechanisms for various types of applications. Nevertheless, the standard lacks a MAC scheduling algorithm that has a multi-dimensional Technological objective of satisfying QoS requirements of the users, maximizing channel utilization while ensuring fairness among users. So we are proposing a novel Priority based Scheduling Algorithm using Fuzzy logic that addresses these aspects. The initial results show that maximum channel utilization is achieved with a negligible increment in processing time while keeping the priority intact.
A web link retrieval framework for retrieving non redundant description based web links

This paper explores the measuring similarity between the web objects which are one of the fundamental task in information retrieval domain. This paper proposes a framework for improved and efficient web object search based on search domain. The concept of proposed approach defines the similarity between two objects (object can be a link or text content) and retrieve the related links with their content descriptor according to user's interest. The proposed framework can retrieve the similar web objects in effective and faster way by eliminating the redundant objects. The proposed algorithm is experimentally tested and the results shows improvement in fast and effective retrieval of web links. The proposed algorithm automatically extracts web links based on user interests. Furthermore, in accordance with user interest's web objects mined and feedbacks of users are assessed for effective retrieval with an idea of dynamically adjusting the ranking scores of Web Pages based on similarity measures.
Using consensus group methods to improve simulation using immersive media in paramedicine

Problem: Simulation is a cornerstone of paramedic pedagogy. It facilitates a learning-centred approach which explicitly links the learning and teaching environment to the real world and enables the student to construct new understandings of paramedic practice threshold concepts. Although the benefits of simulation in medical and health education have been well researched, there is a paucity of research into how to deliver simulation using immersive media (IM) due to its recency as a strategy in paramedicine. This study explored student feedback of simulations using IM to improve the efficacy of learning activities designed for the recently commissioned University of the Sunshine Coast (USC) immersive simulation studio. Method: Feedback was taken using a modified Nominal Group Technique (NGT) consensus method post implementation of an IM strategy. Participants were second year students of the Bachelor of Paramedic Science program at USC who had undertaken simulation using immersive media in 2015. Results: .
A Block Location Scrambling Algorithm of Digital Image Based on Arnold Transformation

Currently there are many methods for calculating the periodicity of Arnold transformation and getting the inverse transformation, the use of traditional Arnold transformation for the image scrambling has become unsafe, for this issue it proposes an algorithm for digital image block location scrambling. It has improved the traditional Arnold transformation by adding two parameters a and b, furthermore it use Logistic map to generate the parameter sequences. The digital image is blocked, then carry out Arnold transformation with different parameters on each image block, after that put the transformed pixels on the corresponding position of the encrypted image, thus achieving image location scrambling. The results of simulation show that this algorithm can achieve good image encryption effect, and it has a large key space, key sensitivity. It basically meets the effectiveness and security requirements of image encryption.
18 F-Fluoroacetate : A Potential Acetate Analog for Prostate Tumor Imaging — In Vivo Evaluation of 18 F-Fluoroacetate Versus 11 C-Acetate

PET with 11C-acetate (11C-ACE) has a high sensitivity for detection of prostate cancer and several other cancers that are poorly detected with 18F-FDG. However, the short half-life (20.4 min) of 11C limits the general availability of 11C-ACE. 18F-Fluoroacetate (18F-FAC) is an analog of acetate with a longer radioactive halflife (18F 5 110 min). This study was undertaken to assess the potential usefulness of 18F-FAC as a prostate tumor imaging agent. Methods: We developed an efficient radiosynthesis for 18F-FAC, which has already been adapted to a commercial synthesizer. Biodistribution studies of 18F-FAC were compared with 11CACE in normal Sprague–Dawley male rats and CWR22 tumorbearing nu/nu mice. We also performed a small-animal PET study of 18F-FAC in CWR22 tumor-bearing nu/nu mice and a whole-body PET study in a baboon to examine defluorination. Results: We obtained 18F-FAC in a radiochemical yield of 55% 6 5% (mean 6 SD) in ;35 min and with a radiochemical purity of . 99%. Rat biodistribution showed extensive defluorination, which was not observed in the baboon PET, as indicated by the standardized uptake values (SUVs) (SUVs of iliac bones and femurs were 0.26 and 0.3 at 1 h and 0.22 and 0.4 at 2 h, respectively). CWR22 tumor-bearing nu/nu mice showed tumor uptake (mean 6 SD) of 0.78 6 0.06 %ID/g (injected dose per gram of tissue) for 11C-ACE versus 4.01 6 0.32 %ID/g for 18F-FAC. For most organs—except blood, muscle, and fat—the tumor-to-organ ratios at 30 min after injection were higher with 18F-FAC, whereas the tumor-to-heart and tumor-to-prostate ratios were similar. Conclusion: All of these data indicate that 18F-FAC may be a useful alternative to 11C-ACE tracer for the detection of prostate tumors by PET.