Miracle-dz/UniFAR-FTUs huggingface dataset:
An arbiter synthesis approach based on arbitration scheme generation/selection for HW/SW co-design

The aim of this paper is to present an arbiter synthesis approach stated as an arbitration scheme generation/selection problem. This approach may be easily inserted in an extendible system co- design methodology, It assumes that many co-design tasks have been performed, and it aims to automate the resolution of the access conflict problems that may be inevitably encountered whenever there is a resource contention in the system. The proposed approach allows one to transform a system composed of high level processes that share the same channels and the same variables in disordered manner into a set of processes executed by interconnected processors and hardware devices (e.g., ASICs, FPGAs, etc.) that share the same resource such as memories and busses using the most efficient arbitration scheme, This approach is basically based on an algorithm that allows respectively the automatic generation/selection of the arbitration scheme, and the fixed priority assignment in a manner that minimizes the real time cost.
Analysis of jitter in phase-locked loops

Jitter in clock signals is analyzed, linking noise in free-running oscillators to short-term and long-term time-domain behavior of phase-locked loops. Particular attention is given to comparing the impact of 1/f noise and white noise in oscillators and frequency dividers on jitter in phase-locked loops of first- and second-order. Theoretical analysis is supported by results obtained using mixed-signal behavior simulation.
Mosaicing for high resolution acquisition of paintings

There is an every day increasing interest toward the applications of image processing techniques to the field of Cultural Heritage, the main objectives being high quality archival, image reproductions enhancement, virtual reconstruction, virtual restoration. This paper deals with the problem of setting up a simple and automatic procedure for obtaining a high resolution picture of a painting starting from a set of overlapped images showing different parts of the painting itself. With respect to other mosaicing techniques the proposed method allows to compose the whole picture even in the presence of strong colour distortions. This is possible thanks to the use of an ordinal measure as a similarity criterion for evaluating the correspondences between the images. Experimental results have demonstrated the good performances of the proposed method.
Modulo scheduling with isomorphic control transformations

This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches introduce multiple execution paths, it is difficult for a global scheduler to keep track of the various paths and to select the appropriate operations to schedule. A new approach to global instruction scheduling is presented that uses Isomorphic Control Transformations (ICTs). If-conversion is used to convert an acyclic control flow graph into a large basic block or hyper-block. Local scheduling techniques which are well-known and widely supported can then be applied to schedule operations. After scheduling, the control flow graph is regenerated using Reverse If-Conversion. One well-known local scheduling based technique is Modulo Scheduling. Modulo Scheduling is a software pipelining technique that effectively schedules loops for high-performance processors. This dissertation highlights the benefits of Modulo Scheduling over other software pipelining techniques based on global scheduling. The ICTs are applied to Modulo Scheduling to schedule loops with conditional branches. Experimental results show that this approach allows more flexible scheduling and thus better performance than Modulo Scheduling with Hierarchical Reduction. Modulo Scheduling with ICTs targets processors with no or limited support for conditional execution such as superscalar processors. However, in processors that do not require instruction set compatibility, support for Predicated Execution can be used. This dissertation shows that Modulo Scheduling with Predicated Execution has better performance and lower code expansion than Modulo Scheduling with ICTs on processors without special hardware support.
Bit-complexité des protocoles de gossip

Nous etudions le probleme du \emph{gossip} (i.e., diffusion de rumeurs) dans le modele des appels aleatoires. Considerons $n$ noeuds communiquant en parallele par etape. A chaque etape, un ensemble (potentiellement vide) de \emph{rumeurs} est genere a chaque noeud, la meme rumeur pouvant etre generee simultanement par plusieurs noeuds. L'objectif est de diffuser ces rumeurs a tous les noeuds. Pour ce faire, a chaque etape, chaque noeud appelle un autre noeud choisi uniformement aleatoirement parmi l'ensemble de tous les noeuds, et un noeud ne peut alors communiquer qu'avec le noeud qu'il a appele, et les noeuds qui l'ont potentiellement appele. Dans ce modele, Karp et ses co-auteurs~\cite{Karp2000} ont montre qu'aucun algorithme de gossip ne peut etre a la fois optimal en temps (i.e., s'executer en $O(\log n)$ etapes) et en volume de communication (i.e., s'executer en transmettant au plus $O(n)$ messages). En particulier, ils ont montre que tout algorithme de gossip n'utilisant pas les IDs des noeuds et diffusant toute rumeur en $O(\log n)$ etapes doit echanger $\Omega(n\log\log n)$ messages par rumeur. Karp et ses co-auteurs ont egalement montre que ce compromis peut etre atteint. Dans cet article, nous etudions le volume de communication estime en nombre de bits echanges plutot qu'en nombre de messages. Nous montrons tout d'abord que tout algorithme de gossip n'utilisant pas les IDs des noeuds et diffusant toute rumeur en $O(\log n)$ etapes doit echanger $\Omega(n (b+\log\log n))$ bits pour diffuser une rumeur de $b$ bits. Nous proposons alors un algorithme de gossip n'utilisant pas les IDs des noeuds qui diffuse toute rumeur en $O(\log n)$ etapes, en echangeant $O(n(b+\log\log n\log b))$ bits pour une rumeur de $b$ bits. Ces resultats demontrent que contrairement a ce qu'il peut sembler lorsque l'on mesure le volume de communication en nombre de messages, il est possible d'etre a la fois optimal en temps (i.e., s'executer en $O(\log n)$ etapes) et en volume de communication (i.e., s'executer en transmettant au plus $O(nb)$ bits), sauf pour des rumeurs extremement petites, de taille $b\ll\log\log n \log\log\log n$ bits.
Business Specialization Track Masters of Software Engineering (MSE) Program

MSE students who aspire to obtain business management positions within a computer-related technology company, to specialize in the development of software to support production and operations, and/or to start their own technical companies will need fundamental business skills and expertise. The MSE Program offers the Business Specialization Track to help students acquire appropriate business skills while completing their master''s degree in software engineering. The track is flexible in that it allows students to choose their own set of track courses from a list of approved business-related courses and, therefore, to match their career objectives with suitable courses. For instance, students can select courses to help them prepare for careers as executive-level managers of computer technology companies, as designers of information systems, as developers of software systems to support production and operations, and/or as founders of high technology companies. This report describes the track rationale and requirements, provides educational guidelines to help students select courses, lists the approved courses, and presents brief synopses of the approved courses. The report is based the author''s work in developing specialization tracks for the MSE program. The author started her work on specialization tracks in graduate software engineering education during the spring of 1993.
JUQUEEN: IBM Blue Gene/Q® Supercomputer System at the Jülich Supercomputing Centre

JUQUEEN is a high-scaling supercomputer funded mainly by the Gauss Centre for Supercomputing and by Helmholtz Association and is hosted by the Julich Supercomputing Centre. It is a 28 rack, IBM Blue Gene/Q ® system combining 28,672 compute nodes through a high-speed network providing an overall peak performance of 5.9 Petaflops.
EVALUATION OF OPERATION PERFORMANCE FOR CONTAINER TERMINAL FROM MICRO POINT VIEW

The method of evaluating a container terminal performance, from a management perspective, is becoming more and more complicated. This paper intends to evaluate the performance of container terminal from a micro perspective. The queuing theory could only solve problems about changes of berth numbers in the operational performance of container terminals and seldom simultaneously deal with equipment variation. In this study, we have used many evaluation indexes, including cost functions, to analysis four different operation scenarios via a simulation model. According to our research results the equipment deployment is discussed to propose an operational method in order to promote port performance. The equipment deployment of a container terminal plays a vital role in port planning and profoundly influences ship berthing and the smooth operation of container loading/discharging. Performances of three different berth configurations are also compared, and the reasonable capacity of container terminal is also deduced.
Fast Ray Tracing Using K-d Trees

A hierarchical search structure for ray tracing based on k-d trees is introduced. This data structure can handle the variety of surfaces commonly used in computer graphics. Algorithms to build and traverse this binary data structure are described. Only regions through which a ray travels are interrogated and the search proceeds along the path of the ray starting from its origin. The algorithm also ensures that no object is interrogated more than once in the search for intersection. Benchmarking results indicate that when used with axis-aligned bounding parallelepipeds, this method of ray tracing is one of the fastest known.
Developing a Centralised Approach for authentication of Online Quran with Assistance of Muslim Scholars

The Magnificent Qur’an, the Muslims’ sacred and the most authentic Book, was revealed in Arabic the most immense language all over the world. Prophet Muhammad (PBUH) upon who this book was reveled in twenty three (23) years make complete arrangements for its authenticity by transferring Allah’s message to His Companions through reciting exact word by word preserving the accurate order. Nowadays with huge advancement in information technology (IT) the preferences are given to the new advance and smart devices for reading, reciting and memorizing the Quran instead of Printed copy of the Holy Quran that is considered more reliable and authentic. No doubt this advancement has make it easy to access the Quran anytime, anywhere for everyone but has open a real threat in the authenticity of digital Quran. In the past a lot of work has been done to define a proper mechanism for authenticity of digital Quran/online Quran, This paper is a step forward to the same process. It introduces the Centralised mechanism using blended approach of Digital signature and Zero-watermarking technique authentication of digital Quran. The skills to control the authenticity of digital Quran with the help of scholars can be challenging in the current situation. Now a days it is the big challenge for the users to identify the valid copy of digital (online) Quran . The Muslims everywhere in the world are facing deficiency of attentiveness in distribution of fake digital versions of Quran without acknowledgment of approved Muslims scholars. Muslims around the world individuals as well as groups have been putting huge effort to detect and eradicate illegal copies of Holy Quran. There should be one committee of Muslims scholars and IT experts which has both type of technological and Islamic knowledge about Quran. We therefore are going to propose digital Quran centralized authentication system by using latest authentication approach. The system is aimed to combining sophisticated knowledge of our outstanding Muslim scholars and extraordinary technological experts to provide the authentic, valid and error proof digital Quran to every Muslim.
Architectural Principles for Virtual Computer Systems

Abstract : he most important new result of the thesis is the model of a process running on a virtual computer system (VCS) and the derivation of design principles from that model. The approach adopted is to consider the introduction of VCS's into the rich, complex architectures likely to be found in 4th generation systems. The model allows us to understand different properties of virtual machines and to interpret a number of proposed implementations of VCS's in terms of the model. Furthermore, the model leads naturally to an implementation of virtual machines, the Hardware Virtualizer (HV) which provides an efficient and simplified mechanism for virtual machines. A number of detailed examples illustrate how the Hardware Vitualizer might operate in an actual 4th generation system.
A Bilingual Treebank for the FraCaS Test Suite

We have created an open-source bilingual treebank for 99% of the sentences in the FraCaS test suite. The treebank was built in conjunction with associated English and Swedish lexica written in the Grammatical Framework Resource Grammar. The original FraCaS sentences are English, and we have tested the multilinguality of the Resource Grammar by analysing the grammaticality and naturalness of the Swedish translations. 86% of the sentences are grammatically and semantically correct and sound natural. About 10% can probably be fixed by adding new lexical items or grammatical rules, and only a small amount are considered to be difficult to cure.
1.2.3 Towards a semantic‐based representation and computation of quantitative indexes for quality management of requirements

Quality management of requirements has seen a dramatic increase of the amount of applications, management platforms, data, etc. gaining momentum in the Systems Engineering area and more specifically in the deployment of the next wave of critical system. In this context, one of the next big things lies in the creation of quality functions that can automatically detect and make decisions according to natural‐language based requirements specifications and models. In this sense quality indicator of requirements seeks for providing an intelligent environment for detecting values of such as correctness, consistency and completeness based on domain knowledge in which both functional and nonfunctional properties of system components can be validated and verified easing the transition to a smart system environment. Thus the testing of critical systems based on requirements quality can be seen as a special kind of policy‐making strategy that must compile several key indicators to summarize data and information and obtain an objective quantitative measure. Nevertheless the quantitative analysis of several quality indicators is becoming a challenging task due to natural language ambiguities and a tangled/heterogeneous environment of data, providers, etc. Existing tools and techniques based on traditional processes of quality assessment are preventing a proper use of the new dynamic and data environment avoiding more timely, adaptable and flexible (on‐demand) quantitative index creation and, as a consequence, more accurate decisions. On the other hand, semantic‐based technologies emerge to provide the adequate building blocks to represent domain‐knowledge and process data in a flexible fashion using a common and shared data model. That is why the present paper introduces a Resource Description Framework (RDF) vocabulary to semantically represent and compute quantitative indexes as part of the implementation of the Open Services for Lifecycle Collaboration initiative (OSLC) Quality Management specification. Finally some discussion, conclusions and future work are also outlined.
Formalization of properties of parallel programs

Abstract : The paper describes a class of parallel programs and gives a formalization of certain properties of such programs in predicate calculus. Although the programs are syntactically simple, they do exhibit interaction between asynchronous parallel processes, which is the essential feature to be considered. The formalization can easily be extended to more complicated programs. Also presented is a method of simplifying parallel programs, i.e., constructing simpler equivalent programs, based on the 'independence' of statements in them. With these simplifications the formalization gives a practical method for proving properties of such programs. (Author)
Malware detection and analysis via layered annotative execution

PAGE Malicious software (i.e., malware) has become a severe threat to interconnected computer systems for decades and has caused billions of dollars damages each year. A large volume of new malware samples are discovered daily. Even worse, malware is rapidly evolving to be more sophisticated and evasive to strike against current malware analysis and defense systems. This dissertation takes a root-cause oriented approach to the problem of automatic malware detection and analysis. In this approach, we aim to capture the intrinsic natures of malicious behaviors, rather than the external symptoms of existing attacks. We propose a new architecture for binary code analysis, which is called whole-system out-of-the-box fine-grained dynamic binary analysis, to address the common challenges in malware detection and analysis. To realize this architecture, we build a unified and extensible analysis platform, codenamed TEMU. We propose a core technique for finegrained dynamic binary analysis, called layered annotative execution, and implement this technique in TEMU. Then on the basis of TEMU, we have proposed and built a series of novel techniques for automatic malware detection and analysis. For postmortem malware analysis, we have developed Renovo, Panorama, HookFinder, and MineSweeper, for detecting and analyzing various aspects of malware. For proactive malware detection, we have built HookScout as a proactive hook detection system. These techniques capture intrinsic characteristics of malware and thus are well suited for dealing with new malware samples and attack mechanisms.
Estimation and Application of Vision-based Camera Tracking Using Planar Structures in the Real World

In this thesis, we propose the camera tracking method using captured images of multiple planar structures in the real world, and the application systems for Augmented Reality. In contrast with previous camera tracking methods using multiple planes, our method doesn’t require any relationship information of the planes because of constructing “3D Projective Space” which is defined by two reference images. We apply this method for AR registration and demonstrate that virtual objects can be overlaid onto input images of the real world frame by frame. By extending this method, “On-line AR System” using multiple planar markers is proposed. This system allows a user to place multiple markers at arbitrary positions and poses in the large space. The virtual object can be overlaid onto the real world in real-time. Moreover, the virtual object can move around the real world not only on the tabletop but also in the large room. AR applications extended this system are also proposed. “AR Baseball Presentation System” is an observation system of a virtual baseball game. Users place a real baseball field model on the tabletop and input a baseball game history (scorebook) into the system. Then they can watch the game by replaying with virtual baseball players on the field model in front of them. In “Interactive AR Bowling System”, users knock down virtual pins by rolling a real ball. On the lane model, there are virtual pins generated with CG. Touching and rolling the real ball provide a sort of tangible feeling in this system. For improving the accuracy of pattern-based tracking, we also propose the tracking method with Particle Filter. By comparing the actual image with generated images by hypotheses, the best camera parameters can be obtained. Our method achieves more stable result than the related method. Finally this method is also applied to the system for mapping GIS information onto the user’s images captured from the high place. By using satellite images, the user’s camera is tracked and then GIS information is overlaid onto the user’s image frame by frame.
Visualizations of Collaborative Information for End-Users

There is a growing need for methods and tools to illuminate the social contexts of interaction environments created by the World Wide Web, Usenet newsgroups, email lists, and other network interaction media. We present here a framework for creating visualizations of the social connections created in and through network interaction media. Using graph-drawing methods, visualizations can be created for a range of systems that link people to people and people to objects through networks. As an example, we present an application of our methods to the Usenet to illustrate how visualization can improve existing systems. We propose that users of network interaction media can benefit from visualizations that illuminate the interaction context generated by the rich interconnections between groups, conversations, and people in these media.
이동로봇의 전역 경로계획을 위한 Self-organizing Feature Map

A global path planning method using self-organizing feature map which is a method among a number of neural network is presented. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of 1-dimensional string and 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.
A pre-processing algorithm for solving constraint satisfaction optimisation problems

A constraint satisfaction problem (CSP) involves finding values, selected from a finite domain, for all variables such that all constraints on the variables are satisfied. A constraint satisfaction optimisation problem (CSOP) is a CSP that has some objective function defined in terms of some or all of the variables. We present an algorithm where we employ local consistency techniques in a pre-processing phase, in order to decrease the domain sizes of the variables. This results in a simplified CSOP to be solved by an existing algorithm.Partial constraint satisfaction involves finding values for all variables such that a maximal subset of the constraints is satisfied. We expand our pre-processing algorithm to the partial CSOP case.