Miracle-dz/UniFAR-FTUs huggingface dataset:
Using Logic Proofs to justify answers in Open-Domain Question-Answering system

Abstract: In an open-domain question answering (QA) system, we can have any type of questions (e.g. factoid, list, definition, etc) on any subject topic (starting from sports to medical, news, programming language, tea, weather, cooking, literally anything! ). To understand the complex questions and to find the accurate answers for these questions, we need deeper text understanding among question, answer and world knowledge to justify if the answer is suitable in the context of the given question. Even though some QA system can answer simple fact seeking questions, but when it turns into a complex question, which needs deeper understanding of texts, then these systems cannot answer very accurately [Voorhees 1999]. D Moldovan and his group at Language Computer Cooperation [LCC] tried to take the state-of-the art QA systems to one step ahead by introducing the Logic Proof system in QA. For the logic proof they convert the world knowledge, question and prospective answer into logic forms and then do the rigorous logic proofs to justify the answer. In this survey we start by describing what Question Answering system is. After that we describe how a question answering system works and also give some examples of different question answering systems. At that point it should be clear to the reader that a question answering system need deeper text understanding to generate the answers. Then we present the question answering system by LCC [Moldovan et al 2002a] and [Moldovan et al 2003], with focus on their logic proof system that is used to justify the answer. We describe the result on their performance issues and error analysis of the system [Moldovan et al 2002b], more specifically why it cannot give answers to some questions, i.e. the reason behind failing in some cases. Text REtrieval Conference [TREC], co-sponsored by National Institute of Standards and Technology (NIST) and U.S. Department of Defense, introduced the evaluation of open-domain question answering system. Most of the research and result in the open domain question answering are based on the evaluation system by TREC [TREC]. Every year they also give an overview of what type of question the QA systems have to answer that year and which team performed how well and a comparative study is also available in those overview papers. D. Moldovan and his group introduced logic proof in their question answering system in 2002/2003 [Moldovan et al 2002 and 2003]. To compare how their system works compare to the other systems, we present the evaluation of different QA systems at TREC 2003 [Voorhees 2003]. We also present their recent performance compare to other groups [Dang et al 2006]. Finally we give some comments on what extra benefits LCC’s QA system achieves for adding the logic proof module in their QA system and we also give comments on how this addition make the system suitable as a next generation question answering system!
Optimalisatie van complexiteit binnen individuen door co-evolutie

Evolutionaire algoritmes (EAs) worden al met succes ingezet voor een breed scala aan problemen. EAs leiden echter niet altijd tot de globaal optimale oplossing doordat ze kunnen stranden in lokale optima. Deze paper beoogt een bijdrage te leveren aan de verbetering van de werking van EAs. Hiertoe is onderzoek verricht naar het verband tussen lokale optima en de complexiteit binnen de in een EA aan evolutie onderhevige individuen. Dit onderzoek is gedaan met als basis het werk van Stuart Kauffman. Kauffman suggereert dat de gemiddelde hoogte van lokale optima in coevolutionaire ecosystemen hoger ligt wanneer de dynamiek van een ecosysteem op de edge of chaos balanceert, een staat tussen geordendheid en chaos. Verder suggereert hij dat co-evolutie zelf in staat is deze edge of chaos op te zoeken door de complexiteit binnen de individuen in het ecosysteem aan te passen. De genoemde complexiteit komt hierbij voort uit het aantal epistatische interacties tussen de genen van een individu. In deze paper is de suggestie dat co-evolutionaire ecosystemen de edge of chaos opzoeken getest met behulp van een nieuw model. In dit model blijkt dat individuen met een bepaalde initiele complexiteit inderdaad het best presteren. Er blijkt echter ook dat co-evolutie in dit model slechts in beperkte mate in staat is de complexiteit van een populatie te optimaliseren.
Reconfiguration planning for modular self-reconfigurable robots

Modular Self-reconfigurable (MSR) robotics is a new technology with the potential to significantly expand the domain of robot applications. The key characteristic of MSR robots is their ability to change configuration automatically, enabling them to adapt their shape to suit multiple, changing tasks. The ability to self-reconfigure translates into great versatility, making MSR systems true general-purpose robots. However, self-reconfiguration introduces a difficult planning problem as the number of modules (and degrees of freedom) in a robot increases. In addition, different hardware designs require strikingly different approaches to reconfiguration. To date, few solutions have been proposed, and no practical algorithms exist yet for some categories of MSR robots. This thesis presents a new planning architecture for a category of MSR robots known as Chain Reconfiguration MSR robots. These are characterized by the fact that, in order to reconfigure, modules move in groups or “chains”. This is in contrast to other MSR robots, where reconfiguration happens as a series of individual module motions. Chain Reconfiguration introduces several planning requirements: solving the kinematics (forward and inverse) of groups of inter-connected modules, maintaining overall stability and avoiding collisions as the module chains move. The Reconfiguration Planner in this thesis is specifically suited to Chain Reconfiguration MSR robots, being the first of its kind. The method proposed is based on the integration of two complementary components: a Connectivity Planner and a Motion Planner. The Connectivity Planner operates in a topological domain, generating an ordered sequence of module connectivity changes. This sequence is passed to the Motion Planner, which computes feasible motion trajectories, accounting for geometry and physics, for the modules involved in each connectivity step. Combining the two planners results in a complete Reconfiguration Planner. The effectiveness of the planning strategy was tested using graphical simulations of PolyBot, an MSR robot developed at the Xerox Palo Alto Research Center. The examples presented span a range of useful manipulation and locomotion configurations, and show various PolyBot robots completing reconfiguration while avoiding external obstacles and self-collisions, and maintaining stability. Performance issues and limitations are discussed, along with recommendations for future research.
Power Efficient Scheduling for Network Applications on Multicore Architecture

Explosive growth of Internet high-traffic applications, such as web browsing, online searching, video streaming, and gaming, requires orders-of-magnitude increase in system throughput. The advent of commodity multicore platforms in the market has opened a new era of computing for network applications due to their superiority in performance, availability and programmability. Along with increased throughput, however, comes significantly increased power consumption. Collectively, millions of servers in the global network consume a great deal of power. And chip manufactures continue to increase both the number of cores and their frequencies, substantially increasing power consumption. With higher power consumption, energy is expected to become more expensive. Higher power consumption also increases core temperature, which exponentially increases the cost of cooling and packaging, as well incurs indirect and life-cycle costs due to reduced system performance, circuit reliability and chip lifetime. Therefore, power efficiency has become and will continue to be a first-order design issue.In this thesis, we focus on power-efficient scheduling for network applications on multicore architectures. Our goal is to improve the performance of network applications in terms of throughput, latency, power, energy and temperature when deployed on multicore servers. More specifically, we first propose a latency and throughput-aware scheduling scheme based on parallel-pipeline topology. Then, we propose a throughput and latency optimization scheme under given power budget for the parallel-pipeline scheduling topology. We also present a power-optimal scheduling algorithm with regard to traffic variation via the use of per-core Dynamic Voltage and Frequency Scaling (DVFS), power gating and power migration. Further more, we explore temperature related issues by proposing a predictive model-based thermal-aware scheduling scheme. We design, implement, and evaluate our novel schemes on real systems (e.g., Intel Xeon E5335 and AMD Opteron 2350) with benchmark applications ranging from micro level (e.g., CRC checksum calculation and switching table look-up) to IP level (e.g., IP forwarding, routing, and flow classification) to application level (e.g., encryption/decryption and URL-based switching). Through extensive experiments, we observe that our schemes outperform existing approaches substantially.
Hierarchical Analysis of the Omega Ontology

Initial delivery for mathematical analysis of the Omega Ontology. We provide an analysis of the hierarchical structure of a version of the Omega Ontology currently in use within the US Government. After providing an initial statistical analysis of the distribution of all link types in the ontology, we then provide a detailed order theoretical analysis of each of the four main hierarchical links present. This order theoretical analysis includes the distribution of components and their properties, their parent/child and multiple inheritance structure, and the distribution of their vertical ranks.
Hacking Exposed Web Applications: Web Application Security Secrets & Solutions

From the Publisher: Get in-depth coverage of Web application platforms and their vulnerabilities, presented the same popular format as the international bestseller, Hacking Exposed. Covering hacking scenarios across different programming languages and depicting various types of attacks and countermeasures, this book offers you up-to-date and highly valuable insight into Web application security.
Designing and Coding Object-Oriented Systems: An Introductory Course Experience Report

An emphasis on design issues along with introductory programming courses is fundamental for students to envision “the big picture”. Teaching with the object-oriented paradigm from the start pays-off. An introductory course (CS/1 like), where this approach was adopted during three school years, is outlined. A detailed look on archetype problems solved at this course is presented.
The Supergirls: Fashion, Feminism, Fantasy, and the History of Comic Book Heroines

"The Supergirls is a long overdue tribute to the fabulous fighting females whose beauty and bravery brighten the pages of your favorite comics. "--STAN LEE "A thoughtful, comprehensive history of women in comics . The Supergirls gleefully celebrates the medium itself, in all its goofy, glorious excess. " --NPR "Best Five Books To Share With Your Friends" citation "Sharp and lively--and just obsessive enough about women who wear capes and boots to be cool but not creepy. [Madrid] clearly loves this stuff. And he's enough of a historian to be able to trace the ways in which the portrayal of sirens and supergirls has echoed society's ever-changing feelings about women and sex. " --Entertainment Weekly Has Wonder Woman hit the comic book glass ceiling? Is that the one opposition that even her Amazonian strength can't defeat? Entertaining and informative, The Supergirls explores iconic superheroines and what it means for the culture when they do everything the superhero does, only in thongs and high heels. This much-needed alternative history of American comic book icons--from Wonder Woman to Supergirl and beyond--delves into where these crime-fighting females fit in popular culture and why, and what their stories say about the role of women in society from their creation to now, and into the future. Mike Madrid is the author of Divas, Dames & Daredevils: Lost Heroines of Golden Age Comics (forthcoming from Exterminating Angel Press in October 2013) and The Supergirls: Fashion, Feminism, Fantasy, and the History of Comic Book Heroines, an NPR "Best Book To Share With Your Friends" and American Library Association Amelia Bloomer Project Notable Book. Madrid, a San Francisco native and lifelong fan of comic books and popular culture, also appears in the documentary Wonder Women! The Untold Story of American Superheroines.
Optimizing the Analysis of Electroencephalographic Data by Dynamic Graphs

The brain’s underlying functional connectivity has been recently studied using tools offered by graph theory and network theory. Although the primary research focus in this area has so far been mostly on static graphs, the complex and dynamic nature of the brain’s underlying mechanism has initiated the usage of dynamic graphs, providing groundwork for time sensitive and finer investigations. Studying the topological reconfiguration of these dynamic graphs is done by exploiting a pool of graph metrics, which describe the network’s characteristics at different scales. However, considering the vast amount of data generated by neuroimaging tools, heavy computation load and limited amount of time and resources, it is vital to refine this pool of metrics to avoid using non-informative and redundant ones. In this study, we use electroencephalographic (EEG) brain signals, taken from recordings in 5 different experimental conditions, to generate the dynamic graphs by moving a sliding window over the time series. Dynamic graphs are produced under various conditions that are a combination of different window sizes, different numbers of shared time points and various frequency bands. Based on each set of these dynamic graphs, time series of 25 graph metrics, and then their pairwise correlation values are computed. This is done to investigate the metric correlations under various circumstances, and to detect the ones that are always present. We conclude by suggesting a set of uniquely informative and orthogonal metrics that is convenient to use for further analysis of brain’s functional connectivity.
Querying XML,: XQuery, XPath, and SQL/XML in context (The Morgan Kaufmann Series in Data Management Systems) (The Morgan Kaufmann Series in Data Management Systems)

1. XML 2. Querying 3. Querying XML 4. MetadataAn Overview 5. Structural Metadata 6. The XML Information Set (Infoset) and Beyond 7. Managing XML: Transforming and Connecting 8. Storing: XML and Databases 9. XPath 1.0 and XPath 2.0 10. Introduction to XQuery 1.0 11. XQuery 1.0 Definition 12. XQueryX 13. Whats Missing? 14. XQuery APIs 15. SQL/XML 16. XML-Derived Markup Languages 17. Internationalization: Putting the W 18. Finding Stuff
Semi-automatic information extraction using ontologies

The vision of the Semantic Web is to structure the World Wide Web in such a way that it is not only understandable for humans, but also for computers. At the heart of the Semantic Web lay the ontologies, that describe the meaning of concepts in a certain domain. These are mostly created and maintained by domain experts. In this Bachelor Thesis we propose a rule based ontology learning process to help domain experts with this process. First we discuss the exiting approaches in ontology learning and pattern matching. Inspired by those approaches, we describe a syntax to describe information extraction rules in order to update the ontology. We show that employing ontologies in the rules, helps them to be created in a more generic manner. This way, different kinds of information may be extracted with the same rule.
Multiagent Flight Control and Virtual Navigation

Multiagent visual computing techniques are applied to design autonomous flig ht control and spacecraft navigation. The basic technique introduced in (Nourani1995) is that of viewing the world as many possible worlds with agents at each world that compliment one another in problem solving by cooperating. The double vision computing paradigm with objects and agents might be depicted by the following figure. The cooperative problem solving paradigms have been applied ever since the AI methods put forth by Hays-Roth. However, the muliagent multiboard techniques due to the author (Nourani1995). The techniques to be presented are to be applied to Mobile Multimedia. Communication and computation by multimedia visual-object languages can be programmed with IM with a simple syntax. The techniques to be presented are to be applied for (a) Precomputed video-object composition and combination for spatial morph Gentzen computing with visual objects (b) High speed visual spacecraft navigation with multiagent multimedia. The Morph Gentzen Computing Logic for computing for multimedia is new projects with important computing applications since (Genesereth & Nilsson 1987) The basic principles are a mathematical logic where a Gentzen (Gentzen et al.1943) or natural deduction systems are defined by taking arbitrary structures and multimedia objects coded by diagram functions. Multimedia objects are viewed as syntactic objects defined by functions, to which the deductive system is applied. The deduction rules are a Gentzen system augmented by Morphing, and Transmorphing on events {p1,p2,. ,pn} with a consequent hybrid picture p. Thus the combination is an impetus event. The deductive theory is a Gentzen system in which hybrid pictures are named by parameterized functions; augmented with the morph rules. A soundness and completeness theorem has been put forth in the author's papers on Morph Gentzen, which is applied to visual multiagent flight control and planning.
Measures to Improve the Globalization in Higher Education

The Faculty of Electrical and Electronic Engineering at Gerhard-Mercator-University Duisburg in Germany first offered a new international degree course in “Computer Science and Communications Engineering” during winter semester 1997/98. The course focuses on the new media and communication technologies that have evolved over the recent years due to the fusion of computer science and information technology. This degree course equally aims at Germans and foreign students and has been designed to serve two purposes. Firstly, to make it easier for foreign students to study at the Gerhard-Mercator-University Duisburg. Secondly, it is supposed to provide German students an opportunity to qualify for the global labour market. The course covers a minimum of 9 semesters, during which students are also required to complete 6 months of industrial training. Apart from the fundamentals of engineering, the basic study period also covers the essentials of Electrical Engineering, Information Science and Information Theory which are needed to study in this new field. The major study period concentrates on the subjects of Data Processing, Information Technology, Communication Networks and Technical Electronics. After successful completion of the course, students have the choice of graduating as a German Dipl. -Ing. or M.Sc. Foreign students, who have already attained the bachelor of science degree have the permission to enter the course at a higher level. The international flair of the degree course results from the addressed target group, the offer of German and English language lectures, studying in a multicultural surrounding and the obligation for German students to study abroad. Further steps are added to expand the globalization of this new degree course. A virtual information and consulting center, which prepares the students for their study, is set up. In order to develop and test new kinds of teaching and learning in multimedia environments an international university co-operation network is being established. [1]
JIVE: Visualizing Java in Action

Dynamic software visualization should provide a programmer with insights as to what the program is doing. Most current dynamic visualizations either use program traces to show information about prior runs, slow the program down substantially, show only minimal information, or force the programmer to indicate when to turn visualizations on or off. We have developed a dynamic Java visualizer that provides a view of a program in action with low enough overhead that it can be used almost all the time by programmers to understand what their program is doing while it is doing it.
L' INTENSIFICATION ECOLOGIQUE DE L'AGRICULTURE : VOIES ET DEFIS

Ecological intensification of agriculture: pathways and challenges. The objective of this paper is to contribute to analyzing the possible pathways to and challenges facing ecologically intensive agriculture (EIA), founded upon the sustainable use of natural processes. Firstly, the notion of ecological intensification by comparison/opposition with conventional forms of agricultural intensification is presented. The positions of the various actors, in relationship to the concept of EIA, are then examined. If this movement towards ecological intensification is apparently garnering a wide consensus, there are in fact different or even divergent points of view. Finally, we analyze the opportunities, barriers and challenges to the development of EIA. Indeed, difficulties may slow down this move towards farming more in harmony with nature and the environment.
Software Testing: A Craftsman''s Approach. Second Edition, CRC Press

A continuous molded plastic strip is produced using mold plates which have cavities therein for molding upstanding members or pile-like formations when moldable plastic material is applied under suitable pressure. Thereafter, plastic material is applied to the exposed ends of the pile-like formations while still in the cavities and a strip constituting a base member is formed having the pile-like protuberances integrally attached.