Miracle-dz/UniFAR-FTUs huggingface dataset:
Data Mining and Machine Learning with Computer Game Logs

This report describes the process of analysing a set of server logs which were recorded during games of the team based first-person shooter Team Fortress Classes (TFC). The aim of the analysis is the discovery of patterns in the data set through the application of machine learning algorithms. These patterns could then be used to improve the playing experience for human players or to create artifical players which show the behavior that is given in the patterns and thus appear more human-like. The report looks at the historical background of machine learning for classic games such as chess and checkers. It then surveys the evolution of computer game AI from its early roots in arcade games in the 1970s to the multi-million dollar productions of the last decade. In the next chapter there is an introduction into computer game genres, goals and limitations of machine learning in those genres as well as an explanation for the principle of online/offline learning to give a better understanding of machine learning in computer games. Then a short introduction to the game from which the data comes is given to facilitate an understanding of certain aspects of the data set. Afterwards the course of action to prepare the data for the actual analysis is described. This consists of the extraction of the information from HTML files and the cleaning of this information. The database in which this information is stored is described. Then the actual analysis consisting of two main experiments is elaborated. Each of these experiments is subdiveded into the definition of the test data set on which the analysis will be performed, a preliminary analysis which specifies the statistical characteristics of the data set on which the experiment is based and the application of the machine learning algorithms as well as the discussion of the results. After the evaluation a discussion of the outcome and the description of possible future work follows. At the end the conclusion sums up the achievements and results of the project.
LOKASI, KEBERAGAMAN PRODUK, HARGA, DAN KUALITAS PELAYANAN PENGARUHNYA TERHADAP MINAT BELI PADA PASAR TRADISIONAL BERSEHATI CALACA

Kota­-kota di Indonesia mengalami perkembangan yang pesat terkait dengan pertumbuhan pasar modern dan semi modern yang menjadi pesaing bagi pasar tradisional. Secara berangsur-angsur pasar tradisional mengalami penyusutan sehingga berpengaruh terhadap kegiatan ekonomi.Pasar tradisional merupakan tempat bertemunya penjual dan pembeli untuk melakukan transaksi, dimana organisasi pasar yang ada masih sangat sederhana dengan tingkat efisiensi dan spesialisasi yang rendah.Penelitian ini merupakan jenis penelitian asosiatif, dimana dilakukan analisis regresi berganda untuk melihat pengaruh antara variabel bebas dan terikat.Hasil penelitian ini menunjukan bahwa lokasi, keberagaman produk, harga, dan kualitas pelayanan berpengaruh terhadap minat beli pada pasar tradisional Bersehati Calaca. Saran penelitian adalah, pihak pengelola pasar tradisional Bersehati harus lebih meningkatkan kualitas layanan dan kebersihan lokasi, agar konsumen tertarik untuk berbelanja pada pasar tradisional Bersehati Calaca. Kata kunci: lokasi, keberagaman produk, harga, dan kualitas pelayanan .
Multiracial Education. 3. Pupils’ Attitudes to the Multiracial School

Summary The study described in this paper was undertaken as one part of a more extensive survey on inter‐ethnic attitudes and behaviour in the context of multiracial education in English schools. The analysis was based on data collected from 3551 pupils in primary and secondary schools in England. The results of this particular study revealed some significant difference in attitudes. It was established that girls were generally more concerned than boys about their school work, that the older age groups had less favourable attitudes to the multiracial school than the young pupils, and that of all the ethnic groups in the sample the pupils of Asian family background had the most positive attitude towards the multiracial school and were the group most concerned about their school work.
Efficient Management of Object-Oriented Queries with Late Binding

To support new application areas for database systems such as mechanical engineering applications or office automation applications a powerful data model is required that supports the modelling of complex data, e.g. the object-oriented model. The object-oriented model supports subtyping, inheritance, operator overloading and overriding. These are features to assist the programmer in managing the complexity of the data being modelled. Another desirable feature of a powerful data model is the ability to use inverted functions in the query language, i.e. for an arbitrary function call fn(x)=y, retrieve the arguments x for a given result y. Optimization of database queries is important in a large database system since query optimization can reduce the execution cost dramatically. The optimization considered here is a cost-based global optimization where all operations are assigned a cost and a way of a priori estimating the number of objects in the result. To utilize available indexes the optimizer has full access to all operations used by the query, i.e. its implementation. The object-oriented data modelling features lead to the requirement of having late bound functions in queries which require special query processing strategies to achieve good performance. This is so because late bound functions obstruct global optimization since the implementation of a late bound function cannot be accessed by the optimizer and available indexes remain hidden within the function body. In this thesis the area of query processing is described and an approach to the management of late bound functions is presented which allows optimization of invertible late bound functions where available indexes are utilized even though the function is late bound. This ability provides a system with support for the modelling of complex relations and efficient execution of queries over such complex relations.
Corese : a Corporate Semantic Web Engine

With the aim of building a Corporate Semantic Web, the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. The Corese engine is dedicated to the querying of corporate semantic webs whose documents are described into RDF annotations. Corese interprets these RDF metadata in the Conceptual Graphs (CG) model in order to exploit the inference capabilities of this formalism. This paper presents our mapping of RDF into CG and its interest in the context of a Corporate Semantic Web.
Language and simulation in conceptual processing

This chapter explains that multiple systems represent knowledge. It focuses on two resources of knowledge, believed to have strong empirical support — linguistic forms in the brain's language systems, and situated simulations in the brain's modal systems. Although this chapter focuses on two sources of knowledge, it does not exclude the possibility that other types are important as well. It argues that statistical representations play central roles throughout the brain, and that they underlie linguistic forms and situated simulations. It examines linguistic and modal approaches to the representation of knowledge. It proposes the language and situated simulation (LASS) theory as a preliminary framework for integrating these approaches. It then explores the evidence for the LASS theory, including evidence for dual code theory, Glaser's (1922) revision of dual code theory or the lexical hypothesis, evidence from the laboratories.
Sparsity, scalability, and distribution in recommender systems

Recommender systems apply knowledge discovery techniques to the problem of making personalized product recommendations. These systems are achieving widespread success in e-commerce nowadays. The tremendous growth of customers and products poses some key challenges for collaborative filtering (CF) based recommender systems. These axe: producing high quality recommendations, performing many recommendations per second for millions of customers and products, achieving high coverage in presence of data sparsity, and meeting the demands of widespread availability. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. In this dissertation, we present our approaches to address three such research challenges—sparsity, scalability, and distribution. For the first two challenges, we perform experiments on real-world data. Our experiments show improvements over the basic CF-based algorithm. For the third challenge, we provide a framework that can be extended to implement distributed recommender systems. We tackle the sparsity problem in two ways—by implementing a model for integrating content-based ratings into a CF system and by applying alternate algorithmic approaches to address sparsity. For the first approach, we apply semi-intelligent filtering agents that generate ratings by analyzing syntactic features of the item content. For the second approach, we apply singular value decomposition (SVD) based prediction algorithms and item-based CF algorithms. Our results suggest that both of these techniques are capable of addressing the sparsity issue. We apply two different approaches to address the scalability issue—by using dimensionality reduction for neighborhood formation and by using incremental model-based techniques. In the first approach, we use SVD based dimensionality reduction technique and a clustering based technique. In the second approach, we use SVD-based incremental technique, incremental item-based technique, and association rule-based technique. Our results suggest that these methods have potential for improving the scalability of recommender systems. We address the distribution issue by analyzing different approaches to implement distributed CF-based recommender systems. We present a taxonomy of recommender system applications based on the relative relevance of geographically proximate and distant users and items. We present three distribution frameworks and an evaluation of each framework-application pair.
The Reduced Nearest Neighbor Rule

Fig. 3 shows PG,. ,,,,, (m) for various numbers of observations N and various sizes of memory m. The Chernoff bound on P,*(a) was used for N 2 32. Quite naturally one does better with more memory. The P~,sym(m) curve for any given value of m follows the P,*(co) line for low values of N, diverges from it for larger values of N, and approaches a nonzero limit P,*(m) as N + co. This behavior is easily explained. Any given machine can “remember” all of the observations for low values of N. Here infinite memory offers no advantages. For larger values of N, a finite-state machine necessarily loses some information and thus does not do so well as one with infinite memory. As N -+ co, Pz sym(m) approaches Pm*(m), the infinite-time lower bound on the probability of error, since from [I] we know that for N = co the optimal machine is symmetric.
An efficient algorithm for analysis of transfer lines with unreliable machines and finite buffers

Abstract In a recent paper [3], Gershwin proposed a decomposition method for the approximate analysis of transfer lines with unreliable machines and finite buffers. The method is based on a decomposition of the line into a set of two-machine lines. It leads to a set of equations which are solved using an iterative algorithm. Experimental results have shown that this technique is very accurate. However, it may happen that the algorithm fails to converge. In this paper, we propose to replace the original set of equations by an equivalent one, which is again solved using an iterative procedure. This new algorithm is simpler than the previous one, and its computational complexity is lower. Moreover, on all examples we tested, the algorithm always converged.
Adaptive Scheduling for the QoS Supported Networks

Sayenko, Alexander Adaptive scheduling for the QoS supported networks Jyväskylä: University of Jyväskylä, 2005, 216 p. (Jyväskylä Studies in Computing ISSN 1456-5390; 54) ISBN 951-39-2295-2 Diss. This work studies the adaptive scheduling in the QoS supported networks. It analyses the existent scheduling disciplines and chooses several basic ones. For the chosen disciplines, the adaptive models are presented that are capable of finding the optimal scheduler configuration based on the QoS requirements and a provider’s preferences concerning each service class. The preferences are expressed with the prices for network services, however, the presented models are flexible in that other criteria can be exploited. It is shown that the proposed adaptive models can be integrated easily into the existent QoS frameworks, such as IntServ and DiffServ. Being independent of a particular signalling protocol and an underlying transport protocol, the models can also be deployed to other QoS environments. The theoretical correctness of the proposed models is confirmed by the extensive simulations carried out with the NS-2 simulator. Each adaptive model is tested within the IntServ and DiffServ QoS frameworks with various requirements and number of service classes. The final simulation scenario presents a hybrid framework, in which the signalling mechanisms from the IntServ QoS framework are combined with the forwarding mechanisms of the DiffServ framework.
Le rapport au sexuel et la sémiotique de l'amour : Marquage socioculturel et climats relationnels

L’objectif de cet article est de presenter les principaux constats d’une recherche qualitative par entretien semi-directif aupres de jeunes adultes en France et en Grece. Les systemes de representation que nous avons analyses nous ont permis de constater que statuer sur le rapport a la sexualite implique la question de la valence affective qui peut etre en jeu dans une relation intime sexuelle. Cette construction est fondee sur la distinction entre differents types des relations intimes dans lesquelles est envisagee la sexualite : quand il y a de l’amour et quand il n’y en a pas. Les « raisonnements affectifs » qui puisent dans cet univers de pensee sous-tendent differentes formes de modalisation dans le rapport a l’autre ou le sexuel est en jeu. Concernant l’apprehension du sida, ces raisonnements mettent en lumiere les jeux d’articulation entre les principes de modalisation, le sentiment de peur que cette maladie suscite, et la construction du risque a son egard. Ce qui nous revele la complexite et la multidimensionnalite des facettes qui sont en jeu dans l’apprehension de l’objet « sexualite » et dans les fonctionnements psychologiques relates par les sujets dans la narration des vecus de leur intimite (peur, desir, perte de controle, .). Ces resultats invitent a conceptualiser les climats relationnels en jeu dans les relations intimes sexuelles, sans les amputer de leur topologie sociale et culturelle, sans les vider de la substance psychologique et intersubjective exprimee.
State Government E-Procurement in the Information Age: Issues, Practices, and Trends

A dual handle semi-flush retrofit kit is provided and consists of a water releasable reservoir cup the weight of which varies the effective buoyancy of the flapper flush valve, connected between the flapper flush valve and double flush handles on a toilet tank, such that if one handle is operated the toilet tank is fully flushed in the conventional way. If the other handle is operated the toilet tank is only half emptied thereby saving many gallons of water. This dual handle semi-flush retrofit kit can be easily installed by the do-it-yourself home owner.
The Predictive Validity of the GRE and TOEFL Exams with GGPA as the Criterion of Graduate Success for International Graduate Students in Science and Engineering.

This study investigated the relationship between graduate grade-point-average (GGPA) and the total score, as well as the scores on each part, of the Graduate Record Examination (GRE). It also investigated the relationship between GGPA and the total score, as well as the scores on each part, of the Test of English as a Foreign Language (TOEFL). The sample for the study consisted of 47 Indian and Chinese international graduate students who had completed their master of science degrees in an area of science or engineering at Rose-Hulman Institute of Technology (R-HIT) between the academic years of 1994-95 and 1997-98. All of the students in the study completed the GRE and TOEFL tests prior to their admission to R-HIT. The results of the study show that there is a significant positive linear correlation between GRE quantitative scores and GGPA, as well as a significant positive linear correlation between the GRE analytical scores and GGPA. Both of the correlations were significant at the 0.05 level. The study also shows that there are no other significant linear correlations, either positive or negative, between any of the other scores (TOEFL Total; TOEFL, Division 1; TOEFL, Division 2; TOEFL, Division 3; GRE Total; and GRE Verbal) and GGPA. (Contains 9 figures, 9 tables, and 10 references.) (Author/SLD) ******************************************************************************** Reproductions supplied by EDRS are the best that can be made from the original document. ******************************************************************************** The Predictive Validity of the GRE and TOEFL Exams with GGPA as the Criterion of Graduate Success for International Graduate Students in Science and Engineering
Combining Multiple Learners Induced on Multiple Datasets for Software Effort Prediction

Background: First approaches in software effort prediction depended on regression based models, whereas later models investigated more sophisticated methods like machine learning algorithms. Discussion Points: Single methods or models can discover only a certain part of the high dimensional space of software effort data and a common practice to increase accuracy values is to combine multiple learners. However, merely comparing models over a single dataset on the basis of precision values is not a healthy practice, since each dataset may favor a certain method. Therefore, a solid statistical test is required for comparison. Method: In this study, we adapt a previous study conducted by Khosgoftaar et. al. [1] in the field of software quality analysis to the field of software effort estimation and evaluate our results on the basis of statistical significance tests. Conclusions: Khosgoftaar et. al.’s work[1] was the first of its kind in software quality and we adapted their novel work to software effort prediction. We exploited 14 methods over 3 different software effort prediction datasets under 4 different scenarios and observed similar results to Khosgoftaar et. al., that is multiple learners induced on single dataset do not produce significantly better results.
ARCHITECTONICS - A SYSTEM OF EXPLORING ARCHITECTURAL FORMS IN SPATIAL CATEGORIES

Comparative researches based on visual analyses of different architectural objects enable separation of the small number of basic recurrent units defining spatial aspects of architectural form independently of when and in which cultural circle the object was created. These basic units of spatial structure can be termed spatial universals. Using them in accordance with some basic and universal rules of assembling into larger wholes makes possible creating any spatial objects as well as transforming them into different ones. At the same time words of natural languages contained in dictionaries give us important clues how people think about space. Another important clues are included in some recent theories of perception. All these findings taken together have been the basis to create the system of notions and terms regarding space in architecture. It is founded on basic and universal spatial elements (units) and rules of their composing into larger wholes. The paper is the trial of presenting such a notional system which was termed architectonics (or morphotectonics). Basic notions enabling description and analysis of spatial structure of any architectural object have been introduced. Fundamental spatial units have been also distinguished based on the principle of hierarchical structure – from elementary ones, through more and more complex up to largest ones playing decisive role in defining the whole architectural object. Basic spatial morphological features called also cardinal ones have been differentiated. Primary kinds of articulation have been discussed dealing with the empty space (internal or external), line, surface and volume and their elementary units had been distinguished. Besides morphological features characterizing composing elements the rules of their assembling have been specified, which have been termed syntax or relational features, characterizing spatial wholes composed of elements. Both morphological and syntax features may be treated quantitatively or measured by means of introduced coefficients. The presented system of notions as well as the quantitative approach should enable objective description and analysis of the built environment which is the necessary condition of research dealing with relations between man and his behavior and the environment, if these researches have to fulfill such elementary scientific criteria as repeatability, verifiability, internal and external validity and inter-subjective communication. The presented methodological proposal is addressed in particular to research on perception and cognition of the built environment and people’s reactions to it, such as evaluations, associations and emotions. It could be also useful in historical research carried both in comparative and systematic perspective, as well as in environmental aesthetics where comparing the new object with existing surrounding is of crucial importance. For the reason of limited place the paper is restricted only to presenting the system itself, while applications should be the subject of different publications.
Analysis of Multi Dimensional Codes for OCDMA System

The wide-ranging services of the Internet have caused the rapid increase of bandwidth requirements on the access networ that can be achieved by relying on fiber optics for future networks. OCDMA is a technology to realize multiplexing transmission and multiple access by coding in the optical domain, supporting multiple simultaneous transmissions in the same timeslot, space and frequency. It is another technology of multiplexing and multiple access. Performance of OCDMA is based on coding techniques. Through this communication various codes for these networks proposed by researchers are discussed like zero cross correlation codes, Perfect Difference Code Set based , optical orthogonal codes, Quasi optical orthogonal codes ,Constant Weight Symmetric OOC, Constant Weight Asymmetric OOC, Variable Weight OOC, Prime Codes, Modified Prime Codes, Time Spreading codes , Frequency Hopping Codes, Linear Congruence codes, Quadratic Congruence codes, Extended Quadratic Congruence codes, Bipolar Codes , Costas Arrays e.t. c and the codes proposed by authors based on two models A and B . Based on their methodology comparison thereof is drawn that the codes given by researchers are easy to construct and have good properties.
Fossil Art - an exhibition of the Geologisches Institut

I marts udkom denne bemaerkelsesvaerdige bog, der pa sin vis er et “katalog” over en eventyrlig udstilling af fossile gravegange, spor og aftryk samt i enkle tilfaelde – fossilerne selv – gennem 2 mia. ar. Den flotte udstilling kan i ovrigt ses pa Geokongressen i Oslo i august i ar.