Miracle-dz/UniFAR-FTUs huggingface dataset:
Thermodynamics meets Special Relativity -- or what is real in Physics?

In this paper we carefully reexamine the various framworks existing in the field of relativistic thermodynamics. We scrutinize in particular the different conceptual foundations of notions like the relativistic work, heat force, moving heat and relativistic temperature. As to the latter notion we argue that, as in ordinary thermodynamics, relativistic absolute temperature should be introduced operationally via relativistic Carnot processes. We exhibit the more implicit or even hidden tacit preassumptions being made and point to a couple of gaps, errors and inconclusive statements in some of the existing literature. We show in particular that there is a wide-spread habit to draw general conclusions from the analysis of too restricted and special thermodynamic processes, e.g. processes with constant pressure, which is dangerous and sometimes leads to wrong results. Furthermore, we give a detailed analysis of the so-called zeroth law of relativistic thermodynamics with the help of a relativistic Carnot process. We rigorously show that, contrary to certain statements in the literature, thermodynamic systems at different relativistic temperatures, moving relative to each other, can thermally stably coexist provided that their respective temperatures obey a certain functional relation (given by the Lorentz factor). This implies however that their respective rest temperatures are the same.
Query-Based Summarization for Search Lists

In this paper we describe a query-based summarization system. We propose a practical approach for this task by identifying the sentences with high query-relevant and high information density. This paper introduces a statistical model for query-relevant summarization: adopt Word overlap feature to capture the power of correlation with the query and mine the relations between the sentences. While the first is executed by computing semantic similarity between the sentence and the query, and the other is executed by using semantic graph. Then these two kinds of features are blessed to score each sentence. At last with the help of MMR for reducing redundancy, we get the summary. Experimental results indicate that this method is encouraging for both those retrieved documents that correspondingly concentrating to one subject and retrieved documents who have many subtopics and comparatively being related to the query.
Development of an Immunofluorescence Assay Using Recombinant Proteins Expressed in Insect Cells To Screen and Confirm Presence of Human Herpesvirus 8-Specific Antibodies

ABSTRACT Human herpesvirus 8 (HHV-8), or Kaposi's sarcoma (KS)-associated herpesvirus, has been linked to all forms of KS. The results of most current serological assays for the detection of HHV-8-specific antibodies have low levels of concordance among themselves. To establish a sensitive and specific testing strategy that can be used to screen for HHV-8-specific antibodies, three HHV-8 proteins, ORF65, ORF73, and K8.1A, were expressed by using baculoviral vectors in insect cells and incorporated into a monoclonal antibody-enhanced immunofluorescence assay (mIFA) termed the Sf9 three-antigen mIFA. The results obtained by this mIFA were compared to those obtained by a standard mIFA with an HHV-8-infected B-cell line (BC3 mIFA). Test sera were obtained from patients diagnosed with KS, human immunodeficiency virus type 1-infected patients at high risk for HHV-8 infection, and healthy controls from a local blood bank. The combined use of both assays had a sensitivity of 94% and a specificity of 96%. The performance of these two assays when they were used together indicates that they may be useful for the reliable detection of HHV-8-specific immunoglobulin G antibodies in a population.
A competition analysis of the single and double disciplines in world-class badminton.

Competition analyses in badminton commonly focus on the singles disciplines while relatively few studies deal with the demands of the doubles disciplines. Knowledge about the characteristics of the doubles disciplines, however, is essential for coaches in elite badminton in order to set up specific endurance training. For this purpose, the time structure of 50 matches of the world’s top ten players in the singles and doubles was investigated. The lowest work to rest ratios were observed in the doubles disciplines (approximately 20 %) except for the ladies’ doubles with 30.1 %. Furthermore, the ladies’ doubles consisted of the longest rallies on average (10.1 s) whilst the rest times did not differ significantly between the disciplines. The men’s and mixed doubles were characterized by the shortest mean rally times of 5.6-6.7 seconds and the highest number of shots per second. These empirical data confirmed the assumed differences between the ladies’ doubles and the other doubles disciplines. When setting up specific training drills the higher frequencies in the doubles disciplines should be taken into consideration. The most common work intervals of 6-10 seconds should be applied and drills with the longest possible work intervals should be incorporated into the specific endurance training.
The Gauss–Poisson Process for Wireless Networks and the Benefits of Cooperation

Gauss-Poisson processes (GPPs) are a class of clustered point processes, which include the Poisson point process as a special case and have a simpler structure than the general Poisson cluster point processes. A key property of the GPP is that it is completely defined by its first- and second-order statistics. In this paper, we first show the properties of the GPP and provide an approach to fit the GPP to a given point set. A fitting example is presented. We then propose the GPP as a model for wireless networks that exhibit clustering behavior and derive the signal-to-interference-ratio distributions for different system models: 1) the basic model where the desired transmitter is independent of the GPP and all nodes in the GPP are interferers; 2) the non-cooperative model where the desired transmitter is one of the nodes in the GPP; and 3) the cooperative model, where the nodes in a GPP cluster transmit cooperatively. The simulation results indicate that a significant gain can be achieved with cooperation.
Virtualization of the Circle of Trust amongst Identity Federations

This paper explores the concepts that enable a more dynamic setup and building of a Circle of Trust (CoT) amongst multiple and overlapped fed-erations. It examines virtualization-building and driving trends, discusses some models of deployment of the CoT and shines a light on the work of the Liberty Alliance Project as a basis for an extended solution for enlarging dynamically the CoT with new entities. Other challenges of this research rely on the administration of the CoT as well as the life cycle of the participants, which imposes an inherent limit on how new Identity and Service Providers can be added to the CoT and how trust relationships can be established between them.
An Efficient Modified K-Means Algorithm To Cluster Large Data-set In Data Mining

Data Mining is the process of extracting hidden and interesting patterns or characteristics from very large datasets and using it in decision making and prediction of future behavior. Clustering is such one of the functionality of data mining. Clustering is the task of segmenting a diverse group into a number of more similar subgroups, or the process of grouping a set of physical or abstract objects into classes of similar objects is called clustering. A cluster is a collection of data objects that are similar to one another within the same cluster and are dissimilar to the objects in other cluster. we proposed an efficient modified K-mean clustering algorithm to cluster large data-sets whose objective is to find out the cluster centers which are very close to the final solution for each iterative steps. Clustering is often done as a prelude to some other form of data mining or modeling. A analysis is performed with the K-Mean and K-Medoid clustering algorithms and the best algorithm in each category was found out based on their performance. The experimental results using the proposed algorithm with a group of randomly constructed data- sets are very promising.
Impact of seawater pCO2 on calcification and Mg/Ca and Sr/Ca ratios in benthic foraminifera calcite: results from culturing experiments with Ammonia tepida

Abstract. Evidence of increasing concentrations of dissolved carbon dioxide, especially in the surface ocean and its associated impacts on calcifying organisms, is accumulating. Among these organisms, benthic and planktonic foraminifera are responsible for a large amount of the globally precipitated calcium carbonate. Hence, their response to an acidifying ocean may have important consequences for future inorganic carbon cycling. To assess the sensitivity of benthic foraminifera to changing carbon dioxide levels and subsequent alteration in seawater carbonate chemistry, we cultured specimens of the shallow water species Ammonia tepida at two concentrations of atmospheric CO2 (230 and 1900 ppmv) and two temperatures (10 °C and 15 °C). Shell weights and elemental compositions were determined. Impact of high and low pCO2 on elemental composition are compared with results of a previous experiment were specimens were grown under ambient conditions (380 ppvm, no shell weight measurements of specimen grown under ambient conditions are, however, available). Results indicate that shell weights decrease with decreasing [CO32−], although calcification was observed even in the presence of calcium carbonate under-saturation, and also decrease with increasing temperature. Thus both warming and ocean acidification may act to decrease shell weights in the future. Changes in [CO32−] or total dissolved inorganic carbon do not affect the Mg distribution coefficient. On the contrary, Sr incorporation is enhanced under increasing [CO32−]. Implications of these results for the paleoceanographic application of foraminifera are discussed.
The Influence of Partial Knee Replacement Designs on Tensile Strain at Implant-Bone Interface

Partial knee replacement (PKR) results in fast recovery and good knee mechanics and is ideal to treat medial knee osteoarthritis. Cementless PKR depends on bone growing into the implant surface for long-term fixation. Implant loosening may occur due to high tensile strain resulted from large mechanical loads during rehab exercises. The purpose of this study is to investigate whether external fixations such as superior screw and frontal flange could reduce the tensile strain at the implant-bone interface. Three medial PKRs were designed. The first PKR had no external fixations. A superior screw and a frontal flange were then added to the first PKR to form the second and third PKR designs, respectively. Finite element analysis was performed to examine the tensile strain at the implant-bone interface during weight-bearing exercises. The PKR with no external fixations exhibited high tensile strain at the anterior implant-bone interface. Both the screwed and flanged PKRs effectively reduced the tensile strain at the anterior implant-bone interface. Furthermore, the flanged PKR resulted in a more uniform reduction of the tensile strain than the screwed PKR. In conclusion, external fixations are necessary to alleviate tensile strain at the implant-bone interface during knee rehab exercises.
Domain and Dialect Adaptation for Machine Translation into Egyptian Arabic

In this paper, we present a statistical machine translation system for English to Dialectal Arabic (DA), using Modern Standard Arabic (MSA) as a pivot. We create a core system to translate from English to MSA using a large bilingual parallel corpus. Then, we design two separate pathways for translation from MSA into DA: a two-step domain and dialect adaptation system and a one-step simultaneous domain and dialect adaptation system. Both variants of the adaptation systems are trained on a 100k sentence tri-parallel corpus of English, MSA, and Egyptian Arabic generated by a rule-based transformation. We test our systems on a held-out Egyptian Arabic test set from the 100k sentence corpus and we achieve our best performance using the two-step domain and dialect adaptation system with a BLEU score of 42.9.
Analysis and simulation of traffic control algorithm for packet switching networks

A challenging research issue in high-speed networking is how to control the transmission rate of statistical data flows. This paper describes a new algorithm, Virtual-Clock, for data traffic control in high-speed networks. Virtual-Clock maintains the statistical multiplexing flexibility of packet switching while ensuring each data flow its reserved average throughput rate at the same time. The algorithm has been tested through simulation.
Is the Same Instance Type Created Equal? Exploiting Heterogeneity of Public Clouds

Public cloud platforms might start with homogeneous hardware; nevertheless, because of inevitable hardware upgrades, or adding more capacity, the initial homogeneous platform will gradually evolve into heterogeneous as time passes by. The consequent performance heterogeneity is of concern to cloud users. In this paper, we evaluate performance variations from hardware heterogeneity and scheduling mechanisms of public clouds. Amazon Elastic Compute Cloud (Amazon EC2) and Rackspace Cloud are used as the representatives because of their relatively long record and wide usage among small and medium enterprises (SMEs). A comprehensive set of microbenchmarks and application-level macrobenchmarks have been used to investigate performance variation. Several major contributions have been made. First, we find out that heterogeneous hardware is a commonality among the relatively long-lasting cloud platforms, although the level of heterogeneity varies. Second, we observe that heterogeneous hardware is the primary culprit of performance variation of cloud platforms. Third, we discover that varied CPU acquisition percentages and different virtual machine scheduling mechanisms exacerbate the performance variation problem, especially for network related operations. Finally, based on the observations, we propose cost-saving approaches and analyze Nash equilibrium from cloud user perspective. By using a simple "trial-and-better" approach, i.e., keep good-performing instances and discard bad-performing instances, cloud users can achieve up to 30 percent cost saving.
A new quantization method for 3-D seismic visualization

The seismic data is a kind of high dynamic range data, which is very difficult to realize high-quality visualization. In this paper, we present a new method to scale the high-dynamic-range seismic data for visualization, which can quantize the high-dynamic-range data into the low-dynamic-range data, while preserving the high frequency characteristics of the geological structure. We divide the seismic data into two parts, the large-scale geological structure part and the small-scale geological structure part. The large-scale part is obtained using an edge-preserving filter called bilateral filter. Then the small-scale part and the processed large-scale part are merged into a new seismic data. Finally, the new generated data is scaled by the histogram-based quantization algorithm to a low-dynamic-range data. In this paper, we discuss and implement our quantization algorithm, and give the results.
Home-based SVM Protocols for SMP Clusters : Design , Implementation

Shared virtual memory has been used as a cost-eeective means of providing the attractive shared-memory model to programmers. In the past, most SVM implementations have been focussed on clusters of uniprocessor systems. Due to the increasing popularity and declining costs of small scale shared memory multiprocessor systems (SMPs), they have become attractive candidates for replacing the uniprocessor nodes when building a shared virtual memory layer. At present, there is no deenite answer on what is the best approach to implementing an SVM layer for a cluster of SMPs, whether such a protocol is necessarily diierent from one designed for uniprocessor nodes, and what accepts of this diierence actually results in increases in performance. To answer these questions and explore the design space of SVM on SMPs, we have implemented a home-based lazy release consistency (HLRC) protocol on a cluster of 4-way Intel PentiumPro SMPs interconnected with Myrinet. This paper presents numerous protocol design options we were faced with and their implications. We are able to achieve very promising performance on some applications investigated so far. We have investigated (quantitatively) the tradeoos in our system to validate some of the choices we have made. The tradeoo investigation is ongoing, and we will complete it for the nal paper.
Passenger/pedestrian analysis by neuromorphic visual information processing

The physiological studies since the Hubel and Wiesel’s experimentation of cat’s visual cortex have confirmed the consensus about the brain’s intelligence of visual perception. A new way of enhancing the safety of vehicle is proposed by employing the neuromorphic VLSI (Very Large Scale Integration) or processing for mimicking the robust and natural intelligence of visual recognition, inspired by both the Hubel and Wiesel’s experimentation of visual cortex and the neurophysiological model of Hodgkin-Huxley formalism. The feasibility of neuromorphic system is demonstrated successfully for the robust recognition of human objects for the safety either in the car or on the road, evaluating the neuromorphic VLSI implementation based on the controlled CMOS (complementary metal-oxide-semiconductor) conductance for the bio-plausible performance. The neuromorphic visual information processing is developed for both applications of the driver/occupant analysis in the car and the human object detection on the road. The neuromorphic vision research was motivated by the status analysis of the human posture and safety apparatus for the innovation of the emergency rescue service dealing with the crash accidents, and extended its applications to the safety technology of assisting the vehicle drive by detecting nearby pedestrians or human objects. The overall performance is measured with the success rate over 90%, for both the pedestrian detection and the occupant monitoring, in day or night. The most of human object detections are based on the neuromorphic visual information processing using the still image from the video sensor, because of the limited sight condition. The appropriate use of orientation feature extraction and neural networks ensures the reliability of proposed neuromorphic visual information processing to perform well under various dynamic conditions, such as in the changing ambient light, in night time, or in wet weather which are inevitable for vehicles on the road. The detection of pedestrian or cyclist performs consistently in wide ranges of environment, evaluated in various times and places of Europe and Asia. The recognition of driver’s eye sight is proved as an added function within the framework of proposed neuromorphic system, to match the varying driver’s eye sight for controlling the eyeglassless 3D dashboard display. The same principle is applicable to detect any particular part or pose of human object, and the neuromorphic visual processing system can accommodate the enforced adaptation or learning as it mimics the natural brain. The neuromorphic coupled with neural networks, suggests it as the new feasible and robust device with the convergence of biological neural system and information technology, or as the cost effective and reliable device of vehicle’s safety enhancement by using the CMOS neuromorphic VLSI approach.
A CLASSIFICATION OF RAPIDLY GROWING RAMSEY FUNCTIONS

Let f be a number-theoretic function. A finite set X of natural numbers is called f-large if card(X) greater than or equal to f(min(X)). Let PHf be the Paris Harrington statement where we replace the largeness condition by a corresponding f-largeness condition. We classify those functions f for which the statement PHf is independent of first order (Peano) arithmetic PA. If f is a fixed iteration of the binary length function, then PHf is independent. On the other hand PHlog* is provable in PA. More precisely let f(alpha)( i) := \i\H-alpha(-1) (i) where \i\(h) denotes the h-times iterated binary length of i and H-alpha(-1) denotes the inverse function of the alpha-th member H-alpha of the Hardy hierarchy. Then PHfalpha is independent of PA (for alpha less than or equal to epsilon(0)) iff alpha = epsilon(0).
Multiscale contrast enhancement with applications to image fusion

A method to merge images from different sensing modalities for visual display was introduced by Toet, van Ruyven, and Valeton in 1989, which produces a fused image by nonlinear recombination of the ratio of low-pass (R0LP) pyramidal decompositions ofthe original images. The appearance of merged images that are produced by this scheme is highly dependent on the contrast and mean gray level ofthe input images. That nonlinear multiplication of the successive layers of a ratio of low-pass pyramid results in a contrast-enhanced image representation that is highly invariant for changes in the global gray-level characteristics of the original image is shown. Application of this nonlinear multiplication procedure in the image fusion process results in composite images that appear highly independent of changes in lighting and gray-level gradients in the input images. The method is tested by merging different degraded versions of parallel registered thermal (FLIR) and visual (CCD) images.
Distributed slot synchronization algorithm using average weighting for adhoc networks

In order to decrease the complexity of popular distributed slot synchronization algorithms for adhoc networks, a new method using average weighting is proposed based on Vicsek model, which is basic model of multi-agent systems. The slot starting time of each node is updated by using a simple local rule based on the average of its own slot starting time plus neighbors. Finally, all nodes have the same slot starting time and the synchronization of adhoc networks is achieved. The convergence of this method under different topology patterns is analyzed, and the result indicate that the method has good applicability and fast convergence rate.
Development and the Tolerance for Inequality

This paper tests the validity of the claim that inequality leads to political instability, as well as several other hypotheses about the tolerance for inequality. Using data from the Social Conflict in Africa Database, I examine macro-level implications of micro-level theories about grievances and collective action, complementing earlier research on the individual-level correlates of protest participation. I find that inequality is associated with more frequent protests about economic issues, as is the complexity of a country’s economy. I also replicate the earlier findings that democracies are more protest-prone and that military repression or the threat of military repression discourages protests. Analyses do not support a set of hypotheses derived from classic theories about urban bias, the tunnel effect, and the ostentation signaling effect.