Miracle-dz/UniFAR-FTUs huggingface dataset:
Evaluation of Porosity in Al Alloy Die Castings

Mechanical properties of an Al-alloy die casting depend significantly on its structural properties. Porosity in Al-alloy castings is one of the most frequent causes of waste castings. Gas pores are responsible for impaired mechanical-technological properties of cast materials. On the basis of a complex evaluation of experiments conducted on AlSi9Cu3 alloy samples taken from the upper engine block which was diecast with and without local squeeze casting it can be said that castings manufactured without squeeze casting exhibit maximum porosity in the longitudinal section. The area without local squeeze casting exhibits a certain reduction in mechanical properties and porosity increased to as much as 5%. However, this still meets the norms set by SKODA AUTO a.s.
Observation of electron neutrino appearance in a muon neutrino beam.

The T2K experiment has observed electron neutrino appearance in a muon neutrino beam produced 295 km from the Super-Kamiokande detector with a peak energy of 0.6 GeV. A total of 28 electron neutrino events were detected with an energy distribution consistent with an appearance signal, corresponding to a significance of 7. 3σ when compared to 4.92±0.55 expected background events. In the Pontecorvo-Maki-Nakagawa-Sakata mixing model, the electron neutrino appearance signal depends on several parameters including three mixing angles θ12, θ23, θ13, a mass difference Δm(32)(2) and a CP violating phase δ(CP). In this neutrino oscillation scenario, assuming |Δm(32)(2)|=2.4×10(-3) eV(2), sin(2)θ(23)=0.5, and Δm322>0 (Δm(32)(2)<0), a best-fit value of sin(2)2θ(13)=0.140(-0.032)(+0.038) (0.170(-0.037)(+0.045)) is obtained at δ(CP)=0. When combining the result with the current best knowledge of oscillation parameters including the world average value of θ(13) from reactor experiments, some values of δ(CP) are disfavored at the 90% C.L.
Adaptive Multilinear SVD for Structured Tensors

The higher-order SVD (HOSVD) is a generalization of the SVD to higher-order tensors (ie. arrays with more than two indexes) and plays an important role in various domains. Unfortunately, the computational cost of this decomposition is very high since the basic HOSVD algorithm involves the computation of the SVD of three highly redundant block-Hankel matrices, called modes. In this paper, we present an ultra-fast way of computing the HOSVD of a third-order structured tensor. The key result of this work lies in the fact it is possible to reduce the basic HOSVD algorithm to the computation of the SVD of three non-redundant Hankel matrices whose columns are multiplied by a given weighting function. Next, we exploit an FFT-based implementation of the orthogonal iteration algorithm in an adaptive way. Even though for a square (1 times 1 times 1) tensor the complexity of the basic full-HOSVD is O(I4) and O(rI3) for its r-truncated version, our approach reaches a linear complexity of O(rIlog2(I))
Improving Word Sense Disambiguation with Linguistic Knowledge from a Sense Annotated Treebank

In this paper we present an approach for the enrichment of WSD knowledge bases with data-driven relations from a gold standard corpus (annotated with word senses, valency information, syntactic analyses, etc.). We focus on Bulgarian as a use case, but our approach is scalable to other languages as well. For the purpose of exploring such methods, the Personalized Page Rank algorithm was used. The reported results show that the addition of new knowledge improves the accuracy of WSD with approximately 10.5%.
Springback Behavior of Advanced High Strength Steel (AHSS) CP800

800MPa grade Advanced High Strength Steels (AHSS), Complex Phase steel CP800, containing microalloying elements, are chosen to test the stamping properties in different test conditions and compared with traditional high strength low alloy (HSLA) steels HSLA S700MC. Tensile test, and HAT shape stamping test are taken to investigate the properties of the materials. Test results indicate that the studied 800MPa grade AHSS shows a better strength ductility balance compared with the reference HSLA steels. Under the same HAT shape springback stamping condition, HSLA steels S700MC always show the largest springback deformation among the investigated steels. While springback angles of all the AHSS studied are markedly smaller than that of steel S700MC. Among the 3 kinds of AHSS researched, CP800T always show the largest springback deformation. Domestic steel CP800 and imported CP800S show much smaller springback deformation respectively. In BHF of 100KN condition, springback deformation of 3 kinds of AHSS reaches the top value among all the BHF conditions. However, steel CP800 indicates an outstanding springback restrain trend in blank holding force (BHF) further increasing attempt. Thus, springback behavior can be restricted obviously by using a larger blank holding force (BHF) in steel CP800 stamping cases.
Performing Bayesian Inference by Weighted Model Counting

Over the past decade general satisfiability testing algorithms have proven to be surprisingly effective at solving a wide variety of constraint satisfaction problem, such as planning and scheduling (Kautz and Selman 2003). Solving such NP-complete tasks by "compilation to SAT" has turned out to be an approach that is of both practical and theoretical interest. Recently, (Sang et al. 2004) have shown that state of the art SAT algorithms can be efficiently extended to the harder task of counting the number of models (satisfying assignments) of a formula, by employing a technique called component caching. This paper begins to investigate the question of whether "compilation to model-counting" could be a practical technique for solving real-world #P-complete problems, in particular Bayesian inference. We describe an efficient translation from Bayesian networks to weighted model counting, extend the best model-counting algorithms to weighted model counting, develop an efficient method for computing all marginals in a single counting pass, and evaluate the approach on computationally challenging reasoning problems.
Loading data into description reasoners

Knowledge-base management systems (KBMS) based on description logics are being used in a variety of situations where access is needed to large amounts of data stored in existing relational databases. We present the architecture and algorithms of a system that converts most of the inferences made by the KBMS into a collection of SQL queries, thereby relying on the optimization facilities of existing DBMS to gain efficiency, while maintaining an object-centered view of the world with a substantive semantics and significantly different reasoning facilities than those provided by Relational DBMS and their deductive extensions. We address a number of optimization issues that arise in the translation process due to the fact that SQL queries with different syntax (but identical semantics) are not treated uniformly by current database management systems.
Effect of micro MoS 2 powder mixed dielectric fluid on surface quality and material removal rate in micro-EDM processes

Efficiency is currently becomes the main problem in μ-EDM processes. To have high efficiency in μ-EDM processes means that the workpiece machined is not only having good surface quality but also need to have high material removal rate during the machining process. In order to increase the efficiency in μ-EDM processes, micro MoS2 powder mixed dielectric fluid is proposed as one of the solution. This study investigated the effect of micro MoS2 powder mixed dielectric fluid with focusing on obtaining good surface quality and higher material removal rate. It was observed that by suspending micro MoS2 powder can produce better surface quality by removing black spot in the center of surface machined. The better in surface quality also followed by increasing in material removal rate up to 70 % in certain of combination of tool electrode and workpiece material. Keywords= micro-EDM, Powder suspended dielectric, surface quality, material removal rate.
Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins

The query processing in a mobile computing environment involves join processing among different sites which include static servers and mobile computers. Because of the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore some unique features of a mobile environment and then, in light of these features, devise query processing methods for both join and query processing. Remote mobile joins are said to be effectual if they are, when being interleaved into a join sequence, able to reduce the amount of data transmission cost required for distributed mobile query processing. Since mobile relations are employed as reducers in our proposed query processing cost model, more mobile joins in the query processing lead to less data transmitted through the network. With proper scheduling, interleaving effectual remote mobile joins into a query scheduling can significantly reduce the total amount of data transmission among different sites. A simulator is developed to evaluate the performance of algorithms devised. Our results show that the approach of interleaving the processing of distributed mobile queries with effectual remote mobile joins is not only efficient, but also effective in reducing the total amount of data transmission cost required to process distributed mobile queries.
A Brief Survey of the Literature on Silica Refractory Research and Development: The Case for Nanostructured Silica Obtained from Rice Husk Ash (RHA)

Silica refractory research and development has taken a down-turn; perhaps due to the problems associated with it, or because of concerns regarding earth conservation, earth being a major source of the raw material - quartz - which is used for silica refractory manufacture. In this review, the authors have pin-pointed the problems associated with silica refractory use from the researches of the early era (1913 to 1990) and have assessed the themes of current research, in order to ascertain how well these current researches have attended to the problems raised in the early research era. The review shows that the gaps identified in the early research era still remain unattended to. It concludes by making a case for nanostructured silica obtained from rice husk ash (RHA), for the production of silica refractory, as a way of solving these problems and making silica refractory production a booming industry once again.
Minimum variance in biased estimation: bounds and asymptotically optimal estimators

We develop a uniform Cramer-Rao lower bound (UCRLB) on the total variance of any estimator of an unknown vector of parameters, with bias gradient matrix whose norm is bounded by a constant. We consider both the Frobenius norm and the spectral norm of the bias gradient matrix, leading to two corresponding lower bounds. We then develop optimal estimators that achieve these lower bounds. In the case in which the measurements are related to the unknown parameters through a linear Gaussian model, Tikhonov regularization is shown to achieve the UCRLB when the Frobenius norm is considered, and the shrunken estimator is shown to achieve the UCRLB when the spectral norm is considered. For more general models, the penalized maximum likelihood (PML) estimator with a suitable penalizing function is shown to asymptotically achieve the UCRLB. To establish the asymptotic optimality of the PML estimator, we first develop the asymptotic mean and variance of the PML estimator for any choice of penalizing function satisfying certain regularity constraints and then derive a general condition on the penalizing function under which the resulting PML estimator asymptotically achieves the UCRLB. This then implies that from all linear and nonlinear estimators with bias gradient whose norm is bounded by a constant, the proposed PML estimator asymptotically results in the smallest possible variance.
Evaluation of an instrument to measure teamwork in multidisciplinary critical care teams

Introduction Teamwork failures contribute to adverse events causing harm to patients. Establishing and maintaining a team and managing the tasks are active processes. Medical education largely ignores teamwork skills. However, lack of robust instruments to measure teamwork limits evaluation of interventions to improve it. The authors aimed to develop and validate an instrument to measure teamwork behaviours. Methods From existing literature, the authors developed an instrument, gaining rater consensus that the final 23 items were comprehensive, comprehensible and observable. Data on the instrument were obtained from three expert raters who scored videotaped simulations of 40 critical care teams (one doctor, three nurses) participating in four simulated emergencies. Exploratory Factor Analysis, Generalisability Analysis and rater interviews on assessor performance provided information on the properties of the instrument. Results Exploratory Factor Analysis found items clustered into three factors: Leadership and Team Coordination; Mutual Performance Monitoring; and Verbalising Situational Information. Internal consistencies (Cronbach's α) for these factors were 0.917, 0.915 and 0.893, respectively. The Generalisability coefficient for overall team behaviour was 0.78 and the G coefficients for the three factors were 0.85, 0.4 and 0.37, respectively. Variance Components and interview data provided insight into individual item performance. Significantly improved performance with time and seniority supported construct validity. Discussion The instrument performed well as an overall measure of team behaviour and reflected three dimensions of teamwork. Triangulation of information on the instrument, the factors and individual items will allow a methodical and informed approach to further development of the instrument. The ultimate goal is an instrument that can robustly evaluate interventions to improve team function in healthcare.
Robust positioning in safety applications for the CVIS project

This paper describes hybrid fusion module used in a strong localization context (POMA) for embedded vehicle applications. This work has been developed in order to give an answer to the POMA (Positioning, Maps and local referencing) sub project objectives. These objectives are to provide, for a set of high level applications, a positioning service included a service quality, a metric accuracy (lane) and a robust result. This work is involved in CVIS European project. The use of IMM approach in the Hybrid Fusion module will be justified in comparison to the different current probabilistic methods. The IMM, contrary to the non modular methods, is based on the discretization of the vehicle evolution space into simple maneuvers, represented each by a simple dynamic model such as constant velocity or constant turning etc. This allows the method to be optimized for highly dynamic vehicles. The application of this positioning service will be presented in a real time embedded architecture. The presented results are based on real measurements collected from representatives scenarios (test track, peri-urban road, highway). These results show a real interest in using the new IMM method in order to reach the POMA's objectives.
Applying fuzzy balanced scorecard for evaluating the CRM performance

Purpose – This paper aims to provide a framework for evaluating the impact of implementing customer relationship management (CRM) based on the balanced scorecard (BSC). The outcomes illustrate the gaps between the present conditions of CRM implementation in a specific organization, which leads to some strategic remedies. These remedies are going to be ranked to achieve the best solution for enhancing the quality of CRM in the organization.Design/methodology/approach – This study investigates the weights of measures presented in the CRM‐BSC by distributing the questionnaires among 44 experts in the beverage industry of Iran. It also benefits from judgment‐purposive in non‐probability sampling method for collecting data. The results are analyzed through a fuzzy approach. The strategic remedies for the drawbacks of the organization that were obtained from the CRM‐BSC are also proposed by the experts. These remedies are again evaluated by questionnaires and some selective tools of multi‐criteria decision‐maki.
FSLRU: a page cache algorithm for mobile devices with hybrid memory architecture

Even though page cache layer of operating system enhances the performance of mobile devices by reducing the number of write requests issued to the underlying mobile storage, the mobile devices still suffer from the excessive write requests. This is because mobile applications frequently trigger synchronous writes with fsync() system call to guarantee the reliability of each application. Unfortunately, these synchronous writes significantly draw both performance and battery power of mobile devices. This paper proposes a novel page cache algorithm, called fsync-aware LRU (FSLRU), that adopts hybrid memory architecture, which is composed of DRAM and emerging nonvolatile memory (NVM). In particular, the proposed algorithm is designed to overcome the negative performance effect of NVM writes, which is measured on a real board. In order to improve performance and energy efficiency of mobile devices, FSLRU integrates the durability function into page cache layer and provides atomic update operations that are necessary to support strong durability. For detailed performance analyses, the proposed algorithm is implemented on a trace-driven simulator and is evaluated on a real board by replaying the results of the simulator. The evaluation results clearly present that FSLRU outperforms the conventional LRU algorithm by up to 3.2 times under three real world workloads while reducing power consumption by up to 99%1.
Pedestrian recognition in urban traffic using a vehicle based multilayer laserscanner

Vehicle-mounted laser scanners are able to observe the vehicles environment in order to detect, track and classify the surrounding objects and thus providing data for active safety systems. The latest development of IBEO combines several innovations. The receiver diodes are arranged in an array, which enables simultaneous measurements in 4 horizontal planes, e.g. to compensate pitching of the vehicle. In addition a multi target capability is integrated. This technique enables the detection of two distances with a single measurement, thus enhancing the robustness against rain. This paper introduces improved high speed object detection and high performance object tracking algorithms for real-time data processing. Additionally a classification of the road users is possible. A system architecture for detection and modelling of dynamic traffic scenes is introduced in order to provide a general idea of the different tasks necessary to reach the aim of a complete environmental model using a sensor for a wide range of applications.
Balanced graph edge partition

Balanced edge partition has emerged as a new approach to partition an input graph data for the purpose of scaling out parallel computations, which is of interest for several modern data analytics computation platforms, including platforms for iterative computations, machine learning problems, and graph databases. This new approach stands in a stark contrast to the traditional approach of balanced vertex partition, where for given number of partitions, the problem is to minimize the number of edges cut subject to balancing the vertex cardinality of partitions. In this paper, we first characterize the expected costs of vertex and edge partitions with and without aggregation of messages, for the commonly deployed policy of placing a vertex or an edge uniformly at random to one of the partitions. We then obtain the first approximation algorithms for the balanced edge-partition problem which for the case of no aggregation matches the best known approximation ratio for the balanced vertex-partition problem, and show that this remains to hold for the case with aggregation up to factor that is equal to the maximum in-degree of a vertex. We report results of an extensive empirical evaluation on a set of real-world graphs, which quantifies the benefits of edge- vs. vertex-partition, and demonstrates efficiency of natural greedy online assignments for the balanced edge-partition problem with and with no aggregation.
Why Multigrid Methods Are So Efficient

Originally introduced as a way to numerically solve elliptic boundary-value problems, multigrid methods, and their various multiscale descendants, have since been developed and applied to various problems in many disciplines. This introductory article provides the basic concepts and methods of analysis and outlines some of the difficulties of developing efficient multigrid algorithms
Open-Vocabulary Spoken Utterance Retrieval using Confusion Networks

This paper presents a novel approach to open-vocabulary spoken utterance retrieval using confusion networks. If out-of-vocabulary (OOV) words are present in queries and the corpus, word-based indexing will not be sufficient. For this problem, we apply phone confusion networks and combine them with word confusion networks. With this approach, we can generate a more compact index table that enables robust keyword matching compared with typical lattice-based methods. In the retrieval experiments with speech recordings in MIT lecture corpus, our method using phone confusion networks outperformed lattice-based methods especially for OOV queries.
Power efficient realtime super resolution by virtual pipeline technique on a server with manycore coprocessors

Super Resolution image processing (SR) is a heavy task for a today's mid-range Xeon server. To accelerate SR, we utilize a server system with manycore coprocessor, Intel Xeon Phi coprocessor. Function offload model is a usual execution model for those systems. However it is difficult for SR to increase utilization of both host processors and coprocessors by the model. We propose a virtual pipeline model which can fully utilize both processors. Experimental results show that our SR improves performance 3.3 times and performance/watt 1.5 times. Our SR achieves 30 frames per sec from SD to HD.
Quantum information processing with superconducting qubits in a microwave field

We investigate the quantum dynamics of a Cooper-pair box with a superconducting loop in the presence of a nonclassical microwave field. We demonstrate the existence of Rabi oscillations for both single- and multiphoton processes and, moreover, we propose a new quantum computing scheme (including one-bit and conditional two-bit gates) based on Josephson qubits coupled through microwaves.
A Simple Fusion Method of State And Sequence Segmentation for Music Structure Discovery

Methods for music structure segmentation are based on strong assumptions on the acoustical properties of structural segments. These assumptions relate to the novelty, homogeneity, repetition and/or regularity of the content. Each of these assumptions provide a different perspective on the music piece. These assumptions are however often considered separately in the methods. In this paper we propose a method for estimating the music structure segmentation based on the fusion of the novelty and repetition assumptions. This combination of different perspectives on the music pieces allows to generate more coherent acoustic segments and strongly improves the final music structure segmentation’s performance.