Miracle-dz/UniFAR-FTUs huggingface dataset:
An Algorithm for Data Replication

Replication is an important technique for increasing computer system availability. In this paper, we present an algorithm for replicating stored data on multiple server machines. The algorithm organizes the replicated servers in a master/slaves scheme, with one master election being performed at the beginning of each service period. The status of each replica is summarized by a set of monotonically increasing epoch variables. Examining the epoch variables of a majority of the replicas reveals which replicas have up-to-date data. The set of replicas can be changed dynamically. Replicas that have been o -line can be brought up to date in background, and witness replicas, which store the epoch variables but not the data, can participate in the majority voting. The algorithm does not require distributed atomic transactions. The algorithm also permits client machines to cache copies of data, with strict cache consistency being ensured by having the replicated servers keep track of which clients have cached what data. The work reported in this paper is part of an ongoing project to build a new replicated distributed le system with client caching, called Echo.
Pygmalion: a creative programming environment.

Abstract : PYGMALION is a two-dimensional, visual programming system implemented on an interactive computer with graphics display. Communication between human being and computer is by means of visual entities called icons, subsuming the notions of variable, reference, data structure, function and picture. The heart of the system is an interactive remembering editor for icons, which executes and (Optionally) saves operations for later reexecution. The display screen is viewed as a document to be edited. Programming consists of recreating a sequence of display frames, the last of which contains the desired information. Display frames are modified by editing operations.
Info Capacity| The Volume and Value of Information

The measurement of the volume of information is fraught with difficulties. However, trends in availability and usage can be very revealing, as is shown by some examples. This article argues that considerations of the volume of information should not be divorced from those of the value of information. In communications, informative comparisons appear to be possible by classifying technologies in just a few dimensions, associated with the features of cost, speed, availability, and usability. An argument also is made that as a rough approximation, the value of information in terms of its volume is best thought of on a logarithmic scale. This approach provides a rough quantitative guide to the diminishing marginal utility delivered by the rapid progress in computing, storage, and communica¬tion technologies. It offers a partial explanation for slow uptake of ultra-high speed broadband and related phenomena.
Simulate the knowledge co-creation process for social emergence studies

At the centre of entrepreneurship research we need to find out how cross-boundary sensemaking and knowledge creation may occur. This paper builds upon the literature of organizational learning and knowledge management to simulate the process. Experiments with the simulator help to further our understandings on how knowledge co-creation may happen and lead to social changes such as successful innovations and the emergence of new industries.
Cognitive and Social Factors Affecting the Use of Wikipedia and Information Seeking / Les facteurs cognitifs et sociaux déterminant l'utilisation de Wikipedia et la recherche d'information

Wikipedia, the free online encyclopedia, is the preferred choice among resources used by college students to meet their research needs. However, Wikipedia has been criticized for its low information quality, lack of accountability, inconsistency, and vulnerability to vandalism. Despite the warnings and concerns voiced by academia, online learning tools such as Wikipedia will continue their rise as major learning resource in today's classroom. Using a sample of 184 college students, the study proposed theoretical models to test the effects of internal beliefs, motivations, and social influences on Wikipedia use and information-seeking, and further empirically tested those models. The findings of this study suggested that Wikipedia use is driven by internal belief and peer pressure, whereas information-seeking is influenced by belief, motivation, and subjective norms. The implications of the findings for the research and practice are discussed. Wikipedia, l'encyclopedie gratuite en ligne, est le choix prefere des etudiants ayant besoin de faire une recherche. Cependant, Wikipedia a ete critique pour la faible qualite de ses informations, son manque d’imputabilite, son incoherence et sa vulnerabilite au vandalisme. En depit des mises en garde et des inquietudes exprimees par le milieu universitaire, l’importance en salle de classe des outils d'apprentissage en ligne tels que Wikipedia continuera de croitre. Sur la base d’un echantillon de 184 etudiants de niveau collegial, l'etude a propose des modeles theoriques pour tester les effets des croyances personnelles, des motivations et des influences sociales sur l'utilisation de Wikipedia et sur la recherche d'information. Ces modeles ont ensuite ete testes empiriquement. Les resultats de cette etude suggerent que l'utilisation de Wikipedia est motivee par les croyances personnelles et la pression exercee par les camarades, alors que la recherche d'information est influencee par les croyances, la motivation et des normes subjectives. L’article se termine par une discussion des implications de ces resultats pour la recherche et la pratique.
Modèles statistiques enrichis par la syntaxe pour la traduction automatique

La traduction automatique statistique par séquences de mots est une voie prometteuse. Nous présentons dans cet article deux évolutions complémentaires. La première permet une modélisation de la langue cible dans un espace continu. La seconde intègre des catégories morpho-syntaxiques aux unités manipulées par le modèle de traduction. Ces deux approches sont évaluées sur la tâche Tc-Star. Les résultats les plus intéressants sont obtenus par la combinaison de ces deux méthodes.
Designing for Older Adults: Principles and Creative Human Factors Approaches

Fundamentals Toward Better Design for Older Adults Characteristics of Older Adult Users Guiding the Design Process Design Guidelines Improving Perception of Information Design of Input and Output Devices Interface Design. Developing Training and Instructional Programs Exemplar Applications Making the Work Environment Age Friendly Maximizing the Usefulness and Usability of Health Care Technologies Transportation Designing Accommodations for Aging-in-Place Tutorials Involving Older Adults in Research and Usability Studies Conducting Focus Groups with Older Adults Statistical Considerations Task Analysis and Error Prediction GOMS Modeling for Older Adults Multimedia Design Conclusion Synthesis and Final Comments References Indexes
Beyond the bounds of the ethnic: for postmigrant cultural and social research

ABSTRACT This article draws on an ongoing self-reflexive debate in German migration research. It is considered that migration research has much contributed to (re)produce subject categories and concepts of the nation-state which it, at the same time, aims to criticize. With its specific focus on diverse figures and formations of the migrant, on ethnic minorities and transnational diasporas, the respective counterparts of a white, national majority and the hierarchical relations between these are being implicitly coconstructed. Especially, the plethora of accounts of migrants’ lives and migrants’ worlds tend to limit themselves to a more or less exclusive “migrantology”—thus petrifying rather than challenging and transgressing the inner boundaries of the nation-state. New approaches of critical migration research, however, aim at broadening that perspective and at reversing its viewing direction: From the perspective of its ethnicized and racialized “margins” the naturalized “centre” can be explored as being part of a postmigrant, postcolonial space of cultural dynamics and social struggles. Extending its scope in this way, beyond its conceptual limits, migration research would be cosmopolitanized and turned into a general study of cultural and social realities crossing ethnic and national bounds.
What Factors Affect Teachers Using the iPads in their Classroom

This study used a qualitative paradigm to discover what types of training teachers have received that resulted in successful use of iPads and what factors affect their decisions to use iPads in their classrooms. Data for this study were 21 interviews with 21 in-service teachers. The findings showed that the majority of teachers did not have any formal iPad training. All reported they had to resort to different sources such as self-learning and colleagues’ support to learn about how to integrate iPads and useful apps into their teaching. There are many factors affecting their use of iPads in their classrooms. The study concluded with discussions and implications for school administrators and teachers. DOI:10.2458/azu_itet_v3i1_vu
Bus buffer modeling and optimization in video processing IP

One important issue for IP-based (Intellectual Property) design is the bus and memory bandwidth budget for a set of IP cores and customized functional units plugging into on-chip bus. In this paper, we propose the bus buffer modeling and the buffer optimization procedure to make the buffer an analytical design. Due to applicability for IP integration, the proposed model has the features of parametrics and generality and is not restricted to some specific process rate or bus transactions. Also the optimization procedure is deterministic, not determined by real-case simulation. With the help of the proposed bus buffer generation algorithm, bus buffer attributes can be determined for implementation.
A Review of Fast L(1)-Minimization Algorithms for Robust Face Recognition

Abstract : `1-minimization refers to finding the minimum `1-norm solution to an underdetermined linear system b = Ax. It has recently received much attention, mainly motivated by the new compressive sensing theory that shows that under quite general conditions the minimum `1-norm solution is also the sparsest solution to the system of linear equations. Although the underlying problem is a linear program, conventional algorithms such as interior-point methods suffer from poor scalability for large-scale real world problems. A number of accelerated algorithms have been recently proposed that take advantage of the special structure of the `1-minimization problem. In this paper we provide a comprehensive review of five representative approaches, namely, Gradient Projection, Homotopy, Iterative Shrinkage-Thresholding, Proximal Gradient, and Augmented Lagrange Multiplier. The work is intended to fill in a gap in the existing literature to systematically benchmark the performance of these algorithms using a consistent experimental setting. In particular, the paper will focus on a recently proposed face recognition algorithm, where a sparse representation framework has been used to recover human identities from facial images that may be affected by illumination occlusion, and facial disguise. MATLAB implementations of the algorithms described in this paper have been made publicly available.
Analyse des impacts économico-environnementaux du changement d’usage d’un foyer de cuisson traditionnel par un foyer de cuisson amélioré optimisé à charbon de bois dans les ménages de la ville de Kinshasa

This study is oriented to the economic and environmental impacts of the substitution in Kinshasa traditional cookstoves by improved clean cookstoves. We selected two traditional cookstoves (TCS), the TCS D27 and the TCS D23 and two improved cookstoves (ICS), the ICS 16/8/NC and the ICS 16/8/C. The test was carried out under the cooking controlled test (CCT) protocol, which is a laboratory test under strictly controlled conditions. All tests were carried out using the meal much preferred by the average and poor households of Kinshasa. To cook a dry meal of 1150g of beans and 1250g of rice, it takes 2429g of charcoal for a traditional cookstove TCS D27 and 1847g for traditional cookstove TCS D23. However, this only requires 1198g of charcoal for an improved cookstove ICS 16/8/NC and 1081g for an improved clean cookstove ICS 16/8/C. This represents fuel savings ranging from 37% to 55%. A household of 10 people in Kinshasa would spend up to $ 48.61 per month to purchase fuel with a TCS D27 while it will only need $ 22.01 per month for the same culinary tasks using an ICS 16/8/C.
The recreation of a castrato voice, Farinelli's voice

We present an original research work culminating in the high quality production of thirty-nine minutes of castrato voice, by the means of sound analysis, processing and synthesis. The goal of the project is the creation of a soundtrack for a film about a famous eighteenth century castrato. Two complementary voices-a coloratura-soprano and a counter-tenor-are used to cover the entire range and compensate for technical difficulties. Then their timbres are homogenised by using combined techniques such as phase-vocoding, additive analysis/synthesis as well as spectral envelope and pitch estimation. Thirty-nine minutes of high quality processed singing have been created for a CD of the soundtrack.
A new method to estimate input‐output tables by means of structural lags, tested on Spanish regions

The RAS method extrapolates a single matrix to conform to new row and column totals. This paper proposes a cell-correction of RAS (CRAS) that uses the deviations of multiple RAS projections, to improve the projection of the input-output table (IOT) of a specific country or region. The new method is tested on eleven survey-based IOTs of Spanish regions for 1999-2005. CRAS is shown to outperform RAS when three to four survey IOTs are used that are close to the target IOT. When more IOTs are added, for most but not all regions, CRAS gradually becomes worse than applying RAS to the single best IOT.
SIMULASI ALGORITMA DIJKSTRA DALAM MENANGANI MASALAH LINTASAN TERPENDEK PADA GRAF MENGGUNAKAN VISUAL BASIC

Penulisan ini bertujuan untuk memberi gambaran tentang cara membangun simulasi algoritma Dijkstra dalam mencari lintasan terpendek pada suatu graf menggunakan bahasa pemrograman Visual Basic dan membuktikan bahwa penghitungan simulasi algoritma Dijkstra yang dibuat mempunyai hasil solusi yang sama dengan penghitungan manual dalam mencari lintasan terpendek pada graf. Algoritma Dijkstra merupakan algoritma untuk mencari lintasan terpendek yang diterapkan pada graf berarah dan berbobot, yang jarak antar titiknya adalah bobot dari tiap busur pada graf tersebut. Permasalahan yang diangkat adalah cara membangun simulasi algoritma Dijkstra dalam mencari lintasan terpendek pada suatu graf menggunakan bahasa pemrograman Visual Basic dan kecocokan hasil pencarian lintasan terpendek antara penghitungan cara manual dengan menggunakan penghitungan simulasi. Simulasi algoritma Dijkstra dalam menangani masalah lintasan terpendek pada suatu graf dibangun menggunakan bahasa pemrograman Visual Basic. Simulasi yang dibangun kemudian diuji dengan bentuk graf dari hasil representasi. Dari graf yang direpresentasikan, setelah diuji coba menggunakan simulasi ternyata mempunyai solusi hasil lintasan dan jarak yang sama dengan penghitungan manual. Dengan demikian, simulasi algoritma Dijkstra dalam menangani masalah lintasan terpendek pada suatu graf menggunakan Visual Basic selesai direalisasikan dan dapat diimplementasikan pada permasalahan sehari-hari yang dapat direpresentasikan dalam bentuk graf dan dicari lintasan terpendeknya.
Efficient load balancing for UBR traffic in ATM networks

A method is presented to find routes for UBR (unspecified bit rate) circuits in ATM networks to make UBR traffic well-balanced. It selects an optimal path for each UBR circuit, while avoiding the potential problem of selecting the same optimal path or subpath repeatedly for different circuits. This is achieved by choosing an optimal path uniformly at random from the set of all optimal paths, according to any user-selected metric. Since the set of potential paths is exponentially large and has a complex structure, a new tool is needed to select a path uniformly at random from the set of all optimal paths efficiently. We propose a solution whose complexity is only that of shortest path selection, and we prove that it selects any optimal path with equal probability, thus providing good load balancing among candidate routes. Given the efficiency of the proposed solution and the above properties of the resulting paths selection, we believe the solution can be a practical approach to load balancing of UBR circuits in ATM networks.
Beyond rule based reasoning-the meaning and use of cases

Commercial legal expert systems are invariably rule based. Such systems are poor at dealing with open texture and the argumentation inherent in law. To overcome these problems we suggest supplementing rule based legal expert systems with case based reasoning or neural networks. Both case based reasoners and neural networks use cases-but in very different ways. We discuss these differences at length. In particular we examine the role of explanation in existing expert systems methodologies. Because neural networks provide poor explanation facilities, we consider the use of Toulmin argument structures to support explanation (S. Toulmin, 1958). We illustrate our ideas with regard to a number of systems built by the authors. <<ETX>>
E-Learning in der Elektronik : der Java-Schaltungssimulator JVSpice

Results 76 100 of 181 Beginning Java Programming Iducate Learning Technologies. Author: Iducate Learning E-Learning in Der Elektronik: Der JavaSchaltungssimulator Jvspice Kokits, Vasil. Title: E-Learning in Der Elektronik: Der ELearning in der Elektronik: Der Java-Schaltungssimulator JVSpice, von Kokits, Vasili: Taschenbücher E-Learning ist aus der modernen Lehre nicht mehr Computerwissen Online Das Webportal für Ihren Informationsbedarf zum Thema E-Learning in der Elektronik: Der Java-Schaltungssimulator JVSpice 5. Okt. 2016 Lesen Sie das Buch für freie E-Learning in der Elektronik: Der Java-Schaltungssimulator JVSpice mit vielen Kategorien kostenlose Bücher in
Bayesian Process Monitoring, Control and Optimization

Bayesian Process Monitoring, Control and Optimization edited by Bianca M. Colosimo and Enrique del Castillo . Bradley Jones Response Surfaces, Mixtures, and Ridge Analysis, Second Edition by George E. P. Box and Norman R. Draper . James M. Lucas
Reducing off-chip memory accesses of wavefront parallel programs in graphics processing units

REDUCING OFF-CHIP MEMORY ACCESSES OF WAVEFRONT PARALLEL PROGRAMS IN GRAPHICS PROCESSING UNITS The power wall is one of the major barriers that stands on the way to exascale computing. To break the power wall, overall system power/energy must be reduced, without affecting the performance. We can decrease energy consumption by designing power efficient hardware and/or software. In this thesis, we present a software approach to lower energy consumption of programs targeted for Graphics Processing Units (GPUs). The main idea is to reduce energy consumption by minimizing the amount of off-chip (global) memory accesses. Offchip memory accesses can be minimized by improving the last level (L2) cache hits. A wavefront is a set of data/tiles that can be processed concurrently. A kernel is a function that get executed in GPU. We propose a novel approach to implement wavefront parallel programs on GPUs. Instead of using one kernel call per wavefront like in the traditional implementation, we use one kernel call for the whole program and organize the order of computations in such away that L2 cache reuse is achieved. An strip of wavefronts (or a pass) is a collection of partial wavefronts. We exploit the non-preemptive behavior of the thread block scheduler to process a strip of wavefronts (i.e., a pass) instead of processing a complete wavefront at a time. The data transfered by a partial wavefront in a pass is small enough to fit in L2 cache, so that, successive partial wavefronts in the pass reuse the data in L2 cache. Hence the number of off-chip memory accesses is significantly pruned. We also introduce a technique to communicate and synchronize between two thread blocks without limiting the number of thread blocks per kernel or SM. This technique is used to maintain the order of wavefronts.
Interconnect-driven multistage hierarchical floorplanning for soft modules

In this paper, we present a new multistage hierarchical floorplanning algorithm for soft modules integrated with fast but effective interconnect-driven module placement and hierarchical chip area minimization. The interconnect-driven module placement is achieved by using a fast cell-filling algorithm based on the interconnection relation of nets. Using the topology of module locations built by our cell-filling algorithm, a hierarchical chip area minimization algorithm, based on non-linear programming, is applied to minimize the total chip area. In addition, critical paths, or the connective strength of critical nets, could be easily enhanced during the step of analyzing interconnection relations for solving timing closure problems. Experimental results show that our multistage hierarchical approach can minimize chip area and total wire length simultaneously in a very efficient way.
A Counter Based Broadcasting Using Symmetric Neighbor Verification Protocol

The objective is to determine a small set of forward nodes to ensure full coverage. A formal framework is used to model inaccurate local views in MANETs, where full coverage is guaranteed if three sufficient conditions connectivity, link availability, and consistency are met. A MANET consists of a set of mobile hosts that may communicate with one another from time to time. Broadcasting in MANETs is a fundamental data dissemination mechanism, with important applications, e.g., route query process in many routing protocols, address resolution and diffusing information to the whole network. Broadcasting in MANETs has traditionally been based on flooding, which overwhelm the network with large number of rebroadcast packets. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats or attacks aiming at the disruption of the protocol itself. The widely assumed trusted environment is not really the environment that can be realistically expected in reality. While broadcasting hello packets originated from its neighbours, may aim to create fake symmetric links in the sparse and dense network.
Penerapan Data Mining dalam Analisis Kejadian Tanah Longsor di Indonesia dengan Menggunakan Association Rule Algoritma Apriori

ABSTRAK. Data mining adalah ekstraksi informasi atau pola yang penting atau menarik dari data yang ada di database yang besar. Salah satu cabang dalam data mining adalah metodealgoritma association rule metode apriori dimana metode ini mencari sekumpulan items yang sering muncul bersamaan. Dalam penelitian ini akan menggunakan data mining dengan metode associationrule untuk mengolah data bencana tanah longsor di Indonesia karena ingin mengetahui informasi apa saja yang sering muncul bersamaan pada kejadian bencana tanah longsor. Dari hasil analisis didapatkan pola hubungan assosiatif yang terjadi dari data tanah longsor di Indonesia pada akhir bulan desember 2014 dan awal bulan januari 2015 dengan nilai support tertinggi yaitu Jika terjadi tanah longsor dengan kondisi tanah labil maka hujanderas dengan nilai support sebesar 0.5227273 dan nilai confident sebesar 0.8214286