Miracle-dz/UniFAR-FTUs huggingface dataset:
Solving the Balance Problem of On-Line Role-Playing Games Using Evolutionary Algorithms

In on-line role-playing games (RPG), each race holds some attributes and skills. Each skill contains several abilities such as physical damage, hit rate, etc. Parts of the attributes and all the abilities are a function of the character’s level, which are called Ability-Increasing Functions (AIFs). A well-balanced on-line RPG is characterized by having a set of well-balanced AIFs. In this paper, we propose an evolutionary design method, including integration with an improved Probabilistic Incremental Program Evolution (PIPE) and a Cooperative Coevolutionary Algorithm (CCEA), for on-line RPGs to maintain the game balance. Moreover, we construct a simplest turn-based game model and perform a series of experiments based on it. The results indicate that the proposed method is able to obtain a set of well-balanced AIFs efficiently. They also show that in this case the CCEA outperforms the simple genetic algorithm, and that the capability of PIPE has been significantly improved through the improvement work.
Intermediate filaments formed de novo from tail-less cytokeratins in the cytoplasm and in the nucleus

The roles of the different molecular domains of intermediate filament (IF) proteins in the assembly and higher order organization of IF structures have recently been studied by various groups but with partially controversial results. To examine the requirement of the aminoterminal (head) and the carboxyterminal (tail) domain of cytokeratins (CKs) for de novo IF formation in the living cell, we have constructed cDNAs coding for intact as well as head- and/or tail-less human CKs 8 and 18 and the naturally tail-less human CK 19, all under the control of the human beta-actin promoter. After transient and stable transfections of mouse 3T3-L1 cells, which are devoid of any CKs, we have studied, with such constructs, the resulting gene products by gel electrophoresis and immunolocalization techniques. By light and electron microscopy we show that extended cytoplasmic IF meshworks are formed from pairs of the type II CK 8 with the type I CKs 18 or 19 as well as from pairs of tail-less CK 8 with tail-less CKs 18 or 19 in the transfected cells, proving that the absence of the tail domain in both types of CKs does not prevent the de novo formation of regular IFs. Most surprisingly, however, we have observed spectacular alterations in the nucleocytoplasmic distribution of the IFs formed from tail-less CKs. In many of the transfected cells, a large part, or all, of the detectable CKs was found to occur in extensive IF bundles in the nucleoplasm. Intranuclear accumulations of CK deposits, however mostly nonfibrillar, were also observed when the cells had been transfected with cDNAs encoding tail-less CKs also lacking their head domains, whereas CKs deleted only in the head domain were found exclusively in the cytoplasm. The specific domain requirements for the assembly of cytoplasmic IF bundles are discussed and possible mechanisms of intranuclear accumulation of IFs are proposed.
Establishment of a Murine Graft-versus-Myeloma Model Using Allogeneic Stem Cell Transplantation

Background Multiple myeloma (MM) is a malignant plasma cell disorder with poor long-term survival and high recurrence rates. Despite evidence of graft-versus-myeloma (GvM) effects, the use of allogeneic hematopoietic stem cell transplantation (allo-SCT) remains controversial in MM. In the current study, we investigated the anti-myeloma effects of allo-SCT from B10.D2 mice into MHC-matched myeloma-bearing Balb/cJ mice, with concomitant development of chronic graft-versus-host disease (GvHD). Methods and results Balb/cJ mice were injected intravenously with luciferase-transfected MOPC315.BM cells, and received an allogeneic (B10.D2 donor) or autologous (Balb/cJ donor) transplant 30 days later. We observed a GvM effect in 94% of the allogeneic transplanted mice, as the luciferase signal completely disappeared after transplantation, whereas all the autologous transplanted mice showed myeloma progression. Lower serum paraprotein levels and lower myeloma infiltration in bone marrow and spleen in the allogeneic setting confirmed the observed GvM effect. In addition, the treated mice also displayed chronic GvHD symptoms. In vivo and in vitro data suggested the involvement of effector memory CD4 and CD8 T cells associated with the GvM response. The essential role of CD8 T cells was demonstrated in vivo where CD8 T-cell depletion of the graft resulted in reduced GvM effects. Finally, TCR Vβ spectratyping analysis identified Vβ families within CD4 and CD8 T cells, which were associated with both GvM effects and GvHD, whereas other Vβ families within CD4 T cells were associated exclusively with either GvM or GvHD responses. Conclusions We successfully established an immunocompetent murine model of graft-versus-myeloma. This is the first murine GvM model using immunocompetent mice that develop MM which closely resembles human MM disease and that are treated after disease establishment with an allo-SCT. Importantly, using TCR Vβ spectratyping, we also demonstrated the presence of GvM unique responses potentially associated with the curative capacity of this immunotherapeutic approach.
A two-stage-training support vector machine approach to predicting unintentional vehicle lane departure

ABSTRACT Advanced driver assistance systems, such as unintentional lane departure warning systems, have recently drawn much attention and efforts. In this study, we explored utilizing the nonlinear binary support vector machine (SVM) technique to predict unintentional lane departure, which is innovative, as the SVM methodology has not previously been attempted for this purpose in the literature. Furthermore, we developed a two-stage training scheme to improve SVM's prediction performance in terms of minimization of the number of false positive prediction errors. Experiment data generated by VIRTTEX, a hydraulically powered, 6-degrees-of-freedom moving base driving simulator at Ford Motor Company, were used. All the vehicle variables were sampled at 50 Hz and there were 16 drowsy drivers (about 3 hours of driving per subject) and six control drivers (approximately 20 minutes f driving each). In total, 3,508 unintentional lane departures occurred for the drowsy drivers and 23 for the control drivers. Our study involving these 22 drivers with a total of more than 7.5 million prediction decisions demonstrates that (a) excellent SVM prediction performance, measured by numbers of false positives (i.e., falsely predicted lane departures) and false negatives (i.e., lane departures failed to be predicted), was achieved when the prediction horizon was 0.6 seconds or less, (b) lateral position and lateral velocity worked the best as SVM input variables among the nine variable sets that we explored, and (c) the radial basis function performed the best as the SVM kernel function.
Rotating magnetic solution in three dimensional Einstein gravity

We obtain the magnetic counterpart of the BTZ solution, i.e., the rotating spacetime of a point source generating a magnetic field in three dimensional Einstein gravity with a negative cosmological constant. The static (non-rotating) magnetic solution was found by Clement, by Hirschmann and Welch and by Cataldo and Salgado. This paper is an extension of their work in order to include (i) angular momentum, (ii) the definition of conserved quantities (this is possible since spacetime is asymptotically anti-de Sitter), (iii) upper bounds for the conserved quantities themselves, and (iv) a new interpretation for the magnetic field source. We show that both the static and rotating magnetic solutions have negative mass and that there is an upper bound for the intensity of the magnetic field source and for the value of the angular momentum. The magnetic field source can be interpreted not as a vortex but as being composed by a system of two symmetric and superposed electric charges, one of the electric charges is at rest and the other is spinning. The rotating magnetic solution reduces to the rotating uncharged BTZ solution when the magnetic field source vanishes.
Using arithmetic transform for verification of datapath circuits via error modeling

In this paper, we consider verification under error-model assumption. We exploit the algebraic properties of the arithmetic transforms that are used in compact graph-based representations of arithmetic circuits, such as *BMDs. Verification time can be shortened under the assumption of corrupting a bounded number of transform coefficients. Bounds are derived for a number of test vectors, and the vectors successfully verified arithmetic circuits under a class of error models derived from recently proposed basic design error classes, including single stuck-at faults.
Research on the networked control system technology applied in Intelligent Building

Intelligent Building is a Networked Control System (NCS) actually, and NCS is the research focus and the future development trend. Therefore, it is significant to research the NCS applied in Intelligent Building. In this paper, according to Intelligent Building, the application research based on NCS technology is proposed from the system prospect. The data transmission in Intelligent Building network is analyzed through the network information scheduling, and scheduling algorithm is also adopted, which can guarantee data transmission in the subsystem of Intelligent Building, improve network utilization and keep the system operate in stable state. Finally, simulation is conducted by Truetime toolbox.
Prevalence of excessive internet use and its correlation with associated psychopathology in 11th and 12th grade students

Background Globally, the number of internet users has crossed the three-billion mark, while in India users grew over 17% in the first 6 months of 2015 to 354 million. This study presented a background on internet use and the existence of excessive internet use. Aim To study the extent of internet use in 11th and 12 grade students and the psychopathology, if any, associated with excessive internet use. Methods 426 students who met the inclusion criteria were recruited from 11th and 12th grade classes from Kendriya Vidyalaya, New Delhi, India, and were assessed by Young’s Internet Addiction Test and the Strength and Difficulties Questionnaire. Results Among the 426 students, the mean internet addiction total score was 36.63 (20.78), which indicated mild level of internet addiction. 1.41% (six students) was diagnosed as excessive internet users, while 30.28% and 23.94% were classified as moderate and mild internet users, respectively. The prevalence of internet addiction between gender was 58.22% in males and 41.78% in females. While both positive (prosocial) and negative (hyperactivity, emotional, conduct and peer problem) impacts of internet use were reported by students, in the current study excessive use of internet had a negative impact on students’ lives as compared with positive impact, which was statistically significant (p<0.0001). Conclusion Excessive internet use led to abnormal behaviours which cause negative consequences to users. Early diagnosis of risk factors related to excessive internet use, provides education about responsible use and supervision of students by family members.
An Intersection Based Routing Protocol for Vehicular Ad Hoc Networks

Vehicular ad hoc networks (VANETs) allow vehicles to form a self-organized network without the need for permanent infrastructure . As a prerequisite to communication, an efficient route between network nodes must be established, and it must adapt to the rapidly ch anging topology of vehicles in motion. This is the aim of VANET routing protocols. In this paper we analyse a n intersection based routing (GYTAR) approach that makes use of the navigational systems of vehicles. Inters ection based routing can eliminate the problem of g eographic source routing. By means of simulation we compare this approach with position-based ad hoc routing str ategy (geographic Source Routing). Simulation results show significant performance improvement in terms of pa cket delivery ratio, end-to-end delay, and routing overh ead.
Blind OFDM Systems Parameters Estimation for Software Defined Radio

In this paper, a blind OFDM system parameters estimation method for software defined radio (SDR) is proposed. This method sequentially estimate the sampling frequency, the number of subcarriers, the CP length as well as the timing and frequency offset in OFDM systems. The blind estimation is based on a combination of the cyclostationarity test and correlation. Monte Carlo simulation is employed to test the performance of the individual estimators as well as the whole estimator.
The Buildup of the Red Sequence in Galaxy Clusters since z ∼ 0.8

We study the rest-frame (U - V) color-magnitude relation in four clusters at redshifts 0.7-0.8, drawn from the ESO Distant Cluster Survey (EDisCS). We confirm that the red-sequence galaxies in these clusters can be described as an old, passively evolving population, and we demonstrate that, by comparison with the Coma Cluster, there has been significant evolution in the stellar mass distribution of red-sequence galaxies since z ∼ 0.75. The EDisCS clusters exhibit a deficiency of low-luminosity passive red galaxies. Defining as "faint" all galaxies in the passive evolution-corrected range 0.4 ≳ L/L* ≳ 0.1, the luminous-to-faint ratio of red-sequence galaxies varies from 0.34 ± 0.06 for the Coma Cluster to 0.81 ± 0.18 for the high-redshift clusters. These results exclude a synchronous formation of all red-sequence galaxies and suggest that a large fraction of the faint red galaxies in current clusters moved on to the red sequence relatively recently. Their star formation activity presumably came to an end at z ≲ 0.8.
AWARDS: an adaptive write strategy for secure local disk systems

Since security is of critical importance for modern storage systems, it is imperative to protect stored data from being tampered or disclosed. Although an increasing number of secure storage systems have been developed, there is no way to dynamically choose security services to meet disk requests' flexible security requirements. Furthermore, existing security techniques for disk systems are not suitable to guarantee desired response times of disk requests. We remedy this situation by proposing an adaptive strategy (referred to as AWARDS) that can judiciously select the most appropriate security service for each write request while endeavoring to guarantee the desired response times of all disk requests. Experimental results show that AWARDS significantly improves security and overall performance over an existing scheme by up to 325.0% and 358.9% (with averages of 199.3% and 213.4%)
Indoor Scene Recognition with a Visual Attention-Driven Spatial Pooling Strategy

Scene recognition is an important research topic in robotics and computer vision. Even though scene recognition is a problem that has been studied in depth, indoor scene categorization has had a slow progress. Indoor scene recognition is a challenging problem due to the severe high intra-class variability, mainly due to the intrinsic variety of objects that may be present, and inter-class similarities of man-made indoor structures. Therefore, most scene recognition techniques that work well for outdoor scenes demonstrate low performance on indoor scenes. Thus, in this paper, we present a simple, yet effective method for indoor scene recognition. Our approach can be illustrated as follows. First, we extract dense SIFT descriptors. Then, we combine a saliency-driven perceptual pooling with a simple spatial pooling scheme. Once the spatial and the saliency-driven encoding have been determined, we use vector quantization to compute histograms of local features from each sub-region. Later, the histograms from all sub-regions are concatenated together to generate the final representation of the image. Finally, a model based mixture classifier, which uses mixture models to characterize class densities, is applied. In order to address the problem of modeling non-Gaussian data which are largely present in our final representation of images, we use the generalized Gaussian mixture (GGM) which can be a good alternative to the Gaussian thanks to its shape flexibility. The learning of the proposed statistical model is carried out using the rival penalized expectation-maximization (RPEM) algorithm which is able to perform model selection and parameter learning together in a single step. Furthermore, we take into account the feature selection problem by determining a set of relevant features for each data cluster, so that we can speed up the used learning algorithm and get rid of noisy, redundant, or uninformative feature. To validate the proposed method we test it on the MIT indoor scenes data set.
Beyond discounting: the tradeoff model of intertemporal choice

Research on intertemporal judgments and choices between a smaller-sooner and a larger-later outcome has revealed many anomalies to the discounted-utility model. Attempts to account for these anomalies within the discounting paradigm have resulted in convoluted and psychologically opaque models. We therefore develop a new model of intertemporal choice, the tradeoff model, in which choice results from a tradeoff between the perceived time difference (interval) and the perceived outcome difference (compensation). This model is both more parsimonious and more intuitive than any rival discounting model of comparable scope. Moreover, it accurately describes archival data as well as data from a new experiment.
Database Computing on Clusters of Workstations

The cooperation between workstations and database servers has become the standard paradigm in database computing. Numerous workstations are usually clustered along with database servers in a LAN to o(cid:11)er high performance processing. There are various ways to organize the resources available in such aggregate architectures. The overall performance of the cluster can be signi(cid:12)cantly improved when system designers can delegate as much processing as possible to the clients of the cluster and exploit local resources such as disk units, client memory and CPUs. In this paper, we describe our work in this area and outline open problems.
Zoolander: Efficiently Meeting Very Strict, Low-Latency SLOs

Internet services access networked storage many times while processing a request. Just a few slow storage accesses per request can raise response times a lot, making the whole service less usable and hurting profits. This paper presents Zoolander, a key value store that meets strict, low latency service level objectives (SLOs). Zoolander scales out using replication for predictability, an old but seldom-used approach that uses redundant accesses to mask outlier response times. Zoolander also scales out using traditional replication and partitioning. It uses an analytic model to efficiently combine these competing approaches based on systems data and workload conditions. For example, when workloads under utilize system resources, Zoolander’s model often suggests replication for predictability, strengthening service levels by reducing outlier response times. When workloads use system resources heavily, causing large queuing delays, Zoolander’s model suggests scaling out via traditional approaches. We used a diurnal trace to test Zoolander at scale (up to 40M accesses per hour). Zoolander reduced SLO violations by 32%.
BitTorrent or BitCrunch: Evidence of a Credit Squeeze in BitTorrent?

BitTorrent is a highly popular peer-to-peer file sharing protocol. Much BitTorrent activity takes place within private virtual communities called "Private Trackers" - a server that allows only community members to share files. Many private trackers implement "ratio enforcement" where the tracker monitors the upload and download behavior of peers. If a peer downloads substantially more than it uploads then service is terminated. Tracker policies related to credit effect the performance of the community as a whole. We identify the possibility of a "credit squeeze" in which performance is reduced due to lack of credit for some peers. We consider statistics from a popular private tracker and results from a simple model (called "BitCrunch").
Combining Logic-Based and Corpus-Based Methods for Resolving Translation Mismatches

Very often in good quality translations, a target language expression (word, sentence or text) differs meaning from the corresponding expression in the source language. Fortunately quality translation consists in approximating the meaning of a source document, for the same meaning often cannot be rendered exactly in the target language. This impossibility is called translation mismatch by Kameyama, Ochitani, and Peters [4], where two of us discussed some factors involved in choosing an appropriate meaning approximation as required. The present paper continues that discussion, and draws conclusions regarding bi-lingual lexicons. Languages differ in the concepts and real-world entities that they have words and grammatical constructs to describe. This is why translation must frequently be a matter of approximating the meaning of a source language text rather than finding an exact counterpart in the target language. A major cause of the inadequate quality presently achieved by machine translation (MT) is the inability to generate contextually appropriate approximations when no exact translation exists between the source and target languages. An MT system needs to recognize mismatches when it encounters them, and to resolve mismatches either by recovering implicit information from their context, as required by the target language, or by leaving out some information the source text gives. English has lexical items like picture, photograph, painting, water color, oil painting, drawing, and line drawing, whose meanings are partially ordered by the relation of hyponymy (inclusion of meaning). In the same semantic field, Japanese has e, syasin, snisaiga, aburae, and senbyou. Only four words in each language have synonyms in the other language (i.e., words with the same meaning): water color (when it refers to the painting) and suisaiga, oil painting and aburae, line drawing and senbyou, photograph and syasin. The Japanese word e is more specific than English picture, as it does not apply to photographs; however, it is more general than painting and drawing, both of whose meanings it includes. To translate an English stateHinrich Schfitze Stanford University