Miracle-dz/UniFAR-FTUs huggingface dataset:
Mentes Y Máquinas Universal Turing Machine

Many hackers worldwide would agree that, had it not been for online algorithms, the synthesis of Web services might never have occurred. In fact, few researchers would disagree with the synthesis of journaling file systems. We demonstrate that though the infamous random algorithm for the investigation of 4 bit architectures by Herbert Simon et al. [114], [188], [188], [62], [70], [179], [68], [68], [95] , [54], [95], [152], [191], [59], [168], [148], [99], [58], [129], [ 128] is maximally efficient, the well-known peer-to-peer algori thm for the analysis of SCSI disks by Ito and Wu is optimal.
REAR-END COLLISION AVOIDANCE ASSIST SYSTEM

Rear-end collisions occur at higher frequency in Japan. The causes of rear-end collisions were therefore investigated. Accident statistics were used to conduct a statistical traffic accident analysis. Simulation was then used to perform an accident analysis on the basis of those studies. The results suggested that many of these accidents were caused by momentary inattention during daily driving. Research was therefore carried out to determine what kind of collision avoidance assist system would be effective for use at such times. The researched system used warning and brake control. The warning timing was set so that it would not interfere with the driver nor lose its impact as a warning. The result was creation of a system capable of contributing to the reduction of rear-end collisions.
Active involvement of Ca2+ in mitotic progression of Swiss 3T3 fibroblasts

Global Ca2+ transients have been observed to precede nuclear envelope breakdown and the onset of anaphase in Swiss 3T3 fibroblasts in 8% (vol/vol) FBS. The occurrence of these Ca2+ transients was dependent on intracellular stores. These Ca2+ transients could be (a) abolished by serum removal without halting mitosis, and (b) eliminated by increasing intracellular Ca2+ buffering capacity through loading the cells with 1,2-bis(2-aminophenoxy)ethane-N,N,N',N'-tetraacetic acid (BAPTA) buffer, via the tetra(acetoxymethyl) ester, without hindering the transition into anaphase. Microinjection of sufficient concentrations of BAPTA buffer could block nuclear envelope breakdown. Pulses of Ca2+ generated by flash photolysis of intracellularly trapped nitr-5, a "caged" Ca2+, could precipitate precocious nuclear envelope breakdown in prophase cells. In metaphase cells, photochemically generated Ca2+ pulses could cause changes in the appearance of the chromosomes, but the length of time required for cells to make the transition from metaphase to anaphase remained essentially unchanged regardless of whether a Ca2+ pulse was photoreleased during metaphase. The results from these photorelease experiments were not dependent on the presence of serum in the medium. Discharging intracellular Ca2+ stores with ionomycin in the presence of 1.8 mM extracellular Ca2+ doubled the time for cells to pass from late metaphase into anaphase, whereas severe Ca2+ deprivation by treatment with ionomycin in EGTA-containing medium halted mitosis. Our results collectively indicate that Ca2+ is actively involved in nuclear envelope breakdown, but Ca2+ signals are likely unnecessary for the metaphase-anaphase transition in Swiss 3T3 fibroblasts. Additional studies of intracellular Ca2+ concentrations in mitotic REF52 and PtK1 cells revealed that Ca2+ transients are not observed at all mitotic stages in all cells. The absence of observable global Ca2+ transients, where calcium buffers can block and pulses of Ca2+ can advance mitotic stages, may imply that the relevant Ca2+ movements are too local to be detected.
An analysis of WWW server status by packet monitoring

A management of WWW server is still relying on the expertise and heuristic of administrators, because the comprehensive understandings of server behavior are missing. The administrators should maintain the WWW server with good states that they should investigate the WWW server in real time. Therefore, it is exactly desirable to provide a measurement application that enables the WWW server administrators to monitor WWW servers in the actual operational environment. We developed a measurement application called ENMA (Enhanced Network Measurement Agent) which is specially designed for WWW server state analysis. Furthermore, we applied this application to the large scale WWW server operation to show its implementation and advantages. In this paper, we analyze the WWW server states based on precise monitoring of performance indices of WWW system to help the server management. key words: server management, server state, real time measurement, packet monitoring, ENMA
Refusal strategies used by 5th semester students of English Department in State Islamic University of Sunan Ampel Surabaya

This thesis examines about refusal strategies used by 5th Semester Students of English Department in State Islamic University of Sunan Ampel Surabaya. This thesis aims to find out the classifications of refusal strategies and refusal sequences used by the 5th semester students as the respondents. The source of data were taken from 5th semester students who already pass a Pragmatics subject. The researcher uses several theories about refusal strategies from Beebe et al., and Brown & Levinson. Also, the researcher uses theory of refusal sequences from Felix Brasdefer. This thesis uses descriptive analysis method. In addition, this thesis uses a DCT (Discourse Completion Test) as the instrument. In the data collection, the researcher observed the 5th semester students during 5 days of college times. Later, the researcher determined 30 students to become the respondents based on the observation result. Next, the researcher made a DCT then gave it to the respondents. The researcher had transcribed the data after collecting the DCT. Then, the researcher identified, coded, classified and analyzed the data. As the result, the researcher found direct strategies that appears 95 times, indirect strategies that appears in the DCT 402 times, and adjuncts that appears 193 times. From the explanation above, the strategy that is most frequently used by the respondents is indirect strategy. The result of second research question shows that the respondents used three sections of refusal sequences in rejecting something. They are: pre refusal strategies appears 201 times, main refusal strategies or head act appears 224 times, and post refusal strategies appears 124 times.
A practical bootstrap method for testing hypotheses from survey data

The bootstrap technique is becoming more and more popular in sample surveys conducted by national statistical agencies. In most of its implementations, several sets of bootstrap weights accompany the survey microdata file given to analysts. So far, the use of the technique in practice seems to have been mostly limited to variance estimation problems. In this paper, we propose a bootstrap methodology for testing hypotheses about a vector of unknown model parameters when the sample has been drawn from a finite population. The probability sampling design used to select the sample may be informative or not. Our method uses model-based test statistics that incorporate the survey weights. Such statistics are usually easily obtained using classical software packages. We approximate the distribution under the null hypothesis of these weighted model-based statistics by using bootstrap weights. An advantage of our bootstrap method over existing methods of hypothesis testing with survey data is that, once sets of bootstrap weights are provided to analysts, it is very easy to apply even when no specialized software dealing with complex surveys is available. Also, our simulation results suggest that, overall, it performs similarly to the Rao-Scott procedure and better than the Wald and Bonferroni procedures when testing hypotheses about a vector of linear regression model parameters. 1. Jean-Francois Beaumont, Statistics Canada, Statistical Research and Innovation Division, Tunney’s Pasture, R.H. Coats building, 16 floor, Ottawa, Ontario, Canada, K1A 0T6. E-mail: Jean-Francois.Beaumont@statcan.gc. ca; Cynthia Bocci, Statistics Canada, Business Survey Methods Division, Tunney’s Pasture, R.H. Coats building, 11 floor, Ottawa, Ontario, Canada, K1A 0T6. E-mail: Cynthia.Bocci@statcan.gc. ca.
Minimally Invasive Treatment of Displaced Proximal Humeral Fractures in Patients Older Than 70 Years Using the Humerusblock

Background. Surgical treatment of proximal humeral fractures (PHF) in osteoporotic bone of elderly patients is challenging. The aim of this retrospective study was to evaluate the clinical and radiological outcome after percutaneous reduction and internal fixation of osteoporotic PHF in geriatric patients using the semirigid Humerusblock device. Methods. In the study period from 2005 to 2010, 129 patients older than 70 years were enrolled in the study. After a mean follow-up of 23 months, a physical examination, using the Constant-Murley score and the VAS pain scale, was performed. Furthermore radiographs were taken to detect signs of malunion, nonunion, and avascular necrosis. Results. The recorded Constant-Murley score was 67.7 points (87.7% of the noninjured arm) for two-part fractures, 67.9 points (90.8%) for three-part fractures, and 43.0 points (56.7%) for four-part fractures. In ten shoulders (7.8%) loss of reduction and in four shoulders (3.1%) nonunion were the reason for revision surgery. Avascular humeral head necrosis developed in eight patients (6.2%). Conclusions. In two- and three-part fractures postoperative results are promising. Sufficient ability for the activities of daily living was achieved. In four-part fractures the functional results were less satisfying regarding function and pain with a high postoperative complication rate. In those patients other treatment strategies should be considered. Study design. Therapeutic retrospective case series (evidence-based medicine (EBM) level IV).
A method for non-linear analysis and calculation of torque and radial forces in permanent magnet multiphase bearingless motors

In this paper an algorithm for non-linear magnetic analysis of surface-mounted permanent-magnet machines is presented. It is based on the equivalent magnetic circuit method and can be used as a useful design and computing tool. The duplication of an elementary cell of the machine allows building whatever typology of windings and ampere-turns distribution in a pole pair. The direct modification of electrical and dimensional parameters and the analysis of rotor movement in sinusoidal multiphase drives are the most important features of this algorithm. The proposed analysis determines the flux density distribution in the machine, the magnetic energy and co-energy, the torque and radial forces in presence of non-linear magnetic materials. The accuracy of calculations is verified by comparing the obtained results with FE analysis, in respect of which the algorithm allows a simplified machine description, reduced computation time but with very similar results.
Policy Incentives for the Adoption of Electric Vehicles across Countries

Electric vehicles (EVs) have prominent advantages for reducing CO 2 emissions and alleviating the dependence on fossil fuel consumption in the transport sector. Therefore, many countries have set targets for EV development in recent years and have employed a number of policies to achieve environmental objectives and alleviate the energy pressure. Despite the fact that the adoption of EVs has increased in the past few years, more policies, such as financial incentives, technology support or charging infrastructure, should be made by governments to promote broader range use of EVs. In this paper, we review the relevant policies that different countries may adopt for stimulating the market of EVs. Based on this, we analyze the relationship between the policies and the adoption of EVs by taking America as an example. In conclusion, some effective policies are summarized to spur the market. Therefore, each country should learn from each other and employ effective policies based on the actual situation.
The Impact of Student Expectations and Tutor Acceptance on Computer-Based Learning Environment Acceptance and Future Usage Intentions

Computer-based tutoring systems should be designed to meet/exceed learners’ expectations and maximize learners’ technology acceptance to increase their satisfaction and future system usage intentions. Pedagogical Agents (PAs) are commonly incorporated into an Intelligent Tutoring System (ITS) to increase learners’ satisfaction; however, empirical evidence on the impact of PAs on learner acceptance is limited. Additionally, few ITS researchers seek to understand learners’ expectations and acceptance of both the agent and learning environment. This paper presents the results of a study that evaluates the relationships between learner expectations and acceptance of a PA and learning environment both before and after learners’ system interactions.
Combination of DTW-based and CRF-based Spoken Term Detection on the NTCIR-11 SpokenQuery&Doc SQ-STD Subtask

Conventional spoken term detection (STD) techniques, which use a text-based matching approach based on automatic speech recognition (ASR) systems, are not robust for speech recognition errors. This paper proposes a conditional ran- domelds (CRF)-based combination (re-ranking) approach, which recomputes detection scores produced by a phoneme- based dynamic time warping (DTW) STD approach. In the re-ranking approach, we tackle STD as a sequence label- ing problem. We use CRF-based triphone detection models based on features generated from multiple types of phoneme- based transcriptions. They train recognition error patterns such as phoneme-to-phone confusions on the CRF frame- work. Therefore, the models can detect a triphone, which is one of triphones composing a query term, with detection probability. In the experimental evaluation on the NTCIR- 11 SpokenQuery&Doc SQ-STD test collection, the CRF- based approach and the combination approach of the two STD systems could not outperform the conventional DTW- based approach we have already proposed.
Simulating the provision of antiretroviral therapy in Zambia

Zambia has over 1.9 million HIV-infected people and is one of the countries hardest hit by the HIV pandemic. Limited information exists on the long-term survival and economic costs of antiretroviral therapy (ART) in the country. The study we describe here has two aims: 1. Provide better estimates for the long-term survival of people on ART; 2. Forecast the number of people on ART and the cost of providing ART in Zambia over the next decade. Survival analysis techniques have been used to estimate distributions for the time spent on ART using electronic records from the Zambian national database. We use Discrete Event Simulation to model the number of people on ART in Zambia and provide projections for the cost of providing ART in the future. HIV-infected patients enter the model when they commence ART and exit the system due to death, becoming lost to follow up or stopping treatment.
Enforcement of Security Properties for Dynamic MAC Policies

This paper focuses on the enforcement of security properties fitting with dynamic Mandatory Access Control policies. It adds complementary results to previous works of the authors in order to better address dynamic policies. Previous works of the authors provide several advances for enforcing the security of MAC system.An administration language for formalizing a large set of security properties is available to system administrators. That language uses several flow operators and ease the formalization of the required security properties. A solution is also available for computing the possible violations of any security property that can be formalized using our language. That solution computes several flow graphs in order to find all the allowed activities that can violate the requested properties. That paper addresses remaining problems related to the enforcement of the same kind of properties but with dynamic MAC policies. Enforcement is more much complex if we consider dynamic policies since the states of those policies are theoretically infinite. A new approach is proposed for dynamic MAC policies. The major idea is to use a meta-policy language for controlling the allowed evolutions of those dynamic policies. According to those meta-policy constraints, the computation problem becomes easier. The proposed solution adds meta-nodes within the considered flow graphs. A general algorithm is given for computing the required meta-nodes and the associated arcs. The proposed meta-graphs provide an overestimation of the possible flows between the different meta-nodes. The computation of the possible violations within the allowed dynamic policies is thus allowed. Several concrete security properties are considered using regular expressions for identifying the requested meta-contexts. The resulting violations, within the allowed meta-graphs, are computed and real violations are presented.
Gaussian Process Bandits for Tree Search: Theory and Application to Planning in Discounted MDPs

We motivate and analyse a new Tree Search algorithm, GPTS, based on recent theoretical advances in the use of Gaussian Processes for Bandit problems. We consider tree paths as arms and we assume the target/reward function is drawn from a GP distribution. The posterior mean and variance, after observing data, are used to define confidence intervals for the function values, and we sequentially play arms with highest upper confidence bounds. We give an efficient implementation of GPTS and we adapt previous regret bounds by determining the decay rate of the eigenvalues of the kernel matrix on the whole set of tree paths. We consider two kernels in the feature space of binary vectors indexed by the nodes of the tree: linear and Gaussian. The regret grows in square root of the number of iterations T, up to a logarithmic factor, with a constant that improves with bigger Gaussian kernel widths. We focus on practical values of T, smaller than the number of arms. Finally, we apply GPTS to Open Loop Planning in discounted Markov Decision Processes by modelling the reward as a discounted sum of independent Gaussian Processes. We report similar regret bounds to those of the OLOP algorithm.
ON THE VALIDITY OF REALIZABLE PHYSICAL APPROXIMATIONS TO δ ( t ) INPUT IMPULSES TO OBTAIN IMPULSE RESPONSES . APPLICATION TO SYNTHETIZE DISCRETE-TIME MODELS FOR LTI SYSTEMS

The aim of this work is to study the validity of impulse approximations to model discrete systems using filter-based identification methods. Even when impulse inputs possess an inherent error due to the physical impossibility of generation of ideal impulses, they are of particular practical interest when treating discrete-time systems where the analytical resolution becomes very complex or even unfeasible. In particular, when handling numerical response impulse simulations the goodness of the results obtained highly depends on the precision of the δ( ) distribution construction. In the first part of the paper an analytical proof ratifying the validity of these approximations is presented, while the second part is devoted to obtain discrete-time models for LTI systems, affording three different filter-based methods to identify the discrete transfer function from the sampled response of the system when excited by an approximated impulsive input.
Path planning for multiple Unmanned Aerial Vehicles using genetic algorithms

In the future, autonomous Unmanned Aerial Vehicles (UAVs) need to work in teams to share information and coordinate activities. The private sector and government agencies have implemented UAVs for home-land security, reconnaissance, surveillance, data collection, urban planning, and geometrics engineering. Significant research is in progress to support the decision-making process for a Multi-Agent System (MAS) consisting of multiple UAVs. This paper investigates fundamental issues in path planning for multiple UAVs. MASs with multiple UAVs are typical distributed systems. We propose to use genetic algorithms to plan multiple paths for multiple UAVs. Simulation technologies have become important to the development of aerospace vehicles. In this research, we verify the proposed path planning approach using Matlab. Simulation results demonstrate that the proposed approach is able to plan multiple paths for UAVs successfully.
The supergravity dual of 3D supersymmetric gauge theories with unquenched flavors

We obtain the supergravity dual of = 1 gauge theory in 2+1 dimensions with a large number of unquenched massless flavors. The geometries found are obtained by solving the equations of motion of supergravity coupled to a suitable continuous distribution of flavor branes. The background obtained preserves two supersymmetries. We find that when Nc ≥ 2Nf the behavior of the solutions is compatible with having an asymptotically free dual gauge theory with dynamical quarks. On the contrary, when Nc < 2Nf the theory develops a Landau pole in the UV. We also find a new family of (unflavored) backgrounds generated by D5-branes that wrap a three-cycle of a cone with G2 holonomy.
Linear feature vector compression using Kullback-Leibler distance

Since multimedia contents became digital lossless and lossy compression techniques have been more and more relevant to store and classify such signals. Some of the linear transformation algorithm used for compression such as DCT, PCA or LDA are known for decades and are successfully used for image, audio and video compression or in the field of multimedia content classification. In this paper a new linear algorithm for lossy feature vector compression is introduced. It can be used to simplify a dataset by reducing the number of dimensions of feature vectors (hopefully) without loss of information to enable a faster, less memory consuming classification. The algorithm bases its compression strategy on the Kullback-Leibler distance
An Artificial Intelligence-Based Trust Model for Pervasive Computing

Pervasive Computing is one of the latest and more advanced paradigms currently available in the computers arena. Its ability to provide the distribution of computational services within environments where people live, work or socialize leads to make issues such as privacy, trust and identity more challenging compared to traditional computing environments. In this work we review these general issues and propose a Pervasive Computing architecture based on a simple but effective trust model that is better able to cope with them. The proposed architecture combines some Artificial Intelligence techniques to achieve close resemblance with human-like decision making. Accordingly, Apriori algorithm is first used in order to extract the behavioral patterns adopted from the users during their network interactions. Naïve Bayes classifier is then used for final decision making expressed in term of probability of user trustworthiness. To validate our approach we applied it to some typical ubiquitous computing scenarios. The obtained results demonstrated the usefulness of such approach and the competitiveness against other existing ones.