Miracle-dz/UniFAR-FTUs huggingface dataset:
Distributed power allocation for device-to-device communications underlaying cellular networks

In recent years, D2D communication technology has been widely used in cellular networks. By introducing D2D users, cellular networks can improve the efficiency of using resources, which can improve the quality of communication. In the system where both D2D users and cellular networks users exist, we studied the method how every user is introduced into the cellular networks to improve the resource utilization. The distributed resource allocation for D2D communications underlying cellular networks is considered. By the game theory, the problem can be considered as a non-cooperative game. Firstly, Nash Equilibrium's existence is proved. Then a distributed algorithm is designed to solve the power allocation problem. Finally, Nash Equilibrium uniqueness and the global convergence of asynchronous distributed algorithm are proved. Simulation results show that the algorithm is convergent,which can get optimal power allocation by iteration method.
Efficient Online k-Best Lookup in Weighted Finite-State Cascades

Weighted finite-state transducers (WFSTs) have proved to be powerful and efficient aids for a variety of natural-language processing tasks, including automatic phonetization and phonological rule systems (Kaplan & Kay, 1994; Laporte, 1997), morphological analysis (Geyken & Hanneforth, 2006), and shallow syntactic parsing (Roche, 1997). In particular, cascades arising from the composition of two or more WFSTs can be used to model processing “pipelines”, each component of which is itself a (weighted) finite-state transducer. Typically, the input to such a pipeline is a simple string, corresponding to a lookup operation for the input string in the processing cascade. Unfortunately, an exhaustive “offline” compilation of the processing cascade turns out in many cases to be infeasible, due to memory restrictions and the combinatorial properties of the composition operation itself. Even for simple lookup operations in “dense” cascades,1 the resulting WFST may in fact be several times larger than the processing pipeline itself. In many such cases – particularly in optimization and error-correction problems – the output WFST itself serves only as an intermediate processing datum, however: we are not interested in an exhaustive representation of the lookup output, but rather only in a small finite subset of its language, such as the k-best paths. This paper presents a novel algorithm for efficient k-best search in a subclass of weighted finite-state lookup cascades which avoids the combinatorial explosion associated with “dense” cascade relations by means of online computation:2 dynamic construction of only those states and arcs required for a k-best search of the lookup output. Use of a greedy termination clause together with an additional cutoff parameter helps to ensure speedy completion and simultaneously prune unwanted results from the output.
Immunization and targeted destruction of networks using explosive percolation

A new method ("explosive immunization") is proposed for immunization and targeted destruction of networks. It combines the explosive percolation (EP) paradigm with the idea of maintaining a fragmented distribution of clusters. The ability of each node to block the spread of an infection (or to prevent the existence of a large cluster of connected nodes) is estimated by a score. The algorithm proceeds by first identifying low score nodes that should not be vaccinated or destroyed, analogously to the links selected in EP if they do not lead to large clusters. As in EP, this is done by selecting the worst node (weakest blocker) from a finite set of randomly chosen "candidates. " Tests on several real-world and model networks suggest that the method is more efficient and faster than any existing immunization strategy. Because of the latter property it can deal with very large networks.
SNIAFL: towards a static non-interactive approach to feature location

To facilitate software maintenance and evolution, a helpful step is to locate features concerned in a particular maintenance task. In the literature, both dynamic and interactive approaches have been proposed for feature location. In this paper, we present a static and non-interactive method for achieving this objective. The main idea of our approach is to use the information retrieval (IR) technology to reveal the basic connections between features and computational units in source code. Due to the characteristics of the retrieved connections, we use a static representation of the source code named BRCG to further recover both the relevant and the specific computational units for each feature. Furthermore, we recover the relationships among the relevant units for each feature. A premise of our approach is that programmers should use meaningful names as identifiers. We perform an experimental study based on a GNU system to evaluate our approach. In the experimental study, we present the detailed quantitative experimental data and give the qualitative analytical results.
The development of BCB-sealed galvanic cells. Case study: aluminum-platinum cells activated with sodium hypochlorite electrolyte solution

Energy on demand is an important concept in remote sensor development. The fabrication process for silicon-wafer-based, totally enclosed galvanic cells is presented herein. Benzocyclyobutene (BCB), a photo-patternable material, is used as the adhesive layer between the silicon wafers on which metal electrodes are patterned to form the cells' electrolyte cavity. As a case study, and since aluminum is an anode material with thermodynamic high energy density, this metal is evaporated onto a wafer and used as an anode. A sputtered platinum film collects the charge and provides a catalytic surface in the cell cathode. The metal film patterning process and wafer-to-wafer bonding with BCB is detailed. The difficulties encountered, and design modifications to overcome these, are presented. Cells of the mentioned design were activated with sodium hypochlorite solution electrolyte. Typical potential outputs for the cells, as a function of operational time, are also presented. With a 5 kΩ load, a potential of 1.4 V was maintained for over 240 min, until depletion of the electrolyte occurred. Average cell energy outputs under electrical loads between 100 Ω and 5 kΩ were in the range of 4–10 J with columbic densities ranging from 45 to 83 Ah L−1.
A Different Angle on Light Communications

Can “twisted” light beams enhance optical communication systems? A conventional propagating free-space laser beam typically has an approximately flat phase front and exhibits an intensity profile that decreases as a function of the radial distance from the beam center. However, in the 1990s, it was shown that propagating light waves can contain an interesting property known as orbital angular momentum (OAM) (1). OAM implies that the light wave's phase front is twisting along the direction of propagation. This twisting of the phase front into a corkscrew shape results in a doughnut-like ring intensity profile (2). It was then demonstrated that a given optical beam with OAM can be encoded with data (3–5). Moreover, a radiowave field trial showed that a free-space radio data link can use OAM for transmission (6). Recent work has demonstrated a 2.56 terabits per second (Tbit/s) free-space optical data transfer using OAM (7).
Spread of Excitation from the Sinus Node

Microelectrodes were employed to determine the mode of propagation of excitation from the sinus node in the rabbit heart. The excitation starts from the sinus node radially, at first, but then proceeds to the crista terminalis, often obliquely. This is because some special tissue having a slow conduction velocity lies behind the sinus node, and also because there is a zone of relatively faster conduction at the basal wall of the superior vena cava. Once the excitation wave enters the crista terminalis, it travels rapidly in two opposite directions through two branches of the ring-like structure which is formed by the crista terminalis and its extension. The excitation wave traveling through the branch encircling the inferior vena cava reached the atrioventricular node earlier in most instances. In the caval region inside the ring-like structure there is a zone of relatively faster conduction. The conduction to the atrioventricular node through this route is latent in the normal state, because conduction through the ring-like structure takes place beforehand. In the caval region near the sinus node, the conduction velocity of the excitation wave from the spontaneously beating sinus node was greater than that from the electrically driven atrium. The spontaneous action potential showed also a steeper rise than that produced by electrical stimulation. The mechanism responsible for this is discussed.
Extended infusion compared to standard infusion cefepime as empiric treatment of febrile neutropenia

Background Extended infusion (EI) dosing provides a longer time above the minimum inhibitory concentration, which is important for the clinical success of β-lactam antibiotics, especially for patients with impaired immunity. The aim of this study was to determine the feasibility and clinical impact of administering cefepime by EI as treatment of febrile neutropenia. Methods This was a prospective, randomized, comparative pilot study. All patients received cefepime 2 g IV every 8 h, with the first dose administered using a 30-min infusion. After the first dose, patients were randomized to receive cefepime over 30 min as a standard infusion (SI) or 3 h (EI). Patients were >18 years old with febrile neutropenia (neutrophil count <500 cells/mm3 and temperature >38.0ºC) and received chemotherapy or stem cell transplant as treatment for malignancy. Patients were excluded for the following: allergy to a cephalosporin, creatinine clearance (CrCl) < 50 mL/min, receipt of concurrent Gram-negative antimicrobial, sepsis, or solid tumor malignancy. The primary outcome was defervescence by 72 h. Secondary outcomes included time to defervescence, clinical success, in-hospital mortality, hospital length of stay, and need for additional antimicrobials. Main results Sixty-three patients were enrolled: 33 in the SI arm and 30 in the EI arm. The groups were similar with regard to age, gender, weight, estimated creatinine clearance, and duration of neutropenia. None of the patients in the EI arm withdrew due to practical complications of receiving EI cefepime. Twenty-three patients in the SI arm and 20 patients in the EI arm defervesced by 72 h (p = 0.99). There were no differences in secondary outcome measures; however, patients in the EI arm appeared to have defervesced more rapidly (median 19 vs. 41 h, p = 0.305). Conclusion Administration of cefepime by EI for the treatment of febrile neutropenia is feasible. Larger clinical trials are necessary to determine if EI cefepime imparts a clinical benefit in the treatment of febrile neutropenia.
Electric‐field‐induced chain orientation in poly(L‐lactic acid)

The orientational order was studied for melt-state poly(L-lactic acid) under an external direct-current electric field. A birefringence as high as 1.1 × 10−2 was recorded against an external field of 1.0 MV/m at 190 °C. The evidence proved that a field–dipole interaction transferred from a randomly coiled conformation to a uniaxially drawn conformation. The field-induced birefringence was temporally resolved, and the chain orientation and relaxation processes on the order of 100 s were observed in a real timescale after the field was turned on and off. A mechanism of chain orientation was examined with respect to the orientation polarization and viscoelasticity. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 4433–4439, 2004
The Economics of Matching: Stability and Incentives

This paper considers some game-theoretic aspects of matching problems and procedures, of the sort which involve matching the members of one group of agents with one or more members of a second, disjoint group of agents, ail of whom have preferences over the possible resulting matches. The main focus of this paper is on determining the extent to which matching procedures can be designed which give agents the incentive to honestly reveal their preferences, and which produce stable matches.Two principal results are demonstrated. The first is that no matching procedure exists which always yields a stable outcome and gives players the incentive to reveal their true preferences, even though procedures exist which accomplish either of these goals separately. The second result is that matching procedures do exist, however, which always yield a stable outcome and which always give all the agents in one of the two disjoint sets of agents the incentive to reveal their true preferences.
Computation over Mismatched Channels

We consider the problem of distributed computation of a target function over a two-user deterministic multiple-access channel. If the target and channel functions are matched (i.e., compute the same function), significant performance gains can be obtained by jointly designing the communication and computation tasks. However, in most situations there is mismatch between these two functions. In this work, we analyze the impact of this mismatch on the performance gains achievable with joint communication and computation designs over separation-based designs. We show that for most pairs of target and channel functions there is no such gain, and separation of communication and computation is optimal.
Designing Robot Competitions that Promote AI Solutions: Lessons Learned Competing and Designing

Robotics competitions are an educational tool at the middle school, high school, and university levels. The layout, rules, and reward systems of these competitions galvanize students to a specific solution space. From our experiences competing-in and designing such competitions, open-loop, low feedback strategies tend to dominate the winner's circle. If we want competitions to emphasize solutions spaces that include AI-type robot control, contest designs need to favor closed-loop, high feedback strategies. Game elements that encourage such designs are discussed.
Patient-specific simulation as a basis for clinical decision-making

Patient-specific medical simulation holds the promise of determining tailored medical treatment based on the characteristics of an individual patient (for example, using a genotypic assay of a sequence of DNA). Decision-support systems based on patient-specific simulation can potentially revolutionize the way that clinicians plan courses of treatment for various conditions, ranging from viral infections to arterial abnormalities. Basing medical decisions on the results of simulations that use models derived from data specific to the patient in question means that the effectiveness of a range of potential treatments can be assessed before they are actually administered, preventing the patient from experiencing unnecessary or ineffective treatments. We illustrate the potential for patient-specific simulation by first discussing the scale of the evolving international grid infrastructure that is now available to underpin such applications. We then consider two case studies, one concerned with the treatment of patients with HIV/AIDS and the other addressing neuropathologies associated with the intracranial vasculature. Such patient-specific medical simulations require access to both appropriate patient data and the computational resources on which to perform potentially very large simulations. Computational infrastructure providers need to furnish access to a wide range of different types of resource, typically made available through heterogeneous computational grids, and to institute policies that facilitate the performance of patient-specific simulations on those resources. To support these kinds of simulations, where life and death decisions are being made, computational resource providers must give urgent priority to such jobs, for example by allowing them to pre-empt the queue on a machine and run straight away. We describe systems that enable such priority computing.
Nucleosomes undergo slow spontaneous gaping

In eukaryotes, DNA is packaged into a basic unit, the nucleosome which consists of 147 bp of DNA wrapped around a histone octamer composed of two copies each of the histones H2A, H2B, H3 and H4. Nucleosome structures are diverse not only by histone variants, histone modifications, histone composition but also through accommodating different conformational states such as DNA breathing and dimer splitting. Variation in nucleosome structures allows it to perform a variety of cellular functions. Here, we identified a novel spontaneous conformational switching of nucleosomes under physiological conditions using single-molecule FRET. Using FRET probes placed at various positions on the nucleosomal DNA to monitor conformation of the nucleosome over a long period of time (30–60 min) at various ionic conditions, we identified conformational changes we refer to as nucleosome gaping. Gaping transitions are distinct from nucleosome breathing, sliding or tightening. Gaping modes switch along the direction normal to the DNA plane through about 5–10 angstroms and at minutes (1–10 min) time scale. This conformational transition, which has not been observed previously, may be potentially important for enzymatic reactions/transactions on nucleosomal substrate and the formation of multiple compression forms of chromatin fibers.
Chylopericardium in a child with impaired venous access following small bowel transplantation

Bhole V, Gozzini S, Stumper O, Advani S, Sullivan PB, Rodrigues AF, Gupte GL. Chylopericardium in a child with impaired venous access following small bowel transplantation. Pediatr Transplantation 2011: 15:e39–e41. © 2009 John Wiley & Sons A/S.
Service composition using new DSON platform architecture for M2M service

M2M (Machine to Machine) service is a new type of service provided to users across data collection and control of sensor networks. The M2M service will develop into a new service type for surveillance, management and control of smart environments using home network devices, personal smart devices, and personal computers. Presently, studies of new platform architecture, that can provide M2M services, are very lack. This paper suggests a new M2M service platform using the e-DSON (enhanced Dynamic Service Overlay Network). And this paper also describes functions, object structure, and service flow of service composition using the e-DSON platform for the M2M service. The M2M service platform using e-DSON will support enhanced service functions, generality, compatibility, intelligence, and dynamic capability.
Evaluation of Simplexa Flu A/B & RSV for Direct Detection of Influenza Viruses (A and B) and Respiratory Syncytial Virus in Patient Clinical Samples

ABSTRACT We evaluated the performance of the Simplexa Flu A/B & RSV kit on 170 prospective respiratory samples using a modified protocol, supplied by the manufacturer, that eliminates the RNA extraction step. Overall, compared against our laboratory-developed assay, the assay's sensitivity, specificity, and positive and negative predictive values were 95.1%, 99.6%, 98.7%, and 98.6%, respectively.
Effects of probing behaviors to adapt machine autonomy in shared control systems

This paper addresses the adaptability in the human-machine collaboration as a necessary element for the adequate coordination between human and mechanized control. Currently, all efforts to resolve any mismatch between humans and machines are charged only to the human operators as machines have no ability to deal with and adapt to variable behaviors of their human partners. Concerning this issue, inspired by our human proactive actions to the external world, the authors advocate introducing proactive agency into machine autonomies so that they can probe or sound out the partner's covert judgments for their adaptation. This behavioral model is implemented into a simulated shared-control environment, in which both a human operator and a machine autonomy can control the behavior of a mobile robot. This testbed environment is utilized to investigate their joint activity and then discuss feasibility of the co-adaptive approach towards the well-coordinated collaboration by the human operator and the machine autonomy.
Similar Pathogen Targets in Arabidopsis thaliana and Homo sapiens Protein Networks

We study the behavior of pathogens on host protein networks for humans and Arabidopsis - noting striking similarities. Specifically, we preform -shell decomposition analysis on these networks - which groups the proteins into various “shells” based on network structure. We observe that shells with a higher average degree are more highly targeted (with a power-law relationship) and that highly targeted nodes lie in shells closer to the inner-core of the network. Additionally, we also note that the inner core of the network is significantly under-targeted. We show that these core proteins may have a role in intra-cellular communication and hypothesize that they are less attacked to ensure survival of the host. This may explain why certain high-degree proteins are not significantly attacked.
Improved permeance network model for embedded magnet synchronous machines

This paper presents an enhanced Permeance Network Model (PNM) for embedded permanent magnet synchronous machines. PNMs are characterized by very fast and accurate results. Furthermore, this approach overcomes some weaknesses associated to analytical models, such as the impossibility of accurately predicting the embedded magnet machines behavior or taking into account the nonlinear behavior of the magnetic materials. The proposed model is a parameterized, rotor motion accounting, nonlinear PNM capable of computing radial and tangential airgap fluxes, inductances, back electromotive force and electromagnetic torque. The obtained results have been compared with finite-element analysis (FEA) in FLUX2D®, demonstrating the effectiveness of the proposed model.