Miracle-dz/UniFAR-FTUs huggingface dataset:
Modeling and Reasoning about Contextual Requirements: Goal-based Framework

Most of requirements engineering (RE) research ignores, or presumes a uniform nature of, the context in which the system operates. This assumption is no longer valid in emerging computing paradigms, such as Ambient, Pervasive and Ubiquitous Computing, where it is essential to monitor and adapt to an inherently varying context. There is a strong relationship between requirements and context. Context might be considered to determine the set of requirements relevant to a system, to derive the alternatives the system can adopt to reach these requirements, and to assess the quality of each alternative. A RE framework that explicitly captures and analyzes this relationship is still missing. Before influencing the behavior of software, context influences the behavior of users. It influences users' goals and their choices to reach these goals. Capturing this latest influence is essential for a software developed to meet users' requirements in different contexts. In this thesis, we propose a goal-oriented RE modeling and reasoning framework for systems operating in and reflecting varying contexts. To this end, we develop a conceptual modeling language, the \emph{contextual goal model}, that captures the relationship between context and requirements at the goal level and provides constructs to analyze context. We develop a set of reasoning mechanisms to analyze contextual goal models addressing various problems: the consistency of context, the derivation of requirements in different contexts, the detection of conflicts between requirements happening as a consequence of changes in the context they lead to, and the derivation of a set of requirements that leads to a system developed with minimum costs and operable in all of the analyzed contexts. We develop a formal framework, CASE tool, and methodological process to assist analysts in using our modeling and reasoning RE framework. We evaluate our proposed RE framework by applying it on two systems: smart home for patient with dementia and museum-guide mobile information system. Our contribution to RE research is a RE framework specialized for emerging computing paradigms that weave together software and context. It allows us to overcome the limitation of existing RE frameworks that ignore, or presume a uniform nature of, the context in which the system operates.
Face and Lip Localization in Unconstrained Imagery

When combined with acoustical speech information, visual speech information (lip movement) significantly improves Automatic Speech Recognition (ASR) in acoustically noisy environments. Previous research has demonstrated that visual modality is a viable tool for identifying speech. However, the visual information has yet to become utilized in mainstream ASR systems due to the difficulty in accurately tracking lips in real-world conditions. This paper presents our current progress in addressing this issue. We derive several algorithms based on a modified HSI color space to successfully locate the face, eyes, and lips. These algorithms are then tested over imagery collected in visually challenging environments.
An illustrated review of how motion is represented in static instructional graphics

This review shows how the depiction of motion in media that is intrinsically motionless (such as paper) is always a creative challenge for designers of instructional material. This is a contribution to existing visual literacy research that more often focuses on motion depiction for aesthetic (e.g. photography and painting), entertainment (e.g. comics and picture books), scientific (e.g. physics) and generic purposes. In contrast, the emphasis here is to illustrate how motion is being represented in instructional graphics that demonstrate how to do a given task in the most unambiguous way. The review uses some examples developed by the author (experimental material of PhD research, in progress) and extracted from his collection of illustrated manuals, which concentrate on motion caused by human physical intervention. In other words, people acting as the agent of the action in various highly dynamic activities: DIY, magic, calligraphy, drawing, golf, dancing, conducting, airplane piloting, juggling and skiing. The review also discusses how the designer’s choice and arrangements of “frozen” moments of the dynamic action are relevant for instructional purposes. The visual depictions for motion are divided into four categories: composite; synoptic; images of before, during and after action; and single significant moment. Ancillary graphic devices and techniques used to evoke the idea of motion (arrows, motion lines and overlapping multiples) are discussed. Where it is possible, existing evidence on the effectiveness of certain types of visual representation is mentioned. This review can be used as a starting point to inform designers of the application of established or innovative forms of motion depiction in a training and educational context.
Sistema para anotação de ações de jogadores de futebol

[1] Barros, R.M. L. , Bergo, F.G. , Anido, R. , Cunha, S.A. , Lima Filho, E.C. , Brenzikofer, R. e Freire, J.B. Sistema para anotação de ações de jogadores de futebol, Rev. Bras. Ciên. e Mov. 10 (2): 07-14, 2002. O presente trabalho propõe um sistema para anotação e análise de ações no futebol, como forma de ampliar as possibilidades de síntese e interpretação da grande quantidade de informações disponíveis, nas competições esportivas. Os objetivos da pesquisa foram: a) desenvolver um software que permitisse a coleta, visualização e tratamento dos dados do jogo em um ambiente integrado, b) exemplificar a forma de descrição e análise proposta, aplicando-a em jogos da copa do mundo de futebol, realizada na França, em 1998. A coleta de dados é feita em uma interface gráfica do software desenvolvido que contém uma representação do campo de jogo. O operador observa a partida, ao vivo ou gravada em um monitor, colocado ao lado do computador e registra os eventos na tela. O sistema caracteriza-se pela possibilidade de anotação e análise das freqüências, evolução temporal e a localização no campo das ações dos atletas, individual ou coletivamente, numérica e graficamente. A metodologia proposta foi intensivamente testada na análise dos jogos da copa do mundo da França, e os resultados obtidos foram disponibilizados para consulta, através da Internet no endereço: http:// www.unicamp. br/unicampnacopa.
Clipping-Based Iterative PAPR-Reduction Techniques for FBMC

—Orthogonal Frequency Division Multiplexing (OFDM) is the most favored modulation technique in multicarrier wireless communications. Recently, the Filter Bank Multicarrier (FBMC) modulation scheme has drawn attention due its low Adjacent Channel Leakage Ratio (ACLR), which makes it especially suitable for Cognitive Radio (CR) applications. In multicarrier schemes the large dynamic range of the signal is a common problem, both FBMC and OFDM signals have high Peak-to-Average Power Ratio (PAPR). If nonlinear distortions are present, this large PAPR can lead to spectral regrowth causing harmful interference in the neighboring frequency bands. In this paper clipping-based PAPR-reduction schemes aided to reduce the PAPR of FBMC signal are presented. A comparison is given for both transmitter and receiver oriented methods.
VHDL modeling and synthesis of the JPEG-XR inverse transform

VHDL Modeling and Synthesis of the JPEG-XR Inverse Transform Peter Frandina Supervising Professor: Dr. Kenneth W. Hsu The Joint Photographic Experts Group (JPEG) recently approved Microsoft’s HD Photo format to become the newest JPEG standard under the name JPEG-XR, an indication of the format’s extended range capabilities. Although the HD Photo format offers many of the same improvements as JPEG 2000, the group’s first standardized improvement on the original JPEG format, HD Photo requires much less computational complexity and can be compressed or decompressed considerably faster. This thesis explores a VHDL model of the inverse lapped biorthogonal transform used in the soon to be released JPEG-XR decompression algorithm, targeting an Altera FPGA. Testing is performed using VHDL testbenches for simulation, and C-language software models. The final implementation is analyzed according to size, speed, and power consumption. It is presented that this implementation of the inverse transform uses 12,796 Combinational ALUTs, 17,908 total registers, and 141,258 total block memory bits on a Stratix II FPGA. It is capable of completing image transforms at a linear rate proportional to the number of pixels in the image with a latency of 99 clock cycles. This represents nearly 2% of the memory bits used on a similarly constrained JPEG-XR forward transform implementation and includes 12 less registers in the pipeline.
Análisis de la curva de Phillips Neokeynesiana, la I-S dinámica y la Regla de Taylor en un contexto de cambio estructural.

Este documento evalúa la estabilidad de la Curva de Phillips Neokeynesiana, la IS dinámica y una Regla de Taylor derivada por Gali y Monacelli (2005) para una economía pequeña y abierta. Para Perú 2003:M8 2012:M2, se aplicó la metodología de Bai y Perron (2003) para estimar las fechas de quiebre y evaluar la estabilidad de las relaciones entre la inación doméstica, el gap del producto y la tasa de interés de referencia (modelo estructural); y la técnica de Qu y Perron (2007) para estimar las fechas de cambio de régimen del equilibrio dinámico (modelo reducido). El cambio en el vector de parámetros de la regla de política (enero-2006 y mayo-2009), la Curva de Phillips (enero-2008) y la IS dinámica (octubre-2008) evidencia que la variación de la política monetaria induce un cambio rezagado en la ecuación de mercado debido a la fricciones existentes en la economía peruana. Asimismo, los quiebres en el modelo reducido (mayo-2008 y mayo-2010) muestran que las variables forward looking cambian en dos oportunidades posiblemente con el n de garantizar una senda convergente hacia un nuevo equilibrio. Los resultados tanto del modelo estructural como reducido evidencian que el canal de las expectativas aumenta desde el año 2008 y, consecuentemente, la política monetaria a través de la Curva de Phillips puede controlar más fácil la inación doméstica mediante una Regla de Taylor simple. Palabras Claves: Estabilidad, Quiebre Estructural, Curva de Phillips, IS Dinámica, Regla de Taylor.
Business process modeling languages for information system development

It is known that different process models are used during various phases of the Business Process Modeling (BPM) life cycle. Many efforts have been introduced to overcome the disintegration between these process models to provide a standard process model for design and execution. However this integration is still a problem that mazes the researches in this field till now. This paper discusses the problem of translation between process models, which known as the conceptual mismatch. Different perspectives are described considering the case of Business Process Modeling Notation (BPMN) vs. Business Process Execution Language (BPEL).
An Ontology-based Knowledge Portal for Language Technology

In order to be efficient and effective, today's technology research needs high quality international services for the provision and exchange of results, tools and resources. We have designed and implemented a rather comprehensive knowledge portal for the field of language technology. The service LT World is online and delivers worldwide information on technology and new developments in the field. We call the service a virtual information center since the provided knowledge is distributed over many places. For better access, for the smooth import and export of data and metainformation, and for more efficient maintenance, we have employed ontologies for the structuring and encoding of the knowledge in LT World. To this end, we have designed a complex ontology for the field of language technology that covers results, resources, researchers, projects, organizations, themes, applications, technologies, communications etc. It includes wide-spread representation schemes for literature, languages, web-resources and linguistic data. It strives for compatibility with other information services and initiatives such as OLAC. In the realization we have employed state-of-the-art ontology editing tools, standards and methods. We also have started utilizing advanced language technology for the preparation of the data. In our presentation, we will present the approach, the ontology and the enabled services.
Automated Comprehension Assessment in a Reading Tutor

Can vocabulary and comprehension assessments be generated automatically for a given text? We describe the automated method used to generate, administer, and score multiple-choice vocabulary and comprehension questions in the 2001-2002 version of Project LISTEN’s Reading Tutor. To validate the method against the Woodcock Reading Mastery Test, we analyzed 69,326 multiple-choice cloze items generated in the course of regular Reading Tutor use by 364 students in grades 1-9 at seven schools. Correlation between predicted and actual scores reached R=. 85 for Word and Passage Comprehension.
Integration of symbolic and connectionist AI techniques in the development of Decision Support Systems applied to biochemical processes

There exist complex systems, such as bio-chemical plants, which require a constant management to be kept in optimal operating conditions. To this end, automation is the only feasible option: the tasks involved, ranging from fault detection to diagnosis to control, can hardly be performed by traditional model-based controllers alone, but instead require the additional application of artificial intelligence-based techniques. AI is a vast field, covering many technologies which can be roughly classified in “Hard” or “Soft” techniques: the former typically use a symbolic representation of the data and elaborate it by logic reasoning; the latter, instead, process information at a sub-symbolic level, exploiting the interactions of many simple elaboration units hence they are also known as connectionist techniques. Since different techniques are more suitable for different problems, a complex management infrastructure is likely to include more than one module. These modules should be able to interact in order to exploit the mutual potentialities when processing the information coming from the managed system. Moreover, this information is likely to be imperfect vague and/or uncertain and/or incomplete so the modules should be able to deal with it appropriately. In this dissertation, we claim not only that taking imperfection into account is a necessary feature of an “intelligent” module interfaced to a real-world system, but also that extending formal logical reasoning with imperfection allows to obtain a deeper integration of “Hard” and “Soft” computing techniques than simply using them together, in cascade or in parallel, obtaining strongly hybrid modules which can be simpler and yet more robust than their pure counterparts. Moreover, it will be shown that such hybrid modules can be deployed effectively within an infrastructure which combines the concepts of service, agent and event in a natural way.
Implementing uniform treatment of hardware and software faults with distributed queues

This thesis explores the use of replicated queues with distributed execution of recovery blocks (DRB) as an approach for uniform treatment of hardware and software faults. An approach to incorporating the capabilities of DRB’s into a load­ sharing multiprocessing scheme using replicated queues is discussed. A simulation aimed at testing the execution efficiency and fault tolerance of the scheme in a real­ time environment has been conducted using IBM’s OS/2 2 . 0’s operating system. The simulated completely connected network was developed and successfully tested on a single 386DX/33 PC. The results indicate the feasibility of achieving tolerance to hardware and software faults in a real-time computer system. The effective use of the schemes distributed execution of recovery blocks with replicated queues deserves serious consideration.
Rulebase Evolution in Active Object-Oriented Database Systems: Adapting the Past to Future Needs

Active database management systems (ADBMSs) support the specification of reactive behavior in the form of event-condition-action rules. The capability to modify the definition of reactive behavior is a crucial part of the ADBMS-functionality. Rulebase evolution is however a complex problem in systems that support composite events, particularly when event occurrences should be taken into account that have occurred prior to the modification. We describe which kinds of rulebase modifications are meaningful and should thus be supported by an ADBMS. We investigate syntactic and semantic aspects of rulebase evolution, and present an algorithm for rulebase evolution for the object-oriented ADBMS SAMOS.
Learning programming via worked-examples

Worked-examples play an important role in learning and problem solving and are crucial to cognitive skill acquisition. However students’ learning styles are a factor in how much they are willing to expend serious effort on understanding worked-examples, with active students tending to be more impatient of them than reflective students. In employing worked-examples to teach programming effectively to both active and reflective students, we propose a worked-example format that combines a completion strategy with a structure-emphasising strategy. In this paper, we present two types of web-based interface supporting both the strategies and briefly discuss their specific interface designs.
Electronic Circuit & System Simulation Methods (SRE)

This comprehensive volume reveals how, using basic principles of elementary circuit analysis along with familiar numerical methods, readers can build up sophisticated electronic simulation tools capable of analyzing large, complicated circuits. The book describes in clear language an especially broad range of uses to which circuit simulation principles may be put-from running general applications, to understand why SPICE works in some cases and not in others.
A generic model for managing software architecture evolution

Evolution becomes an important concern of software architectures, as well at architectural level as at application one. In addition, such evolution can be rather static (at specification time) than dynamic (at execution time). To face this important problem of software-architecture evolution, it is necessary to consider the evolution in a genetic and uniform way by : defining the same concepts to manage the evolution of any architectural elements at any level of abstraction and independently of the software architectures description or implementation language. Our work aims to reach these objectives through the proposed model, called SAEV(Software Architecture EVolution Model). SAEV offers evolution operations described by evolution strategies and evolution rules to manage the architectural elements evolution. These rules and strategies must respect all invariants defined on each architectural element to safeguard the architecture coherence across the evolution. SAEV proposes also an evolution mechanism, which describes the execution process of the evolution model.
A Tutorial Introduction to ADB

Debugging tools generally provide a wealth of information about the inner workings of programs. These tools have been available on UNIX† to allow users to examine ‘‘core’’ files that result from aborted programs. A new debugging program, ADB, provides enhanced capabilities to examine "core" and other program files in a variety of formats, run programs with embedded breakpoints and patch files. ADB is an indispensable but complex tool for debugging crashed systems and/or programs. This document provides an introduction to ADB with examples of its use. It explains the various formatting options, techniques for debugging C programs, examples of printing file system information and patching.
Statistical Machine Translation and Controlled Language Impact and Interactions

This thesis explores the possible interactions between controlled language and statistical machine translation. Building on some previous research done at Autodesk Development Sarl. , we conducted a separate short research to determine whether it would be possible to improve SMT output by editing the input texts according to CL rules (in particular, AcrocheckTM rules). Although these results are not conclusive due to the limited extent of the tests performed, this preliminary study has shown that the impact of CL on SMT systems (particularly, Moses) is slightly positive, rarely negative. The perspectives are very optimistic and research in this sense may bear fruits. Future lines of research are suggested.
Robust Fault Detection

This research used mixed structured singular value theory to develop new estimator (or observer) based approaches to fault detection for dynamic systems. The initial developments were based on minimizing the H-infinity, I-1 and H2 system norms. The resultant fault detection algorithms were each shown to be successful, but the fault detection algorithm based on the I-1 norm was best able to detect abrupt faults. This latter technique was further improved by using fuzzy logic for the fault evaluation. Based on an anomaly observed in this research and apparently ignored in the literature, current research focuses on the determination of a fault using a norm of the change in the residual (the difference between the output of the system and observer) and not simply a norm of the residual itself. This research may lead to a fundamental contribution to research in fault detection and isolation.
Efficient approaches to subset construction

This thesis addresses important issues in the conversion of nondeterministic nite automata into deterministic nite automata: the development of the conversion process, the behavior of the conversion process with respect to input automata, and the relationship of output automata to input automata. In developing a robust, e cient, and modular conversion program, it is necessary to analyze searching and sorting routines, abstract data types, and other issues in order to determine appropriate routines and structures for use with automata and their manipulation. Subset construction is a well-known procedure for converting a nondeterministic nite automaton into a deterministic nite automaton. A large part of this thesis explains the improvements made to an existing, ine cient, implementation of subset construction based on a pseudo-code speci cation. The testing phase of this project led to a study of the behavior of the conversion process with respect to di erent types of automata. Very few automata were available for testing, therefore, methods to generate test automata were examined. Some interesting behavior in the output automata, with respect to the input automata, prompted concurrent study in this area. A conjecture based on the density of automata enables us to estimate the cost of subset construction prior to actually performing the construction. In conclusion, recommended implementations of subset construction are suggested based upon information about the input automaton. v