Search

In this article we signpost readers to 10 papers we consider essential reading for anyone starting out on an evidence-based medicine journey. We have considered papers consisting a mix of old and new, seminal and cutting-edge that offer insight into what evidence-based medicine is, where it came from, why it matters and what it has achieved. This is balanced against some of the common criticisms of evidence-based medicine and efforts to tackle them. We have also highlighted papers acknowledging the importance of teaching and learning of the principles of evidence-based medicine and how health professionals can better use evidence in clinical decisions with patients.

In recent years, data mining had become very popular to provide a facility in various fields. Large amount of data elements are stored in the database. Various data mining algorithms are used to classify the data elements and perform some operations to find the best solution on the basis of some relational parameters. One of the automatic architecture designs in this research is to find the solution for examination in terms of level wise question paper. The entire examination process is a vital component for direct assessment of an individual learning. So, preparing a complete test paper and the setup is relatively necessary. Currently, the customary technique of making question paper has been handbook. In current scenario the question paper generation is a manual approach leading to unproductive at times owing to bias, repetition and security concerns. The current paper presents an automatic procedure of question paper group which can be modified, streamlined, synchronized and secured. Each task done by this system is automatic, such that storing space, bias and security is not an apprehension any longer. Earlier, the question paper was generated by concerned subject teacher manually and was very time consuming, man power was required and sometimes the question paper lacked accuracy. Outcome Based Education (OBE) designates what students will know and be intelligent to do, as they advance in a program. The information related to student learning was collected for question paper generation and assessment using OBE. This information can be used to predict students ability, advancements in education system, betterment in teaching method, future interest of student etc. Various data mining classifiers like oneR, ZeroR, J48, Naive Bayes, IBk are used for prediction of the course outcome. The comparative study contains some parameters like time, detection accuracy, classification error etc. to find the performance of the proposed architecture as compared to other techniques to verify the enhancements.

This communication comments on the three papers by the FDA CDER research team on the regulatory perspective of the missing data problem. The focus is on two topics: causal estimand and sensitivity analysis. Copyright © 2016 John Wiley & Sons, Ltd.

In Fritz John's famous paper (1979), he discovered that for the wave equation $\Box u=|u|^p$, where $1, Comment: 11 pages, 3 figures

We construct a counterexample that disproves the claim of Theorem 0.2 of the paper “Injective mappings and solvable vector fields of Euclidean spaces”, which appeared in Topology Appl. 136 (2004), 261–274.

The high frequency scattering problems of electromagnetic fields scattered from electrically large scatterers are important and challenging. On the calculation of the reflected and diffracted wave fields, the high frequency methods could be classified into the current based method and the ray based method. In this paper, first, we give a review on the progress of the modern high frequency methods for solving the electromagnetic scattering problems. Next, due to the highly oscillatory property of the high frequency electromagnetic scattered fields, we propose the numerical steepest descent path method. Finally, we comprehensively address the high frequency wave physics, including the high frequency critical point contributions, the Keller’s cone, the shadow and reflection boundaries and the creeping wave fields.

We characterize functions of finite energy in the plane in terms of their traces on the lines that make up "graph paper" with squares of side length $mn$ for all $n$, and certain $\12-$order Sobolev norms on the graph paper lines. We also obtain analogous results for functions of finite energy on two classical fractals: the Sierpinski gasket and the Sierpinski carpet.

In this note, we give affirmative answers to two open problems posed by Agarwal et al. in the paper (J Optim Theory Appl 163(2):482---490, 2014).

In this short note, it is shown that there is a gap in the proof of Theorem 11 in the paper of Meyer and Neutsch (J. of Algebra, 1993). We prove, nevertheless, that the statement of the theorem is true and fix the proof by using a certain extremal property of idempotents which has an independent interest., 6 pages, submitted 2017

The aim of this paper is to study a new equivalent form of the weak maximum principle for a large class of differential operators on Riemannian manifolds. This new form has been inspired by the work of Berestycki, Hamel and Rossi for trace operators, and allows us to shed new light on it and to introduce a new sufficient bounded Khas’minskii type condition for its validity. We show its effectiveness by applying it to obtain some uniqueness results in a geometric setting.

We try to describe in this paper how methods from extremal combinatorics play an important role in the development of parameterized algorithms, also sketching further venues how this influence could be even increased in order to obtain quick \(\mathcal {FPT}\) classification results. Conversely, we show how certain notions that have become of importance within parameterized algorithmics can be useful to keep in mind for combinatorialists. We hope that this account initiates fruitful future discussions between the different scientific sub-communities that usually comprise IWOCA and that make this event quite special.

Automated techniques for analysis and optimization of finite-precision computations have recently garnered significant interest. Most of these were, however, developed independently. As a consequence, reuse and combination of the techniques is challenging and much of the underlying building blocks have been re-implemented several times, including in our own tools. This paper presents a new framework, called Daisy, which provides in a single tool the main building blocks for accuracy analysis of floating-point and fixed-point computations which have emerged from recent related work. Together with its modular structure and optimization methods, Daisy allows developers to easily recombine, explore and develop new techniques. Daisy’s input language, a subset of Scala, and its limited dependencies make it furthermore user-friendly and portable.

This article is intended to indicate and discuss some errors in N. Lavi’s paper “A Ganzstellensatz for semi-algebraic sets and a boundedness criterion for rational functions”.

In today's world on one hand where the computer has revolutionized the field of education and on other hand there are still some areas where there is a need of use of computers. Traditional ways of checking have various kinds of faults. There are several mistakes that occur on the checking department's side like totaling error, marking mistake and sometimes there can be partiality in evaluation of marks. For any student the evaluation of the exam plays an important role. The students are generally classified on the basics of their performances in the examination. Therefore the assessment of examination should be carried out in a most efficient way. Current evaluation process leaves the future of the student at the mercy of the teachers. The understudies likewise don't motivate chances to express their insight and potential. Rather they are made to take in the stuff they had already learnt in their individual reading material. These variables upset the imagination of the understudies all things considered. Likewise a lot of cash and time is squandered. The practice of current evaluation system is used widely across the world and student s across all the areas have been facing the drawbacks of this current evaluation system. The advance of separation training has likewise been hampered by the non-accessibility of an automated assessment framework. This paper tends to how these striking insufficiencies in the instructive framework can be evacuated.

This note concerns about the conclusion of a lemma of a published paper of this journal.

For any discrete valuation ring R, any R-linear mapping u from an R-module E into an R-module F and any \(y_0\in F\), a necessary and sufficient condition for the solvability of the equation \(u(x)=y_0\) is established, and an application of this result is presented.

In our data driven society in which we expect that all major decisions are backed up by empirical evidence based on high quality data, broad access to these data is a must. However, the benefits of broad data access need to be balanced against potential risks of disclosure. Most data gathered by government agencies are collected under the pledge of confidentiality and the agencies have a legal and moral obligation to guarantee this pledge. Furthermore, if respondents get the impression that their data are not sufficiently protected they might refuse to participate or purposely provide wrong answers jeopardizing the quality of the collected data. Statistical agencies thus have to address this trade-off and much progress has been made in the last decades increasing the amount of data available for the general public while maintaining the confidentiality of the survey respondents. Still, there are certain types of data for which addressing this trade-off is particularly difficult. Medical records containing sensitive information on health status are one example, another example are business data. These data are particularly difficult to protect since a few variables usually suffice to identify larger businesses in the data. At the same time the collected information is often sensitive since other establishments might gain an edge if they learn certain attributes

Rapid urban growth is occurring across Australia. This has implications for planning and management of cities. Data is key to tackling this. Hitherto, an extensive range of organisations has held the data for Australian cities, crossing government, industry and academia. With the growing demand for open data and capabilities to support big data analytics, new opportunities now exist to rectify this situation. The Australian Urban Research Infrastructure Network (AURIN) project has been funded to provide seamless, secure access to data from definitive organisations of Australia. We describe the AURIN platform; it's data, together with a representative big data case study.

Assume that A and G are finite groups of coprime orders such that A acts on G via automorphisms. Let p be a prime. The following coprime action version of a well-known theorem of Ito about the structure of a minimal non-p-nilpotent groups is proved: if every maximal A-invariant subgroup of G is p-nilpotent, then G is p-soluble. If, moreover, G is not p-nilpotent, then G must be soluble. Some earlier results about coprime action are consequences of this theorem.

Let [Formula: see text] be a projective variety of dimension [Formula: see text] over an algebraically closed field of arbitrary characteristic. We prove a Fujiki–Lieberman type theorem on the structure of the automorphism group of [Formula: see text]. Let [Formula: see text] be a group of zero entropy automorphisms of [Formula: see text] and [Formula: see text] the set of elements in [Formula: see text] which are isotopic to the identity. We show that after replacing [Formula: see text] by a suitable finite-index subgroup, [Formula: see text] is a unipotent group of the derived length at most [Formula: see text]. This result was first proved by Dinh et al. for compact Kähler manifolds.

n/a

In this note we show that the presented proof of [1, th. 12] , being based on a false statement appearing in this proof, is not viable for all of the proclaimed values of the involved parameters. We also determine necessary and sufficient conditions for those parameters, which provides that the considered statement, and therefore [1, th. 12] itself, still remains valid.

The aim of this paper is to discuss the main result in the paper by D.Y. Gao and X. Lu [On the extrema of a nonconvex functional with double-well potential in 1D, Z. Angew. Math. Phys. (2016) 67:62]. More precisely we provide a detailed study of the problem considered in that paper, pointing out the importance of the norm on the space $C^{1}[a,b]$; because no norm (topology) is mentioned on $C^{1}[a,b]$ we look at it as being a subspace of $W^{1,p}(a,b)$ for $p\in [1,\infty]$ endowed with its usual norm. We show that the objective function has not local extrema with the mentioned constraints for $p\in [1,4)$, and has (up to an additive constant) only a local maximizer for $p=\infty$, unlike the conclusion of the main result of the discussed paper where it is mentioned that there are (up to additive constants) two local minimizers and a local maximizer. We also show that the same conclusions are valid for the similar problem treated in the preprint by X. Lu and D.Y. Gao [On the extrema of a nonconvex functional with double-well potential in higher dimensions, arXiv:1607.03995]., 12 pages; in this version we added the forgotten condition $F(x) \ne 0$ for $x\in (a,b)$ on page 3

In this short note, we show that all results presented in Alderremy et al. (2018) are straightforward and can be obtained immediately as special cases by means of Laplace’s transform. Furthermore, we show that Elzaki’s transform is a special case of Laplace’s transform, and then cannot be a new transform. Also, we mention that the application of the recursion scheme of the new iterative method (NIM) is incorrect. Keywords: Elzaki transform, Laplace transform, Novel Elzaki iterative method

In today's competitive operating environment one of the chief factors in success of outsourcing is the suppliers. Hence, it becomes imperative for an organization to choose suppliers carefully who cater to its needs. In this paper, we have developed a hybrid approach dedicated to supplier selection problem; this approach combines the correlation coefficient and standard deviation (CCSD) method and the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method. In order to validate the model, an application is performed in a paper company. Numerical results of the problem are revealed to select the appropriate supplier among three ones, regarding 5 criteria, namely, price, quality, delivery, responsiveness to complaints, and responsiveness to emergencies.

The paper “State-of-the-art of research on seismic pounding between buildings with aligned slabs” (by Kharazian and Lopez-Almansa) has recently been published in the journal of Archives of Computational Methods in Engineering. It can be considered as a kind of continuation of previous ‘state-of-the-art’ publications, including two papers and a book. Unfortunately, the paper contains a number of misleading or wrong statements as well as mistakes. The aim of the present paper is to discuss the controversial statements and to correct the mistakes.

Discussion of the Paper "Asymptotic Theory of Outlier Detection Algorithms for Linear Time Series Regression Models" by Soren Johansen and Bent Nielsen

We show that a relative entropy condition recently shown by Leger and Vasseur to imply uniqueness and stable $L^2$ dependence on initial data of Lax 1- or $n$-shock solutions of an $n\times n$ system of hyperbolic conservation laws with convex entropy implies Lopatinski stability in the sense of Majda. This means in particular that Leger and Vasseur's relative entropy condition represents a considerable improvement over the standard entropy condition of decreasing shock strength and increasing entropy along forward Hugoniot curves, which, in a recent example exhibited by Barker, Freist\"uhler and Zumbrun, was shown to fail to imply Lopatinski stability, even for systems with convex entropy. This observation bears also on the parallel question of existence, at least for small $BV$ or $H^s$ perturbations, Comment: to appear in Proceedings of the AMS

In this paper, analog-and-digital hybrid beamformer design is considered for millimeter-wave (mmWave) wideband multi-user (MU) multiple-input single-output (MISO)-OFDM downlink systems, where a single common analog beamformer is used for all subcarriers while a separate digital beamformer is applied to each subcarrier. By applying a signal-to-leakage-plus-noise ratio (SLNR) approach, an efficient beamformer design algorithm based on a trace quotient is derived for joint design of the common analog beamformer and the separate digital beamformers.

In (Barbour, 1990) foundations for diffusion approximation via Stein's method are laid. This paper has been cited more than 130 times and is a cornerstone in the area of Stein's method. A semigroup argument is used therein to solve a Stein equation for Gaussian diffusion approximation. We prove that, contrary to the claim in (Barbour, 1990), the semigroup considered therein is not strongly continuous on the Banach space of continuous, real-valued functions on D[0,1] growing slower than a cubic, equipped with an appropriate norm. We also provide a proof of the exact formulation of the solution to the Stein equation of interest, which does not require the aforementioned strong continuity. This shows that the main results of (Barbour, 1990) hold true., Comment: 8 pages

We correct an error in the Multiple Point Formula (7.3) in the paper mentioned in the title. This correction propagates to formulas (7.5), (7.6), (7.23) and (8.18), and it affects minor results in Section 8, where few statements require an extra assumption, but it does not affect the main results of Section 8.

Automatic summarisation is a popular approach to reduce a document to its main arguments. Recent research in the area has focused on neural approaches to summarisation, which can be very data-hungry. However, few large datasets exist and none for the traditionally popular domain of scientific publications, which opens up challenging research avenues centered on encoding large, complex documents. In this paper, we introduce a new dataset for summarisation of computer science publications by exploiting a large resource of author provided summaries and show straightforward ways of extending it further. We develop models on the dataset making use of both neural sentence encoding and traditionally used summarisation features and show that models which encode sentences as well as their local and global context perform best, significantly outperforming well-established baseline methods., Comment: 11 pages, 6 figures

Riemann’s mathematical papers contain many ideas that arise in physics, and some of them are motivated by problems from physics. In fact, it is not easy to separate Riemann’s ideas in mathematics from there in physics. Furthermore, Riemann’s philosophical ideas are often in the background of his work on science. The aim of this chapter is to give an overview of Riemann’s mathematical results based on physical reasoning or motivated by physics. We also elaborate on the relation with philosophy. While we discuss some of Riemann’s philosophical points of view, we review some ideas on the same subjects emitted by Riemann’s predecessors, and in particular Greek philosophers, mainly the pre-socratics and Aristotle.

In Service-Oriented Architecture (SOA), dedicatedintermediate nodes called load balancers are usually deployed in data centers (DC) in order to balance the load among multiple instances of an application service and to optimize the resource utilization. However, the addition of these nodes increases the installation and operational cost of DCs. These load balancers distribute incoming flows to multiple outgoing ports usually by hashing them. Several techniques are used in order to select the outgoing ports e.g. round robin, queue length, feedback from neighbors etc. Such load balancing approaches do not considergetting live feedback from the service end and therefore are not able to dynamically change the amount of allocated resources. In this paper, a distributed load management scheme isproposed for service oriented networks based on the currentInternet architecture. In this scheme, lightweight interconnected management agents are used to decide the availability for a particular service instance and help in optimal distribution of the flows. The proposed scheme can also be applied in other emerging internetworking architectures such as RINA.

This special issue of METRIKA contains mainly a collection of papers presented at the 3rd Workshop on Goodness-of-Fit and Change-Point problems, which was supported by the German Research Foundation (DFG), and was held at the Church House of the Protestant Academy Baden in Bad Herrenalb in the Black Forest near Karlsruhe, Germany, 8–10 September, 2017. The first workshop in this series took place in 2012 at the University of Sevilla, and the second was held at the National and Kapodistrian University of Athens, 2015. There is already a follow-up event that will take place in 2019 at the University of Trento, Italy. We firmly believe that this series of workshops will become a regular international meeting

In this paper, we discuss the validity of the result of Khuangsatung and Kangtunyakarn [Existence and convergence theorem for fixed point problem of various nonlinear mappings and variational inequality problems without some assumptions, Filomat 32(1) (2018) 305–309].

We give some comments on the paper by Mendes and Yigit where some misleading statements on rank tests have been given. Also, we give some additional important references on the same topic, which are not cited in this paper. By extending the simulations presented in the Mendes and Yigit paper to larger and unequal sample sizes, we demonstrate that the main conclusions are misleading.

International audience; We present a new communication subsystem for high speed networks featuring an extendable packet optimization engine mixing several communication flows. Optimizations are parameterized by the capabilities of the underlying network drivers, and are triggered by the network cards when they become idle. The database of predefined strategies can be easily extended.

In T. Kruse and A. Popier, we established existence and uniqueness of solutions of backward stochastic differential equations in under a monotonicity condition on the generator and in a general filtration. There was a mistake in the case . Here we give a corrected proof. Moreover the quasi-left continuity condition on the filtration is removed.