Miracle-dz/UniFAR-FTUs huggingface dataset:
Generic Ontology Design Patterns at Work

Generic Ontology Design Patterns, GODPs, are defined in Generic DOL, an extension of DOL, the Distributed Ontology, Model and Specification Language, and implemented using Heterogeneous Tool Set. Parameters such as classes, properties, individuals, or whole ontologies may be instantiated with arguments in a host ontology. The potential of Generic DOL is illustrated with GODPs for an example from the literature, namely the Role design pattern. We also discuss how larger GODPs may be composed by instantiating smaller GODPs.
Well-separating common complements of a sequence of subspaces of the same codimension in a Hilbert space are generic

Given a family of subspaces we investigate existence, quantity and quality of common complements in Hilbert spaces and Banach spaces. In particular we are interested in complements for countable families of closed subspaces of finite codimension. Those families naturally appear in the context of exponential type splittings like the multiplicative ergodic theorem, which recently has been proved in various infinite-dimensional settings. In view of these splittings, we show that common complements with subexponential decay of quality are generic in Hilbert spaces. Moreover, we prove that the existence of one such complement in a Banach space already implies that they are generic.
The stochastic nonlinear Schrödinger equation in unbounded domains and manifolds

In this article, we construct a global martingale solution to a general nonlinear Schrodinger equation with linear multiplicative noise in the Stratonovich form. Our framework includes many examples of spatial domains like $\mathbb{R}^d$, non-compact Riemannian manifolds, and unbounded domains in $\mathbb{R}^d$ with different boundary conditions. The initial value belongs to the energy space $H^1$ and we treat subcritical focusing and defocusing power nonlinearities. The proof is based on an approximation technique which makes use of spectral theoretic methods and an abstract Littlewood-Paley-decomposition. In the limit procedure, we employ tightness of the approximated solutions and Jakubowski’s extension of the Skorohod Theorem to nonmetric spaces.
Zero-cycles with modulus and relative
K-theory

We construct a cycle class map from the higher Chow groups of 0-cycles to the relative $K$-theory of a modulus pair. We show that this induces a pro-isomorphism between the additive higher Chow groups of relative 0-cycles and relative $K$-theory of truncated polynomial rings over a regular semi-local ring, essentially of finite type over a characteristic zero field.
Problem on Mutant Pairs of Hyperbolic Polyhedra

We present a notion of mutation of hyperbolic polyhedra, analogous to mutation in knot theory, and then present a general question about commensurability of mutant pairs of polyhedra. We motivate that question with several concrete examples of mutant pairs for which commensurability is unknown. The polyhedra we consider are compact, so techniques involving cusps that are typically used to distinguishing mutant pairs of knots are not applicable. Indeed, new techniques may need to be developed to study commensurability of mutant pairs of polyhedra.
Two-Handed Multi-Fingers String-Based Haptic Interface Device

Alkali metal or alkaline earth metal terminated rubbery polymers are reacted with monofunctional hydrocarbyl organometal compounds in which the metal is selected from Groups 2b, 4a, and 5a and which contain either halogen, -OR, -SR, or -N(R)2. The resulting rubbery polymers have improved physical properties in gum or filled stocks.
The dark matter profiles in the Milky Way

We investigate the dark matter profile of the Milky Way using the observed rotation curve data out to 100 kpc. The baryonic matter of the Milky Way is divided into bulge, disc, and gas components, and each component is modelled using various possible mass profiles available in literature. The arbitrary combination of seven bulge profiles, four disc profiles, and two gas profiles results in 56 baryon models. These baryon models are combined with one of the four dark matter profiles: Burkert profile, core-modified profile, pseudo-isothermal profile, and NFW profile, to fit the observed rotation curve data. Results show that in general the NFW profile fits the data better than the Burkert profile, while the core-modified profile and the pseudo-isothermal profile are essentially ruled out. The best-fitting NFW model has the scale length r0 = 8.1 ± 0.7 kpc, and the corresponding local density of dark matter is ρdm(R = R⊙) = 0.51 ± 0.09 GeV cm−3.
Tomographic reconstruction of triaxial strain fields from Bragg-edge neutron imaging

This paper presents a proof-of-concept demonstration of triaxial strain tomography from Bragg-edge neutron imaging within a three-dimensional sample. Bragg-edge neutron transmission can provide high-resolution images of the average through thickness strain within a polycrystalline material. This poses an associated rich tomography problem which seeks to reconstruct the full triaxial strain field from these images. The presented demonstration is an important step towards solving this problem, and towards a technique capable of studying the residual strain and stress within engineering components. A Gaussian process based approach is used that ensures the reconstruction satisfies equilibrium and known boundary conditions. This approach is demonstrated experimentally on a non-trivial steel sample with use of the RADEN instrument at the Japan Proton Accelerator Research Complex. Validation of the reconstruction is provided by comparison with conventional strain scans from the KOWARI constant-wavelength strain diffractometer at the Australian Nuclear Science and Technology Organisation and simulations via finite element analysis.
Instabilities and dripping of electrified liquid films on inverted substrates

We consider the gravity-driven flow of a perfect dielectric, viscous, thin liquid film, wetting a flat substrate inclined at some non-zero angle to the horizontal. The dynamics of the thin film is influenced by an electric field which is set up parallel to the substrate surface. The term corresponding to the electric field is nonlocal, and provides a stabilising effect on the dynamics. Our primary interest is in the use of the reduced-order models to predict the regions of parameter space for which an electrified film hanging from an inverted substrate drips. Precisely, for given fluid and geometrical parameters, we seek a critical electric field strength beyond which no dripping occurs. Unlike the problem of an electrified film hanging from a horizontal substrate, a temporal instability analysis does not provide insight into this problem; the linear stabilisation of the flat state is dependent on the system length, whereas the critical electric field strength required to prevent dripping is length-independent (for sufficiently long domains), with non-trivial wave-train solutions emerging. We investigate the transition from convective to absolute instability for hanging flows which was shown to have reasonable predictability of the dripping limit for the non-electrified case (for some parameters). The absolute instability threshold for the reduced-order models is found using the Briggs-Bers criterion, and validated with DNS taking small-amplitude pulse initial conditions. Increasing the electric field strength reduces the parameter space in which absolute instability is found. In some parameter regimes, absolute instability remains a good order-of-magnitude predictor for the onset of dripping of the electrified film. We find that a sufficiently large, yet physically acceptable, electric field strength may be used to suppress dripping in castor oil liquid films.
An Ontology-based Approach to Explaining Artificial Neural Networks

Explainability in Artificial Intelligence has been revived as a topic of active research by the need of conveying safety and trust to users in the `how' and `why' of automated decision-making. Whilst a plethora of approaches have been developed for post-hoc explainability, only a few focus on how to use domain knowledge, and how this influences the understandability of an explanation from the users' perspective. In this paper we show how ontologies help the understandability of interpretable machine learning models, such as decision trees. In particular, we build on Trepan, an algorithm that explains artificial neural networks by means of decision trees, and we extend it to include ontologies modeling domain knowledge in the process of generating explanations. We present the results of a user study that measures the understandability of decision trees in domains where explanations are critical, namely, in finance and medicine. Our study shows that decision trees taking into account domain knowledge during generation are more understandable than those generated without the use of ontologies.
Programming in VLSI: from communicating processes to delay-insensitive circuits

Abstract : see report With chip size reaching one million transistors. the complexity of VLSI algorithms -i.e., algorithms implemented as digital VLSI circuits is approaching that of software algorithms i.e., algorithms implemented as code for a stored-program computer. Yet design methods for VLSI algorithms lag far behind the potential of the technology. Since a digital circuit is the implementation of a concurrent algorithm. we propose a concurrent programming approach to digital VLSI design. The circuit to be designed is first implemented as a concurrent program that fulfills the logical specification of the circuit. The program is then compiled manually or automatically into a circuit by applying semantic-preserving program transformations. Hence, the circuit obtained is correct by construction. The main obstacle to such a method is finding an interface that provides a good separation of the physical and algorithmic concerns. Among the physical parameters of the implementation, timing is the most difficult to isolate from the logical design. because the timing properties of a circuit are essential not only to its real-time behavior but also to its logical correctness if the usual synchronous techniques are used to implement sequencing. For this reason. delay-insensitive techniques are particularly attractive for VLSI synthesis. A circuit is delay-insensitive when its correct operation is independent of any assumption on delays in operators and wires except that the delays be finite [17]. Such circuits do not use a clock signal or knowledge about delays. Let us clarify a matter of definitions right away: The class of entirely delay insensitive circuits is very limited. Different asynchronous techniques distinguish themselves in the choice of the compromises about delay-insensitivity. Speed-independent techniques assume that delays in gates are arbitrary, but that there are no delays in wires.
Survey on Mining Web Graphs for Recommendation, Query Suggestions, & Image Recommendations

As generation of various content on the web is exponentially increases so Recommendation techniques need to be indispensable. Each and every day The different kinds of recommendations are prepared on the Web which includes different images, various types of music, plenty of books recommendations, abundant number of query suggestions, etc. there is no further issue that which types of data sources are used for recommendation . various types of graphs can be modeled using these data sources. To provide related queries to users’ information need, commercial search engines are required to employed Query Suggestion plan. To mine latent semantically similar queries based on the users’ information need query plan is required. In this paper, shows how to change dissimilar Web data sources into accurate graphs, and analysis of several experimental results related to query suggestions, and image recommendations. The projected framework can be utilized in a lot of recommendation tasks on the World Wide Web, which counting query plans, different tag recommendations, expert decision, related image recommendations, lots of image annotations, etc. Investigational analysis on huge data sets shows the optimistic future of our work. Keywords— Recommendation, Query Suggestion, Image Recommendation.
Universics: Common Formalization Framework for Brain Informatics and Semantic Web

This chapter is an introduction to a conceptual framewok and a mathematical apparatus, said to be Universics, designed to serve for integration of other disciplines via their universes of discourse and, in particular, for the integration of Brain Informatics and Semantic Web, which are in the focus of this chapter. By universe I refer not only to what is said to be a „universe of discourse“, but also to any modeling framework where, for modeling, we use representation rather than discourse, so that such universe can be said to be a „universe of representation“. Universics is a fundamental theory which posits the notion of universe (or world) with a plural universes (or worlds) in the basis of a conceptual framework, and expresses other notions through this basis. An object said to be a universe must be rather complex and only a complex mathematical structure can serve as its formalization. I have previously outlined (Drugus, 2007) an approach to the content of mind said to be the A3 approach. This approach is introduced in this paper in full detail and used for the formalization of the concepts of Universics which, thus, becomes centered around the A3 approach. The A3 approach can also serve for the formal specification of an intelligent agent a virtual machine for processing ‚mind content’ which adds non-determinacy to the Turing machine to enhance its algorithmic capabilities with features of intelligence. I will outline the features of such a machine, which I say to be a conceptor, but a complete specification of conceptor would require a separate publication. I had to make reference to this intelligent agent here, because its involvement simplifies the account of Universics strongly centered around the data model of ‚mind content’ of such an intelligent agent. Since the ‚mind content’ of an intelligent agent is obtained in result of cognition of the Universe and is „in the image“ of the Universe, it is natural to say a piece of mind content to be a universe an „inner universe“, „subjective universe“, or „subject universe“, as opposed to the „objective universe“ or „object universe“. Moreover, due to the A3 approach, the ‚mind content’ has a strictly specified „format“, defined in the language of an enlarged set theory said to be A3 language. Therefore, by applying „conceptual inverse engineering“ (my term), I ascribe this „format“ to any universe. Having this manner obtained a uniform 4
Palm Print Identification using Centered Discretization Hashing Technique

Palmprint is the unique identity of any person or human being. As it is unique identity it helps to prevent the deceptive crimes. We will be implementing hashing based palmprint identification i.e. we using hashing technique to search for the palmprint templates in the database, as hashing is one of the fastest technique used for searching in database. The present two hashing based technique for fast palmprint identification are principal orientation pattern (POP) and Orientation pattern (OP). We introduce Centered Discretization, a simpler discretization method; It allows for smaller tolerance regions without impacting the usability of the system. We then introduce our fast identification method based on Centred Discretization. Discretization is used in clickbased graphical passwords but in our project we will be using this so that approximately correct control points (CP) can be accepted and stored generating a hash value from the palmprint template.
Virtual enterprise access control requirements

Current developments in IT point towards the formation of loosely coupled enterprises, often referred to as virtual enterprises. These enterprises require both secure and flexible collaboration between unrelated information systems. Web services technology can be used as an ideal platform for realising virtual enterprises throughh their ease of integration, flexibility, and support of XML vocabularies. To ensure the successful implementation of Web services within virtual enterprises, new approaches to security are required. Together with authentication, access control has been seen as a pillar of IT security approaches. The focus of this paper will be to determine requirements that could play a role when the access control policies of such enterprises are defined.
The role of the human in intelligent control practices

Operator's models are attracting the interest of industry as they relate to monitoring and control of complex engineered processes. Such processes are usually relying upon the expertise and ability of human operators for control purposes; they are often controlled sub-optimally owing to high personnel turnover, lack of fundamental understanding of plant dynamics, inaccuracy or unreliability of manual control actions, etc. Capturing and utilizing the expert's knowledge effectively and efficiently in an intelligent control framework promises to improve plant operational conditions particularly in the event of large-scale disturbances. Modeling the expert operator's experience is a perfect semiotic paradigm since the operator employs a variety of informational granules in order to establish an effect-cause relationship and take appropriate action in the event of an emergency. This paper focuses upon the role of the human in intelligent control, means to extract expert knowledge, represent it and employ it for control of complex systems. A neuro-fuzzy implementation strategy is suggested and the model is tested on a pH neutralization process.
Model based spectrum prediction

This paper presents methods for speech spectrum prediction based on Gaussian mixture models. Spectrum prediction may be useful in a packet transmission system where the sensitivity to packet losses is a major problem. Models of speech are trained by the expectation maximization algorithm using pairs, triples etc. of consecutive cepstral vectors. The models are used to design first, second etc. order predictors. The prediction schemes are evaluated using the spectral distortion criterion and compared to a simple reference method. The best prediction scheme obtains an average spectral distortion that is 0.46 dB less than for the reference method.
PRODUCING EXPLANATIONS AND JUSTIFICATIONS OF EXPERT CONSULTING PROGRAMS

Traditional methods for explaining programs provide explanations by converting to English the code of the program or traces of the execution of that code. While such methods can provide adequate explanations of what the program does or did, they typically cannot provide justifications of the code without resorting to canned-text explanations. That is, such systems cannot tell why what the system is doing is a reasonable thing to be doing. The problem is that the knowledge required to provide these justifications is needed only when the program is being written and does not appear in the code itself. In the XPLAIN system, an automatic programming approach is used to capture some of the knowledge necessary to provide these justifications. The XPLAIN system uses an automatic programmer to generate the consulting program by refinement from abstract goals. The automatic programmer uses a domain model, consisting of facts about the application domain, and a set of domain principles which drive the refinement process forward. By keeping around a trace of the execution of the automatic programmer it is possible to provide justifications of the code using techniques similar to the traditional methods outlined above. This paper discusses the system described above and outlines additional advantages this approach has for explanation.
Individuelle Förderung von Rechenfertigkeiten in der Grundschule durch ein computergestütztes Übungsprogramm

Zur individuellen Forderung von Rechenfertigkeiten in der Grundschule entwickelten wir das computergestutzte Ubungsprogramm, "Merlins Rechenmuhle", das auf eine Datenbank von uber 2300 Aufgaben verschiedener Typen und Schwierigkeiten zuruckgreift. Die Grose des Aufgabenpools und die Moglichkeiten des Computers zu unmittelbarer Ruckmeldung ermoglichen die Individualisierung von Ubung in einer Gruppensituation. Vorgestellt werden die Algorithmen zur Vorhersage der Aufgabenschwierigkeit und zur Aufgabenauswahl, sowie zwei empirische Studien, in denen die Wirksamkeit der Algorithmen empirisch nachgewiesen wurde. Die Erfahrungen aus diesen Studien sollen in die Entwicklung einer neuen Programm¬version fliesen, bei der die sehr zeitaufwandige individuelle Aufgabenauswahl automatisiert wird. We present our computer assisted training program "Merlin's Rechenmuhle", which was developed for individualized practice of arithmetic skills in elementary school. The software connects to a database with more than 2300 problems of different types and difficulties. The size of the database and the facility of computer software to give immediate feedback permit individualization of practice in a group situation. We present the algorithms for predicting problem difficulties and for problem selection. In two studies, we showed the effectiveness of these algorithms. Results and experience from these studies will be exploited in a new version of the software, which will automize the time-consuming task of individual problem selection.
An assessment of published evaluations of requirements management tools

Context: The traditional literature review is a low cost, relatively quick but potentially ineffective method for evaluating tools. Practitioners appear to place a greater emphasis on the practical constraints of an evaluation (e.g. that it is low cost and quick) and the efficacy of the technology to the company, rather than on generic scientific results. By contrast, academia appears to place greater emphasis on theory confirmation, rigour and validity, and their literature reviews focus on literature published in peer-reviewed journals and conferences, and tend not to consider the trade and 'grey' literature. Objectives: To assess the quality and quantity of published evaluations of requirements management tools (RMTs) reported in the academic, 'grey' and trade literatures. Method: Three independent literature reviews were conducted to identify published evaluations of RMTs. The three reviews were conducted by three different types of reviewers: a practitioner in a company, an experienced researcher, and 19 final-year undergraduate students. The researcher and the students followed a version of Evidence Based Software Engineering to undertake their literature reviews. The practitioner undertook an ad hoc literature review. Publications were then screened to select higherquality evaluations, which were then analysed to identify the RMTs evaluated. Results: The three literature reviews found a total of 28 evaluations referring to 14 RMTs, of which 6 evaluations were duplicates, giving 22 unique evaluations. Evaluations were identified between approximately the year 2000 and 2007, with an average of about 3 evaluations published per year. Conclusions/implications: Given the number of commercial RMTs on the market (>40), and the few evaluations published per year, there are surprisingly few higher-quality evaluations. There is a noticeable bias toward evaluating the market leading RMTs. Given the rate of change in the IT industry, there may be a need to re-evaluate RMTs every two years or less. Overall, there appears to be a poor 'base' of up-to-date published evaluations of RMTs available for use in literature reviews. Literature reviews would appear to be useful for short-listing RMTs for subsequent in-company evaluation, and for benchmarking, but care should be taken to include non-market leading RMTs in the shortlisting.