The application of PCA as a movement pattern recognition technique: A proof of principle

Quantitative methods can help us understand how underlying attributes contribute to movement patterns. Applying principal components analysis (PCA) to whole-body motion data may provide an objective data-driven method to identify unique and statistically important movement patterns. Therefore, the primary purpose of this study was to determine if athletes’ movement patterns can be differentiated based on skill level or sport played using PCA. Motion capture data from 542 athletes performing three sport-screening movements (i.e. bird-dog, drop jump, T-balance) were analyzed. A PCA-based pattern recognition technique was used to analyze the data. Prior to analyzing the effects of skill level or sport on movement patterns, methodological considerations related to motion analysis reference coordinate system were assessed. All analyses were addressed as case-studies. For the first case study, referencing motion data to a global (lab-based) coordinate system compared to a local (segment-based) coordinate system affected the ability to interpret important movement features. Furthermore, for the second case study, where the interpretability of PCs was assessed when data were referenced to a stationary versus a moving segment-based coordinate system, PCs were more interpretable when data were referenced to a stationary coordinate system for both the bird-dog and T-balance task. As a result of the findings from case study 1 and 2, only stationary segment-based coordinate systems were used in cases 3 and 4. During the bird-dog task, elite athletes had significantly lower scores compared to recreational athletes for principal component (PC) 1. For the T-balance movement, elite athletes had significantly lower scores compared to recreational athletes for PC 2. In both analyses the lower scores in elite athletes represented a greater range of motion. Finally, case study 4 reported differences in athletes’ movement patterns who competed in different sports, and significant differences in technique were detected during the bird-dog task. Through these case studies, this thesis highlights the feasibility of applying PCA as a movement pattern recognition technique in athletes. Future research can build on this proof-of-principle work to develop robust quantitative methods to help us better understand how underlying attributes (e.g. height, sex, ability, injury history, training type) contribute to performance.

An Empirical Evaluation of Preconditioning Data for Accelerating Convex Hull Computations

The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so accelerates the final hull finding procedure. We present an algorithm to precondition data before building a 2D convex hull with integer coordinates, with three distinct advantages. First, for all practical purposes, it is linear; second, no explicit sorting of data is required and third, the reduced set of s points is constructed such that it forms an ordered set that can be directly pipelined into an O(n) time convex hull algorithm. Under these criteria a fast (or O(n)) pre-conditioner in principle creates a fast convex hull (approximately O(n)) for an arbitrary set of points. The paper empirically evaluates and quantifies the acceleration generated by the method against the most common convex hull algorithms. An extra acceleration of at least four times when compared to previous existing preconditioning methods is found from experiments on a dataset.

An Empirical Evaluation of Preconditioning Data for Accelerating Convex Hull Computations

The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so accelerates the final hull finding procedure. We present an algorithm to precondition data before building a 2D convex hull with integer coordinates, with three distinct advantages. First, for all practical purposes, it is linear; second, no explicit sorting of data is required and third, the reduced set of s points is constructed such that it forms an ordered set that can be directly pipelined into an O(n) time convex hull algorithm. Under these criteria a fast (or O(n)) pre-conditioner in principle creates a fast convex hull (approximately O(n)) for an arbitrary set of points. The paper empirically evaluates and quantifies the acceleration generated by the method against the most common convex hull algorithms. An extra acceleration of at least four times when compared to previous existing preconditioning methods is found from experiments on a dataset.

The Challenge of Migration and the Global Security Strategy of the European Union

This article discusses the challenges of irregular migration for the security of the EU. They are analyzed starting with the European Security Strategy 2003, and the Report on its Implementation, 2008, and notes many failures: The EU Members did not follow the directives adopted in Brussels, the mismanagement of migration and asylum policies, and numerous actions that can be characterized or described as improvised, scattered or irresponsible. The 2016 Global Strategy recognizes these failures and call attention to the European leaders to reconsider how the EU functions and operates, suggesting the need for greater unity and cooperation to achieve a more effective migration policy. However, the article points out that practically all of the sections of the new Strategy dealing with migration were already embodied in previous Strategies, and stress that in parallel with the publication of the 2016 Global Strategy, actions are already undertaken, such as the EU readmission agreements signed with several important third countries of origin.

Physical Layer Security with Threshold-Based Multiuser Scheduling in Multi-antenna Wireless Networks

In this paper, we consider a multiuser downlink wiretap network consisting of one base station (BS) equipped with AA antennas, NB single-antenna legitimate users, and NE single-antenna eavesdroppers over Nakagami-m fading channels. In particular, we introduce a joint secure transmission scheme that adopts transmit antenna selection (TAS) at the BS and explores threshold-based selection diversity (tSD) scheduling over legitimate users to achieve a good secrecy performance while maintaining low implementation complexity. More specifically, in an effort to quantify the secrecy performance of the considered system, two practical scenarios are investigated, i.e., Scenario I: the eavesdropper’s channel state information (CSI) is unavailable at the BS, and Scenario II: the eavesdropper’s CSI is available at the BS. For Scenario I, novel exact closed-form expressions of the secrecy outage probability are derived, which are valid for general networks with an arbitrary number of legitimate users, antenna configurations, number of eavesdroppers, and the switched threshold. For Scenario II, we take into account the ergodic secrecy rate as the principle performance metric, and derive novel closed-form expressions of the exact ergodic secrecy rate. Additionally, we also provide simple and asymptotic expressions for secrecy outage probability and ergodic secrecy rate under two distinct cases, i.e., Case I: the legitimate user is located close to the BS, and Case II: both the legitimate user and eavesdropper are located close to the BS. Our important findings reveal that the secrecy diversity order is AAmA and the slope of secrecy rate is one under Case I, while the secrecy diversity order and the slope of secrecy rate collapse to zero under Case II, where the secrecy performance floor occurs. Finally, when the switched threshold is carefully selected, the considered scheduling scheme outperforms other well known existing schemes in terms of the secrecy performance and complexity tradeoff

Data Mining for Network Intrusion Detection : A comparison of data mining algorithms and an analysis of relevant features for detecting cyber-attacks

Data mining can be defined as the extraction of implicit, previously un-known, and potentially useful information from data. Numerous re-searchers have been developing security technology and exploring new methods to detect cyber-attacks with the DARPA 1998 dataset for Intrusion Detection and the modified versions of this dataset KDDCup99 and NSL-KDD, but until now no one have examined the performance of the Top 10 data mining algorithms selected by experts in data mining. The compared classification learning algorithms in this thesis are: C4.5, CART, k-NN and Naïve Bayes. The performance of these algorithms are compared with accuracy, error rate and average cost on modified versions of NSL-KDD train and test dataset where the instances are classified into normal and four cyber-attack categories: DoS, Probing, R2L and U2R. Additionally the most important features to detect cyber-attacks in all categories and in each category are evaluated with Weka’s Attribute Evaluator and ranked according to Information Gain. The results show that the classification algorithm with best performance on the dataset is the k-NN algorithm. The most important features to detect cyber-attacks are basic features such as the number of seconds of a network connection, the protocol used for the connection, the network service used, normal or error status of the connection and the number of data bytes sent. The most important features to detect DoS, Probing and R2L attacks are basic features and the least important features are content features. Unlike U2R attacks, where the content features are the most important features to detect attacks.

Platform Privacy: The Missing Piece of Data Protection Legislation

After years of deliberation, the EU commission sped up the reform process of a common EU digital policy considerably in 2015 by launching the EU digital single market strategy. In particular, two core initiatives of the strategy were agreed upon: General Data Protection Regulation and the Network and Information Security (NIS) Directive law texts. A new initiative was additionally launched addressing the role of online platforms. This paper focuses on the platform privacy rationale behind the data protection legislation, primarily based on the proposal for a new EU wide General Data Protection Regulation. We analyse the legislation rationale from an Information System perspective to understand the role user data plays in creating platforms that we identify as “processing silos”. Generative digital infrastructure theories are used to explain the innovative mechanisms that are thought to govern the notion of digitalization and successful business models that are affected by digitalization. We foresee continued judicial data protection challenges with the now proposed Regulation as the adoption of the “Internet of Things” continues. The findings of this paper illustrate that many of the existing issues can be addressed through legislation from a platform perspective. We conclude by proposing three modifications to the governing rationale, which would not only improve platform privacy for the data subject, but also entrepreneurial efforts in developing intelligent service platforms. The first modification is aimed at improving service differentiation on platforms by lessening the ability of incumbent global actors to lock-in the user base to their service/platform. The second modification posits limiting the current unwanted tracking ability of syndicates, by separation of authentication and data store services from any processing entity. Thirdly, we propose a change in terms of how security and data protection policies are reviewed, suggesting a third party auditing procedure.

B-1 Monthly Report of Medical Services Provided under Title XIX of the Social Security Act, April 2016

B-1 Medicaid Reports -- The monthly Medicaid series of eight reports provide summaries of Medicaid eligibles, recipients served, and total payments by county, category of service, and aid category. These reports may also be known as the B-1 Reports. These reports are each available as a PDF for printing or as a CSV file for data analysis. Report Report name IAMM1800-R001--Medically Needy by County - No Spenddown and With Spenddown; IAMM1800-R002--Total Medically Needy, All Other Medicaid, and Grand Total by County; IAMM2200-R002--Monthly Expenditures by Category of Service; IAMM2200-R003--Fiscal YTD Expenditures by Category of Service; IAMM3800-R001--ICF & ICF-MR Vendor Payments by County; IAMM4400-R001--Monthly Expenditures by Eligibility Program; IAMM4400-R002--Monthly Expenditures by Category of Service by Program; IAMM4600-R002--Elderly Waiver Summary by County.

B-1 Monthly Report of Medical Services Provided under Title XIX of the Social Security Act, May 2016

B-1 Medicaid Reports -- The monthly Medicaid series of eight reports provide summaries of Medicaid eligibles, recipients served, and total payments by county, category of service, and aid category. These reports may also be known as the B-1 Reports. These reports are each available as a PDF for printing or as a CSV file for data analysis. Report Report name IAMM1800-R001--Medically Needy by County - No Spenddown and With Spenddown; IAMM1800-R002--Total Medically Needy, All Other Medicaid, and Grand Total by County; IAMM2200-R002--Monthly Expenditures by Category of Service; IAMM2200-R003--Fiscal YTD Expenditures by Category of Service; IAMM3800-R001--ICF & ICF-MR Vendor Payments by County; IAMM4400-R001--Monthly Expenditures by Eligibility Program; IAMM4400-R002--Monthly Expenditures by Category of Service by Program; IAMM4600-R002--Elderly Waiver Summary by County.

B-1 Monthly Report of Medical Services Provided under Title XIX of the Social Security Act, February 2016

B-1 Medicaid Reports -- The monthly Medicaid series of eight reports provide summaries of Medicaid eligibles, recipients served, and total payments by county, category of service, and aid category. These reports may also be known as the B-1 Reports. These reports are each available as a PDF for printing or as a CSV file for data analysis. Report Report name IAMM1800-R001--Medically Needy by County - No Spenddown and With Spenddown; IAMM1800-R002--Total Medically Needy, All Other Medicaid, and Grand Total by County; IAMM2200-R002--Monthly Expenditures by Category of Service; IAMM2200-R003--Fiscal YTD Expenditures by Category of Service; IAMM3800-R001--ICF & ICF-MR Vendor Payments by County; IAMM4400-R001--Monthly Expenditures by Eligibility Program; IAMM4400-R002--Monthly Expenditures by Category of Service by Program; IAMM4600-R002--Elderly Waiver Summary by County.

Data Science Seminar: Generic Big Data Processing for Advancing Situation Awareness and Decision-Support

The generation of heterogeneous big data sources with ever increasing volumes, velocities and veracities over the he last few years has inspired the data science and research community to address the challenge of extracting knowledge form big data. Such a wealth of generated data across the board can be intelligently exploited to advance our knowledge about our environment, public health, critical infrastructure and security. In recent years we have developed generic approaches to process such big data at multiple levels for advancing decision-support. It specifically concerns data processing with semantic harmonisation, low level fusion, analytics, knowledge modelling with high level fusion and reasoning. Such approaches will be introduced and presented in context of the TRIDEC project results on critical oil and gas industry drilling operations and also the ongoing large eVacuate project on critical crowd behaviour detection in confined spaces.

B-1 Monthly Report of Medical Services Provided under Title XIX of the Social Security Act, June 2016

B-1 Medicaid Reports -- The monthly Medicaid series of eight reports provide summaries of Medicaid eligibles, recipients served, and total payments by county, category of service, and aid category. These reports may also be known as the B-1 Reports. These reports are each available as a PDF for printing or as a CSV file for data analysis. Report Report name IAMM1800-R001--Medically Needy by County - No Spenddown and With Spenddown; IAMM1800-R002--Total Medically Needy, All Other Medicaid, and Grand Total by County; IAMM2200-R002--Monthly Expenditures by Category of Service; IAMM2200-R003--Fiscal YTD Expenditures by Category of Service; IAMM3800-R001--ICF & ICF-MR Vendor Payments by County; IAMM4400-R001--Monthly Expenditures by Eligibility Program; IAMM4400-R002--Monthly Expenditures by Category of Service by Program; IAMM4600-R002--Elderly Waiver Summary by County.

B-1 Monthly Report of Medical Services Provided under Title XIX of the Social Security Act, July 2016

B-1 Medicaid Reports -- The monthly Medicaid series of eight reports provide summaries of Medicaid eligibles, recipients served, and total payments by county, category of service, and aid category. These reports may also be known as the B-1 Reports. These reports are each available as a PDF for printing or as a CSV file for data analysis. Report Report name IAMM1800-R001--Medically Needy by County - No Spenddown and With Spenddown; IAMM1800-R002--Total Medically Needy, All Other Medicaid, and Grand Total by County; IAMM2200-R002--Monthly Expenditures by Category of Service; IAMM2200-R003--Fiscal YTD Expenditures by Category of Service; IAMM3800-R001--ICF & ICF-MR Vendor Payments by County; IAMM4400-R001--Monthly Expenditures by Eligibility Program; IAMM4400-R002--Monthly Expenditures by Category of Service by Program; IAMM4600-R002--Elderly Waiver Summary by County.