Neurology assessment by objective structured video examination (OSVE)

Summary
Background
The ability to carry out a neurological examination and make an appropriate differential diagnosis is one of the mainstays of our final Bachelor of Medicine (MB) exam; however, with the introduction of objective structured clinical examinations (OSCEs) it has become impossible to arrange for adequate numbers of suitable real patients to participate in the exam.

Context
It is vital that newly qualified doctors can perform a basic neurological examination, interpret the physical signs and formulate a differential diagnosis.

It is vital that newly qualified doctors can perform a basic neurological examination

Innovation
Since 2010 we have introduced an objective structured video examination (OSVE) of a neurological examination of a real patient as part of our final MB OSCE exam. The students view clips of parts of the examination process. They answer questions on the signs that are demonstrated and formulate a differential diagnosis.

Implications
This type of station is logistically a lot easier to organise than a large number of real patients at different examination sites. The featured patients have clearly demonstrated signs and, as every student sees the same patient, are perfectly standardised. It is highly acceptable to examiners and performed well as an assessment tool. There are, however, certain drawbacks in that we are not examining the student's examination technique or their interaction with the patient. Also, certain signs, in particular the assessment of muscle tone and power, are more difficult for a student to estimate in this situation

Rocking behaviour of multi-block columns subjected to pulse-type ground motion accelerations

Ancient columns, made with a variety of materials such as marble, granite, stone or masonry are an important part of the
European cultural heritage. In particular columns of ancient temples in Greece and Sicily which support only the architrave are
characterized by small axial load values. This feature together with the slenderness typical of these structural members clearly
highlights as the evaluation of the rocking behaviour is a key aspect of their safety assessment and maintenance. It has to be noted
that the rocking response of rectangular cross-sectional columns modelled as monolithic rigid elements, has been widely investigated
since the first theoretical study carried out by Housner (1963). However, the assumption of monolithic member, although being
widely used and accepted for practical engineering applications, is not valid for more complex systems such as multi-block columns
made of stacked stone blocks, with or without mortar beds. In these cases, in fact, a correct analysis of the system should consider
rocking and sliding phenomena between the individual blocks of the structure. Due to the high non-linearity of the problem, the
evaluation of the dynamic behaviour of multi-block columns has been mostly studied in the literature using a numerical approach
such as the Discrete Element Method (DEM). This paper presents an introductory study about a proposed analytical-numerical
approach for analysing the rocking behaviour of multi-block columns subjected to a sine-pulse type ground motion. Based on the
approach proposed by Spanos (2001) for a system made of two rigid blocks, the Eulero-Lagrange method to obtain the motion
equations of the system is discussed and numerical applications are performed with case studies reported in the literature and with a
real acceleration record. The rocking response of single block and multi-block columns is compared and considerations are made
about the overturning conditions and on the effect of forcing function’s frequency.
.

A Structured Approach to Simulate Manufacturing System In Virtual Environment

Nowadays, the realization of the Virtual Factory (VF) is the strategic goal of many manufacturing enterprises for the coming years. The industrial scenario is characterized by the dynamics of innovations increment and the product life cycle became shorter. Furthermore products and the corresponding manufacturing processes get more and more complex. Therefore, companies need new methods for the planning of manufacturing systems.
To date, the efforts have focused on the creation of an integrated environment to design and manage the manufacturing process of a new product. The future goal is to integrate Virtual Reality (VR) tools into the Product Lifecycle Management of the manufacturing industries.
In order to realize this goal the authors have conducted a study to perform VF simulation steps for a supplier of Industrial Automation Systems and have provided a structured approach focusing on interaction between simulation software and VR hardware tools in order to simulate both robotic and
manual work cells.
The first results of the study in progress have been carried out in the VR Laboratory of the Competence Regional Centre for the qualification of the Transportation Systems that has been founded by Campania Region.

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph

A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.

Necessary and sufficient conditions for a Hamiltonian graph

A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an eigenvector belonging to the zero eigenspace of A has no zero entries, then the singular graph is said to be a core graph. A ( k,t)-regular set is a subset of the vertices inducing a k -regular subgraph such that every vertex not in the subset has t neighbours in it. We consider the case when k=t which relates to the eigenvalue zero under certain conditions. We show that if a regular graph has a ( k,k )-regular set, then it is a core graph. By considering the walk matrix we develop an algorithm to extract ( k,k )-regular sets and formulate a necessary and sufficient condition for a graph to be Hamiltonian.

Spectra of graphs obtained by a generalization of the join graph operation

Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional consequences are explored, namely regarding the largest eigenvalue and algebraic connectivity.

IB-DFE receiver techniques for CP-assisted block transmission within DS-CDMA and MC-CDMA systems

MC-CDMA (MultiCarrier Code Division Multiple Access), currently regarded as a promissing multiple access scheme for broadband communications, is known to combine the advantages of an OFDM-based (Orthogonal Frequency Division Multiplexing), CP-assisted (Cyclic Prefix) block transmission with those of CDMA systems. Recently, it was recognised that DS-CDMA (Direct Sequence) implementations can also take advantage of the beneficts of the CP-assisted block transmission approach, therefore enabling an efficient use of FFT-based (Fast Fourier Transform), chip level FDE (Frequency- Domain Equalisation) techniques. In this paper we consider the use of IB-DFE (Iterative Block Decision Feedback Equalisation) FDE techniques within both CP-assisted MC-CDMA systems with frequency-domain spreading and DS-CDMA systems. Our simulation results show that an IB-DFE receiver with moderate complexity is suitable in both cases, with excellent performances that can be close to the single-code matched filter bound (especially for the CP-assisted DSCDMA alternative), even with full code usage.

Gene Network Inference using Machine Learning and Graph Algorithms on Big Biomedical Data

Thesis (Master's)--University of Washington, 2016-03

A study on the encryption algorithm for RFID tag (SEED : 8 Rounds × 64 bits block)

Although it is always weak between RFID Tag and Terminal in focus of the security, there are no security skills in RFID Tag. Recently there are a lot of studying in order to protect it, but because it has some physical limitation of RFID, that is it should be low electric power and high speed, it is impossible to protect with the skills. At present, the methods of RFID security are using a security server, a security policy and security. One of them the most famous skill is the security module, then they has an authentication skill and an encryption skill. In this paper, we designed and implemented after modification original SEED into 8 Round and 64 bits for Tag.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

A Fractional Perspective to the Bond Graph Modelling of World Economies

Inspired in dynamic systems theory and Brewer’s contributions to apply it to economics, this paper establishes a bond graph model. Two main variables, a set of inter-connectivities based on nodes and links (bonds) and a fractional order dynamical perspective, prove to be a good macro-economic representation of countries’ potential performance in nowadays globalization. The estimations based on time series for 50 countries throughout the last 50 decades confirm the accuracy of the model and the importance of scale for economic performance.

Structured Light System for Underwater Inspection Operations

In this work we propose the development of a stereo SLS system for underwater inspection operations. We demonstrate how to perform a SLS calibration both in dry and underwater environments using two different methods. The proposed methodology is able to achieve quite accurate results, lower than 1 mm in dry environments. We also display a 3D underwater scan of a known object size, a sea scallop, where the system is able to perform a scan with a global error lower than 2% of the object size.

Structured products in the current low interest rate environment

Directed Research Internship