Miracle-dz/UniFAR-FTUs huggingface dataset:
Modelo Conceptual para o Depuramento de Programas Distribuídos por Troca de Mensagens

This dissertation presents a conceptual model of message-passing distributed programs that is used as a base for the debugging of this kind of programs. The model is independent from the message-passing software used and incorporates several facilities aimed at supporting debugging: generation of a space-time diagram which shows the progression of the execution being studied, detection of race conditions, detection of particular kinds of predicates and representation of causality cones. Conceived according to the object-oriented methodology, the model is composed of two groups of classes: kernel classes and graphical classes. The first group contains the classes which are models of the entities envolved in the execution. The classes in the second group, graphical classes, are subclasses of the previous ones and, additionaly, are responsible for drawing the space-time diagram. All the details that depend on the graphical software adopted are encapsulated in graphical classes. A tool called MPVisualizer implements the conceptual model. This tool contains a reexecution mechanism that allows the reproduction of behaviours exhibited in previous executions by programs that are potentially nondeterministic. The capability of reproducing behaviours is vital in cyclic debugging, a frequently used technique in the debugging of sequencial programs.
Morphological Decomposition in the Recognition of Prefixed and Suffixed Words: Evidence From Korean

Korean has visually salient syllable units that are often mapped onto either prefixes or suffixes in derived words. In addition, prefixed and suffixed words may be processed differently given a left-to-right parsing procedure and the need to resolve morphemic ambiguity in prefixes in Korean. To test this hypothesis, four experiments using the masked priming lexical decision paradigm were conducted. Results showed that suffixed primes facilitated responses to their stem targets regardless of the lexicality or interpretability of the primes. In contrast, prefixed primes had a significant effect only when they were real words, and not when they were either interpretable or noninterpretable prefixed pseudowords. These results suggest that there may be two different processing mechanisms for derived words in Korean. One is prelexical morphological decomposition for suffixed words, and the other is the supralexical analysis for prefixed words where decomposition occurs only after the whole word has been accessed.
*1 Exploring the composition of the searchable web: a corpus-based taxonomy of web registers

One major challenge for Web-As-Corpus research is that a typical Web search provides little information about the register of the documents that are searched. Previous research has attempted to address this problem (e.g., through the Automatic Genre Identification initiative), but with only limited success. As a result, we currently know surprisingly little about the distribution of registers on the web. In this study, we tackle this problem through a bottom-up user-based investigation of a large, representative corpus of web documents. We base our investigation on a much larger corpus than those used in previous research (48,571 web documents), and obtained through random sampling from across the full range of documents that are publically available on the searchable web. Instead of relying on individual expert coders, we recruit typical end-users of the Web for register coding, with each document in the corpus coded by four different raters. End-users identify basic situational characteristics of each web document, coded in a hierarchical manner. Those situational characteristics lead to general register categories, which eventually lead to lists of specific sub-registers. By working through a hierarchical decision tree, users are able to identify the register category of most Internet texts with a high degree of reliability. After
Optimization of light-tree routing and wavelength assignment in WDM networks with limited splitting capability

Multicast applications have attracted more and more attention due to more efficient bandwidth usage and the increasing popularity of the point-multipoint multimedia applications. Supporting multicast directly at physical layer, namely optical multicasting, can provide improved performance over electronic multicasting. In this paper, a new Mixed Integer Linear Programming algorithm is proposed to resolve the light-tree routing and wavelength assignment problem with wavelength continuity constraints. The node in our system is limited branching and power-efficient multicast capable OXC. The node constraints are considered in our model formulation. Numerical results are given by using representative examples and discussed to show the efficiency of our algorithm.
Synthesis and Characterization of Dibenzodioxazasiladecines

Abstract The reaction of N‐(2‐hydroxymethylphenyl)salicylideneimine with sodium hydride in dry toluene at −4°C produces 1,9‐remote dianion. The cyclization of this dianion with diorganodichlorosilanes affords dibenzodioxazasiladecines in good yields. The products were characterized by satisfactory elemental analyses and spectral (IR, 1H, 13C, and 29Si NMR and mass) studies.
Multi-code CDMA wireless personal communications networks

Proposes a code division multiple access (CDMA) based system that can provide a smooth migration path to PCS, either from a digital cellular system (IS-95) or from a wideband CDMA system, to serve both isochronous and asynchronous applications. A unified digital bandwidth on demand platform is realized by allocating multiple codes (on demand), and hence increased capacity, to users. This approach, dubbed multi-code CDMA (MC-CDMA), will enable efficient delivery of all services made possible by digital cellular, CDPD, and other PCS technologies. Since a large variety of services (voice, data, image, and perhaps video) is expected in future wireless networks, users with very different, and time-varying, source rates will have to be accommodated. MC-CDMA is a wireless system whose rate (which is proportional to the number of codes assigned to the user) and service are dynamically matched to users' needs and can evolve from commercial digital cellular systems. This system retains the CDMA advantage in combating multipath and does not require significant modifications of the radio frequency (RF) circuitry. The dynamic, packet-like capacity access enabled by MC-CDMA will allow users to access the base station at different source rates, and when all other users are idle, will provide peak rate access to a single user.
Models of the Learner in Computer-Assisted Instruction

Abstract : The adaptability of computer-assisted instruction to individuals should be enhanced by the use of explicit models of the learner. To be appropriate for computer representation, these models must take the form of effective procedures. Such procedures may be derived from four areas of investigation: quantitative models of memory, regression models of performance, automaton models of performance, and artificial intelligence. Relevant work in these four areas is identified and reviewed.
An assessment of the current status of algorithmic approaches to the verification of hybrid systems

This paper reviews the current status of implemented verification techniques for hybrid systems. We focus on tools that perform model checking for hybrid systems with varying levels of complexity. Features of the tools are described using a batch reactor example to illustrate what is required to develop an appropriate model for each tool. The concluding section suggests directions for future research and tool development based on the needs of industry for tools to perform verification and validation of designs for embedded control systems.
Review on the Study of the Internet Word-of-Mouth Effect

With the development of the new technology, the Internet has increasingly become one of our most important media. Consumers are more inclined to rely on the internet to search and achieve information ,word of mouth has become the main way to talk about the quality of products and services . According to domestic and foreign scholars, research dimensions of word of mouse ,carry out a more detailed review towards word-of-mouth network from the angles of features from the communicator, communication channel characteristics, reputation information, the recipient characteristics ,and point out the limitations of the current research, analysis the development trend in the future.
Optimization of Permanent Magnet Synchronous Motor Vector Control System Based on Particle Swarm Optimization

For permanent magnet synchronous motor control system at this stage has defects such as the poor robustness and control, this paper proposes an optimization scheme of permanent magnet synchronous motor vector control system based on particle swarm optimization. Establish the mathematical model of the permanent magnet synchronous motor, use the particle swarm optimization algorithm to optimize the PID controller parameters of the system speed loop on the basis of the theoretical analysis of vector control, PID controller and particle swarm optimization, build the optimization simulation model of the permanent magnet synchronous motor vector control system based on particle swarm optimization in MATLAB/Simulink and conduct the related research. The simulation results show that the optimization scheme is effective and it can significantly improve system control performances.
Interpolation results in the split inversion neural network algorithm

It is shown that the split inversion neural network algorithm can provide accurate interpolation for nonlinear situations that would be difficult to obtain with a look-up table. Neural networks trained with the algorithm are shown to provide complex interpolation when used as associative memories. The nonlinear relations need never be known; the network learns these from training with representative examples. The discretization of the parameters used in obtaining training samples and the nature of the underlying equations determine the accuracy of the interpolation. This approach has been shown to be valuable for engineering design where expertise is often dependent on association with previous designs that on following a set of rules. The neural network has been applied to the design of a beam-truss-spring structure. <<ETX>>
Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.
Concurrent engineering tool in software development

Traditional approaches to software development which separate analysis, design, coding and testing can lead to inconsistency among different phases, low efficiency, and rework, particularly in large-scale information system development. These problems would be alleviated if there were effective tools supporting every phase in the software life cycle in an integrated fashion. This paper proposes an integrated approach to these problems, based on the concept of concurrent engineering. Concurrent engineering is an important concept in computer integrated manufacturing (CIM). It aims at rapid product development and a better designed product, by incorporating all issues of the product life cycle right in the design phase. The development of software can be compared with that of a manufactured product, both of which have requirements definition, analysis, design, coding (manufacturing), testing and maintenance phases. This paper applies concurrent engineering methodologies to software "manufacturing". A concurrent development integrated tool (CDIT) is described, which includes project management, system analysis, design, testing, generation and maintenance. The architecture of CDIT, the functions of each component, its application to system development, and the further development of CDIT are discussed.
Discriminative dictionaries for automated target recognition

We present an approach for discriminating among dierent classes of imagery in a scene. Our intended application is the detection of small watercraft in a littoral environment where both targets and land- and sea-based clutter are present. The approach works by training dierent overcomplete dictionaries to model the dierent image classes. The likelihood ratio obtained by applying each model to the unknown image is then used as the discriminating test statistic. We rst demonstrate the approach on an illustrative test problem and then apply the algorithm to short-wave infrared imagery with known targets.
Cooperative control of autonomous systems

This special issue contains a collection of papers on task assignment problems, path planning problems, cooperative control problems and coordinated control problems. Each of the authors has concentrated his or her efforts on both theory development and application to enhance the overall academic contribution of each paper. The theme of this special issue was motivated by the many collaborations of the Cooperative and Intelligent Control of Unmanned Aerial Vehicles (UAV) group in the Control Science Center of Excellence of the Air Force Research Laboratory (AFRL). Published 2011. This article is a US Government work and is in the public domain in the USA.
Error Detection, Factorization and Correction for Multi-View Scene Reconstruction from Aerial Imagery

Scene reconstruction from video sequences has become a prominent computer vision research area in recent years, due to its large number of applications in fields such as security, robotics and virtual reality. Despite recent progress in this field, there are still a number of issues that manifest as incomplete, incorrect or computationally-expensive reconstructions. The engine behind achieving reconstruction is the matching of features between images, where common conditions such as occlusions, lighting changes and texture-less regions can all affect matching accuracy. Subsequent processes that rely on matching accuracy, such as camera parameter estimation, structure computation and non-linear parameter optimization, are also vulnerable to additional sources of error, such as degeneracies and mathematical instability. Detection and correction of errors, along with robustness in parameter solvers, are a must in order to achieve a very accurate final scene reconstruction. However, error detection is in general difficult due to the lack of ground-truth information about the given scene, such as the absolute position of scene points or GPS/IMU coordinates for the camera(s) viewing the scene. In this dissertation, methods are presented for the detection, factorization and correction of error sources present in all stages of a scene reconstruction pipeline from video, in themore » absence of ground-truth knowledge. Two main applications are discussed. The first set of algorithms derive total structural error measurements after an initial scene structure computation and factorize errors into those related to the underlying feature matching process and those related to camera parameter estimation. A brute-force local correction of inaccurate feature matches is presented, as well as an improved conditioning scheme for non-linear parameter optimization which applies weights on input parameters in proportion to estimated camera parameter errors. Another application is in reconstruction pre-processing, where an algorithm detects and discards frames that would lead to inaccurate feature matching, camera pose estimation degeneracies or mathematical instability in structure computation based on a residual error comparison between two different match motion models. The presented algorithms were designed for aerial video but have been proven to work across different scene types and camera motions, and for both real and synthetic scenes. « less
The Relevance of Facet Analysis for World Wide Web Subject Organization and Searching

SUMMARY Different forms of indexing and search facilities available on the Web are described. Use of facet analysis to structure hypertext concept structures is outlined in relation to work on (1.) development of hypertext knowledge bases for designers of learning materials and (2) construction of knowledge based hypertext interfaces. The problem of lack of closeness between page designers and potential users is examined. Facet analysis is suggested as a way of alleviating some difficulties associated with this problem of designing for the unknown user.
Experimenting e-Learning with a large class

An experimental use of web based material to supplement the teaching of the course GEC121 – Computing and Information Skills Fundamental I, in the University of Botswana was carried out between August and December 2003 to a class of over 750 students in the Faculty of Social Sciences. The course was taught in a one-hour class, with two-hour lab sessions every week for each student. The face-to-face sessions were supplemented with course outline, lecture notes, laboratory manuals, quizzes and bulletin board on an Learning Management Software called WebCT while the laboratory sessions were purely done using WebCT. This paper looks at the areas of application of eLearning for large classes and how it was applied at the University of Botswana for the GEC121 course, students and tutors view of the course, as well as experiences from its use.
A Combined Markov and Noise Clustering Modeling Method for Cell Phase Classification

This paper proposes a classification method of cell nuclei in different mitotic phases using a combined Markov and noise clustering modeling technique. The method was tested with the data set containing 379519 cells in 892 cell sequences for 5 phases extracted from real image sequences recorded at every fifteen minutes with a time-lapse fluorescence microscopy. Experimental results showed that the proposed method performed better than the k-means modeling method.
Realization of quaternary logic circuits by n-channel MOS devices

A method to implement quaternary circuits using NMOS devices is proposed. The authors have designed a simplified elementary form of inverter and have implemented a series of fundamental logic and memory circuits. These circuits comprise MOS transistors with three values of enhancement-mode threshold voltage and one depletion-mode threshold voltage. The features of these circuits are a small number of MOS transistors, a simple structure, and an exact transfer characteristic. Several fundamental circuits such as inverter, NAND, NOR, and delta literal have been fabricated by conventional NMOS technology. Comparisons between the measured and calculated results indicate a good agreement, taking into account some back-bias effect. The performance of the inverter, including speed, noise margin, and pattern area, is also discussed.
Inferring Semantic Facets of a Music Folksonomy with Wikipedia

Music folksonomies include both general and detailed descriptions of music, and are usually continuously updated. These are significant advantages over music taxonomies, which tend to be incomplete and inconsistent. However, music folksonomies have an inherent loose and open semantics, which hampers their use in many applications, such as structured music browsing and recommendation. In this paper, we present a system that can (1) automatically obtain a set of semantic facets underlying the folksonomy of the social music website Last.fm, and (2) categorize Last.fm tags with respect to the obtained facets. The semantic facets are anchored upon the structure of Wikipedia, a dynamic repository of universal knowledge.
TTBox: A MatLab Toolbox for the Computation of 1D Teleseismic Travel Times

Since the MatLab software has become an increasingly popular tool in data processing in recent years, it would be nice to have a travel-time software that is directly accessible from MatLab routines and integrates smoothly into applications written in the MatLab programming language. This can be achieved in different ways. One is to write interface routines to existing software packages, such as the FORTRAN tau package (Buland and Chapman, 1983, hereafter referenced as the libtau.f library) or the Java-based TauP Toolkit (Crotwell et al. , 1999). Another possibility is to write a completely new set of routines in the MatLab programming language. This second approach is the one followed in the programming of TTBox , the Travel Time ToolBox for MatLab. The MatLab approach has the main advantage that the programming language is completely platform-independent. If low-level access to operating system and hardware is avoided, MatLab routines immediately run on every platform on which MatLab is running, so installation is reduced to copying the files and adding a directory to the search path. Also, since MatLab encompasses many powerful plotting routines, it is also easy to include routines that plot input velocity models, resulting travel times, and ray paths and other curves. Export of graphs in any standard format is also provided by the MatLab environment. One important development goal for TTBox was to be able to change the input velocity model easily and quickly, and to compute travel times for different planets, especially the Moon and Mars. This was achieved by avoiding precomputed tables and by including information on the planet in velocity model files. The planetary radius is the most important datum in this context (details of file formats are given in a later section). The first section of this paper outlines the theoretical background of computations …
Track splitting technique for tracking in a cluttered environment using PDAF

For tracking a target in a heavily cluttered environment, the Probabilistic Data Association Filter (PDAF) is very efficient and can significantly reduce track losses. However, as shown in this paper, the PDAF will experience difficulties at the initial stage of the filtering when the track is not accuracy enough, and the filter tends to diverge under even modest clutter density. To address this problem we propose a technique of splitting the track of the target into sub-tracks that run in parallel when the original track has low accuracy. Each sub-track occupies a portion of the uncertainty region of the original track. As a result, the sub-tracks maintained using the PDAF will be more selective over the incoming measurements (including detection and false alarms), and have less loss in tracking accuracy and improved robustness. This approach is similar to the Gaussian Sum filter in the literature. The major contribution of this paper is to propose a systematic method to effectively divide a less accurate track in a high dimensional state space into a set of sub-tracks to effectively improve the robustness of the PDAF. The splitting of the track will incur a significant amount of additional computation cost. To reduce the number of sub-tracks a likelihood ratio test is also proposed for the problem considered to drop unlikely sub-tracks. Simulation results are presented to demonstrate the performance of the proposed algorithm.