Hybrid deep learning model for answering visual medical questions

Due to the increase in electronic documents containing medical information, the search for specific information is often complex and time-consuming. This has prompted the development of new tools designed to address this issue. Automated visual question/answer (VQA) systems are becoming more challenging to develop. These are computer programs that take images and questions as input and then combine all inputs to generate text-based answers. Due to the enormous amount of question and the limited number of specialists, many issues stay unanswered. It’s possible to solve this problem by using automatic question classifiers that guide queries to experts based on their subject preferences. For these purposes, we propose a VQA approach based on a hybrid deep learning model. The model consists of three steps: (1) the classification of medical questions based on a BERT model; (2) image and text feature extraction using a deep learning model, more specifically the extraction of medical image features by a hybrid deep learning model; and (3) text feature extraction using a Bi-LSTM model. Finally, to predict the appropriate answer, our approach uses a KNN model. Additionally, this study examines the influence of the Adam, AdaGrad, Stochastic gradient descent and RMS Prop optimization techniques on the performance of the network. As a consequence of the studies, it was shown that Adam and SGD optimization algorithms consistently produced higher outcomes. Experiments using the ImageCLEF 2019 dataset revealed that the suggested method increases BLEU and WBSS values considerably.

     

Near-Entropy Hotlink Assignments

Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T. Each web page i carries a probability p _i representative of the frequency with which it is visited. By adding hotlinks—shortcuts from a node to one of its descendents—we wish to minimize the expected number of steps l needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink per node, our method guarantees an upper bound on l of 1.141H(p)+1 if d>2 and 1.08H(p)+2/3 if d=2. We also present the first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on l of at most \frac2H(p)log(k+1)+1\frac{2H(p)}{\log(k+1)}+1 and \fracH(p)log(k+d)-logd+1\frac{H(p)}{\log(k+d)-\log d}+1 , respectively. All our methods are strong, i.e., they provide the same guarantees on all subtrees after the assignment. We also present an algorithm implementing these methods in O(nlog n) time, an improvement over the previous O(n ²) time algorithms. Finally we prove a Ω(nlog n) lower bound on the running time of any strong method that guarantee an average access time strictly better than 2H(p).     

MLP bilinear separation

In this paper, we present a thorough mathematical analysis of the use of neural networks to solve a specific classification problem consisting of a bilinear boundary. The network under consideration is a three-layered perceptron with two hidden neurons having the sigmoid serving as the activation function. The analysis of the hidden space created by the outputs of the hidden neurons will provide results on the network’s capacity to isolate two classes of data in a bilinear fashion, and the importance of the value of the sigmoid parameter is highlighted. We will obtain an explicit analytical function describing the boundary generated by the network, thus providing information on the effect each parameter has on the network’s behavior. Generalizations of the results are obtained with additional neurons, and a theorem concerned with analytical reproducibility of the boundary function is established.     

Characterization of renal tumours based on Raman spectra classification

In this study, we propose to evaluate the potential of Raman spectroscopy (RS) to assess renal tumours at surgery. Different classes of Raman renal spectra acquired during a clinical protocol are discriminated using support vector machines classifiers. The influence on the classification scores of various preprocessing steps generally involved in RS are also investigated and evaluated in the particular context of renal tumour characterization. Encouraging results show the interest of RS to evaluate kidney cancer and suggest the potential of this technique as a surgical assistance during partial nephrectomy.     

Exploring the relationship between Internet ethics in university students and the big five model of personality

The widespread use of the Internet and the convenient mechanism it provides, such as easy access, easy downloads, and easy copy and paste functions have made many types of unethical behaviors easier, particularly those involving students in academic settings. Among the issues in ethics within the academic environment that can be triggered by the Internet are fraudulence, plagiarism, falsification, delinquency, unauthorized help, and facility misuse. Given these issues, the study seeks to investigate the extent to which students at a public university in Malaysia engage in such unethical behavior and their relationship with the big five personality model. This study was conducted using a survey method of 252 students in three different academic faculties. The results of factor analyses confirm and refine the reliability of the scales for both big five personality variables and unethical Internet behaviors as conceptualized through Internet triggered academic dishonesty (ITADS). The findings indicate that personality traits such as (1) agreeableness, (2) conscientiousness and (3) emotional stability are significantly and negatively correlated with unethical Internet behavior in university students. Significant differences in facility misuse are also observed between the three academic faculties investigated. This research should provide significant contributions to educators in designing the computer ethics curriculum and in allowing for educational institutions as well as other organizations in developing relevant policies and guidelines on matters pertaining to academic conduct, utilization of computers and Internet, and recruitment exercises.     

Multi-contact vertical ladder climbing with an HRP-2 humanoid

We describe the research and the integration methods we developed to make the HRP-2 humanoid robot climb vertical industrial-norm ladders. We use our multi-contact planner and multi-objective closed-loop control formulated as a QP (quadratic program). First, a set of contacts to climb the ladder is planned off-line (automatically or by the user). These contacts are provided as an input for a finite state machine. The latter builds supplementary tasks that account for geometric uncertainties and specific grasps procedures to be added to the QP controller. The latter provides instant desired states in terms of joint accelerations and contact forces to be tracked by the embedded low-level motor controllers. Our trials revealed that hardware changes are necessary, and parts of software must be made more robust. Yet, we confirmed that HRP-2 has the kinematic and power capabilities to climb real industrial ladders, such as those found in nuclear power plants and large scale manufacturing factories (e.g. aircraft, shipyard) and construction sites.     

A sliding mode observer for uncertain nonlinear systems based on multiple models approach

This paper presents a method of state estimation for uncertain nonlinear systems described by multiple models approach. The uncertainties, supposed as norm bounded type, are caused by some parameters’ variations of the nonlinear system. Linear matrix inequalities (LMIs) have been established in order to ensure the stability conditions of the multiple observer which lead to determine the estimation gains. A sliding mode gain has been added in order to compensate the uncertainties. Numerical simulations through a state space model of a real process have been realized to show the robustness of the synthesized observer.     

Rational method for 3D manufacturing tolerancing synthesis based on the TTRS approach “R3DMTSyn”

During the production of new part in an industrial environment, it results in a high percentage of scrap if manufacturing planning is not carried out properly. One of the major factors responsible for this phenomenon is tolerance synthesis. In this paper, we deal with tolerance synthesis, and especially tolerance type identified after transfer. An algorithmic Rational method for 3D Manufacturing Tolerancing Synthesis (R3DMTSyn), which is based on the use of the Technologically and Topologically Related Surface (TTRS) rules, is developed. The TTRS concept helps to generate only the necessary manufacturing specification needed to guarantee the respect of the functional specification studied.The manufacturing project is modeled by a graphical representation called the SPIDER GRAPH. With the SPIDER GRAPH, all active surfaces can be detected (machined and positioning surfaces), so it is possible to identify the location of the functional surfaces used in each functional specification. The construction or the determination of the tolerancing torsor, belonging to each active surface, contributes to the selection of the adequate case of associations. A semantic study is already done to identify all possible combinations or associations needed to locate surfaces during each phases.Finally, referring to the developed TTRS_Cars_Process and in every phase, one or more manufacturing specifications are generated until finishing the treatment of all surfaces (surface belonging to the functional condition, or intermediate surfaces).     

Causality, conditional independence, and graphical separation in settable systems

We study the connections between causal relations and conditional independence within the settable systems extension of the Pearl causal model (PCM). Our analysis clearly distinguishes between causal notions and probabilistic notions, and it does not formally rely on graphical representations. As a foundation, we provide definitions in terms of suitable functional dependence for direct causality and for indirect and total causality via and exclusive of a set of variables. Based on these foundations, we provide causal and stochastic conditions formally characterizing conditional dependence among random vectors of interest in structural systems by stating and proving the conditional Reichenbach principle of common cause, obtaining the classical Reichenbach principle as a corollary. We apply the conditional Reichenbach principle to show that the useful tools of d-separation and D-separation can be employed to establish conditional independence within suitably restricted settable systems analogous to Markovian PCMs.