Miracle-dz/UniFAR-FTUs huggingface dataset:
Applications of Thread Prioritization in SMT Processors

Previous work in multithreading, and specifically in simultaneous multithreading (SMT), has focused primarily on increasing total instruction throughput. While this focus is sufficient in some application domains, widespread deployment of multithreaded processors will require robust behavior across a variety of platforms. For instance, interactive systems must be concerned with the execution latency of foreground userinterface threads. Multiuser systems must be concerned with fair allocation of throughput among competing users. A multithreaded processor that seeks solely to maximize throughput will favor efficient threads at the expense of any potential latency or fairness
Adaptive Resource Allocation in Multiuser OFDM System Based on Genetic Algorithm

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless local area network systems. The capacity of MU-OFDM can be maximized as long as subchannels and power are allocated adaptively, a new method based on genetic algorithm (GA) is proposed for adaptive power allocation in MU-OFDM system. Some proportional fairness constraints are also added to assure that each user can achieve a required data rate. Each subchannel to the user with the best channel-to-noise ratio has been assigned and an optimal power allocation algorithm based on GA has been proposed. The results demonstrate that the new method we proposed is optimal and efficient to resource allocation.
Payoff suboptimality and errors in value induced by approximation of the Hamiltonian

Dynamic programming reduces the solution of optimal control problems to solution of the corresponding Hamilton-Jacobi-Bellman partial differential equations (HJB PDEs). In the case of nonlinear deterministic systems, the HJB PDEs are fully nonlinear, first-order PDEs. Standard, grid-based techniques to the solution of such PDEs are subject to the curse-of-dimensionality, where the computational costs grow exponentially with state-space dimension. Among the recently developed max-plus methods for solution of such PDEs, there is a curse-of-dimensionality-free algorithm. Such an algorithm can be applied in the case where the Hamiltonian takes the form of a pointwise maximum of a finite number of quadratic forms. In order to take advantage of this curse-of-dimensionality-free algorithm for more general HJB PDEs, we need to approximate the general Hamiltonian by a maximum of these quadratic forms. In doing so, one introduces some errors. In this work, we obtain a bound on the difference in solution of two HJB PDEs, as a function of a bound on the difference in the two Hamiltonians. Further, we obtain a bound on the suboptimality of the controller obtained from the solution of the approximate HJB PDE rather than from the original.
A Note on WACC Calculations in Practice: Incorrect Calculations Due to Unnecessary Inconsistent Assumptions on the Cost of Debt

This note reveals that in practical applications the weighted average cost of capital (WACC) is often incorrectly estimated. The error occurs due to the implicit assumption that the beta of debt is zero, while calculating with a cost of debt that is above the risk free rate. It is shown how this error can be avoided, if the cost of debt is known. It is also demonstrated how the error can be mitigated, if the cost of debt is unknown and how the impact of a misestimated cost of debt can be reduced. Compared to the most common approach of estimating the after-tax WACC, a better estimate can be found without the need for an explicit estimation of the cost of debt - i.e. this note shows how a better WACC estimate can be found with less effort.
A GPU-based implementation on super-resolution reconstruction

Super-resolution reconstruction (SRR) proposes a fusion of several low-quality images into one higher quality result with better optical resolution. However, due to the vast amount of calculation of the SRR algorithm, its implementation is too slow. In this paper, we present a GPU-based parallel implementation on SRR algorithm. The compute unified device architecture (CUDA) is a programming approach for performing scientific calculations on a graphics processing unit (GPU) as a data-parallel computing device. The proposed GPU-based implementation using CUDA is up to approximately 200 times faster than the corresponding optimized CPU counterparts.
Bootstrapping the Interactome: Unsupervised Identification of Protein Complexes in Yeast

Protein interactions and complexes are important components of biological systems. Recently, two genome-wide applications of tandem affinity purification (TAP) in yeast have increased significantly the available information on interactions in complexes. Several approaches have been developed to predict protein complexes from these measurements, which generally depend heavily on additional training data in the form of known complexes. In this article, we present an unsupervised algorithm for the identification of protein complexes which is independent of the availability of such additional complex information. Based on a Bootstrap approach, we calculate intuitive confidence scores for interactions more accurate than all other published scoring methods and predict complexes with the same quality as the best supervised predictions. Although there are considerable differences between the Bootstrap and the best published predictions, the set of consistently identified complexes is more than four times as large as for complexes derived from one data set only. Our results illustrate that meaningful and reliable complexes can be determined from the purification experiments alone. As a consequence, the approach presented in this article is easily applicable to large-scale TAP experiments for any species even if few complexes are already known.
Incidence of and risk factors for adverse events associated with distemper and rabies vaccine administration in ferrets.

OBJECTIVE To determine incidence of and risk factors for adverse events associated with distemper and rabies vaccine administration in ferrets. DESIGN Retrospective cohort study. ANIMALS 3,587 ferrets that received a rabies or distemper vaccine between January 1, 2002, and December 31, 2003. PROCEDURES Electronic medical records were searched for possible vaccine-associated adverse events. Adverse events were classified by attending veterinarians as nonspecific vaccine reactions, allergic reactions, or anaphylaxis. Patient information that was collected included age, weight, sex, cumulative number of distemper and rabies vaccinations received, clinical signs, and treatment. The association between potential risk factors and occurrence of an adverse event was estimated with logistic regression. RESULTS 30 adverse events were recorded. The adverse event incidence rates for administration of rabies vaccine alone, distemper vaccine alone, and rabies and distemper vaccines together were 0.51%, 1.00%, and 0.85%, respectively. These rates were not significantly different. All adverse events occurred immediately following vaccine administration and most commonly consisted of vomiting and diarrhea (52%) or vomiting alone (31%). Age, sex, and body weight were not significantly associated with occurrence of adverse events, but adverse event incidence rate increased as the cumulative number of distemper or rabies vaccinations received increased. In multivariate logistic regression analysis, only the cumulative number of distemper vaccinations received was significantly associated with the occurrence of an adverse event. CONCLUSIONS AND CLINICAL RELEVANCE Results suggest that in ferrets, the risk of vaccine-associated adverse events was primarily associated with an increase in the number of distemper vaccinations.
Enhancing in vehicle digital maps via GPS crowdsourcing

In this paper, we propose a simple and effective method to extend digital maps with the location and timing of stop-signs and traffic lights in a city, given GPS traces collected by on-road vehicles. Our system finds the location and timing of traffic lights and stop-signs using a small number of traces per road segment. We developed and evaluated the system by applying it to two sets of GPS traces — open street map, a multicity, publicly available database of GPS traces, and a set of traces collected in west Los Angeles. Evaluation results show that our system can estimate the location of stop-signs with as little as 5 traversal per road segment and the location/timing of traffic lights with as little as 7 traversals, with more than 90% accuracy.
The menu-size complexity of auctions

We consider the menu size of auctions as a measure of auction complexity and study how it affects revenue. Our setting has a single revenue-maximizing seller selling two or more heterogeneous items to a single buyer whose private values for the items are drawn from a (possibly correlated) known distribution, and whose valuation is additive over the items. We show that the revenue may increase arbitrarily with menu size and that a bounded menu size can not ensure any positive fraction of the optimal revenue. The menu size turns out to "nail down" the revenue properties of deterministic auctions: their menu size may be at most exponential in the number of items and indeed their revenue may be larger than that achievable by the simplest types of auctions by a factor that is exponential in the number of items but no larger. Our model is related to a previously studied "unit-demand" model and our results also answer an open problem in that model.
THE CONTRACTION MAPPING THEOREM

Let f : X → X be a mapping from a set X to itself. We call a point x ∈ X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval then any continuous function f : [a, b] → [a, b] has at least one fixed point. This is a consequence of the intermediate value theorem, as follows. Since f(a) ≥ a and f(b) ≤ b, we have f(b) − b ≤ 0 ≤ f(a) − a. The difference f(x)− x is continuous, so by the intermediate value theorem 0 is a value of f(x)−x for some x ∈ [a, b], and that x is a fixed point of f . Of course, there could be more than one fixed point. We will discuss here the most basic fixed-point theorem in analysis. It is due to Banach and appeared in his Ph.D. thesis (1920, published in 1922).
Tool based implementation of SQL injection for penetration testing

Web applications are a fundamental pillar of today's world. Society depends on them for business and day to day tasks. Because of their extensive use, Web applications are under constant attack by hackers that exploit their vulnerabilities to disrupt business and access confidential information. SQL Injection and Remote File Inclusion are the two most frequently used exploits and hackers prefer easier rather than complicated attack techniques. Every day as number of Internet users are increasing, the vulnerabilities of a system being attacked is becoming easier. SQL Injection is one of the most common attack method that is being used these days. Havij is one of the tools used to implement SQL Injection which will be discussed in this paper. Our research objective is to analyse the use of Havij in penetration testing in IT industry and to compare various SQL Injection tools available in the market.
Justice Within Social Dilemmas

The defining feature of social dilemma situations is the inherent conflict faced by those involved: should one act in his or her own individual best interest or sacrifice a measure of one's personal payoff to help maximize the joint payoff of the group as a whole? In such dilemmas, those making individualistic and defecting choices are always at a competitive advantage relative to those who choose to cooperate. One seemingly inevitable consequence of the resulting resource allocation asymmetry is that it must challenge and threaten the cooperator's sense of fairness and justice, and it is the reaction of those caught in social dilemmas to this injustice and unfairness that is the focus of this article. We examine how justice processes-distributive justice, procedural justice, restorative justice, and retributive justice operate in social dilemmas. Within this examination, we consider ideas from classic and contemporary conceptual analyses of justice to provide a broader context within which to understand social dilemmas and the roles that justice plays as people strive to ensure fair outcomes for themselves and for others. We conclude with the proposal of a 4-stage, sequential model of justice in social dilemmas that posits groups move between the types of justice concerns when unfair and unsatisfactory outcomes (e.g., inequitable resource allocations, violations of agreed-on allocation rules, intentional and egregious exploitation of the group) cause members to “recognize the necessity” for change to ensure fair and just outcomes for all.
A Survey of Machine Translation Techniques and Systems for Indian Languages

Machine Translation pertains to translation of one natural language to other by using automated computing. The main objective is to fill the language gap between two different languages speaking people, communities or countries. In India, we have multiple and hugely diverse languages and scripts, hence scope and need of language translation is immense. In this paper, we focus on the current scenario of research in machine translation in India. We have reviewed various important Machine Translation Systems (MTS) and presented preliminary comparison of the core methodology as used by them.
Staffing Policies and Strategic Control in British Multinationals

While the effective management of human resources is increasingly being recognized as a major determinant of success or failure in international business (Tung, 1984), in practice many organizations are still coming to terms with the human resources issues associated with international operations (Dowling, 1986). In the international arena, the quality of management seems to be even more critical than in domestic operations (Tung, 1984, p. 129). This is primarily because the nature of international business operations involves the complexities of operating in different countries and employing different national categories of workers (Morgan, 1986, p. 44). Yet, while it is recognized that HRM problems become more complex in the international arena, there is evidence to suggest that many companies underestimate the complexities involved in international operations. The field of international human resource management, however, is only slowly developing as a field of academic study and has been described by one authority as being in the infancy stage (Laurent, 1986, p. 91). Moreover, there is relatively little empirical research that documents the international HRM strategies and practices of international firms particularly firms that have their headquarters outside North America.
Outdoor View Recognition Based on Landmark Grouping and logistic Regression

Vision-based robot localization outdoors has remained more elusive than its indoors counterpart. Drastic illumination changes and the scarceness of suitable landmarks are the main difficulties. This paper attempts to surmount them by deviating from the main trend of using local features. Instead, a global descriptor called landmark-view is defined, which aggregates the most visually-salient landmarks present in each scene. Thus, landmark co-occurrence and spatial and saliency relationships between them are added to the single landmark characterization, based on saliency and color distribution. A suitable framework to compare landmark-views is developed, and it is shown how this remarkably enhances the recognition performance, compared against single landmark recognition. A view-matching model is constructed using logistic regression. Experimentation using 45 views, acquired outdoors, containing 273 landmarks, yielded good recognition results. The overall percentage of correct view classification obtained was 80.6%, indicating the adequacy of the approach.
Research Statement Erez Louidor 1 Overview

• Generalized a known method for computing lower bounds on the capacity for a class of 2-dimensional constrained channels. Using the new method, I improved the previous best lower bounds on the capacities of 2 constrained channels in this class. • Showed how to obtain estimates on the capacity for a class of 2-dimensional constrained channels which are not of finite-type. • Computed the exact capacities for two families of multidimensional constrained channels. • Explicitly determined the so-called “tradeoff function” for 2 classes of runlength-limited (RLL) constrained channels. • Showed a sufficient condition for the capacity of a multidimensional constrained channel to approach 0 as the number of dimensions grows to infinity. This result partially answers a question of [21].
The Platform Configuration for Product Family Production

The focus of manufacturing has been shifting from mass production to mass customization and producers are seeking ways to reduce production costs, still offering a competitive basket of products. One approach for implementing mass customization is to develop or produce products based on platform architecture. We propose a platform based approach for the production of a product family under demand uncertainty. Using this approach, every product variant in the family may either be assembled directly from its components, or from any platform whose component set resembles those required by the product. The methodology seeks to minimize the overall production costs of the products, which include the costs of production, and holding cost of unused platform inventory and shortage cost of lost demands of products, while considering the stochastic demand of each product type. The problem is formulated as a two stage stochastic programming model with recourse. The platform formation problem for the economic production of a product family with stochastic demand of each of the product is modeled as a general optimization problem.
Specification of Transactional Requirements for Web Services using Recoverability

In Service-Oriented Computing SOC, a business transaction comprises of several web services provided by multiple enterprises. The transactional behaviour of individual web services must be considered for service selection so that the composition of web services results in a reliable execution. It is difficult for a business analyst to envisage the desired business policies of a process in terms of transactional properties of the corresponding service. Hence, an abstract mechanism that enables the business analyst to specify the transactional properties in a simple manner must be introduced. Towards this objective, it is proposed to express the transactional properties in terms of the recoverability of services. The transactional web services are grouped into different levels of recoverability based on their recovery cost. The estimated recovery costs are empirically verified and validated.
Investigating Therapist Reflective Functioning, Therapeutic Process, and Outcome

Grounded in a view of the therapeutic alliance as a process of intersubjective negotiation between patient and therapist, this study examines therapist reflective functioning (RF) as a predictor of process and outcome of psychotherapy in 43 cases of brief relational therapy. Psychotherapy process was measured with the Working Alliance Inventory, Session Evaluation Questionnaire, and a measure of rupture resolution. Outcome was measured with the Symptom Checklist Revised–90 (SCL-90) and the Inventory of Interpersonal Problems–32 (IIP-32) at intake, termination, and 6-month follow-up. Analyses revealed that higher therapist RF predicted greater therapist-reported Working Alliance Inventory, greater patient-reported depth, and greater reported degree of resolving ruptures from both patients’ and therapists’ perspectives. Therapist RF was correlated with increased self-reported symptoms on SCL-90 and IIP-32 from intake to termination. Therapist RF was correlated with a decrease in symptoms on SCL-90 and interpersonal problems on IIP-32 from termination to 6-month follow-up. The results are consistent with the hypothesis that therapists’ capacity for mentalization is associated with greater depth of in-session exploration and greater success in resolving in-session ruptures allowing for the potential facilitation of greater patient change.
A shared augmented virtual environment for real‐time mixed reality applications

Headsets for virtual reality such as head‐mounted displays have become ubiquitous and bring immersive experiences to individual users. People who stand outside the virtual world may want to share the same scenes that are shown on the screen of the headset. It is therefore of great importance to merge real and virtual worlds into the same environment, where physical and virtual objects exist simultaneously and interact in real time. We propose shared augmented virtual environment (SAVE), a mixed reality (MR) system that overlays the virtual world with real objects captured by a Kinect depth camera. We refine the depth map and exploit a Graphics Processing Unit (GPU) based natural image matting method to obtain the real objects from cluttered scenes. In the synthetic MR world, we can render real and virtual objects in real time and handle the depth from both worlds properly. The advantage of our system is that we connect the virtual and real worlds with a bridge controller mounted on the Kinect and need to calibrate the whole system only once before use. Our results demonstrate that the proposed SAVE system is able to create high‐quality 1080p live MR footage, enabling realistic virtual experiences to be shared among a number of people in potential applications such as education, design, and entertainment.
Morphological Brain Changes after Climbing to Extreme Altitudes—A Prospective Cohort Study

Background Findings of cerebral cortical atrophy, white matter lesions and microhemorrhages have been reported in high-altitude climbers. The aim of this study was to evaluate structural cerebral changes in a large cohort of climbers after an ascent to extreme altitudes and to correlate these findings with the severity of hypoxia and neurological signs during the climb. Methods Magnetic resonance imaging (MRI) studies were performed in 38 mountaineers before and after participating in a high altitude (7126m) climbing expedition. The imaging studies were assessed for occurrence of new WM hyperintensities and microhemorrhages. Changes of partial volume estimates of cerebrospinal fluid, grey matter, and white matter were evaluated by voxel-based morphometry. Arterial oxygen saturation and acute mountain sickness scores were recorded daily during the climb. Results On post-expedition imaging no new white matter hyperintensities were observed. Compared to baseline testing, we observed a significant cerebrospinal fluid fraction increase (0.34% [95% CI 0.10–0.58], p = 0.006) and a white matter fraction reduction (-0.18% [95% CI -0.32–-0.04], p = 0.012), whereas the grey matter fraction remained stable (0.16% [95% CI -0.46–0.13], p = 0.278). Post-expedition imaging revealed new microhemorrhages in 3 of 15 climbers reaching an altitude of over 7000m. Affected climbers had significantly lower oxygen saturation values but not higher acute mountain sickness scores than climbers without microhemorrhages. Conclusions A single sojourn to extreme altitudes is not associated with development of focal white matter hyperintensities and grey matter atrophy but leads to a decrease in brain white matter fraction. Microhemorrhages indicative of substantial blood-brain barrier disruption occur in a significant number of climbers attaining extreme altitudes.