Miracle-dz/UniFAR-FTUs huggingface dataset:
Centrum voor Wiskunde en Informatica

This paper discusses an architectural design support system. The system is based on a strategy of incremental spatial decomposition of a design object. It provides mechanisms for the application of strategies such as functional decomposition and re-use of design object knowledge. First we discuss two basic strategies used in architectural design, viz. decomposition and application of prototypes. We then discuss the architecture of a design system that supports both strategies. By means of an example, we show how the system actually supports an architectural design process and how the system is used to communicate with external, autonomous design support expert systems. Such systems provide special facilities for drawing, calculating and other tasks performed during a design process, and are interfaced by means of our design system. The last part of the paper contains an evaluation of our work. We propose topics for further research for our project: the IIICAD project. The aim of our system is to provide a sound basis for the tools developed in the IIICAD project and at the same time to be an interface to already existing tools like expert systems for FEM modelers, drawing machines etc.
A TCP-Over-UDP Test Harness

This report describes an implementation of a TCP-like protocol that runs over UDP. This TCP-like implementation, which does not require kernel modifications, provides a test harness for evaluating variations of the TCP transport protocol over the Internet. The test harness provides a tunable and instrumented version of TCP that supports Reno, NewReno, and SACK/FACK. The test harness can also be used to characterize the TCP-performance of a network path. Several case studies illustrate how one can tune the transport protocol to improve performance.
Validating software metrics

We propose a comprehensive metrics validation methodology that has ix validation criteria, each of which supports certain quality unctions. New criteria are defined and illustrated, including consistency, discriminative power, tracking and repeatability. We show ihat non-parametric statistical methods play an important role in evaluating metrics against the validity criteria. A detailed example Df the application of the methodology is presented.
Using KORBX for military airlift applications

KORBX, a new product for solving large-scale linear programs, consists of parallel processing hardware and software that exploits its design and resources. KORBX contains four algorithms which are variations of the interior point method of N. Karmarkar (1984). The four, known as the primal, dual, primal-dual, and power series algorithms, were empirically evaluated on a set of linear programming application models being used by the staff of the US Military Airlift Command at Scott Air Force Base. The results are summarized. <<ETX>>
A Study on Efficient Searching Top-k Semantic Similar Sentences (データ工学)

Semantic similarity measure between sentences is an important issue in many applications, such as, text mining, Web page retrieval, dialogue systems, and so forth. Although it has been explored for several decades, most of these studies focus on how to improve the effectiveness of the problem. In this paper, we address the efficiency issue, i.e., for a given sentence collection, how to efficiently discover the top-k most semantic similar sentences to the query. It is a very important issue for real applications while existing state-of-the-art strategies cannot satisfy the performance requirement of the users. We introduce a general framework to tackle the issue, in which several efficient strategies are proposed. Extensive experimental evaluations demonstrate that our approach outperforms the state-of-the-art methods. Keyword semantic similarity, query aggregation, Top-k
Uma arquitetura de controle inteligente para múltiplos robôs

In this work, an intelligent control architecture for multi-robots denominated ACIn was proposed. With this objective, some techniques considered intelligent were studied for the planning of trajectories, such as Artificial Neural Networks, Potential Fields and Potential Fields based on the boundary value problem (BVP). Such techniques, normally used for a single robot, were adapted to function with multi-robots inside the ACIn architecture. Another contribution of this work refers to the improvement of the Potential Fields based on the boundary value problem (BVP) technique. This improvement was proposed to supply the drawback of the BVP based techniques when they are applied to multi robots environments. Besides, a Rule Based System (RBS) was also proposed as part of the ACIn architecture. The objective of the RBS is to characterize the functionality of each robot for a determined task. This is necessary for the behavior of the equip members not to be competitive, but collaborative. Finally, it was observed through the experiments with the robot soccer simulated environment, that our intelligent control architecture (ACIn) proposal, integrating planning and RBS for the control of multi-robots was satisfactory.
Modular Specification and Verification of Delegation with SMT Solvers

Delegation is a very common programming idiom, whereby a task is carried out by a statically unknown part of the program. Delegation enhances the modularity and the extensibility of a program, and, for that reason, is the main ingredient of many important design patterns. Unfortunately, delegation complicates specification and verification: the programmer must either rely on unsuitably weak specifications imposed by behavioral subtyping, or compromise automation by resorting to higherorder logic. In this paper, we present an expressive specification and verification methodology, in which partial correctness reasoning about delegation can be carried out in first order logic, using automated SMT solvers.
An Introduction To Survival Analysis Using Stata Third |

Dynamic Prediction in Clinical Survival AnalysisStata Survival Analysis and Epidemiological TablesBayesian Survival AnalysisAn Introduction to Survival AnalysisModelling Survival Data in Medical Research, Second EditionSurvival AnalysisAn Introduction to Survival Analysis Using StataEvent History AnalysisSurvival Analysis in Medicine and GeneticsSurvival and Event History AnalysisAdvanced Survival ModelsSurvival AnalysisAnalysis of Survival DataHandbook of Survival AnalysisAnalysis of Multivariate Survival DataApplied Survival AnalysisAnalysis of Survival Data with Dependent CensoringSurvival Analysis Using SSurvival AnalysisApplied Survival Analysis Using RCounting Processes and Survival AnalysisClinical TrialsIntroduction to Survival AnalysisSurvival Analysis with Interval-Censored DataSurvival AnalysisAn Introduction to Survival Analysis Using StataFlexible Parametric Survival Analysis Using StataMultivariate Survival Analysis and Competing RisksApplied Survival AnalysisSurvival Analysis Using SASFrailty Models in Survival AnalysisPredictive Modeling Applications in Actuarial ScienceSurvival AnalysisStatistical Methods for Survival Data AnalysisBusiness Survival Analysis Using SASAnalysis of Failure and Survival DataStatistical Methods for Survival Data AnalysisIntroducing Survival and Event History AnalysisModeling Survival Data: Extending the Cox ModelAn Introduction to Survival Analysis Using Stata, Second Edition
SPECIFICATION OF BUSINESS VALUE WITH AND IN SOFTWARE PATTERNS

Business value is a crucial, but frequently neglected, aspect of software quality. Specification of business value with and in software patterns promises improved software quality. Here, ‘with’ refers to patterns describing best practices in modeling, monitoring, and control of business value of software. Contrary, ‘in’ refers to annotations of existing patterns (for various problems) with business value information. We illustrate our discussion on the WS-Policy4MASC policy language and the UML profiles for it. WSPolicy4MASC enables specification of diverse business values and various business strategies for maximizing business values in run-time system monitoring and control. The UML profiles for WS-Policy4MASC can be used for specification of business value (and other quality aspects) both with and in software patterns.
Editing distance information in compact microphone array recordings for its binaural rendering (応用音響)

Spatial sound information can be recorded using spherical microphone arrays. Realistic binaural renderings of such recordings require the head-related transfer functions (HRTFs), characterized from thousands of surrounding positions to both ears. We propose a 3D audio processing method to make sounds appear closer or farther than their original distance. HRTFs for only some surrounding positions at a fixed distance are required. Binaural signals are synthesized from samplings of the sound pressure field on a rigid spherical surface. The directional structure of both the sound pressure field and the HRTFs are encoded using spherical harmonics. Distance manipulations rely on the use of the spherical Hankel functions.
Retargetable tools for embedded software

Today, the advent of the multi-million transistor chip offers the opportunity to provide more integrated functionalities into a single silicon die. This is both a clear advantage to improve existing products and a hard challenge to cope with. Unfortunately, today's available design methodologies and tools are not sufficiently advanced to exploit the full potential of such large silicon flexibility. On one hand, the design of complex system-on-chip requires new tools for the analysis and optimization of embedded software, which should extend the standard tool chain consisting of complier, debugger and simulator. On the other hand, the development of such tool chain for a new microprocessor requires a substantial time effort which is no more compatible with actual market dynamics. In STMicroelectronics, we developed a technology which tries to tackle such a double-face problem by adding several retargetability features to a standard tool chain and by providing new tools for code analysis.
An analysis of a noise reduction neural network

An analysis of the four-layer, feedforward, noise-reduction neural network proposed by S. Tamura author and A. Waibel (Int. Conf. Acoust., Speech and Signal Proc., p.553-6, 1988) is described. Each layer has 60 units and is fully interconnected with the next higher layer. The input of the network is given by a 60-point-long (at 12-kHz sampling rate) noisy waveform, and the output is a 60-point-long noise-free waveform. The network was trained using the back-propagation learning algorithm. The network is divided into three subelements for the analysis. Each element stands for a transformation from a layer output to the next higher layer output. First, the transformation from the input layer to the first hidden layer is analyzed, showing that the linear part of the transformation performs linear noise reduction as well as linear speech/noise-characteristic extraction. It is also shown that the transformation from the first hidden layer to the second hidden layer greatly compresses the noise region of the first hidden layer by sigmoid nonlinearities, while preserving its speech region, and the transformation from the second hidden layer to the output layer linearly suppresses the noise components. The spectra of basis vectors spanning an output waveform space show poor higher formant structures. <<ETX>>
Simulating a Simple Real Business Cycle Model Using Excel

Simulating the real business cycle models is a popular topic in first-year graduate courses on macroeconomics. Usually, Maple and Matlab are used for this purpose, mainly because they can be used both for solving and for simulating the models. Strulik (2004) demonstrates that Excel can be used both for solving and for simulating a standard RBC model. In this paper, we propose a more elementary approach that might be suitable for undergraduate courses. We illustrate (i) how to solve a simple RBC model by hand and (ii) how to use Excel to simulate the solution.
Security Engineering with Patterns: Origins, Theoretical Models, and New Applications

1. Introduction. - 2. Patterns in Software Development. - 3. Ontologies. - 4. The Human Factor. - 5. Classifying Security Improvement Artifacts. - 6. Toward a Security Core Ontology. - 7. Foundations of Security Patterns. - 8. A Theoretical Model for Security Patterns. - 9. New Applications of Security Patterns. - 10. Summary and Outlook. - A. Sources for Mining Security Patterns. - B. Example Security Patterns and Annotations. - C. Ontology Development. - D. F-Logic Primer. - E. Gaining Security Expertise.
LABR: A Large Scale Arabic Sentiment Analysis Benchmark

We introduce LABR, the largest sentiment analysis dataset to-date for the Arabic language. It consists of over 63,000 book reviews, each rated on a scale of 1 to 5 stars. We investigate the properties of the dataset, and present its statistics. We explore using the dataset for two tasks: (1) sentiment polarity classification; and (2) ratings classification. Moreover, we provide standard splits of the dataset into training, validation and testing, for both polarity and ratings classification, in both balanced and unbalanced settings. We extend our previous work by performing a comprehensive analysis on the dataset. In particular, we perform an extended survey of the different classifiers typically used for the sentiment polarity classification problem. We also construct a sentiment lexicon from the dataset that contains both single and compound sentiment words and we explore its effectiveness. We make the dataset and experimental details publicly available.
Face detection in video using combined data-mining and histogram based skin-color model

An improved technique of skin-color modelling for face detection in video is proposed. The skin-color is modelled as a combination of histogram based and data-mining based approaches. To solve a skin-color modelling problem in the presence of lighting variation, unconstrained environment, variation in races, resulting skin-color model is a product that minimizes registration errors and increases robustness and accuracy of the face detection in video system. The method improves applications performance on 7%, which is a significant advantage.
Error resilient transmission of H.263 coded video over mobile networks

In this paper, we propose an error resilient transmission system for reliable transmission of H.263 coded video sequence over mobile networks. Both the coded video characteristics and mobile channel statistics are investigated. The error protection schemes are designed based on the best matched block codes coupled with diversity reception. A low complexity error concealment based on prediction of inter-block correlation is also introduced to effectively reconstruct the damaged image blocks caused by the residual errors. Simulations with different test video sequences under various mobile channel conditions confirm that good visual quality can be achieved by the proposed system.
rMPI : increasing fault resiliency in a message-passing environment.

As High-End Computing machines continue to grow in size, issues such as fault tolerance and reliability limit application scalability. Current techniques to ensure progress across faults, like checkpoint-restart, are unsuitable at these scale due to excessive overheads predicted to more than double an applications time to solution. Redundant computation, long used in distributed and mission critical systems, has been suggested as an alternative to checkpoint-restart on its own. In this paper we describe the rMPI library which enables portable and transparent redundant computation for MPI applications. We detail the design of the library as well as two replica consistency protocols, outline the overheads of this library at scale on a number of real-world applications, and finally outline the significant increase in an applications time to solution at extreme scale as well as show the scenarios in which redundant computation makes sense.
Methods for Network Abstraction

We propose network abstraction as a research area. It is motivated by the growth of networks in many areas of life. Consider, for instance, networks of thousands of genes, millions of people, or billions of web pages. They are too large to be directly analyzed by users. The aim of network abstraction is to summarize a large network as a smaller one. An abstracted network can then help users to see the overall topology of a large network, or to understand the connections of distant nodes. The general network abstraction task is: given a large network, transform it into a smaller one, which contains in some well-specified sense the most relevant information. In this thesis, we analyze this research area and propose methods to solve some instances of the problem. The methods also provide different trade-offs between the graph quality and simplicity, as well as between result quality and efficiency. More specifically, we propose two approaches to abstracting a network. The first one is to simplify a weighted network by removing edges under the constraint that distances between all pairs of nodes are preserved. We first empirically show that a number of edges can be removed from real biological networks without losing any graph connectivity. We next relax the constraint of fully preserving original graph connectivity, extend lossless network simplification to lossy network simplification, and demonstrate that many more edges can be removed with little loss of quality.
Bhattacharyya distance 기반 특징 추출 기법

Bhattacharyya distance는 패턴 분류 문제에 있어서 클래스간 분리도 측정의 수단으로 사용되어 왔으며 특징 추출 시 유용한 정보를 제공한다. 본 논문에서는 최근 발표된 Bhattacharyya distance를 이용한 에러 예측 기법을 이용하여 예측된 분류 에러가 최소가 되는 특징 벡터를 추출하는 방법에 대하여 제안한다. 제안한 특징 추출 기법은 최적화 알고리즘인 전체탐색 및 순차탐색 방법의 적용 시 분류 에러를 직접 구하지 않고 Bhattacharyya distance를 이용하여 분류 에러를 예측하므로 고차원 데이터의 경우 고속의 특징 추출이 가능하며, 에러 예측 성질을 이용하여 패턴 분류 시 필요한 최소 특징 벡터의 수를 예측할 수 있는 장점이 있다.
New motivations are required for freshman introductory programming

The perception of software engineering practice prevailing in today's students changed a lot from the image we had of the profession when we began our studies. Freshmen perceive the profession they chose from their experience, where Web and games were the most outstanding examples. The first course in programming traditionally addresses examples drawn from math and physics, and when motivation is required, from what we consider is the real world of professional development. But this real world is not the image that freshmen have as to what they will be doing for a living. So these kind of examples have lost their motivating power. Programming seems to be no more a vocational training for students pursuing a software engineering degree. We introduced Web and game programming examples instead of classical programming exercises in our first programming courses. This approach proved to be more motivating to our students.
Interface Specifications for the SCR (A-7E) Extended Computer Module.

This document describes the programmer interface to a computing machine partially implemented in software. The Extended Computer is part of NRL's Software Cost Reduction (SCR) project, to demonstrate the feasibility of applying advanced software engineering techniques to complex real-time systems in order to simplify maintenance. The Extended Computer allows code portability among avionics computers by providing extensible addressing, uniform i/o and data access, representation-independent data types, uniform event signalling, a standard subprogram invocation mechanism, and parallel process capability. The purpose of the Extended Computer is to allow the remainder of the software to remain unchanged when the host computer is changed or replaced.
Time Series Prediction with Multilayer Perception, FIR and Elman Neural Networks

Multilayer perceptron network (MLP), FIR neural network and Elman neural network were compared in four different time series prediction tasks. Time series include load in an electric network series, fluctuations in a far-infrared laser series, numerically generated series and behaviour of sunspots series. FIR neural network was trained with temporal backpropagation learning algorithm. Results show that the efficiency of the learning algorithm is more important factor than the network model used. Elman network models load in an electric network series better than MLP network and in other prediction tasks it performs similar to MLP network. FIR network performs adequately but not as good as Elman network.
MINING SEMANTICS FROM MEDICAL STRUCTURED CORPUSES TO BUILD AND ENRICH DOMAIN ONTOLOGIES

Ontologies have become an important means for structuring knowledge, building knowledgeintensive systems and applying to open and dynamic environments wherever the knowledge they model, as well as the user needs which they have to answer evolve. Therefore, the ontologies must be regularly updated at the risk of becoming obsolete. The construction and maintenance of domain ontologies are costly and time-consuming tasks.With the advent of ontologies being used in many different fields of computer science, developing appropriate methods to automate ontology engineering become an increasingly important goal. Hence, we present an extraction, building and enrichment process to generate and enrich domain ontology using text-mining techniques. We exploit domain specific texts collected from medical reports in order to automatically extract terms. These terms are sets of concepts/relations which have either taxonomic or non-taxonomic relationships among them. For the building need, we have developed an extensive and detailed ontology in the field of gynaecology using this process. For the enrichment need, we arrange the extracted terms in sub-hierarchies, and detect the appropriate place to attach them to the ontology hierarchy
Variáveis Dummy: Especificações de Modelos com Parâmetros Variáveis

The present work search to study the regression on variablesdummies. More specifically, to revise the theory and the cases where theycan be used, in order to elaborate, in a succinct form, a simple and includingmaterial on the subject, capable to assist in research and works. After theformalization, will present the operational procedures to execute them,with aid of computational resources, using in such a way, the Statisticasoftware version 5.1.