Miracle-dz/UniFAR-FTUs huggingface dataset:
An UML-metamodeling Architecture for Interoperability of Information Systems

Metamodeling architectures use a metamodel as a core for abstraction mechanisms. Our idea is to employ such a metamodeling architecture for determination of an abstract basis of agreement for interoperability of information systems. Within the domain of UML metamodeling, we propose a particular four-layer metamodeling architecture: the meta-metamodel layer provides an informal description of modeling paradigms organized into a poset, while the metamodel layer more or less accurately mirrors that poset in terms of an inheritance hierarchy of metamodels. In this paper, we propose a formal description of our architecture that can be used to define –through a set of pre-defined operations– a metamodel as an abstract basis of agreement.
DIMMI DOVE VIVI E TI DIRÒ COME STAI: UN'INDAGINE EMPIRICA SUGLI EFFETTI DELLA DEPRIVAZIONE DEL QUARTIERE DI RESIDENZA SUI RISULTATI DI SALUTE

La presenza di un’elevata concentrazione delle condizioni di malattia nelle aree disagiate e un tema molto dibattuto di salute pubblica. Da una parte si sostiene che tale concentrazione sia la manifestazione dell’effetto della poverta e del disagio individuale (effetto composizionale), mentre piu di recente si e cominciato ad ipotizzare che anche il contesto possa esercitare un’influenza autonoma sui risultati di salute. Questo lavoro rappresenta il primo tentativo empirico per l’Italia di verificare l’effetto della deprivazione del quartiere di residenza in termini di inquinamento ambientale, criminalita, vandalismo e degrado urbano sulle condizioni di salute percepita, la presenza di malattie croniche e la presenza di condizioni di disabilita di lunga durata. Il lavoro mostra, come, accanto ad un forte effetto delle condizioni socio-economiche individuali, le cattive condizioni sociali ed ambientali del quartiere di residenza esercitino un’influenza non trascurabile sulla salute, soprattutto per le donne e gli individui disagiati dal punto di vista socio-economico. L’effetto della deprivazione, inoltre, sembra essere piu marcato nelle regioni centrosettentrionali rispetto a quelle meridionali probabilmente a causa di una maggiore deprivazione relativa. Questi risultati suggeriscono di accompagnare ad i tradizionali interventi di politica sociale aventi come focus l’individuo, politiche tese a migliorare le condizioni sociali, economiche ed ambientali dei quartieri disagiati, con possibili benefici sulla salute fruibili dalle intere comunita che li abitano.
2006 CCRTS The State of the Art and the State of the Practice Structure Mapping in Visual Displays for Decision Support

This paper adopts a cognitive theory of analogy and applies it to the design of decision support systems. The approach, called structure mapping, captures the conceptual structure of a C2 problem in the graphical features of a visual display. The result is a visualization that supports decision making better than standard mappings of geospatial information. As an example we present a system designed to support weapon-target pairing for time-sensitive targeting. This C2 system in particular, and structure mapping in general, are useful because solving a problem like weapon-target pairing requires reasoning about probabilities, priorities and other parameters that are not shown in standard mappings. Thus the contribution of this paper is threefold in: (1) reviewing the theory behind our structure mapping approach; (2) presenting a system designed in accordance with this approach; (3) discussing how the same approach can be used to design intuitively informative displays for other C2 systems.
Software Metrics as Class Graph Properties

Software metrics are useful for multiple purposes, such as increasing software quality and identifying error-prone software entities. Many modelling techniques, however, do not provide formal means for expressing metrics as properties of models. This report focuses on the definition and construction of class graphs for which we will express particular properties in a formalism called Description Logics. We have specified graph grammars for transforming the abstract syntax tree of a program into the corresponding class graph. After defining the Description Logic language we have expressed some selected metrics in this language. The expression evaluator we implemented checks whether the class graph contains elements that satisfy the expressions. The evaluator has been implemented in an ad-hoc way and needs to be systematically redesigned in the future. Description Logics are a useful formalism for expression properties of graphs as long as those properties do not require mathematical computations.
ISOLASI DAN IDENTIFIKASI JAMUR ENDOFIT PADA DAUN JAMBLANG (SYZYGIUM CUMINIL)

ABSTRAK Jamur endofit yang hidup pada jaringan tumbuhan berpotensi menghasilkan senyawa metabolit sekunder sama seperti inangnya. Penelitian ini berupaya mengidentifikasi jenis-jenis jamur endofit yang terdapat pada daun Jamblang (Syzigium cumini L.). Pendekatan yang digunakan dalam penelitian ini adalah pendekatan kualitatif dan metode yang digunakan adalah metode eksplorasi dan experimen. Sampel yang digunakan pada penelitian ini yaitu daun Jamblang yang berasal dari Desa Ujongbatee, Kecamatan Mesjid Raya, Kabupaten Aceh Besar.Pengumpulan data dilakukan dengan tahapan sebagai berikut: (1) isolasi dengan menggunakan metode sterilisasi permukaan (sterilization surface) dan (2) identifikasi jamur endofit secara konvensional yaitu dengan mengamati karakter fenotipik morfologi secara mikroskopik dan makroskopik lalu dibandingkan dengan monograf.Hasil penelitian menunjukkanjamur endofit yang berhasil diisolasi dari daun Jamblang sebanyak 11 jenis dan yang berhasil diidentifikasi adalah sebanyak 7 jenis dan dikelompokkan ke dalam 7 genus yaitu Fusarium, Macrophopmina, Dactylella, Paecilomyces, Nigrospora, Acremonium dan Colleotrichum. Jenis-jenis jamur endofit yang terdapat pada daun muda adalah Fusarium sp. , Isolat I, Paecilomyces sp. , Isolat III, Macrophomina sp. , dan Acremonium sp. Pada daun setengah tua terdapat jamur endofit Fusarium sp. , Macrophomina sp. , Paecilomyces sp. , Isolat I, dan Isolat II. Pada daun tua, jenis jamur endofit yang didapat adalah Dactyela sp. , Fusarium sp. , Nigrospora sp. , Acremonium sp. , dan Colletotrichum sp. , Isolat I, Isolat III, dan Isolat IV. Kata kunci: isolasi, identifikasi, jamur endofit, daun jamblang
Oracle 8: The Complete Reference

Datatypes Abstract datatypes are datatypes that consist of one or more subtypes. Rather than being constrained to the standard Oracle datatypes of NUMBER, DATE, and VARCHAR2, abstract datatypes can more accurately describe your data. For example, an abstract datatype for addresses may consist of the following columns: Street VARCHAR2(50) City VARCHAR2(25) State CHAR(2) Zip NUMBER When you create a table that uses address information, you could create a column that uses the abstract datatype for addresses—and thus contains the Street, City, State, and Zip columns that are part of that datatype. Abstract datatypes can be nested; they can contain references to other abstract datatypes. You will see a detailed example of nested abstract datatypes in the next section of this chapter. Two of the benefits listed earlier for objects—reuse and standards adherence— are realized from using abstract datatypes. When you create an abstract datatype, you create a standard for the representation of abstract data elements (such as addresses, people, or companies). If you use the same abstract datatype in multiple places, then you can be sure that the same logical data is represented in the same manner in those places. The reuse of the abstract datatype leads to the enforcement of standard representation for the data. You can use abstract datatypes to create object tables. In an object table, the columns of the table map to the columns of the abstract datatype. Nested Tables A nested table is a table within a table. A nested table is a collection of rows, represented as a column within the main table. For each record within the main table, the nested table may contain multiple rows. In one sense, it’s a way of storing a one-to-many relationship within one table. Consider a table that contains information about departments, each of which may have many projects in progress at any one time. In a strictly relational model, you would create two separate tables—DEPARTMENT and PROJECT. Nested tables allow you to store the information about projects within the DEPARTMENT table. The PROJECT table records can be accessed directly via the DEPARTMENT table, without the need to perform a join. The ability to select the data without traversing joins may make the data easier to access for users. Chapter 4: The Basics of Object-Relational Databases 73 ORACLE Series / Oracle 8i: TCR / Loney / 2364-8 / Chapter 4 Blind Folio 4:73 C:\work\CD\Book.vp Wednesday, April 12, 2000 3:56:10 PM Color profile: Disabled Composite Default screen
Authentication in VoIP Telephony with Use of the Echo Hiding Method

The paper describes the method intended to authenticate identity of a VoIP subscriber with use of the data hiding technique that is specifically implemented by means of the echo hiding method. The scope includes presentation of experimental results related to transmission of information via a hidden channel with use of the SIP/SDP signalling protocol as well as results of subjective assessment on quality of a signal with an embedded watermark. Keywords—authentication, BS 1116-1 test, digital watermarking, echo hiding.
A critical analysis of the global optimization problem for horizontal microcode (phase-coupled, compaction, code motion, compilation)

The major phases of microcode generation include register assignment, code selection, global optimization, and local compaction. Register assignment binds target machine registers to intermediate language variables. Code selection replaces an intermediate language specification of the function of the microprogram with a target machine implementation of that function. Global optimization performs code motion and code transformations within and beyond basic block boundaries. Little research has been done on the problems of phase-coupled code generation and microcode generation. This thesis investigates of the problem of phase-coupled microcode generation, noting that the problem has not been adequately defined, and therefore the proposal of solutions is somewhat premature. The purpose is to expose the nature of the problem, propose an efficient method for computing microprogram properties, to lay out interdependencies between the various phases, and to weigh possible solutions to problems of phase-coupling. A working retargetable microcode compiler is used to test various hypotheses. In-roads have been made in defining how the phases interact and at what level the interaction should be manipulated. Results indicate there is great potential in attempting to solve the microcode generation problem in a phase-coupled manner, but much study is required at every level of interaction. Pre code selection possibilities are numerous, but difficult to assess. Symbolic register assignment is helpful as it eliminates extra loads and stores that occur when register assignment between blocks is not coordinated. Compaction under timing restrictions is studied, algorithms suggested, and heuristics applied. The use of absolute node timings is found to be of importance in the compaction process. Compacting in forward and reverse directions are compared. The interactions between various phases are studied and possible mechanisms for interaction are explored. Although no set of specific heuristics can be proposed at this time, the research strongly suggests that coupling has great potential and effort used tuning heuristics and refining interactions will be well spent. The dependency of heuristics on the architecture is a recurring theme in the research.
Policy-based network management - solutions for the next generation

Policy-Based Network Management (PBNM) systems enable business rules and procedures to be translated into policies that configure and control the network and its services. Those who manage network systems are aware that this approach can benefit both network management as well as the development of applications that use network services; however, the details surrounding these systems has been obscured by marketing hype, numerous acronyms, and theoretical complexities. "Policy-Based Network Management: Solutions for the Next Generation" cuts through the hype surrounding PBNM and makes it approachable for those who really need to understand what it has to offer. The author, founder of the IETF Policy Framework working group, discusses system requirements, information models, and system components for Policy-Based Management. He also provide practitioners with a resource for developing and/or incorporating PBNM systems. As network systems become larger and more complex, creating policies for them has become a crucial step in the management of network systems, and this book is a welcome addition to this exciting approach. It presents a completely new approach to PBNM that unites the business, system, and implementation spheres. As the basis for examples and discussion, it uses the DEN-ng information model, an easy-to-understand open standard tied closely to eTOM and NGOSS. It introduces the Ponder system, then examines Ponder extensions designed to enhance the structure of high-level policies and their application in a PBNM system. It is filled with examples illustrating how policies are most effectively used in a PBNM system and what new directions PBNM is likely to take.
Modeling speech melody as communicative functions with PENTAtrainer2

This paper presents PENTAtrainer2, a semi-automatic software package written as Praat plug-in integrated with Java programs, and its applications for analysis and synthesis of speech melody as communicative functions. Its core concepts are based on the Parallel Encoding and Target Approximation (PENTA) framework, the quantitative Target Approximation (qTA) model, and the simulated annealing optimization. This integration allows it to globally optimize for underlying pitch targets of specified communicative functions. PENTAtrainer2 consists of three computational tools: Annotation tool for defining communicative functions as parallel layers, Learning tool for globally optimizing pitch target parameters, and Synthesis tool for generating speech melody according to the learned pitch targets. Being both theory-based and trainable, PENTAtrainer2 can serve as an effective tool for basic research in speech prosody.
Performance of Modified Orthogonal Space-Time Block Codes in Nakagami Fading Channels

The bit error rate (BER) performances of the Modified Orthogonal Space-Time Block Codes (MO-STBC) and Orthogonal Space-Time Block Codes (O-STBC) for coherent detection in Nakagami Fading channels are analyzed. The exact BER expressions for coherent MO-STBC and O-STBC over generalized fading channels, with Gray code mapped M-ary PSK and QAM modulations, in the presence of time-selectivity, are also derived. Keywords— O-STBC, Nakagami fading, time-selectivity, transmit diversity, bit error probability
On the Use of Grammar Based Language Models for Statistical Machine Translation

In this paper, we describe some concepts of language models beyond the usually used standard trigram and use such language models for statistical machine translation. In statistical machine translation the language model is the a-priori knowledge source of the system about the target language. One important requirement for the language model is the correct word order, given a certain choice of words, and to score the translations generated by the translation model \Pr(f_1^J/e^I_1), in view of the syntactic context. In addition to standard m-grams with long histories, we examine the use of Part-of-Speech based models as well as linguistically motivated grammars with stochastic parsing as a special type of language model. Translation results are given on the VERBMOBIL task, where translation is performed from German to English, with vocabulary sizes of 6500 and 4000 words, respectively.
Practical reusable UNIX software

Software Reuse: A Decade-Long Experiment Libraries, File and Portability Configuration Management Base Tools: KSH and Easel APP - An Annotation Preprocessor for C Reverse Engineering-CIA Security and Software Engineering A Software Fault Tolerance Platform Generalized Event - Action Handling Software Process - Provence Inter-Tool Connections Evaluation of Approach.
EXPLORING BEHAVIORAL PATTERNS IN COMPLEX ADAPTIVE SYSTEMS

Many phenomenons in real world can be characterized as complex adaptive systems (CAS). We are surrounded with a huge number of communicating and interacting agents. Some of those agents may be capable of learning and adapting to new situation, trying to achieve their goals. E-commerce, social media, cloud computing, transportation network and real-time ride sharing, supply chain are a few examples of CAS. These are the systems which surround us in every day’s life, and naturally we want to make sense of those systems and optimize systems’ behavior or optimize our behavior around those systems. Given the complexity of these systems, we want to find a set of simplified patterns out of the seeming chaos of interactions in a CAS, and provide more manageable means of analysis for such systems. In my thesis I consider a few example problems from different domains: modeling human behavior during fire evacuation, detection of notable transitions in data streams, modeling finite resource sharing on a computational cluster with many clients, and predicting buyer behavior on the marketplace. These (and other) seemingly different problems demonstrate one important similarity: complex semi-repetitive or semi-similar behavior. This semi-repetitive behavior poses a challenge to model such processes. This challenge comes for two major reasons: 1 ) state-space explosion and sparsity of data 2 ) critical transitions and precision of process modeling I show, that the analysis of smilingly different CAS coming from different domains, can be performed by following the same recipe.
Censoring for cooperative positioning

Cooperative positioning is an emerging topic in wireless sensor networks and navigation. It can improve the positioning accuracy and coverage in GPS-challenged conditions such as inside tunnels, in urban canyons, and indoors. Different algorithms have been proposed relying on iteratively exchanging and updating positional information. Although cooperative positioning can provide excellent accuracy, it suffers from high computational complexity due to a lot of incoming information from the neighboring devices. Cooperation in a dense network also increases network traffic. For practical implementation of cooperative positioning, a less complex algorithm with low network traffic is necessary. The complexity of the positioning algorithms are directly related to the number of used links in the iterative update phase. Not all of the incoming information from neighboring devices are required for precise positioning. In addition, the network traffic depends on the network geometry, type of positioning algorithm, number of transmissions per node. As the network geometry and type of positioning algorithm are predefined, we can control the network traffic only by reducing the number of transmissions per node. In this thesis we propose an algorithm that can minimize the number of used links for update and also the network traffic without significant performance degradation. We show that information that is not reliable should not be shared, and information that is not informative should not be used. This naturally leads to censoring schemes. We consider different censoring schemes based on the Cramer Rao bound (CRB). We find that by blocking the broadcasts of the nodes that don’t have reliable estimates (transmit censoring) and selecting the best usable links after receiving signals from neighbors (receive censoring), complexity and network traffic can be reduced significantly without hampering the positioning performance or latency.
L’Europa sociale. Il modello “ideale”

«Da sociologo che si occupa di welfare, mi interessa porre l’accento sui fondamenti di cultura politica e istituzionale che possono costituire dei mattoni per una idea di costituzione sociale europea. L’idea di una “Europa sociale”, nel processo di sviluppo istituzionale delle Comunita Europee, ha avuto un forte impulso in particolare con la Presidenza della Commissione di Jacques Delors – a partire dalla definizione di un modello sociale continentale basato sul dialogo sociale e sulla definizione di diritti fondamentali comuni ». (segue).
Ant Colony Algorithm for Solving Scheduling Problem in Multi-targets Attacking

Aiming at the command and decision-making problem in Beyond Visual Range Air Combat(BVRAC),an optimal scheduling method of multi-targets BVR attacking based on ant colony algorithm is put forward.By applying the good parallel computing and fast global searching capabilities of ant colony algorithm,it makes the constructed scheduling method of multi-targets BVR attacking,which can obtain satisfaction solution to the problem in real time.The implement process is given.Simulation result shows that the method is effective,especially for large scale scheduling problem,and has faster constringency rate and higher precision.
Automatically detecting important moments from everyday life using a mobile device

This paper proposes a new method to detect important moments in our lives. Our work is motivated by the increase in the quantity of multimedia data, such as videos and photos, which are capturing life experiences into personal archives. Even though such media-rich data suggests visual processing to identify important moments, the oft-mentioned problem of the semantic gap means that users cannot automatically identify or retrieve important moments using visual processing techniques alone. Our approach utilises on-board sensors from mobile devices to automatically identify important moments, as they are happening.
Analysis of A Compact Wideband Slotted Antenna for Ku Band Applications (In Press)

The design procedure and physical module of a compact wideband patch antenna for Ku band application are presented in this paper. Finite element method based on 3D electromagnetic field solver has been utilized for the designing and analyzing process of proposed microstrip line fed modified - shaped electrically small patch antenna. After successful completion of the design process through various simulations, the proposed antenna has been fabricated on printed circuit board (PCB) and its characteristics have been studied. The parameters of the proposed antenna prototype have been measured in standard far-field rectangular shape anechoic measurement compartment. It is apparent from the measured antenna parameters that the proposed antenna achieved almost stable variation of radiation pattern over the entire operational band with 1380 MHz of 10 dB return loss bandwidth. The maximum gain of 7.8 dBi and 89.97% average efficiency within the operating band from 17.15 GHz to 18.53 GHz ensure the suitability of the proposed antenna for Ku band applications.