Miracle-dz/UniFAR-FTUs huggingface dataset:
REASONING ABOUT DEFINEDNESS － A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC

E ective de nedness checking is crucial for an implementation of a logic with undenedness. The objective of the MathScheme project is to develop a new approach to mechanized mathematics that seeks to combine the capabilities of computer algebra systems and computer theorem proving systems. Chiron, the underlying logic of MathScheme, is a logic with unde nedness. Therefore, it is important to automate, to the greatest extent possible, the process of checking the de nedness of Chiron expressions for the MathScheme project. This thesis provides an overview of information useful for checking de nedness of Chiron expressions and presents the design and implementation of an AND/OR tree-based approach for automated de nedness checking based on ideas from arti cial intelligence. The theorems for de nedness checking are outlined rst, and then a three-valued AND/OR tree is presented, and nally, the algorithm for reducing Chiron de nedness problems using AND/OR trees is illustrated. An implementation of the de nedness checking system is provided that is based on the theorems and algorithm. The ultimate goal of this system is to provide a powerful mechanism to automatically reduce a de nedness problem to simpler de nedness problems that can be easily, or perhaps automatically, checked.
Vertex covering transversal domination in graphs

Abstract A set Â of vertices in a graph G = (V, E) is called a dominating set if every vertex in V â€“ D is adjacent to a vertex in D. A set CÂ V of vertices in G is called a vertex covering set if every edge of G is incident to at least one vertex in C. Also C is said to be a minimum vertex covering set if there is no other vertex covering set Câ€™ such that. A dominating set which intersects every minimum vertex covering set in G is called a Vertex Covering Transversal Dominating set. The minimum cardinalityÂ of a vertex covering transversal dominating set is called Vertex Covering Transversal Domination number of G and is denoted by . In this paper, we begin with an investigation of this parameter. Â Â Keywords: dominating set, vertex covering set, vertex covering transversal dominating setÂ Â
Pronunciation instruction Classroom practice and empirical research

The present paper reviews the literature in the area of English pronunciation instruction. It starts by focusing on the way it has been addressed by different approaches to Second Language Teaching, from Direct Approaches to Communicative Methodologies. Then textbooks and pronunciation manuals are analyzed. Finally, data from empirical research is summarized. The conclusion is that there no integration between research and the production of materials for pronunciation instruction. Also, communicative aspects and the student’s mother tongue are not taken into account.
Impact of organizational justice on job performance in libraries

Purpose – The purpose of this paper is to examine the mediating role of leader-member exchange in the relationship between organizational justice and job performance. The study primarily focused on the perception of university libraries personnel regarding organizational justice practices and the quality of their relationship with their supervisors and how such perceptions predict their job performance. Design/methodology/approach – This study tested a sample of 15 university libraries of Islamabad, Pakistan. Data were accumulated through questionnaire and analyzed on SPSS. Descriptive and correlation analysis showed the positive and significant relationship between all variables. Series of separate hierarchical regression analysis were used to test the hypothesis. Findings – The result revealed that all three kinds of organizational justices (distributive justice, procedural justice and interactional justice) predict the job performance but interactional justice along with leader-member exchange impacts .
ASSOCIATION-STORING PROCESSOR STUDY.

Abstract : The recent increase in the importance of such computer applications as fact retrieval and language translation, has made apparent the need for general purpose computers which can efficiently process non-numerical problems. With the objective of satisfying this need, an unconventional computer concept, called the Association-Storing Processor, has been defined, and the basic organization, operation, and logic design of a processor, designed to implement this concept, has been developed. The concept is based upon the representation of information as a directed graph. The data items are the nodes of the graph. Associations between pairs of items are explicitly represented by labels placed on the edges (links) of the graph. These associations are the basic units of data. All processes performed upon this data are stated in terms of a single type of instruction. Each instruction specifies conditions to be met by the data, and transformations to be performed upon the data if the conditions are met. The instructions and programs themselves, like the data, are represented as directed graphs, and are stored with the data. The processor organization design to implement this concept is based upon the use of a main memory which has the parallel search capability of an associative memory. Instruction processing is performed almost entirely within this memory by logic distributed at the bit and word levels of the storage cells. The approach is directed at taking advantage of the parallel processing permitted by the instruction and of the characteristics of the developing batch fabrication technologies. (Author)
Optimized SVPWM for Multilevel Inverter

Multilevel inverters have gained interest in recent years in high-power medium-voltage industry. This paper considered the most popular structure among the transformer-less voltage source multilevel inverters, the diode-clamped converter based on the neutral point converter. This paper proposes a single carrier multi-modulation SVPWM technique with an optimized space vector switching sequence. Simulation results presents comparison of single and multicarrier optimized space vector switching sequence with general switching sequence of nine-level diode-clamped inverter for the parameter total harmonic distortion and fundamental component of voltage.
Recommendation System using Web Usage Mining for users of E-commerce site

World Wide Web (WWW) provides abundant information for the Internet users. Users’ accesses behavior is recorded in web logs. This information seems to be very helpful in an E-commerce environment for several applications such as personalization and recommendation. This paper focuses on providing real time recommendation to online users who can be either registered or unregistered. This technique makes use of traditional web usage mining steps for data acquisition and data cleaning and finally to construct useful session. Two different approaches are proposed to provide effective recommendation. In product based technique, recommendation is provided to unregistered user based on IP address as obtained from log file. This method has an edge over traditional techniques which provide recommendation to unregistered user based on cache memory. Another technique is user based technique which provides recommendation to registered customer based on session constructed for each unique user based on users’ navigation. Evaluation of the proposed system is done by performing experiment on real E-commerce data. Results show that both the techniques provide better recommendation quality and accuracy. Keywords— Collaborative filtering, common log file, ecommerce, personalized recommendation, web usage mining.
Understanding UML: the developer's guide: with a Web-based application in Java

1 Introduction 2 The Vocabulary of Object Technology 3 A Simple Object-Oriented Methodology 4 The Unified Modeling Language 5 Coding Applications in Java 6 Java Development with an Object-Oriented Modeling Tool 7 Business Process Reengineering 8 Use Case Diagrams and Ideal Object Models 9 CRC Cards 10 UML Class and Object Diagrams 11 UML Sequence and Collaboration Diagrams 12 UML State and Activity Diagrams 13 Designing an Object-Oriented System 14 Choosing an Object-Oriented Architecture 15 Expanding Your Design Appendix A Code for the SalesWeb Example Appendix B A Comparison of UML, Booch, and MOT Notations Appendix C Products Mentioned in the Book
Reasoning under Uncertainty in Natural Language Dialogue using Bayesian Networks

In which uncertainty in natural language dialogue is introduced as the central problem in the research described in this thesis. The idea of using of Bayesian networks is hypothesised as a possible solution to this problem. Dialogue acts are presented as the central notion in our approach to dialogue modelling and the task of recognising dialogue act types as the central topic in the experiments.
Knowledge Acquisition Techniques for Expert Systems: Conceptual and Empirical Comparisons

Abstract : The knowledge-acquisition phase in the development of expert systems is hampered by inadequate techniques for the elicitation and representation of knowledge from human experts. The objective of this research is, ultimately, to develop guidelines for effective knowledge acquisition. The objective of this Phase I (SBIR) research is to establish the feasibility of designing and executing experiments comparing knowledge-acquisition techniques. These empirical comparisons should provide the data that permit us to categorize the kinds and amount of different kinds of knowledge that each technique elicits, so that the technique can be matched with the domain of expertise and the purpose of the resulting expert system to provide the knowledge engineer with the most effective means of building the knowledge base. Keywords: Artificial intelligence; Cognitive psychology; Expert systems; Knowledge acquisition; Route planning.
Formulas in the acquisition of English interrogatives: A case study

representation (THING). At the phonological level, the lexical unit contains a full specification of all the words that make up the expression, while in the schema one of the component units is replaced by a phonological place-holder (represented here by a blank). The crucial point, however, is that both share the same basic structure. Consequently, the transition
On combining collaborative and automated curation for enzyme function prediction

Data generation has vastly exceeded manual annotation in several areas of astronomy, biology, economy, geology, medicine and physics. At the same time, a public community of experts and hobbyists has developed around some of these disciplines thanks to open, editable web resources such as wikis and public annotation challenges. In this thesis I investigate under which conditions a combination of collaborative and automated curation could complete annotation tasks unattainable by human curators alone. My exemplar curation process is taken from the molecular biology domain: the association all existing enzymes (proteins catalysing a chemical reaction) with their function. Assigning enzymatic function to the proteins in a genome is the first essential problem of metabolic reconstruction, important for biology, medicine, industrial production and environmental studies. In the protein database UniProt, only 3% of the records are currently manually curated and only 60% of the 17 million recorded proteins have some functional annotation, including enzymatic annotation. The proteins in UniProt represent only about 380,000 animal species (2,000 of which have completely sequenced genomes) out of the estimated millions of species existing on earth. The enzyme annotation task already applies to millions of entries and this number is bound to increase rapidly as sequencing efforts intensify. To guide my analysis I first develop a basic model of collaborative curation and evaluate it against molecular biology knowledge bases. The analysis highlights a surprising similarity between open and closed annotation environments on metrics usually connected with “democracy” of content. I then develop and evaluate a method to enhance enzyme function annotation using machine learning which demonstrates very high accuracy, recall and precision and the capacity to scale to millions of enzyme instances. This method needs only a protein sequence as input and is thus widely applicable to genomic and metagenomic analysis. The last phase of the work uses active and guided learning to bring together collaborative and automatic curation. In active learning a machine learning algorithm suggests to the human curators which entry should be annotated next. This strategy has the potential to coordinate and reduce the amount of manual curation while improving classification performance and reducing the number of training instances needed. This work demonstrates the benefits of combining classic machine learning and guided learning to improve the quantity and quality of enzymatic knowledge and to bring us closer to the goal of annotating all existing enzymes.
Asymptotic capacity of multi-receiver networks

We formulate a notion of asymptotic capacity in bits/sec for a sequence of multi-user, multi-receiver networks. Using this notion of bit rate capacity, we define a dual notion of capacity in users per Hz and prove that the capacity region is convex. We consider an application of this result to mobile radio. <<ETX>>
What we have learned from our experience from TMIT-Stanford shared class

This paper describes our experience at Tokyo Metropolitan Institute of Technology in sharing a Mechanical Engineering Design class with Stanford University through the network. These classes are taught on the principle of project based learning and students are expected to form a team and to find a way to solve a problem by themselves. Although Stanford has a long experience in PBL, most of their experiences are on the campus. The shared class this time was one of the first in expanding this class across the national boundaries by the full use of computer capabilities. The purpose of this class is for the students to learn how to form a design team and how to come up with a good design plan. Students have to demonstrate how good their design plan is by producing a prototype. Thus, real manufacturing of a prototype is involved in the class activities and in addition, it has to be done across the national boundaries, and with time difference. This paper discusses how physical entity is necessary for ME classes and how a physical world should be combined with a virtual world.
Selective Harmonic Elimination PWM Method using Seven Level Inverters by Genetic Algorithm Optimization Technique

This paper proposes a method for optimization of the harmonic performance of inverters under selective harmonic elimination PWM modulation (SHEPWM) control. SHEPWM method is used to optimize harmonic stepped waveform for multi-level inverters using Genetic algorithm. It involves the solution of non-linear transcendental equation sets representing the relation between the amplitude of the fundamental wave, harmonic components and the switching angles. The genetic algorithm obtains the being optimal solution set of switching angles for each obligatory harmonic profile. Optimized SHEPWM sequences obtained for various operating points under different sampling frequencies are exposed to result in significant reduction of major harmonics while upholding the waveform quality inside prescribed limits. Keywords—Selective Harmonic Elimination PWM Method (SHEPWM), Genetic Algorithm (GA), Cascaded H-Bridge Multilevel Inverter, Optimization Technique.
Entwicklung eines Konzepts zur Annotation von grafischen Elementen in Visualisierungen

Einer der zeitaufwendigsten Aspekte bei der Durchfuhrung von Eye-Tracking Studien im Bereich der Visualisierung ist, neben dem Entwurf und dem Design der Studie, vor allem die Auswertung der Blickdaten. Diese Blickdaten werden in Form von einzelnen Positionen mit Hilfe eines Eye-Trackers aufgezeichnet. Anschliesend mussen von Hand diejenigen Elemente einer Visualisierung identifiziert werden, die sich an den gemessenen Positionen befinden. Durch diese Abbildung von Positionen auf visuelle Elemente wird das Ziehen von Schlussen uber die Vorgehensweise eines Probanden und dessen kognitive Prozesse beim Betrachten von Visualisierungen moglich. Das Ziel dieser Studienarbeit ist, ein Konzept zu entwickeln, welches die Annotation von grafischen Elementen in Visualisierungen durch semantische Informationen aus einer Visualisierungs-Ontologie ermoglicht. Anhand eines Fixationspunkts eines Probanden kann aufgrund der Annotierung dann automatisch bestimmt werden, welche visuellen Elemente sich an dieser Position befinden, sowie welche Metainformationen diese enthalten. Der implementierte Prototyp demonstriert, dass das Konzept in bestehende Visualisierungs-Frameworks integriert werden kann. Dazu wurden auserdem drei verschiedene Visualisierungstechniken beispielhaft semantisch annotiert. One of the most time-consuming aspects when carrying out eye tracking studies in the field of visualization is, besides the outline and the design of the study, the analysis of the gaze data. The gaze data is collected as several positions by using an eye-tracker. Afterwards the elements of a visualization, which are located at the measured positions, have to be identified manually. This mapping from positions to visual elements enhances the user’s ability to draw conclusions about the approach of a subject and its cognitive processes while viewing visualizations. The aim of this thesis is to develop a concept, which allows the annotation of graphical elements in visualizations by using semantic information from a visualization ontology. Due to the annotation, it is possible to automatically determine which visual elements are located at a fixation point of a subject and which meta information the perceived elements contain. The implemented prototype demonstrates that the concept can be integrated into existing visualization frameworks. Furthermore three different visualization techniques have been semantically annotated as an example.
Module 7: Multilevel Models for Binary Responses (Concepts)

C7.5. 1 A random slope logit model . 27 C7.5. 2 Example: Allowing the relationship between income and voting intentions in the US to vary across states . 28 C7.5. 3 Two random coefficients: Allowing income and urban-rural differentials in voting intentions to vary across states . 32
Investigation on nonlinear filtering algorithms for GPS

Presents the results obtained in our research about application of modern nonlinear filtering techniques to GPS based position estimation. The stand-alone GPS based position estimation problem using GPS pseudo-range and Doppler shifts measurements are described. A model for position and velocity estimation are developed. The model is nonlinear and has variable measurement number for coping with an arbitrary number of satellites. Over the last 20-30 years, the extended Kalman filter (EKF) has become the algorithm of choice in numerous nonlinear estimation and machine learning applications. In this work the use of an alternative filter: the unscented Kalman filter (UKF) is proposed. The first experimental results that comprise the comparison of estimation results obtained with a simple model using different filters are then presented. Future research directions are also discussed.
Supporting learners: The tension between institutional provision and learners’ expectations

The rapid growth of open, distance, online, and flexible qualification programmes over the last decade has introduced a new set of challenges for tertiary education providers. Study from a distance increases the support and interaction needs of learners with a diverse range of academic skills and abilities. This paper will discuss the issues and challenges faced by both tertiary institutions and learners in the provision of effective support systems for open and distance courses, supported by data from three research studies.
Multi-objective Scheduling of Flow-Shop Problems in Finishing Factory Using Genetic Algorithms

The most important trend in chemical finishing is characterized by the key term ‘better cost-efficiency relation’. In this work, we have tried to attain inferior cost by optimization of the scheduling of resources using genetic algorithms. This work is divided in two steps. In the first one, we studied the times of production process in order to show the difference between the predicted time and the real time of finishing process. In second one, we have setting up a program for scheduling jobs using multi-objective genetic algorithm.
Digital carrier demodulation for the DSN Advanced Receiver

The digital in-phase and quadrature (I and Q) carrier demodulation for the Deep Space Network's (DSN) Advanced Receiver is described and analyzed. The system provides coherent demodulation for a variety of modulation formats including Binary Phase Shift Keying (BPSK), BPSK with a carrier residual, Quadrature Phase Shift Keying (QPSK), Offset-QPSK (OQPSK), and Minimum Shift Keying (MSK). The focus is on the theory and hardware design of the halfband filters which are the integral part of the demodulator. The underlying theory of the filters is summarized, a breadboard hardware design is described, and a VLSI implementation is proposed which significantly decreases the hardware. A second important problem analyzed is DC-offset in the demodulator. This is a serious problem which translates into bias error in the residual carrier phase detector. The dynamic range of the complex mixer is analyzed using a probabilistic approach. It is deduced that the resulting static phase error is less than 0.2 deg when the ratio of carrier power to noise power in the demodulator input bandwidth is -72 dB or higher. Thus, the static phase error is negligible at a carrier power to noise spectral density of 0 dB-Hz for a 15 MHz bandwidth demodulator.
A Taxonomy of Data Communication Protocols for Vehicular Ad Hoc Networks

Vehicular Ad Hoc Networks (VANETs) are the potential core of the Intelligent Transportation System (ITS) which aims to increase people safety and improve transportation efficiency. In this paper, we provide the first known taxonomy of VANET data communication protocols, based on road dimension, neighbor knowledge, acknowledgment, start of forwarding, competition to retransmit, vehicle connectivity, urgency, and message contents. The taxonomy provides fundamental blocks in VANET data communication protocols and help researchers better understand the details of each protocol. Further, the taxonomy helps in designing new protocols, by replacing one option by another from the same category. It also helps to understand various limitations of certain protocols, and the need to generalize these protocols and apply them in various VANET applications and scenarios. We also provide here a survey of recent data communication protocols, and a tutorial on how most of them work. 14.
How Do Median Graduate Economic Programs Differ from Top-ranked Programs?

This paper reports the results of a survey of median economics graduate programs and compares it with the results of a survey of top economics graduate programs done by Colander. Overall it finds that while there are some differences in the programs, there are large areas of similarity. Some of the particular finding are that there are more US respondents in median programs than in top programs, median students have more interest in econometrics, history of thought and economic literature than do students at top programs, although after the fifth year, their interest in any field drops significantly. It also finds that students at top schools are much more likely to be involved in writing scholarly papers, and that students at top schools give far less emphasis to excellence in mathematics as a path to the fast track than do students at median schools.