Motor intention in the posterior parietal cortex:experimental data analysis and functional modeling study

The complexity of processes occurring in the brain is an intriguing issue not just for scientists and medical doctors, but the humanity in general. The cortex ability to perceive and analyze an enormous amount of information in an instance of time, the parallelism and computational efficiency are among the questions that attract attention. Even a simple, everyday gesture, for example, reaching for a cup of coffee, evokes a flow of signals in the brain. It goes from the primary visual region, that locates the cup on the table, to the primary motor region that sends the precise coordinates to the hand, and the instruction what to do next. The sequence of signal transmission and transformation continues through several regions, sensory, associative and motor ones. In this study, we will focus on the posterior parietal cortex, the region involved in the transformation of visual inputs into the preliminary motor plans. The years of experimental work revealed mechanisms for integration of multimodal signals, coordinate transformations, information representation in multiple coordinate frames, and many other. Still, a single encompassing theory about movement generation in the parietal cortex does not exist, and is a matter of debate. This study contributes to the analysis of motor intention in the 7a parietal region. The motor intention, a high-level cognitive signal, is defined as the preliminary plan for making a movement. From the engineering point of view, encoding of motor parameters in the neural activity is extensively studied within the framework of brain-computer interfaces. The motivation behind these studies is the development of neural prosthesis for the paralyzed persons. The direct cortical prosthesis can significantly improve the lives of paralyzed people, who have lost every other contact with the outside world. Also, this framework opens the possibilities for monitoring the neural processes during the execution of natural movements, and studying the mechanisms behind it. In this work, a method for identification of motor intention from the standard recordings of neural activity, the spike trains, is developed. The data of interest was collected in a series of behavioral experiments involving reaching or saccadic eye movements. The presence and absence of motor intention was monitored in various phases of motion execution, and for different types of movements. All the recordings obtained simultaneously are combined in the same decoding session. Therefore, the analysis is done using the activity of small population of cells (typically 8 to 12 cells). We aim to study the motor intention in a general context which requires using activity of multiple cells. The population size is determined by the experimental procedure. Throughout this study we assume that the motor intention can be red from the spike rates, the assumption supported by the neurophysiological studies. Therefore, all the simultaneously collected spike trains are converted into vectors of spike rates. The results of this study show that motor intention can be decoded from the spike rates. A machine-learning based algorithm is developed to analyze the presence or absence of motor intention in the obtained spike rate vectors. This algorithm, based on standard support vector machines, can distinguish between the segments of recordings that encode motor intention, from those that do not encode it. The goal of the study was to examine the precision of motor intention identification, when the activity of a randomly selected set of cells is analyzed using on such algorithm. Additionally, several relevant parameters were tested. The algorithm precision during different phases of movement execution is tested. Also, the influence of the population size and of the procedure for spike rates computation is examined. The obtained results demonstrated that the motor intention can be extracted from the neural signals with the precision of around 70% for a randomly selected set of cells. For the best groups of cells, this precision was 82%. The motor intention identification was particularly precise during the intervals of preparation and realization of saccadic eye movements. This is in accordance with the known functions of the 7a region, where the majority of cells respond to the eye movements. The algorithm precision is determined by the considered population size. For the bigger population the precision increases. Still, this conclusion holds only on average, since adding one or a couple of randomly selected cells does not have to change the result. Randomly selected cells do not necessary carry the information of interest. The influence of each of the cells, present in one set, is tested in this context. The obtained results indicate redundant coding of motor intention in the parietal cortex. Many cells carry the same information, and some of them can be removed from the set without changing the algorithm precision. Still, removing all of them degrades the result. Finally, the influence of the window size, used to compute spike rates in some of the tests is studied. In general, the precision improves when using bigger windows, the result that is consistent with the literature. Introducing the window for computing spike rates enables automatic identification of motor intention, the method suitable for the brain-computer interface applications. Finally, the analysis of the experimental data is complemented with the study of an appropriately designed model. Modeling the biological processes, in order to reveal additional functionality and test some parameters not accessible through the data, is a widely accepted approach. Still, the development of a model, sufficiently simple for implementation on the standard hardware, sufficiently tractable in the simulations, yet informative enough to capture the main processes of interest, is not straightforward. Our motivation for accepting this approach was to test several parameters that imposed themselves as important in the data analysis step. Due to the nature of the problem itself, the test on an approximative model was the only feasible tactic. The influence of the population size and the window size was assessed in this study. This, additionally, demonstrated the algorithm precision scaling as a function of the number of cells

Lowering outbound shipping costs in an online retail environment by making better fulfillment and replenishment decisions

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 181-185).As online retailing - or e-tailing - continues to grow as more and more customers buy physical goods on the internet, finding ways to reduce the cost and environmental impact of outbound shipping in this sector will become increasingly important. We investigate the impact of making poor fulfillment and replenishment decisions using data obtained from a large American online retailer. Then, we propose implementable - i.e., computationally tractable and relatively intuitive - solutions for both the fulfillment and replenishment problems, both tested either on actual data from our industrial partner or on small but realistic models. We first focus on the fulfillment problem, namely, deciding from which warehouse(s) to fulfill a customer's order when several options exist. We propose a heuristic that utilizes the dual values of a transportation linear program to estimate the opportunity cost of depleting inventory from a warehouse. This linear program values inventory at a warehouse due to both its geography and the size of its catalogue. After showing that this linear program is asymptotically optimal - using concepts developed in airline network revenue management - we then test the heuristic on industry data, showing a 1% reduction in outbound shipping costs as compared to a myopic fulfillment policy. The last part of the thesis focuses on replenishment. Every period, for each item, the network places an order to restock all the warehouses. Complicating this decision are two factors. First, the orders will not arrive immediately, but rather require a lead time to be delivered. During this time a random number of customers will place orders with the network. Second, any customer's order may be filled from any warehouse, which becomes important when warehouses stock out of an item. Therefore, it is not trivial to calculate the optimal inventory to order to each warehouse. We show that using a standard replenishment policy - popular in practice - can lead to dynamics that result in increased outbound shipping costs. We propose a replenishment policy heuristic that is intuitive and performs well on examples. This heuristic has two variants: a simpler one that assumes deterministic demand, and a more complicated one that accounts for stochasticity.by Jason Andrew Acimovic.Ph.D

Near-Field Mapping of Plasmonic Antennas by Multiphoton Absorption in Poly(methyl methacrylate)

Mapping the optical near-field response around nanoantennas is a challenging yet indispensable task to engineer light-matter interaction at the nanometer scale. Recently, photosensitive molecular probes, which undergo morphological or chemical changes induced by the local optical response of the nanostructures, have been proposed as a handy alternative to more cumbersome optical and electron-based techniques. Here, we report four-photon absorption in poly(methyl methacrylate) (PMMA) as a very promising tool for nanoimaging the optical near-field around nanostructures over a broad range of near-infrared optical wavelengths. The high performance of our approach is demonstrated on single-rod antennas and coupled gap antennas by comparing experimental maps with 3D numerical simulations of the electric near-field intensity

Sheridan School of Architectural Technology Volume 3 [W2018+S2018]

This volume shows the work of the graduating students of the Architectural Technology programme. Once again, their hard work over three years of study shows both in the variety and in the quality of their work. The work presented here was prepared in a single course but it draws from all the courses in the programme. It reflects their capabilities in design, building science, legislation, regulations, graphical representation and technology. Each piece of work represents the individual blend of these that each student possesses. As they leave Sheridan they take with them a range of knowledge and skills that will start their careers. As their careers develop some will do exactly what they thought and more will move in completely new and unexpected directions. Please enjoy the work presented here and think of the future to come.https://source.sheridancollege.ca/fast_books/1005/thumbnail.jp

A groovy kind of club: Examining the impact of new grooves rules on the PGATOUR

Abstract In January 2010, grooves on the heads of golf clubs were mandated to have less volume and rounder edges. The intention of the controversial new grooves design was to make hitting from the rough harder, thereby making driving accuracy more important. We analyze data from 2009 and 2010 to determine the impact of the new rule on golfers on the PGA TOUR. In the 1980's, those golfers who were ranked most accurate in their driving were also ranked highest on the money list. However, this correlation has steadily decreased, to the point where it is now nearly zero. We find that for 2010, the correlation between these two variables is higher, but not statistically significantly so. We then examine whether it was harder in 2010 to hit from the rough, both visually and statistically. Both approaches show that it was no more difficult to hit from the rough in 2010 than in 2009, and perhaps even easier. Lastly, we look into players' strategies to determine whether or not they are playing differently in 2010 to adjust for the new rule. We find no evidence -either visual or statistical -to suggest that players have significantly changed their styles in 2010