Miracle-dz/UniFAR-FTUs huggingface dataset:
CAPTURING CONCEPTS IN A SEMANTIC NET

Abstract : A working memory model based on a semantic network is described in detail. Some advantages and disadvantages of such a model are discussed. An attempt is made to enable a reader to learn to perform the formidable task of representing data in the memory format. Since the actual memory is not easily read (or written), a set of LISP programs are included which make these tasks manageable.
Information Retrieval: Uncertainty and Logics: Advanced Models for the Representation and Retrieval of Information

List of Figures. List of Tables. Preface. Part I: Genesis. 1. A Non-Classical Logic for Information Retrieval C.J. van Rijsbergen. Part II: Logical Models. 2. Toward a Broader Logical Model for Information Retrieval Jian-Yun Nie, F. Lepage. 3. Experiences in Information Retrieval Modelling Using Structured Formalisms and Modal Logic J.-P. Chevallet, Y. Chiaramella. 4. Preferential Models of Query by Navigation P. Bruza, B. van Linder. 5. A Flexible Framework for Multimedia Information Retrieval A. Muller. 6. The Flow of Information in Information Retrieval: Towards a General Framework for the Modelling of Information Retrieval M. Lalmas. 7. Mirlog: A Logic for Multimedia Information Retrieval C. Meghini, et al. Part III: Uncertainty Models. 8. Semantic Information Retrieval G. Amati, K. van Rijsbergen. 9. Information Retrieval with Probabilistic Datalog T. Rolleke, N. Fuhr. 10. Logical Imaging and Probabilistic Information Retrieval F. Crestani. 11. Simplicity and Information Retrieval G. Amati, K. van Rijsbergen. Part IV: Meta-Models. 12. Towards an Axiomatic Aboutness Theory for Information Retrieval T. Huibers, B. Wondergem.
Cooperative Security, the OSCE and Its Code of Conduct

Preface G. de Nooy. 1. Introducing the Code V. -Y. Ghebali. 2. Negotiating the Code: A Polish View A. Kobieracki. 3. Negotiating the Code: A German View P. von Butler. 4. Negotiating the Code: A British View C. Hain-Cole. 5. The Code and International Law P. Kooijmans. 6. The Code, Humanitarian Law, and Human Rights D. Raic. 7. The Code, Early Warning, and Conflict Prevention M. Lucas. 8. The Code and Civil-Military Relations: The Polish Case J. Simon. 9. The Code and Civil-Military Relations: The Russian Case S. Blank. 10. The Code and Civil-Military Relations: The German Case U. Hundt. 11. Implementing the Code: The Way Ahead H. Vetschera. 12. Summary of Main Conclusions G. de Nooy. Annex: Code of Conduct on Politico-Military Aspects of Security. About the Authors.
Pantone Guide to Communicating with Color

It sounds good when knowing the pantone guide to communicating with color in this website. This is one of the books that many people looking for. In the past, many people ask about this book as their favourite book to read and collect. And now, we present hat you need quickly. It seems to be so happy to offer you this famous book. It will not become a unity of the way for you to get amazing benefits at all. But, it will serve something that will let you get the best time and moment to spend for reading the book.
Quasi-Q-sorting innovation: the use of tangible Cues in sorting Methodology

Q-sort is a qualitative research method that is gaining popularity outside of its traditional psychology and social sciences areas. The Quasi-Q-sort is a derivative of the Q-sort that affords more latitude in the design and administration of the process. This paper reports how the Quasi-Q-sort method was applied in an innovative way to categorise according to tangible attributes in addition to the standard semantic sorting protocol. The Sensory Quasi-Q-Sort (SQQS) was used to obtain unprompted and spontaneous respondent categorisation of 40 hotel comment cards (HCC). Respondents identified attributes that could be clustered to form a description-based classification not restricted to semantic context. This study showed divergence in categorisation indicating varying first impressions of HCCs by guests. Emergent themes identified were Question Format, Graphic Design/ Appearance, Dimension, Texture/Paper weight, Ready to mail format, Time taken to complete, Ease-of-use, Geographic/Locality, and Familiar/Expected/ Customary form/Appearance. SQQ-sorting is a valuable way of adding to the richness of qualitative research as it allows inclusion of dimensions previously ignored. As part of a mixed method approach, this is a simple cost effective, efficient and effective method to obtain valuable perspective on how objects are perceived by all the human senses. Such data can influence design and marketing concepts.
Perspectives of causal attributions : A study of couples and depression

Dysphoric and non-dysphoric members of heterosexual dyads made attributions about hypothetical positive and negative events that happened (1) to themselves or (2) their partners. Participants also (3) indicated what attributions they expected their partner to be making about their own (i.e., participants') outcomes. Results showed that dysphorics made more depressogenic attributions for own outcomes (i.e., internal, stable, and global ones for failure and external, variable, and specific ones for success) as compared to non-dysphorics. Dysphorics also expected their partners to be making depressogenic attributions about their outcomes. However, dysphorics made more antidepressogenic causal ascriptions for their partners' outcomes as compared to non-dysphorics. Participants' attributions were not only influenced by own level of depression but also by the mood status of the partner. Individuals with a dysphoric partner made more antidepressogenic attributions than individuals with a non-dysphoric partner. It was found that non-dysphoric persons' expectations about how their partners would attribute their outcomes were more closely related to partners' actual attributions than dysphorics' expectations.
Recommendation Systems with Complex Constraints: A CourseRank Perspective

We study the problem of making recommendations when the objects to be recommended must also satisfy constraints or requirements. In particular, we focus on course recommendations: the courses taken by a student must satisfy requirements (e.g., take 2 out of a list of 5 math courses) in order for the student to graduate. Our work is done in the context of the CourseRank system at Stanford, used by students to plan their academic program at Stanford University. Our goal is to recommend to these students courses that not only help satisfy constraints, but that are also desirable (e.g., popular or taken by similar students). We develop increasingly expressive models for course requirements, and present a variety of schemes for both checking if the requirements are satisfied, and for making recommendations that take into account the requirements. We show that some types of requirements are inherently expensive to check, and we present heuristics for those cases. Although our work is specific to course requirements, it provides insights into recommendation systems in the presence of complex constraints found in other applications.
Towards Interest And Engagement, A Framework For Adaptive Storytelling

A storyteller builds a narrative that captivates the audience, immersing them in the story. Storytelling is an interactive process. Though the listeners cannot affect what happens in the story, a good narrator observes the audience's responses and adjusts his/her storytelling accordingly. We present an automated storytelling agent that is aimed at achieving the same effect. While presenting a story, the user is given chances to give comments or ask questions. The agent estimates the user's preferences towards various topics from these responses and weighs the factors of novelty, current interest, and consistency for generating the next part of the narration. We describe the components of the agent, and an example of applying it for narrating a Chinese fantasy story.
Strategies for Struggling Writers

Unlike purely process-orientated approaches, which hold that skills are acquired intuitively through writing and revising, strategic writing instruction sees the acquisition of key skills as integrally related to effective self-expression. Based on extensive research, the book describes how teachers and students can work together to develop writing strategies - thinking procedures for solving problems ranging from spelling a word correctly to planning a whole project. Illustrative case studies demonstrate how the co-construction and implementation of writing strategies can help students formulate and achieve their own personal writing goals.
A Methodology for Assessing Software Releasibility.

Abstract : A distinct challenge of Software engineering is the tradeoff between developing a high quality software product and delivering it on schedule. This thesis proposes a new methodology which addresses this tradeoff. The term "releasable" Software is introduced as a product which demonstrates a fault content acceptable to users in the field. The releasability assessment methodology capitalizes on basic testing metrics, software reliability modeling, statistical analysis techniques, and program specific criteria to present an objective estimation of the software release date. It is illustrate as an adaptive series of detailed procedures tailored to the unique needs and assumptions of the program. A division of Rome Laboratory recognized for medium-large scale software development provides the perspective for investigating finer points of the methodology. A notion of Configuration Reliability and the importance of system configuration management are presented. The impact configuration problems can have on software testing is discussed and a root cause analysis technique is recommended for achievement of optimal releasability.
Incremental Computation and Maintenance of Temporal Aggregates (Journal version)

We consider the problems of computing aggregation queries in temporal databases, and of maintaining materialized temporal aggregate views efficiently. The latter problem is particularly challenging since a single data update can cause aggregate results to change over the entire time line. We introduce a new index structure called the SB-tree, which incorporates features from both segment-trees and B-trees. SBtrees support fast lookup of aggregate results based on time, and can be maintained efficiently when the data changes.We extend the basic SB-tree index to handle cumulative (also called moving-window) aggregates, considering separately cases when the window size is or is not fixed in advance. For materialized aggregate views in a temporal database or warehouse, we propose building and maintaining SB-tree indices instead of the views themselves.
Network Throughput Improvement using Dijkstra’s and Floyd Warshall Algorithm

In now a day’s explosion of digital world results in faster, easily accessible, most efficient, reliable communication over the network communication to exchange the information. Considering this advantages, this paper introduced the network on which shortest path algorithm implemented to communicate number of nodes on network in shortest, efficient path with efficient throughput mechanism. In this paper Dijkstra and Floyd Warshall algorithms are implement to find shortest and efficient path. In the simulation, it estimates parameters the throughput, arrival and blocking rate with packet error rate and signal to noise ratio. The routing algorithms are compared on the basis of parameters and better results estimated in network simulator NS2 software.
Language and literacy in mathematics: stepping stones or stumbling blocks in accelerating junior-secondary students

The authors have collaborated in the development and initial evaluation of a curriculum for mathematics acceleration. This paper reports upon the difficulties encountered with documenting student understanding using pen-and-paper assessment tasks. This leads to a discussion of the impact of students’ language and literacy on mathematical performance and the consequences for motivation and engagement as a result of simplifying the language in the tests, and extending student work to algebraic representations. In turn, implications are drawn for revisions to assessment used within the project and the language and literacy focus included within student learning experiences.
Design and Implementation of Distributed Algorithms for Their Application in Telematic Services. Use case: Shared Calendar

[ANGLES] In distributed systems arise several issues that are solved using distributed algorithms. The main purpose of this thesis is to develop a system for academic use that allows to implement distributed algorithms and test them. As a result, a set of tools has been developed, which allow to easily implement distributed algorithms and combine them to build distributed systems. Finally, it was decided to prove their utility by building a system that can be integrated into a final application, called Shared Calendar.
Malware Detection Focusing on Behaviors of Process and its Implementation

In recent years, malwares spread faster and become cleverer to evade anti-virus software. So, the capability of anti-virus software is limited to some extent. Recently, the methods based on malicious behaviors of malwares are proposed. However, there is a problem of false positives in these methods. In this paper, we propose a malware detection scheme based on evaluation of suspicious process behaviors on Windows operating system. We consider an event of creating files to operating system and temporary folders as a malicious behavior. And, we consider an event of executing the created file as a malicious behavior. Moreover, to decrease false positives, we consider an event of registering and deleting uninstallation information as a non-malicious behavior. The result of our experiment shows that our proposal detected about 60% of malwares and there were no false positives. Using our tool, we can verify whether a program is malware or not automatically, and reduce the time of analyzing the behavior of programs.
Channel routing: Efficient solutions using neural networks

Neural network architectures are effectively applied to solve the channel routing prob lem. Algorithms for both two-layer and multilayer channel-width minimization, and constrained via minimization are proposed and implemented. Experimental results show that the proposed channel-width minimization algorithms are much superior in all respects compared to existing algorithms. The optimal two-layer solutions to most of the benchmark problems, not previously obtained, are obtained for the first time, including an optimal solution to the famous Deutch's difficult problem. The optimal solution in four-layers for one of the be lchmark problems, not previously obtained, is obtained for the first time. Both convergence rate and the speed with which the simulations are executed are outstanding. A neural network solution to the constrained via minimization problem is also presented. In addition, a fast and simple linear-time algorithm is presented, possibly for the first time, for coloring of vertices of an interval graph, provided the line intervals are given.
Delay jitter control for real-time communication in a packet switching network

A study is made of the feasibility of bounding the delay jitter for real-time channels in a packet-switched store-and-forward wide-area network with general topology, extending the scheme proposed in previous papers. The authors prove the correctness of the solution, and study its effectiveness by means of simulations. The results show that the scheme is capable of providing a significant reduction in delay jitter, that there is no accumulation of jitter along the path of a channel, and that jitter control reduces the buffer space required in the network significantly. <<ETX>>
Using Online Dictionaries

Until now, there has been little research into the use of online dictionaries despite expanding markets: both academic and commercial lexicography increasingly focus on online products while sales figures for printed dictionaries decline. This created a demand for reliable empirical information on how online dictionaries are actually used and how they could be optimized. This volume makes a substantial contribution to closing this research gap.
Effective Bayesian inference for sparse factor analysis models

We study how to perform effective Bayesian inference in high-dimensional sparse Factor Analysis models with a zero-norm, sparsity-inducing prior on the model parameters. Such priors represent a methodological ideal, but Bayesian inference in such models is usually regarded as impractical. We test this view. After empirically characterising the properties of existing algorithmic approaches, we use techniques from statistical mechanics to derive a theory of optimal learning in the restricted setting of sparse PCA with a single factor. Finally, we describe a novel `Dense Message Passing' algorithm (DMP) which achieves near-optimal performance on synthetic data generated from this model.DMP exploits properties of high-dimensional problems to operate successfully on a densely connected graphical model. Similar algorithms have been developed in the statistical physics community and previously applied to inference problems in coding and sparse classification. We demonstrate that DMP out-performs both a newly proposed variational hybrid algorithm and two other recently published algorithms (SPCA and emPCA) on synthetic data while it explains at least the same amount of variance, for a given level of sparsity, in two gene expression datasets used in previous studies of sparse PCA.A significant potential advantage of DMP is that it provides an estimate of the marginal likelihood which can be used for hyperparameter optimisation. We show that, for the single factor case, this estimate exhibits good qualitative agreement both with theoretical predictions and with the hyperparameter posterior inferred by a collapsed Gibbs sampler. Preliminary work on an extension to inference of multiple factors indicates its potential for selecting an optimal model from amongst candidates which differ both in numbers of factors and their levels of sparsity.
Suffix competition in old english word formation

This article deals with noun formation in Old English and, to be more precise, the competition that arises in suffixation. Four questions are addressed: What are the instances of affix competition in the formation of Old English nouns? Can affix competition be explained exclusively on morphological grounds? Can affix competition be accounted for in terms of the semantics of the base of derivation exclusively? and What is the role of diachronic evolution? The conclusion is reached that morphological or semantic explanations in isolation do not suffice. Regarding diachronic evolution, this discussion leads to the conclusion that the winner of competition is the affix that has survived for a longer time throughout the evolution of the language.
Introduction to Statistical Investigations

1. Significance: How Strong is the Evidence? 2. Generalization: How Broadly do the Results Apply? 3. Estimation: How Large is the Effect 4. Causation: Can We Say What Caused the Effect? 5. Comparing Two proportions 6. Comparing Two Means 7. Paired Data: one Quantitative Variable 8. Comparing More Than Two Groups using proportions 9. Comparing More Than Two Means 10. Two Quantitative Variables Appendix
Sequential PLEX, and its Potential for Parallel Execution

Some computer systems have been designed under the assumptionthat activities in the system are executed non-preemptively.Exclusive access to any shared data in such a system is automaticallyguaranteed as long as the system is executed on a single-processor architecture.However, if the activities are executed on a multiprocessor,exclusive access to the data must be guaranteed when memory conflictsare possible. An analysis of the potential memory conflicts can beused to estimate the possibility for parallel execution.Central parts of the AXE telephone exchange system from Ericsson isprogrammed in the language PLEX. The current software is executedon a single-processor architecture, and assumes non-preemptive execution.In this paper, we investigate some existing PLEX code with respect tothe number of possible shared-memory conflicts that could arise if theexisting code, without modifications, would be executed on a parallelarchitecture. Our initial results are promising; only by examining thedata that actually can be shared, we manage to reduce the numberof conflicts from the assumed 100% to figures between 25-75% for theobserved programs. Simple optimizations decrease the numbers evenfurther.
Augmenting Social Media Items with Metadata using Related Web Content

The Web has shifted from a read-only medium where most users were solely consumers of information, to an interactive medium where collaborative technologies allow anyone to publish or edit content. In this environment, social media such as social network sites, blogs, wikis, and content-sharing websites have flourished and now masses of users are contributing to the pool of human knowledge that is the Web. This large-scale user participation means that the content-creation capacity of the Web has exploded and there is now wide coverage of news, niche interests and hyperlocal content, all available in real-time. In short, Web 2.0 services have successfully harnessed collective intelligence and a huge and diverse information source has emerged. The downside of social media as an information source is that often the individual items are very short, informal and lacking in metadata. Despite the wealth of information available in online communities, locating objects of interest can still be challenging. The search and navigation of social media could be greatly improved by augmenting the content of social media items with annotations to provide additional context or descriptors. This thesis investigates the potential of using related data from the Web to enrich social media items with metadata and thus make it easier to find or browse information in social media. We provide three methods by which social media items can be augmented with novel metadata, specifically tags, locations and categories. Our approaches make use of existing Web data retrieved from HTML documents, APIs and Linked Data. We describe how Semantic Web technologies can be used to represent social media posts and their metadata in a uniform way and thus allow enhanced search and browsing over online community data integrated from heterogeneous sources.
Dimensions of Partial Completion of Activities in Workflow Management

Process and workflow management have become well accepted methods for helping to increase efficiency in companies. However the experience has been that highly structured workflows need to be more flexible to meet the requirements of dynamic businesses today. Recently Lin and Orlowska [2005] have addressed this topic by introducing partially complete-able activities. In contrast to classic workflows the activities do not show an allor-nothing behaviour (they are fully completed or not) but can be completed on different levels. The decision as to whether or not the process can be continued is then the responsibility of the process owner. In our paper we extend this concept by the introduction of fuzzy and probably complete-able activities. Moreover we show that a process memory can further increase the flexibility of the workflow.
MLC++, A Machine Learning Library in C++.

We present MLC ++ , a library of C ++ classes and tools for supervised Machine Learning. While MLC ++ provides general learning algorithms that can be used by end users, the main objective is to provide researchers and experts with a wide variety of tools that can accelerate algorithm development, increase software reliability, provide comparison tools, and display information visually. More than just a collection of existing algorithms, MLC ++ is an attempt to extract commonalities of algorithms and decompose them for a uniied view that is simple, coherent, and extensi-ble. In this paper we discuss the problems MLC ++ aims to solve, the design of MLC ++ , and the current functionality.