Miracle-dz/UniFAR-FTUs huggingface dataset:
A new parallel technique for design of decrement/increment and two's complement circuits

A novel design technique for the construction of a decrement/increment and two's complement (DIT) circuit is presented. The technique is shown to be highly efficient of both in terms silicon area consumption and time. More interestingly, it is shown that the operation delay is almost independent of the word size, and hence the method is best used for high-density codes. Structurally, the circuit is made of two parallel paths: one for the input data and one for the generation of the control signal to be utilized for DIT operation through the data path. The circuit is designed and simulated for 64-bit word length using CMOS technology. For the worst-case situation, a 14.7 ns response time is reported. <<ETX>>
Review on radio propagation into and within buildings

The paper reviews the published information on radio propagation into and within buildings particular to microcellular portable mobile radio channel at frequencies from 150 MHz upwards. However, no particular attention has been paid to the work carried out at millimetre wavelengths. The review has been carried out because such propagation information is required for the design of future portable mobile communication systems.The need for propagation information and the types of information required is described. The buildings, where a portable handset is likely to be used, have been categorised to put bounds on the received signal statistics and provide channel models for any particular type of building. The results published by different authors are then summarised by considering all the proposed categories. The results have been divided into narrowband and wideband measurements. This information is tentative as it is based on only a few measurements. As more measured results become available the design information and channel models can be modified. Suggestions for new measurements required are made in the light of existing information.
A contribution to DECT in frequency synthesis and modulation using DDS

DDS (direct digital synthesis) techniques are an alternative to the traditional signal generation techniques. Because of its digital nature, DDS is suitable for implementing special architectures with great flexibility, few adjustment points and a high level of integration. Joining DDS features with the remaining advantages of a traditional phase locked loop (PLL), it is possible to obtain optimal synthesizer designs.
Il Coding nella scuola Italiana. L’esperienza pugliese e il confronto con le ricerche internazionali

“Docenti InFormAzione”1 e il percorso formativo all’interno del progetto EDOC@Work3.02 rivolto alle scuole pugliesi in cui e stata sperimentata la metodologia del Coding. L’interesse per questo metodo didattico, con particolare riferimento alla scuola primaria, e in linea con i cambiamenti dei programmi scolastici europei che stanno comprendendo il valore di introdurre temi come la programmazione, la computer science e il pensiero computazionale nei curricola. Tali cambiamenti stimolano il dibattito scientifico e ci guidano in una lettura critica dei risultati emersi dall’esperienza nelle aule pugliesi rispetto non solo ad un primo impatto sul curricolo, ma anche sugli apprendimenti e sulle pratiche didattiche messe a sistema dai docenti. Questo ragionamento viene condotto sulla base degli stimoli e delle linee di pensiero promosse dalla letteratura scientifica sul tema. Tali studi rappresentano le piste di interrogazione dei dati qualitativi acquisiti dalla esperienza nelle classi pugliesi al fine di confermare o meno alcune condizioni e comprenderne la declinazione rispetto alle discipline coinvolte nella sperimentazione, all’integrazione tecnologica e alle dinamiche di classe attivate nel contesto italiano.
Collaborative Software Visualization in Co-located Environments

Most software visualization systems and tools are designed from a single-user perspective and are bound to the desktop and IDEs. These design decisions do not allow users to analyse software collaboratively or to easily interact and navigate visualizations within a co-located environment at the same time. This thesis presents an exploratory study of collaborative software visualization using multi-touch tables in a co-located environment. The thesis contributes a richer understanding of how pairs of developers make use of shared visualizations on large multi-touch tables to gain insight into the design of software systems. We designed a collaborative software visualization application, called Source-Vis, that contained a suite of 13 visualization techniques adapted for multi-touch interaction. We built two large multi-touch tables (28 and 48 inches) following existing hardware designs, to explore and evaluate SourceVis. We then conducted both qualitative and quantitative user studies, culminating in a study of 44 professional software developers working in pairs. We found that pairs preferred joint group work, used a variety of coupling styles, and made many transitions between coupling and arrangement styles. For collaborative group work we recommend designing for joint group work over parallel individual work, supporting a flexible variety of coupling styles, and supporting fluid transitions between coupling and arrangement styles. We found that the preferred style for joint group work was closely coupled and arranged side by side. We found some global functionally was not easily accessible. We found some of the user interactions and visual interface elements were not designed consistently. For the design of collaborative software visualizations we recommend designing visualizations for closely coupled arrangements with rotation features, providing functionality in the appropriate locality, and providing consistent user interactions and visual interface design. We found sometimes visualization windows overlapped each other and text was hard to read in windows. We found when pairs were performing joint group work the size of the table was appropriate but not for parallel individual. We found that because the table could not differentiate between different simultaneous users that some pair interactions were limited. For the design of multi-touch tables we recommend providing a high resolution workspace, providing appropriate table space, and differentiating between simultaneous user interactions.
A STRUCTURE MEMORY FOR DATA FLOW COMPUTERS

A data flow computer is one which achieves enormous concurrency of instruction execution through a machine architecture that acts directly on a data dependency graph of the program. To handle arrays and data structures effectively, a data flow computer must have access to a memory system which can handle large numbers of concurrent transactions. This thesis presents a design for such a memory. A "cache" mechanism is presented for improving the performance of the system, and a mechanism is given for using sequential-access devices such as shift registers as the memory medium. The memory system design uses the "packet communication" concept, in which the components of the system communicate only through the transmission of fixed size "packets" of data.
Intelligent multirobot systems performing cooperative tasks

We discuss how to plan the actions of a multirobot system acting in the real world by using task constraints for implicit coordination. Classifying and modelling task constraints is shown to be a very powerful mechanism for giving each robot an extended capability of coordinating itself with the other robots of the whole system. Thus, we investigate the problem of performing collective tasks with emphasis on the use of task constraints to get intelligent coordination among the individual members of the robot group. We have also introduced a set of macroscopic parameters that allow us to evaluate the evolution of the whole system. They depend on both the global task, and the environment dynamics, allowing the robots to implicitly communicate their intention to be involved in complex actions. Other group members become aware of their task simply by recognizing configuration patterns of the environment. We illustrate some examples of such a coordination taken from the scenario of both service robotics and of simulated robot games.
Mutation testing-an evolving technique

The paper provides a brief review of the program testing technique known as mutation testing, an error-based testing technique. A large number of simple changes (mutations) are made to program one at a time. Test data then has to be found which distinguishes the mutated versions from the original version. An underlying assumption of mutation testing is that experienced programmers write nearly correct programs. Hence small perturbations of the original program are expected to cause an observable difference to the program's performance. Mutation testing as originally developed was considered by many as somewhat bizarre and costly to perform. Subsequently a less demanding form known as weak mutation testing was proposed and the original technique was renamed strong mutation testing. More recently firm mutation has been introduced as an intermediate approach. The author discusses these types of mutation testing. As an example of the wide applicability of the mutation approach, its use in testing algebraic specifications is considered. >
A New High-Dynamic-Range Compression and Detail Enhancement Algorithm for Infrared Images

Infrared images have the high dynamic range characteristic, generally digitized to 14 bit. While most display devices can only show 8 bit images, so high bit-wide infrared image signal should be compressed to low bit-wide display data without losing the important detail information. A new high-dynamic-range compression and detail enhancement algorithm for infrared images is presented in this paper. In the proposed algorithm, the original infrared image is separated into the low-frequency base component and the high-frequency detail component. Then the base component is compressed with the simple gray level linear mapping, and the detail component is enhanced with the S-curve transformation. Finally, the two components are combined to get the 8 bit enhanced image. The experimental results show that the proposed algorithm can achieve the dynamic range compression while effectively preserve and enhance the local detail information.
N -Cyclohexyl-2-oxo-2 H -1-benzopyran-3-carboxamide

The title compound, C16H17NO3, crystallizes in the space group P\overline 1, with one mol­ecule in the asymmetric unit. The amide H atom is engaged in an intramolecular N—H⋯O contact to the O atom of one of the two carbonyl groups. The mol­ecules form centrosymmetric dimers through self-complementary C—H⋯O hydrogen-bonding interactions defining the R22(14)[R21(6)] motif. The supramolecular structure is achieved by aryl C—H⋯π interactions, as well as face-to-face π–π stacking interactions between lactone and benzenoid rings.
A detection algorithm for road feature extraction using EO-1 hyperspectral images

The proposed method takes advantage of spectral information content in the hyperspectral images, EO-1 hyperion, to find road candidates. The assumption of this approach assumes that each pixel in the hyperspectral images is composed of a linear mixing of the reflectance from various components of the Earth's surface. The algorithm derived from the statistical and linear model is used to highlight the targets - road features and to suppress the background features of a scene. After road detection, all potential road candidates have been presented in the detected image. The objective is to avoid predicting uncertain road points and setting complex criteria to form the road network. Finally, the detected road segments will be traced and connected to generate skeletonized results. This proposed approach could be used to detect other linear features, such as a drainage network, from the hyperspectral imagery as well. In this way, the vectorized image could be produced to provide additional thematic layers for further spatial analysis in GIS applications.
Enhancing Dynamic Base Station Relay station Association in Cellular Network for Load Balancing

Wireless will be the term helpful to describe just about any computer system where there is no physical " cable " connection involving sender along with receiver, but alternatively the system is connected by stereo waves and/or microwaves to maintain communications. In right now day among wireless system is cell phone network. A cell phone network is a mobile network that gives services through the use of a large number of base gas stops with constrained power, each covering a limited spot. This area is called a mobile or portable. The constrained power means that we can re-use exactly the same frequency several cells far from the base station with no causing disturbance. This document present technique for the load balancing within cellular system. This discusses concerning the various approach developed within decade involving year along with propose a technique for enhancing force balancing within cellular system using base station along with relay train station
On-line processing of voice pitch feedback during production of Mandarin tones

A harvester thresher comprises a chassis, a housing, a threshing and separating mechanism operating in accordance with the principle of a tangential flow and including a threshing drum and a threshing basket, a shaker located after the threshing mechanism as considered in direction of an agricultural product flow, and a threshing and separating device located after the shaker in the housing, operating in accordance with the principle of axial flow and including a rotor and a casing.
La visualisation de traces, support à l'analyse, déverminage et optimisation d'applications de calcul haute performance

L'analyse du comportement d'applications logicielles est une tâche de plus en plus difficile a cause de la complexite croissante des systemes sur lesquels elles s'executent. Alors que l'analyse des systemes embarques doit faire face a une pile logicielle complexe, celle des systemes paralleles doit etre ca- pable de s'adapter a l'envergure de leur architecture materielle et a leur indeterminisme. La visualisation de traces obtenues lors du deroulement des applications s'executant sur ces plate-formes s'est repandue dans les outils d'analyse pour faire face a ces problematiques. Il existe aujourd'hui un large eventail de techniques qui se distinguent par la quantite d'informations, l'echelle des systemes, ou les comportements qu'elles sont capables de representer. Nous nous proposons d'en faire un etat de l'art, en discutant des methodes de visualisation statistiques, comportementales et structurelles de l'application, et des techniques permettant le passage a l'echelle de l'analyse.
The application of artificial neural networks in the prediction of earnings

In the past three decades, earnings has been the most researched variable in accounting. Empirical research provided substantial evidence on the usefulness of earnings in stock market valuation and capital market research. Unfortunately, there has been little or weak empirical evidence in predicting earnings. From the empirical evidence provided thus far, it is debatable whether a number of underlying econometric and statistical issues were fully resolved, mainly because of the nature of accounting and financial data. Linear and logistic regression approaches were applied in the past for providing prediction models, but their predicting ability was not robust. In an attempt to improve the prediction ability and robustness of the prediction models and thus avoid the inherent econometric and statistical problems in prior research, a different approach was employed. This paper examines the application of artificial neural networks (ANNs) in the prediction of future earnings. The variable to be predicted was a dichotomous realization of the change in earnings per share, adjusted for the drift in the prior earnings changes, and the predictor variables which were used had been identified, in this study, to have the highest information content for the prediction. The multi-layer perceptron (MLP) feedforward neural network architecture was used, due to its suitability as a classifier and its implementation simplicity on a sequential computer. In contrast with prior applications of ANNs in accounting, and business in general, this study also focused in the selection of an efficient and robust training algorithm. The complexity and the size of the problem, in combination with the scattered nature of pooled accounting data, demanded that a training algorithm should guarantee convergence without oscillations and be relatively fast in order to be used in such a problem. Therefore, the conjugate gradient training algorithm, originally adapted for the efficient training of ANNs by Charalambous (1992), was employed. The algorithm considers the training of the network as a multi-variable function minimization problem, employing a line search in each iteration. The logistic regression method was also examined in parallel with the ANN approach, to compare the performance of the two methods in a problem which cannot be fully solved, since it is proved that earnings follow a random walk model. Comparing the performance of the two models examined, it was found that the ANN approach performed slightly better than the logit approach. Moreover, different accounting variables were identified as earnings predictors. Future research should investigate the usefulness of other accounting information to further improve the predictability of earnings. <<ETX>>
Environment representation using multiple abstraction levels

This paper describes an approach to building a hierarchy of maplike descriptions of an initially unknown environment using a mobile robot. High-level tasks require a symbolic and qualitative description of space, yet this remains a stable and consistent method for defining specific regions of interest. The paper describes a hierarchy of spatial abstractions and a classification scheme for spatial regions to be used in navigation and mapping. In particular, the problem of maintaining a stable description of the environment that can be used for symbol extraction receives attention. By combining signal-domain analysis for initial processing of sonar and video data in conjunction with geometric processing for symbolic map data constructed from the sonar data, robust navigation becomes possible. Geometric map construction is based on range data, with sonar data used as an example. Recalibration of the robot's position, however, is critical to this task. Two different and complementary forms, of localization algorithm are described. One of these is based on simple geometric modeling of range data points, followed by data-to-object matching. The second method depends less strongly on a simple environment geometry and is based on image data.
Akademicka baza informacji jako przykład wykorzystania technologii Sieci Semantycznej

Accessing information available in WWW requires a lot of effort from human reader and is usually inaccessible for automated processing by software agents. The Semantic Web is a vision of changing this situation by providing infrastructure for expressing data and knowledge in machine-understandable format. To make this vision possible W3C Semantic Web Activity prepared set of specifications including RDF (Resource Description Language) for representing statements about resources, OWL (Web Ontology Language) for representing ontologies and SPARQL (SPARQL Protocol And RDF Query Language) for querying RDF data sets. Although Semantic Web is still a work in progress, there is already a lot of ontologies available today. In the article the SWRC (Semantic Web for Research Communities) ontology was chosen as an example. This ontology models key entities in academic and research communities and can be used for describing information about members (academic staff, students), publications (books, articles, reports) and events (workshops, conferences, lectures) Akademicka Baza Informacji jako przykład wykorzystania technologii . 43 as well as different relations between them. Knowledge about resources described in SWRC ontology can be represented as an object model, as shown in Fig.1. Using this model Semantic Web application will be able to automatically collect, integrate and process information from many sources and RDF models provided by involved organizations and different community members. SPARQL query language provides an easy way of querying distributed RDF models even not using specialized and complicated software. In conclusion, using Semantic Web technologies already available today, one could create an distributed machine-readable, self-describing database of related information. All data in such database are provided by independent sources and no central and cost-consuming maintenance is needed.
Diseño de un Almacén de Datos Histórico en el Marco del Desarrollo de Software Dirigido por Modelos

Syntax development (EMF) Concrete Syntax development (GMF) Model Transformation (QVT, JET, MOF2Text) Standards Implementations (UML2, OCL, OMD, XSD) Technology & Research (GMT, MDDi, Query, Transaction, etc) Describiremos los dos primeros, los cuales ya son proyectos maduros y cuyas implementaciones han ido evolucionando en los ultimos anos. La primera
Étude des performances du Distributed Spanning Tree : un Overlay Network pour la Recherche de Services

Les arbres et les graphes aleatoires sont deux topologies qui sont habituellement utilisees pour construire des reseaux de recouvrement et implanter des mecanismes de decouverte ? grande echelle. Nous proposons une autre topologie d interconnexion des noeuds, le Distributed Spanning Tree, qui permet l implantation d algorithmes de traversee d arbres tout en evitant les goulets d etranglement inherents ? ceux-ci et, de ce fait, offre une execution plus efficace des algorithmes de recherche en terme du nombre de messages et de repartition de la charge. Cet article presente les resultats de simulations des performances du DST. Ces simulations nous ont permis de conclure que le DST offre de bonnes performances pour les recherches, meilleures que celles des reseaux ? base de graphes et meilleures que celles des arbres. Nous etudions egalement le comportement de la structure face ? l ajout ou ? la suppression de noeuds pour montrer qu elle est adaptee aussi aux environnements dynamiques.
H/sup /spl infin//-optimal tracking control techniques for nonlinear underactuated systems

Presents techniques for controlling the motion of an underactuated vehicle when disturbances are present and only imperfect state measurements are available for feedback. A state feedback controller is developed and then it is converted to an imperfect state measurement feedback controller. The state feedback tracking control law uses an H/sup /spl infin//-optimal design and produces a locally exponentially stable closed-loop system. The imperfect state measurement feedback controller combines the state feedback control law with an H/sup /spl infin//-filter to estimate the states and achieves a modified form of disturbance attenuation. The state estimator exploits a unique structure in the nonlinear equations of motion to develop a direct solution. MATLAB simulations illustrate both control algorithms for an underactuated ship model.
Non destructive monitoring of the curing process of epoxy in situ by way of a fiber acoustic sensor

In this paper the experimental model of the nondestructive monitoring of the curing process of epoxy in situ by way of an embedded fiber optic acoustic sensor is given and the sensing principles of this intensity modulation fiber acoustic sensor are theoretically analyzed. The highlight is focused on the study of how the amplitude of the nonideal guided mode L/sub 01/ in the acoustic fiber changes with the variation of the characteristic of the cladding material. Based on the experimental results it is concluded that the theories are in good accordance with the measurement results.