1,218 research outputs found
A three-dimensional model of human lip motion
No full textThesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (leaves 40-41).by Sumit Basu.M.Eng
Development of biodegradable polymer based tamoxifen citrate loaded nanoparticles and effect of some manufacturing process parameters on them: a physicochemical and in-vitro evaluation
No full textBasudev Sahana, Kousik Santra, Sumit Basu, Biswajit MukherjeeDepartment of Pharmaceutical Technology, Jadavpur University, Kolkata, IndiaAbstract: The aim of the present study was to develop nanoparticles of tamoxifen citrate, a non-steroidal antiestrogenic drug used for the treatment of breast cancer. Biodegradable poly (D, L- lactide-co-glycolide)-85:15 (PLGA) was used to develop nanoparticles of tamoxifen citrate by multiple emulsification (w/o/w) and solvent evaporation technique. Drug-polymer ratio, polyvinyl alcohol concentrations, and homogenizing speeds were varied at different stages of preparation to optimize the desired size and release profile of drug. The characterization of particle morphology and shape was performed by field emission scanning electron microscope (FE-SEM) and particle size distribution patterns were studied by direct light scattering method using zeta sizer. In vitro drug release study showed that release profile of tamoxifen from biodegradable nanoparticles varied due to the change in speed of centrifugation for separation. Drug loading efficiency varied from 18.60% to 71.98%. The FE-SEM study showed that biodegradable nanoparticles were smooth and spherical in shape. The stability studies of tamoxifen citrate in the experimental nanoparticles showed the structural integrity of tamoxifen citrate in PLGA nanoparticles up to 60°C in the tested temperatures. Nanoparticles containing tamoxifen citrate could be useful for the controlled delivery of the drug for a prolonged period.Keywords: biodegradable, nanoparticles, PLGA, stability, tamoxifen citrat
Performance analysis of the WiNC2R platform:
No full textA Cognitive Radio (CR) is an intelligent transceiver device, able to support multiple technologies, dynamic re-configurability, ease of programming and collaboration with other CR devices to improve the communication efficiency. The two key requirements for an efficient CR implementation are flexibility in operation/programming and speed.
WiNC2R (Winlab Network Centric Cognitive Radio) achieves high speed of operation using its hardware platform and flexibility using its software-configurable architecture. The current WiNC2R architecture implements an 802.11a-like OFDM flow. We evaluate the WiNC2R hardware architecture to see the modularity in the architecture, separation of data and control flow and the performance in terms of latency and throughput. To test the system, the Xilinx Bus Functional Model environment, which is designed to test the IBM standard bus-architecture-based hardware systems, is used. We use a simple ALOHA protocol in the MAC layer to communicate between two WiNC2R nodes and evaluate the performance under the best-case scenario, where the performance is only hindered by the architecture itself rather than external conditions like channel state.
The results of our basic experiments showed that for a single OFDM 802.11a-like flow, the Unit Control Modules (UCM) were idle for almost 80% of the total processing time.
We then tested the WiNC2R system to study the effects of changing the frame size. It was seen that the latencies in the WiNC2R transmitter are frame-size dependent while those in the receiver mainly depend on the size of the data in the last chunk rather than the size of the whole frame. We suggest that chunk size should be 2 OFDM symbols, and chunking be moved to MAC layer for better performance. We give analytical estimates of resulting performance improvement. In the next experiment, we describe virtualization in the WiNC2R by adding more flows. We describe the steps to implement the additional flows and estimate maximum number of concurrent flows possible.
In the last analysis, we show the effect of operating clock frequency on the performance. We prove that at 250 MHz operating frequency and 2 OFDM symbols per chunk, the current WiNC2R implementation will be able to satisfy the SIFS criterion.M.S.Includes bibliographical references (p. 72-73)by Sumit Satarka
Conversational scene analysis
No full textThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 106-109).In this thesis, we develop computational tools for analyzing conversations based on nonverbal auditory cues. We develop a notion of conversations as being made up of a variety of scenes: in each scene, either one speaker is holding the floor or both are speaking at equal levels. Our goal is to find conversations, find the scenes within them, determine what is happening inside the scenes, and then use the scene structure to characterize entire conversations. We begin by developing a series of mid-level feature detectors, including a joint voicing and speech detection method that is extremely robust to noise and microphone distance. Leveraging the results of this powerful mechanism, we develop a probabilistic pitch tracking mechanism, methods for estimating speaking rate and energy, and means to segment the stream into multiple speakers, all in significant noise conditions. These features gives us the ability to sense the interactions and characterize the style of each speaker's behavior. We then turn to the domain of conversations. We first show how we can very accurately detect conversations from independent or dependent auditory streams with measures derived from our mid-level features. We then move to developing methods to accurately classify and segment a conversation into scenes. We also show preliminary results on characterizing the varying nature of the speakers' behavior during these regions. Finally, we design features to describe entire conversations from the scene structure, and show how we can describe and browse through conversation types in this way.by Sumit Basu.Ph.D
On the importance of thermo-elastic cooling in the fracture of glassy polymers at high rates
No full textAbstractIn a previous thermo-mechanical analysis [Estevez, R., Basu, S., van der Giessen, E., 2005. Analysis of temperature effects near mode I cracks in glassy polymers. Int. J. Fract. 132, 249–273] in which shear yielding of the bulk and failure by crazing were accounted for, we examined which of these two viscoplastic processes contributed to heat in mode I fracture. The present study completes this work by investigating the conditions for thermo-elastic cooling prior to crack propagation as reported experimentally by Rittel [Rittel, D., 1998. Experimental investigation of transient thermo-elastic effects in dynamic fracture. Int. J. Solids Struct. 35, 2959–2973] and Bougaut and Rittel [Bougaut, O., Rittel, D., 2001. On crack tip cooling during dynamic crack propagation. Int. J. Solids Struct. 38, 2517–2532] on high strain rate loading of PMMA. To this end, coupled thermo-mechanical finite element simulations are carried out by accounting for the thermo-elastic source, in addition to the heat sources related to shear yielding and crazing. The bulk as well as cohesive zone parameters for crazing realistically describe PMMA as they are obtained from detailed calibration experiments. Our results show that if significant thermo-elastic cooling has to be observed in the vicinity of the crack tip of a polymeric material, suppression of shear yielding as well as suppression of crazing is necessary. It seems that at these high strain rates a brittle fracture mechanism activated at very high stresses takes over from crazing, or at least that craze initiation occurs for stress levels very different to those for quasi-static conditions
Query optimization in mobile environments
No full textWe consider the issue of optimizing queries for distributed processing in mobile environment. An interesting characteristic of mobile machines is that they depend on battery as a source of energy which may not be substantial enough. Hence, the appropriate optimization criterion in a mobile environment considers both resource utilization and energy consum- ption at the mobile client.
In this scenario, the optimal plan for a query depends on the residual battery level of the mobile client and the load at the server. We approach this problem by compiling a query into a sequence of candidate plans, such that for any state of the client-server system, the optimal plan is one of the candidate plans.
A general solution is proposed by adapting the partial order dynamic programming search algorithm (p.o dp) such that the coverset of the query is the set of candidate plans. We propose two novel algorithms, namely, the linear combinations algorithm and the linearset algorithm (referred to as the linear algorithms) that compute the linearset of a query. The linear- set of a query is an approximation to the coverset returned by p.o. dp.
We show, by means of simulation, that (1) the linearset is an excellent approximation of the coverset, (2) query compilation using the linear algorithms outperform query compilation using p.o. dp by factors ranging from 2 to 9, (3) the time taken to compile queries using the linear algorithms for the general optimization criterion is at most twice the time taken by a System R* like standard query optimizer search algorithm, and (4) the run time overhead incurred by the linear algorithms technique is minimal.
The techniques presented in the paper are of general applicability to multi-criterion optimization problems in distributed databases, where each criterion is an additive metric.Technical report lcsr-tr-21
Interactive machine learning for complex graphics selection
No full textThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Cataloged from student-submitted PDF version of thesis.Includes bibliographical references (pages 89-91).Modern vector graphics editors support the creation of a wonderful variety of complex designs and artwork. Users produce highly realistic illustrations, stylized representational art, even nuanced data visualizations. In light of these complex graphics, selections, representations of sets of objects that users want to manipulate, become more complex as well. Direct manipulation tools that artists and designers find accessible and useful for editing graphics such as logos and icons do not have the same applicability in these more complex cases. Given that selection is the first step for nearly all editing in graphics, it is important to enable artists and designers to express these complex selections. This thesis explores the use of interactive machine learning techniques to improve direct selection interfaces. To investigate this approach, I created Insight, an interactive machine learning selection tool for making a relevant class of complex selections: visually similar objects. To make a selection, users iteratively provide examples of selection objects by clicking on them in the graphic. Insight infers a selection from the examples at each step, allowing users to quickly understand results of actions and reactively shape the complex selection. The interaction resembles the direct manipulation interactions artists and designers have found accessible, while helping express complex selections by inferring many parameter changes from simple actions. I evaluated Insight in a user study of digital designers and artists, finding that Insight enabled users to effectively and easily make complex selections not supported by state-of-the-art vector graphics editors. My results contribute to existing work by both indicating a useful approach for providing complex representation access to artists and designers, and showing a new application for interactive machine learning.by Sumit Gogia.M. Eng
Optimizing queries for coarse grain parallelism
No full textWe consider the problem of optimizing select-project-join relational queries for minimum response time on parallel machines. The design of the optimizer is based on three ideas: (1) the concept and quantification of degree of coarse grain parallelism for an execution tree, (2) the design of a parallelizing scheduler for a tree of coarse grain operations which is provably near optimal, and (3) the analysis of the scheduling algorithm to obtain a cost formula for parallel execution time. The search algorithm of the optimizer is presented as a multi-dimensional dynamic programming algorithm. We present two three- dimensional search algorithms for the case when placement of relations in the parallel machine do not overlap. We propose the tree placement strategy and demonstrate, by means of examples, how the number of dimensions in the search can be significantly reduced, thereby increasing the efficiency of the search algorithm.Technical report lcsr-tr-21
Characterizing Logarithmic Bregman Functions
No full textMinimum divergence procedures based on the density power divergence and the
logarithmic density power divergence have been extremely popular and successful
in generating inference procedures which combine a high degree of model
efficiency with strong outlier stability. Such procedures are always preferable
in practical situations over procedures which achieve their robustness at a
major cost of efficiency or are highly efficient but have poor robustness
properties. The density power divergence (DPD) family of Basu et al.(1998) and
the logarithmic density power divergence (LDPD) family of Jones et al.(2001)
provide flexible classes of divergences where the adjustment between efficiency
and robustness is controlled by a single, real, non-negative parameter. The
usefulness of these two families of divergences in statistical inference makes
it meaningful to search for other related families of divergences in the same
spirit. The DPD family is a member of the class of Bregman divergences, and the
LDPD family is obtained by log transformations of the different segments of the
divergences within the DPD family. Both the DPD and LDPD families lead to the
Kullback-Leibler divergence in the limiting case as the tuning parameter
. In this paper we study this relation in detail, and
demonstrate that such log transformations can only be meaningful in the context
of the DPD (or the convex generating function of the DPD) within the general
fold of Bregman divergences, giving us a limit to the extent to which the
search for useful divergences could be successful.Comment: Current Status : Submitted to Pattern Recognition Letter
- …
