Miracle-dz/UniFAR-FTUs huggingface dataset:
Translating concurrent communicating programs into asynchronous circuits

As VLSI technology improves, the number of devices that can be built on a chip, and the speed of those devices continue to increase. These improvements allow much more complicated systems to be considered than were possible a short time ago. Along with these improvements, however, come many challenges directly associated with the speed and scale of the new circuits. This thesis presents a method for taming the complexity of large and fast VLSI systems. As chips get larger, and delays in signal propagation even inside a single chip become more significant, systems that are designed around a global synchronizing signal such as a clock become more difficult to design. One alternative is to design the system hierarchically as a set of subsystems each operating at its own rate and cooperating through communication. These subsystems can be built using asynchronous or self-timed circuit techniques which allow the circuits to run at their own speed without synchronizing to a global clock signal. The act of communicating synchronizes the processes involved in the communication and allows data to be shared between processes. Another problem of large systems is related to the very complexity of the system. One method for taming this complexity is to use automatic methods for generating circuits from behavioral descriptions. Such a system is usually called a silicon compiler. This allows the designer to abstract away details of the low-level circuits and think of system behavior in terms of high level programs. Because the generated circuits faithfully mimic the behavior of the program, the resulting circuits are correct by construction. In order to design efficient systems in this way there must be a way for the programmer to reason about the resulting circuit based on the program text. The translation process must be sufficiently transparent to give the programmer some idea of how different program alternatives will affect the compiled circuit. Combining these ideas, I present a method for designing a VLSI system as a concurrent program written in a subset of OCCAM and automatically translating that system description into an asynchronous circuit. The translation procedure is syntax-directed, and the resulting circuits are improved using correctness-preserving circuit-to-circuit transformations. A compiler has been constructed that automatically performs the translation and transformation.
Plagiarism and its implications on higher education in developing countries

Plagiarism at higher education institutions is a big threat to academic standards. It is a widely prevalent phenomenon in student population, although mainly due to their lack of awareness, but also due to weak controlling mechanisms within the education systems. Coupled with socio-economic situations, plagiarism becomes a big motivation to enhance academic credentials and to gain financial benefits. Transformation into knowledge-based economy is the only hope for the developing countries to be competitive in modern world. Poor educational standard could create lack of competitiveness among graduates in developing countries to be competitive at international level. In this paper, we discuss the motivation and reasons for indulging in plagiarism for students and academicians in educational institutions in developing countries. We also provide guidelines for controlling the phenomenon from academic institutions. Our guidelines suggest an extensive focus on higher education provision by the policy makers to implement a well thought out strategy.
Trends in handover design

Handover is the mechanism that transfers an ongoing call from one cell to another as a user moves through the coverage area of a cellular system. As smaller cells are deployed to meet the demands for increased capacity, the number of cell boundary crossings increases. The author presents an overview of published work on handover performance and control and discusses current trends in handover research. He discusses investigations that are applicable to a single tier of cells. He focuses on macrocells, but includes a brief discussion on how things change as cell sizes shrink. By assuming an overlay of macrocells and microcells he summarizes issues and approaches unique to such systems.
Developing Professional-Level Language Proficiency: Toward academic-level foreign language abilities: reconsidering foundational assumptions, expanding pedagogical options

Among the most enduring and pronounced disjunctures in American college foreign language (FL) programs is that between the lofty desire for students to attain upper levels of performance in a second language (L2) and realities on the ground. On the one hand, the ideal of upper-level L2 abilities – henceforth generically referred to as advanced second language (AL 2) use – is alive and well as indicated in departmental mission and goals statements and also in the profession's continued insistence on “near-native abilities” in candidates for faculty positions (Koike and Liskin-Gasparro [1999]). On the other hand, we know that the first few semesters at best enable students to acquire basic interactional facility in the L2 and that the subsequent content courses rarely even state appropriate acquisitional goals much less incorporate explicit instructional interventions that target AL 2 learning. However, a mismatch that may have been tolerable in the past may no longer be workable in the future, as external demands press in on the profession, with serious consequences for FL departments, including the outsourcing of language instruction, the dramatic reorganization of some departments, and even their closing (Schneider [2001]). For the real meaning to FL departments of the much-hailed globalization, the greater ethnic and linguistic diversity of nations, and the demands for more democratization around the world may not simply be that societies require a multilingual citizenry but that this citizenry of the future requires upper levels of language abilities so as to be able to use an L2 competently in a wide variety of public and professional contexts and not only in private settings among family and friends.
Analisis Pengaruh City Branding Dan Word Of Mouth Terhadap Minat Berkunjung Serta Dampaknya Terhadap Keputusan Berkunjung Ke Sukabumi

vi ABSTRAK . vii KATA PENGANTAR . viii DAFTAR ISI . xi DAFTAR TABEL . xiv DAFTAR GAMBAR . xvii DAFTAR LAMPIRAN . xviii BAB I . 1 PENDAHULUAN . 1 A. Latar Belakang . 1 B. Perumusan Masalah . 12 C. Tujuan dan Manfaat Penelitian . 13 BAB II . 16 TINJAUAN PUSTAKA . 16 A. LANDASAN TEORI . 16 1. Pemasaran Jasa . 16 2. City Branding . 24 3. Word of Mouth . 33 4. Minat Berkunjung Wisatawan . 40 5. Keputusan Berkunjung Wisatwan . 42 B. Hubungan Antar Variabel . 51 C. Penelitian Terdahulu . 52 D. Kerangka Berpikir . 62 E. Hipotesis . 64 xii BAB III . 66 METODOLOGI PENELITIAN . 66 A. Ruang Lingkup Penelitian. 66 1. Populasi Penelitian . 67 2. Sampel Penelitian . 67 C. Metode Pengumpulan Data . 68 1. Sumber Data . 68 D. Metode Analisis Data . 71 1. Uji kualitas data . 71 E. Analisis Jalur (Path Analysis) . 72 1. Koefisien Korelasi . 74 2. Koefisien Determinasi (Goodness of Fit) . 75 3. Uji Signifikansi Simultan (Uji F) . 76 4. Uji Signifikan Parameter Individu (Uji Statistik t) . 76 F. Uji Sobel . 77 G. Operasional Variabel Penelitian . 77 BAB IV . 82 ANALISIS DAN PEMBAHASAN . 82 A. Sekilas Gambaran Umum Sukabumi . 82 B. Analisis Dan Pembahasan . 83 1. Deskripsi Data Responden . 83 2. Uji Kualitas Data . 86 3. Analisis Deskriptif . 91 4. Analisis Jalur (Path Analysis) . 122 5. Uji Signifikansi Simultan (Uji F) . 127 6. Uji Signifikansi Individu (Uji t) . 129 7. Diagram Analisis Jalur . 135 8. Uji Sobel . 136 9. Perhitungan Pengaruh . 139 BAB V . 144 xiii KESIMPULAN DAN SARAN . 144 A. Kesimpulan . 144 B. Saran . 145 DAFTAR PUSTAKA . 147 LAMPIRAN . 151
Application of fuzzy tools to the automatic analysis of system dynamics models: an example of World3

Abstract Even the simple run of a medium size system dynamics model can be a cumbersome process, since the uncertainty of the parameters forces the modeler to consider many runs before being confident of how the model behaves. System dynamics simulation packages include some analysis tools, but there is a lack of a commonly used analysis tool such as fuzzy clustering. In this paper, we explore the possibilities of a programming language, Matlab, and its simulation tool, Simulink, for the above mentioned possibilities. These languages enable the development of customized analysis tools at a very low programming cost. World3 model is a widely known example of a large model whose analysis becomes a difficult task. We have programmed this model in Simulink and, afterwards, some tools, such as fuzzy clustering and pathway participation metric (PPM), have been applied to show their potential capacity to facilitate model simulation analyses.
Analytical and empirical ENOB in evaluation analysis of cyclic A/D coverters performance

The paper is devoted to the problem of accurate assessment of the expected and real effective number of bits (ENOB) of the cyclic A/D converter. The analysis is performed on the example of sub-optimal intelligent cyclic ADC (IC ADC). There is shown the equivalence of definition of ENOB in IEEE standard and analytical measures of IC ADC performance used. The non-direct and direct methods of ENOB assessment are discussed. The obtained results can be used for development of mathematically based procedures of actual ADC performance analysis and testing.
Cache design strategies for efficient adaptive line placement

Efficient memory hierarchy design is critical due to the large difference between the speed of the processors and the memory. In this context, cache memories play a crucial role bridging this gap. Cache management has become even more significant due to the appearance of chip multiprocessors (CMPs), which imply larger memory bandwidth requirements and greater working sets of many emerging applications, and which also need a fair and efficient distribution of cache resources between the cores in a single chip. This dissertation aims to analyze some of the problems commonly found in modern caches and to propose cost-effective solutions to improve their performance. Most of the approaches proposed in this Thesis reduce cache miss rates by taking advantage of the different levels of demand cache sets may experience. This way, lines are placed in underutilized cache blocks of other cache sets if they are likely to be reused in the near future and there is no enough space in their native cache set. When this does not suffice, this dissertation proposes to modify in a coordinated way the insertion policies of oversubscribed sets. Hence, our proposals retain the most useful part of the working set in the cache while discarding temporary data as soon as possible. These ideas, initially developed in the context of last-level caches (LLCs) in single core systems, are successfully adapted in this Thesis to first-level caches and multicore systems. Regarding first-level caches, a novel design that allows to dynamically allocate banks to the instruction or the data cache depending on their degree of pressure is presented. As for multicore systems, our designs are firstly provided with thread-awareness in shared caches in order to give a particular treatment to each stream of requests depending on its owner. Finally, we explore the sharing of resources by means of the spilling of lines among private LLCs in CMPs using several innovative features such as a neutral state, which prevents caches from taking part in the spilling mechanism if this could be harmful, variable granularities for the management of the caches, or the coordinated management of the cache insertion policy. Throughout this process we have used a simple and cost-effective metric to track the state of each cache set called Set Saturation Level (SSL). Finally, it is worthy to point out that our approaches are very competitive and often outperform many of the most recent techniques in the field, despite they imply really small storage and power consumption overheads.
Use of wikis in K-12 and higher education: a review of the research

One of the many recent technologies to appear in the educational landscape is the wiki. Drawing on literature until end of January 2008, we review past empirical research studies on the use of wikis in K-12 and higher education settings. This review is organised into three topics: the settings in which research on wiki was conducted, effects of wiki on learners' outcomes and wiki usage profile. The conclusions overall suggest that most of the studies reviewed were descriptive and conducted in higher education settings involving participants from North America, and that past wiki research had been most frequently conducted in the education, and engineering and sciences disciplines. The question on whether the use of wikis can improve learners' outcome such as writing ability is unresolved. Students liked the asynchronicity and traceability features of the wiki. Students' use of wikis seemed to be influenced by four main factors: wiki usability, pedagogical issues, social environment and students' technical knowledge and skills. Several limitations of previous empirical studies were discussed. We conclude by providing some recommendations for future research related to the use of wiki in education settings.
Analysis, preliminary design and simulation systems for control-structure interaction problems

Software aspects of control-structure interaction (CSI) analysis are discussed. The following subject areas are covered: (1) implementation of a partitioned algorithm for simulation of large CSI problems; (2) second-order discrete Kalman filtering equations for CSI simulations; and (3) parallel computations and control of adaptive structures.
Stereo image correspondence methods for efficient hardware implementation

Solution Volume C(i,j,d) Figure 47. Visualization of the Abstract Volume Compared to the Cubic Volume. After [12] The abstract solution volume is stable so long as the maximum slope p of the solution surface does not exceed the search range . D If the slope is greater than the search range, the abstract solution has discontinuous regions that cannot be solved using the second stage minimum distance of the dynamic program. The discontinuity appears to the TSDP algorithm as all paths through the discontinuity having infinity cost.
Protecting Software Execution by Dynamic Environment Hardening

Software has an important role in many systems, in particular in critical systems where the correct function of the larger system is of utmost importance. Software malfunction, or software exploits, that allow other system components or an adversary to control the execution of software, can cause significant damage to the system, and hence to what is controlled by the system. Due to the complexity in, and construction of, modern software systems, it is not sufficient to only analyze software source, such as source code, trying to find vulnerabilities that might enable exploits when executing. Instead, software protection must be extended with methods that consider the actual software execution, typically by executing in parallel with the software, and that protect the software as it executes. By using such methods, we can detect unwanted execution and protect against many exploits where the underlying vulnerability is difficult or impossible to find using only pre-execution, or static, methods. In this thesis, we present a methodology, and model for protecting software execution. We argue for the merits of dynamic methods, i.e. methods that consider the actual software execution, and we present a number of principles for how dynamic methods can be constructed. We also present three experiment systems that we have constructed, and show how the dynamic methods represented through these systems can be used to protect software execution and hence protect a system against exploits.
RHETORICAL STRUCTURE THEORY: A THEORY OF TEXT ORGANIZATION

Abstract : Rhetorical Structure Theory is a descriptive theory of a major aspect of the organization of natural text. It is a linguistically useful method for describing natural texts, characterizing their structure primarily in terms of relations that hold between parts of the text. This paper establishes a new definitional foundation for RST. Definitions are made more systematic and explicit, they introduce a new functional element, and incidentally reflect more experience in text analysis. Along with the definitions, the paper examines three claims and findings of RST: the predominance of nucleus/satellite structural patterns, the functional basis of hierarchy, and the communicative role of text structure. (Author) Keywords: Artificial intelligence; Coherence; Computational linguistics; Discourse; Grammar; Knowledge delivery; Natural language processing; Pragmatics.
Research on Undergraduate Students’ Usage Satisfaction of Mobile Learning

This research focuses on the usage satisfaction of mobile learning among undergraduate students, and adopts the structure of close-ended and the Likert-Scale five-point measure questionnaire. There are 300 respondents from Southwest University. The questionnaires are randomly delivered to students from different majors and grades. The result indicates: 1) most of the undergraduate students are satisfied with mobile learning (76%) and will use mobile learning in future learning (84%). 2) More than half of the respondents have benefited from mobile learning, especially in quickly solving problems encountered in learning and making better use of learning time. 3) Undergraduate students are satisfied with the text content and image content in mobile learning, but the video content gets few agreements (11.4%). 4) The item “I am satisfied with the mobile learning resources provided by my university” gets the lowest mean score (M = 2.15), so teachers and universities should pay more energy and effort to promote the quality of mobile learning resources.
Ranking large networks : leadership, optimization and distrust

Large networks mathematically models the connections between items (generally millions or billions of items). For instance, people using their mobile phones live in a network where they are connected by their calls, SMSs, MMSs, etc. Another example is given by the set of webpages in the World Wide Web that are connected by their hyperlinks. The representation of these large databases by networks allows us to extract different type of hidden information as the sets of communities and the importance of the nodes in the network. We investigate the second issue where the target is to assign a rank to all nodes that will be relevant for classifying them by order of importance in some context. We will consider five topics related to ranking methods for networks: (1) Ranking can be used to identify the leaders among the customers of a mobile phone company, that is, people who has the capacity to influence their contacts. Surprisingly enough, the study shows that some measure based on the structural position of a customer in the mobile phone network provides relevant information to identify leaders. (2) We call a degree leader someone who has more friends than his friends. We could expect that when your number of friends increases, the probability to be degree leader becomes higher. That question is analyzed for random networks that have the same degree distribution than real social networks. (3) We consider the problem of maximizing the average PageRank of a set of webpages when we consider two realistic constraints: one can only control the hyperlinks of one's webpages and one must points to the rest of the web. (4) The PageRank (and many other ranking methods) is based on a random walk over the network. We extend the random walk to the case where connections of distrust are present in the network. (5) Opinions can be modeled by a network where the connections are directed and weighted by a vote. We propose an iterative filtering that alternatively uses the credibility of the votes to determine the reputations of the nodes, and then the reputation of the nodes to update the real bias of the votes.
PENLAB: A MATLAB solver for nonlinear semidefinite optimization

PENLAB is an open source software package for nonlinear optimization, linear and nonlinear semidefinite optimization and any combination of these. It is written entirely in MATLAB. PENLAB is a young brother of our code PENNON \cite{pennon} and of a new implementation from NAG \cite{naglib}: it can solve the same classes of problems and uses the same algorithm. Unlike PENNON, PENLAB is open source and allows the user not only to solve problems but to modify various parts of the algorithm. As such, PENLAB is particularly suitable for teaching and research purposes and for testing new algorithmic ideas. In this article, after a brief presentation of the underlying algorithm, we focus on practical use of the solver, both for general problem classes and for specific practical problems.
Analyzing Linguistic Variation: Statistical Models and Methods

The book explains the theory and practice of using logistic regression for the description of language variation, including a comprehensive discussion of the Varbrul program used in sociolinguistics. Assuming no prior background in statistics, Paolillo explains the statistical foundation of logistic regression, using concrete examples of variation bearing on substantive issues in linguistics.
Tracking, analysis, and nowcasting of Cuban convective cells as seen by radar

This work describes the implementation and validation of an objective methodology for storm cell identification and tracking, which only uses radar reflectivity data as input. This methodology was applied to the statistical characterization of Cuban convective storms. The properties of radar echoes during 13 convective days in the vicinity of Camaguey, Cuba for the 2007 rainy season are obtained, and frequency distributions of mean hour of occurrence, total duration, maximum reflectivity, area, top height, and mean velocity during each trajectory are presented and compared to similar reports in Cuba and other regions. The trajectory of each storm is extrapolated to forecast its position up to 1 h ahead. Both tracking and nowcasting are evaluated for different situations, showing the good performance of the method. Copyright © 2013 Royal Meteorological Society
Projected Newton-type methods in machine learning

We consider projected Newton-type methods for solving large-scale optimization problems arising in machine learning and related fields. We first introduce an algorithmic framework for projected Newton-type methods by reviewing a canonical projected (quasi-)Newton method. This method, while conceptually pleasing, has a high computation cost per iteration. Thus, we discuss two variants that are more scalable, namely, two-metric projection and inexact projection methods. Finally, we show how to apply the Newton-type framework to handle non-smooth objectives. Examples are provided throughout the chapter to illustrate machine learning applications of our framework.
Rare conditions and their effect on software failures

Data gathered by the authors as well as those published by others show that rarely executed code has a much higher failure rate (expressed in execution time) than frequently executed code during the early operational period. More detailed analysis of the data shows that the inability to handle multiple rare conditions, such as response to hardware failures or exception conditions caused by the computer state, is a prominent cause of program failure in well-tested systems. Approaches to coping with this difficulty are discussed. <<ETX>>