Miracle-dz/UniFAR-FTUs huggingface dataset:
Implementation of nonuniform reliability in a deregulated power market

Power system deregulation has introduced some fundamental problems regarding system security and customer reliability. This paper presents some reliability models for different market players in an arbitrary power market. A generation system is represented by an equivalent multi-state generation provider and a transmission system is represented by an equivalent multistate transmission provider. The parameters of the equivalent service providers are determined using reliability network equivalent techniques. The determination and implementation of nonuniform reliability are illustrated. A test system is used to illustrate the application of these techniques.
Evaluation of the A-7 Requirements Document by Analysis of Change Data.

Abstract : We describe in this report an effective data collection method for evaluating software development methodologies, from definition of the objectives of the data collection to analysis of the results. We show how the data analysis can answer questions with respect to how successfully the goals of the development methodology are met. The A-7 requirements document is used as an example. We provide the results of data analyses conducted partway through the A-7 flight software development cycle, and we discuss the utility of information obtained by such partial analyses. Results from the study show that data collection is feasible and useful when performed as part of configuration control, that data distributions based on partial data provided useful feedback to the developers, and that the A-7 requirements document is easily maintained and changed. (Author)
Server side round-trip delay measurements in WAP environments

Wireless Internet access is one of highest increasing service segments in telecom area. It offers the freedom of mobility and mass information backbone to the user. Providing general service quality framework around the system is necessary for a lot of reasons. Measurements and continuous monitoring of network performance is one of the key element of such framework. The methods developed for performance measurements in normal Internet environment cannot be directly applied due to the different properties of the wireless client terminals, used protocol stack and the server content. However, the methodology is usable and with the appropriate modifications the required procedures can be defined. The paper deals with the definition and implementation of the measurements and monitoring of the round trip delay in a WAP based wireless access environment.
The coordination of cognitive processes in solving geometric problems requiring formal proof

We present here a study designed to analyse the cognitive processes relating to visualisation and reasoning as shown by trainee primary teachers when solving geometry problems. The purpose of this research is to understand and describe the role played by cognitive activity in order to enable the subjects to construct geometrical proofs in a pencil-and-paper environment.
Developing and Assessing Research-Based Tools for Teaching Quantum Mechanics and Thermodynamics

Research-based tools to educate college students in physics courses from introductory level to graduate level are essential for helping students with a diverse set of goals and backgrounds learn physics. This thesis explores issues related to student common difficulties with some topics in undergraduate quantum mechanics and thermodynamics courses. Student difficulties in learning quantum mechanics and thermodynamics is investigated by administering written tests and surveys to many classes and conducting individual interviews with a subset of students outside the class to unpack the cognitive mechanism of the difficulties. The quantum mechanics research also focuses on using the research on student difficulties for the development and evaluation of a Quantum Interactive Learning Tutorial (QuILT) to help students learn about the time-dependence of expectation values using the context of Larmor precession of spin and evaluating the role of asking students to self-diagnose their mistakes on midterm examination on their performance on subsequent problem solving. The QuILT on Larmor precession of spin has both paper-pencil activities and a simulation component to help students learn these foundational issues in quantum mechanics. Preliminary evaluations suggest that the QuILT, which strives to help students build a robust knowledge structure of time-dependence of expectation values in quantum mechanics using a guided approach, is successful in helping students learn these topics in the junior-senior level quantum mechanics courses. The technique to help upper-level students in quantum mechanics courses effectively engage in the process of learning from their mistakes is also found to be effective. In particular, research shows that the self-diagnosis activity in upper-level quantum mechanics significantly helps students who are struggling and this activity can reduce the gap between the high and low achieving students on subsequent problem solving. Finally, a survey of Thermodynamic Processes and the First and Second Laws (STPFaSL) is developed and validated with the purpose of evaluating the effectiveness of these topics in a thermodynamics curriculum. The validity and reliability of this survey is discussed and the student difficulties with these topics among various groups from introductory students to physics graduate students is cataloged.
Refactoring object-oriented frameworks

This thesis defines a set of program restructuring operations (refactorings) that support the design, evolution and reuse of object-oriented application frameworks. The focus of the thesis is on automating the refactorings in a way that preserves the behavior of a program. The refactorings are defined to be behavior preserving, provided that their preconditions are met. Most of the refactorings are simple to implement and it is almost trivial to show that they are behavior preserving. However, for a few refactorings, one or more of their preconditions are in general undecidable. Fortunately, for some cases it can be determined whether these refactorings can be applied safely. Three of the most complex refactorings are defined in detail: generalizing the inheritance hierarchy, specializing the inheritance hierarchy and using aggregations to model the relationships among classes. These operations are decomposed into more primitive parts, and the power of these operations is discussed from the perspectives of automatability and usefulness in supporting design. Two design constraints needed in refactoring are class invariants and exclusive components. These constraints are needed to ensure that behavior is preserved across some refactorings. This thesis gives some conservative algorithms for determining whether a program satisfies these constraints, and describes how to use this design information to refactor a program.
On the role of vowel duration in the New Zealand English front vowel shift

Abstract This article investigates the role of vowel duration in the front vowel system of New Zealand English (NZE), drawing on data obtained from speakers born between the 1890s and the 1930s. After providing a brief overview of the history of short vowels in NZE, a comprehensive analysis of front vowel duration in conjunction with a number of earlier results from formant frequency measurements will be presented. It will be shown that the front vowel system of NZE shows interaction between vowel duration and formant frequency. A number of implications that follow from these patterns for the front vowel system of NZE will be discussed. It will be argued that it is reasonable to divide up the class of short front vowels in NZE into a short set (consisting only of one vowel) and a “not-so-short set. ” In addition, it will be concluded that phonological class membership is irrelevant to making generalizations over patterns of movements in vowel change.
Parallel prefetching and caching

High-performance I/O systems depend on prefetching and caching to deliver good performance to applications. These two techniques have generally been considered in isolation, even though there are significant interactions between them: a block prefetched too early may cause a block that is needed soon to be evicted from the cache, thus reducing the effectiveness of the cache, while a block cached too long may reduce the effectiveness of prefetching by denying opportunities to the prefetcher. Using both analytical and experimental methods, we study the problem of integrated prefetching and caching for an I/O system with multiple disks. In a theoretical analysis, we consider algorithms for integrated prefetching and caching in a model abstracting relevant characteristics of file systems with multiple disks. Previously, the "aggressive" algorithm was shown by Cao, Felten, Karlin, and Li to have near-optimal performance in the single disk case. We show that the natural extension of the aggressive algorithm to the parallel disk case is suboptimal by a factor near the number of disks in the worst case. Our main theoretical result is a new algorithm, "reverse aggressive," with provably near-optimal performance in the presence of multiple disks. Using disk-accurate trace-driven simulation, we explore the performance characteristics of several algorithms in cases in which applications provide full advance knowledge of accesses using hints. The algorithms tested are the two mentioned previously, plus the "fixed horizon" algorithm of Patterson et al., and a new algorithm, "forestall," that combines the desirable characteristics of the others. We find that when performance is limited by I/O stalls, aggressive prefetching helps to alleviate the problem; that more conservative prefetching is appropriate when significant I/O stalls are not present; and that a single, simple strategy is capable of doing both. We also consider three related problems. First, we present an optimal algorithm for a restricted version of the single disk prefetching and caching problem. Next, we propose an approach to the integration of prefetching and caching policies with processor and disk scheduling policies. Finally, we show the NP-hardness of a problem of ordering requests to maximize locality of reference.
A Survey Paper on Hyperlink?Induced Topic Search (HITS) Algorithms for Web Mining

--In this Paper Hyperlink-Induced Topic Search (HITS) is a link algorithm for web mining which helps in rating Web pages also known as Hubs and authorities fast and efficient HITS are query dependent and calculated at the time of the search. HITS mechanism for web crawling and retrieval remains as a challenging issue. This paper deals with Survey and comparison of web page ranking algorithms based on various parameter to find out their advantages and limitations for the ranking of the web pages using Web mining. Web mining technique is used to categorize users and pages by analyzing users behavior, the content of pages and order of URLs accessed. In this paper we discuss and compare the different used algorithms i.e.Page Rank and HITS.
ScaleFS : a multicore-scalable file system

It is difficult to achieve durability and crash consistency in file systems along with multicore scalability. Commutative file system operations, which should scale according to the Scalable Commutativity Property, conflict on shared resources like coarse-grained locks and pages present in the page cache or buffer cache. Furthermore, data structures that are on separate cache lines in memory (e.g., directory entries) are grouped together when the file system writes them to disk for durability. This grouping results in additional conflicts. This thesis introduces a new design approach that decouples the in-memory file system from the on-disk file system, using per core operation logs. This facilitates the use of highly concurrent data structures for the in-memory representation, which is essential for commutative operations to proceed conflict free and hence scale perfectly. The in-memory representation does not propagate updates to the disk representation immediately, instead it simply logs the operation in a per core logical log. A sync or an fsync call processes these operations and applies them to the disk. Techniques based on time stamping linearization points of file system operations ensure crash consistency, and dependency tracking ensures good disk performance. A prototype file system, SCALEFS, implements this new approach and techniques. Experiments using COMMUTER and SCALEFS show that the implementation is conflict free for 99% of test cases involving commutative operations. Thesis Supervisor: M. Frans Kaashoek Title: Professor Thesis Supervisor: Nickolai Zeldovich Title: Associate Professor
Toward a shared understanding of competency in programming: an invitation to the BABELnot project

The ICT degrees in most Australian universities have a sequence of up to three programming subjects, or units. BABELnot is an ALTC-funded project that will document the academic standards associated with those three subjects in the six participating universities and, if possible, at other universities. This will necessitate the development of a rich framework for describing the learning goals associated with programming. It will also be necessary to benchmark exam questions that are mapped onto this framework. As part of the project, workshops are planned for ACE 2012, ICER 2012 and ACE 2013, to elicit feedback from the broader Australasian computing education community, and to disseminate the project's findings. The purpose of this paper is to introduce the project to that broader Australasian computing education community and to invite their active participation.
Survey on Data Annotation for Search Results from Web Databases

A large portion of web is database based. This portion is accessible through html form based interface. For many search engines data result come from structured database called Web database(WDBs). Results returned from WDBs are called Search Result Records (SRRs). Data unit returned from WDBs are encoded into result pages dynamically for user browsing. These data unit are need to be extracted and assigned a meaning full labels. For encoded data unit to be machine process able the proposed system presents dynamic annotation approach which align data unit on result pages in different pages. Data in same group will have same semantic. This paper provides annotation for each group from different aspects and aggregate different annotation to predict final annotation label for it. An annotation wrapper is used to annotate new result pages from same database. Keywords— Data alignment, Data annotation, Web database,
Are Students Ready to Adopt E-Portfolio? Social Science and Humanities Context

This paper presents the learners readiness towards the implementation of E-Portfolio as means of solving the persistent problems in educational setting. The purpose of the study was to examine the learner’s readiness towards the implementation E-Portfolio in higher education. Initially, this paper was conducted a study with a total number of 300 students form Social Sciences and Humanites cluster and then practicing portfolio in their coursework. The pilot study was conducted and showed the reliability coefficient with Cronbach’s alpha () is 0.825. The instrument was divided into five components which involved (1) technology accessibility (2) online skills and relationship (3) motivation (4) internet discussion and (5) importance to success, to measure the learners’ readiness. The findings were reported that students are ready to have an E-Portfolio as a learning tool in constructing their knowledge and experience of learning. The E-Portfolio will extend the opportunity from paper-based into the electronic based with a variety of online learning features in gaining students interest and motivation in learning. At the end of the day, the E-Portfolio will not only benefit the students and the faculty but also towards the employability.
Mathematical and computational aspects of lexicalized grammars

Most current linguistic theories give lexical accounts of several phenomena that used to be considered purely syntactic. The information put in the lexicon is thereby increased both in amount and complexity. We explore the view that syntactic rules are not separated from lexical items. In this approach, each elementary structure is associated with a lexical item called the anchor. These structures specify extended domains of locality (as compared to context-free grammars) over which constraints can be stated. The 'grammar' consists of a lexicon where each lexical item is associated with a finite number of structures for which that item is the anchor. There are 'rules' which tell us how these structures are composed. A grammar of this form will be said to be lexicalized. The process of lexicalization of context-free grammars (CFGs) constrained by linguistic requirements forces us to use operations for combining structures that make the formalism fall in the class of mildly context sensitive languages. We show that substitution, the combining operation corresponding to CFGs, does not allow one to lexicalize CFGs but the combination of substitution and adjunction does. We show how tree-adjoining grammar (TAG) is derived from the lexicalization process of CFGs. Then we show that TAGs are closed under lexicalization and we illustrate the main structures found in a lexicalized TAG for English. The properties of TAGs permit us to encapsulate diverse syntactic phenomena in a very natural way. TAG's extended domain of locality and its factoring of recursion from local dependencies enable us to localize many syntactic dependencies (such as filler-gap) as well as semantic dependencies (such as predicate-arguments). We investigate the processing of lexicalized TAGs. We first present two general practical parsers that follow Earley-style parsing. They are practical parsers for TAGs because, as for CFGs, the average behavior of Earley-type parsers is superior to its worst case complexity. They are both left to right bottom-up parsers that use top-down predictions but they differ in the way the top down prediction is used. Then we explain the building of a set of deterministic bottom-up left to right parsers which analyze a subset of tree-adjoining languages. The LR parsing strategy for CFGs is extended to TAG by using a machine, called Bottom-up Embedded Push Down Automaton (BEPDA), that recognizes in a bottom-up fashion the set of tree-adjoining languages (and exactly this set). Finally we show how lexicalized grammars suggest a natural two-step parsing strategy. We consider lexicalized TAGs as an instance of lexicalized grammar and we examine the effect of the two-step parsing strategy on main types of parsing algorithms.
How do American University Students "Invite" others?: A Corpus‑based Study of Linguistic Strategies for the Speech Act of "Invitations"⑴

This paper examines pragmatic strategies employed by native English speak‑ ers for the performance of an English speech act of “invitation” through analyses of responses provided by U.S. university undergraduate students with the use of the DCT (= discourse completion test. The analyses of the linguistic strategies have been carried out at the (1 lexical (2 grammatical and (3 discourse levels along with the strategy combinations applied by native American English speakers. The results also indicate that the use of corpus data can be effective for ELT (English Language Teaching pursuing the methodology of CLT (Communicative Language Teaching in that the database can supply materials which provide “natural” and “appropriate” examples of English language use in a context where one needs to perform a specific speech act such as “invitation. ”
Introduction To Cryptography With Java Applets

Introduction to Cryptography with Java Applets covers the mathematical basis of cryptography and cryptanalysis, like linear diophantine equations, linear congruences, systems of linear congruences, quadratic congruences, and exponential congruences. The chapters present theorems and proofs, and many mathematical examples. Cryptography with Java Applets also covers programming ciphers and cryptanalytic attacks on ciphers. In addition many other types of cryptographic applications, like digest functions, shadows, database encryption, message signing, establishing keys, large integer arithmetic, pseudo-random bit generation, and authentication are included. The author has developed various Java crypto classes to perform these functions, and many programming exercises are assigned to the reader. The reader should be someone with a basic working knowledge of Java, but knowledge of number theory or cryptography is not necessary.
Efficient Resource Scheduling in Multiprocessors

Abstract : As multiprocessing becomes increasingly successful in scientific and commercial computing, parallel systems will be subjected to increasingly complex and challenging workloads. To ensure good job response and high resource utilization, algorithms are needed to allocate resources to jobs and to schedule the jobs. The focus of this thesis is in between the theory and practice of scheduling: it includes modeling, performance analysis and practical algorithmic. We present a variety of new techniques for scheduling problems relevant to parallel scientific computing. The thesis progresses from new compile-time algorithms for message scheduling through new runtime algorithms for processor scheduling to a unified framework for allocating multiprocessor resources to competing jobs while optimizing both individual application performance and system throughput. The compiler algorithm schedules network communication for parallel programs accessing distributed arrays. By analyzing and optimizing communication patterns globally, we often reduce communication costs by factors of two to three in an implementation based on IBM's High-Performance Fortran compiler. The best parallelizing compilers at present support regular, static, array-based parallelism. But parallel programmers are out-growing this model. Many scientific and commercial applications have a two-level structure: the outer level is a potentially irregular and dynamic task graph, and the inner level comprises relatively regular parallelism within each task. We give new runtime algorithms for allocating processors to such tasks.
Learning Based Job Scheduling Algorithm Based On Map Reduce Framework

MapReduce has become a popular paradigm for large scale data processing in the cloud. The sheer scale of MapReduce deployments make job scheduling in MapReduce an interesting problem. The scale of MapReduce applications presents unique opportunity to use data driven algorithms in resource management. We present a learning based scheduler that tries to allocate a task on a node if the incoming task does not affect the tasks already running on that node.We propose an approach which tries to find a good mix of jobs for each worker node, and in turn decrease their runtime. In our model, the scheduler is made aware of different types of jobs running on the cluster. From the list of available pending tasks, our algorithm selects the one that is most compatible with the tasks already running on that node. We bring up machine learning based solution to our approach and try to maintain a resource balance on the cluster by not overloading any of the nodes, thereby reducing the overall runtime of the jobs.
The analysis of multi-channel sound reproduction algorithms using HRTF data.

Described in this paper is a method for the analysis and comparison of multi-speaker surround sound algorithms using HRTF data. Using Matlab and Simulink [1] a number of surround sound systems were modeled, both over multiple speakers (for listening tests) and using the MIT Media Labs HRTF set (for analysis)[2]. The systems under test were 1 Order Ambisonics over eight and five speakers, 2 Order Ambisonics over eight speakers and Amplitude panned 5.0 over five speakers. The listening test results were then compared to the HRTF analysis with favourable results.