Where’s the Winner? Max-Finding and Sorting with Metric Costs (2009)
Abstract. Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work, etc.);...
Stochastic Steiner Tree with Non-Uniform Inflation (2009)
Anupam Gupta, Mohammadtaghi Hajiaghayi, Amit Kumar, Sloan Fellowship
Abstract. We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this problem. In...
Scheduling with Outliers (2009)
Gupta, Anupam, Krishnaswamy, Ravishankar, Kumar, Amit, Segev, Danny
In classical scheduling problems, we are given jobs and machines, and have to schedule all the jobs to minimize some objective function. What if each job has a specified profit, and we are no longer...
AND THROUGHPUT OVERHEAD. WE PROPOSE REDUCING ENERGY AND DELAY, AND (2009)
Amit Kumar, Li-shiuan Peh, Partha Kundu, Niraj K. Jha
to wire scaling and increasing bandwidth demands, packet-switched on-chip networks are quickly replacing shared buses and dedicated wires as the de facto interconnection fabric in general-purpose...
NoC with Near-Ideal Express Virtual Channels Using Global-Line Communication (2009)
Tushar Krishna, Amit Kumar, Patrick Chiang, Mattan Erez, Li-shiuan Peh
As processor core counts increase, networks-on-chip (NoCs) are becoming an increasingly popular interconnection fabric due to their ability to supply high bandwidth. However, NoCs need to deliver...
CFD Modeling of Gas-Liquid-Solid Fluidized Bed (2009)
Gas–liquid–solid fluidized beds are used extensively in the refining, petrochemical, pharmaceutical,biotechnology, food and environmental industries. Some of these processes use solids whose...
33.3 HybDTM: A Coordinated Hardware-Software Approach for Dynamic Thermal Management ∗ (2009)
Amit Kumar, Li Shang, Li-shiuan Peh, Niraj K. Jha
With ever-increasing power density and cooling costs in modern high-performance systems, dynamic thermal management (DTM) has emerged as an effective technique for guaranteeing thermal safety at...
On Configuring BGP Route Reflectors (2009)
Yuri Breitbart, Minos Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi
Abstract — The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today’s Internet. Within an AS,...
Sara Ahmed, Marcus Moench, Sarah Opitz-stapleton, Shashikant Chopde, Daanish Mustafa, Ajaya Dixit, ...
International
RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks (2008)
Shu Du, Amit Kumar, Saha David, B. Johnson
Abstract—Duty-cycle MAC protocols have been proposed to meet the demanding energy requirements of wireless sensor networks. Although existing duty-cycle MAC protocols such as S-MAC are power...
An ECO Technique for Removing Crosstalk Violations in Clock Networks (2008)
Amit Kumar, Krishnendu Chakrabarty
Abstract — Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix crosstalk...
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for greater exibility since...
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for greater exibility since...
A SYSTEM FOR AUTOMATIC EVALUATION OF PROGRAMS FOR CORRECTNESS AND PERFORMANCE (2008)
Amit Kumar, Mandal Chittaranjan Mandal, Chris Reade
Abstract: This paper describes a model and implementation of a system for automatically testing, evaluating, grading and providing critical feedback for the submitted programming assignments....
RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks (2008)
Shu Du, Amit Kumar, Saha David, B. Johnson
Abstract—Duty-cycle MAC protocols have been proposed to meet the demanding energy requirements of wireless sensor networks. Although existing duty-cycle MAC protocols such as S-MAC are power...
Cary Gillenwater, Amit Kumar, Brian Moynihan, Jeff Vandrimmelen
This document proposes a study on the use of haptic devices in an educational setting. Devices that employ “haptics ” provide a touch-based/force feedback system of interaction with virtual...
Feature Based Occupancy Grid Maps for Sonar Based Safe-Mapping (2008)
Amit Kumar, Pandey K Madhava, Krishna Mainak Nath
This paper presents a methodology for integrating features within the occupancy grid (OG) framework. The OG maps provide a dense representation of the environment. In particular they give information...
Order Scheduling Models: Hardness and Algorithms (2008)
Naveen Garg, Amit Kumar, Vinayaka P
Abstract. We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a single type....
Stochastic Steiner Tree with Non-Uniform Inflation (2008)
Anupam Gupta, Mohammadtaghi Hajiaghayi, Amit Kumar
Abstract. We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this problem. In...
Linear and Nonlinear Optical constants of BiFeO_3 (2008)
Kumar, Amit, Rai, R., Podraza, Nikolas, Denev, Sava, Ramirez, Mariola, Chu, Ying-Hao, ...
Using spectroscopic ellipsometry, the refractive index and absorption versus wavelength of the ferroelectric antiferromagnet Bismuth Ferrite, BiFeO_3 is reported. The material has a direct band-gap...
Kevin R Nicholas, Amit Kumar, Yvan Strahm, David Powell, Torsten Seemann, Kerry A. Daly, ...
Delivering bioinformatics power to life science researchers inevitably runs into problems of limited computing resources in the context of exponentially increasing data sources, access time, costs,...
Kevin R Nicholas, Amit Kumar, Yvan Strahm, David Powell, Torsten Seemann, Kerry A. Daly, ...
Delivering bioinformatics power to life science researchers inevitably runs into problems of limited computing resources in the context of exponentially increasing data sources, access time, costs,...
Solubility of volatile organic compounds in polymers : effect of polymer type and processing (2008)
Dingemans, Maarten, Dewulf, Jo, Kumar, Amit, Van Langenhove, Herman
Removal of dimethyl sulfide in a thermophilic membrane bioreactor (2008)
Luvsanjamba, Munkhtsetseg, Kumar, Amit, Van Langenhove, Herman
All-Norms and All-L_p-Norms Approximation Algorithms (2008)
Golovin, Daniel, Gupta, Anupam, Kumar, Amit, Tangwongsan, Kanat
In many optimization problems, a solution can be viewed as ascribing a ``cost'' to each client, and the goal is to optimize some aggregation of the per-client costs. We often optimize some $L_p$-norm...
MammoSapiens: eResearch of the lactation program. (2008)
Nicholas, Kevin R, Kumar, Amit, Strahm, Yvan, Powell, David, Seemann, Torsten, Daly, Kerry A., ...
Delivering bioinformatics power to life science researchers inevitably runs into problems of limited computing resources in the context of exponentially increasing data sources, access time, costs,...
Digital Library of Dental Radiographs (2007)
This paper addresses the need for a comprehensive database of dental radiographs that serves as an image repository for the dental students and faculty. The main purpose of this project is to the lay...
Digital Library of Dental Radiographs (2007)
This paper addresses the need for a comprehensive database of dental radiographs that serves as an image repository for the dental students and faculty. The main purpose of this project is to the lay...
Phosphoinositide 3–kinase γ participates in T cell receptor–induced T cell activation (2007)
Alcázar, Isabela, Marqués, Miriam, Kumar, Amit, Hirsch, Emilio, Wymann, Matthias, Carrera, Ana C., ...
11 pages, 8 figures.-- PMID: 17998387 [PubMed].-- PMCID: PMC2118532.-- Printed version published Nov 26, 2007.
Daniel B. Costa, Balázs Halmos, Amit Kumar, Susan T. Schumer, Mark S. Huberman, Titus J. Boggon, ...
BackgroundEpidermal growth factor receptor (EGFR) mutations are present in the majority of patients with non-small cell lung cancer (NSCLC) responsive to the EGFR tyrosine kinase inhibitors (TKIs)...
Summary: A reaction progress variable approach is developed for subgrid scale (SGS) modeling of non-premixed turbulent diffusion flames with soot. Two-phase state-relations are constructed using...
A reaction progress variable approach for LES of strongly radiating sooty flames (2007)
Thesis (M.S.)--State University of New York at Buffalo, 2007.
Costa, Daniel B, Halmos, Bal Zs, Kumar, Amit, Schumer, Susan T, Huberman, Mark S, Boggon, Titus J, ...
BACKGROUND: Epidermal growth factor receptor (EGFR) mutations are present in the majority of patients with non-small cell lung cancer (NSCLC) responsive to the EGFR tyrosine kinase inhibitors (TKIs)...
Amit Kumar, Sarma Barch Msc, Marcus Beale Architects
This paper examines planned community markets in New Delhi, India and proposes that the spatial and configurational properties of the markets as embedded in the urban grid can, in part, explain their...
Express Virtual Channels: Towards the Ideal Interconnection Fabric (2007)
Amit Kumar, Li-shiuan Peh, Partha Kundu, Niraj K. Jha
Due to wire delay scalability and bandwidth limitations inherent in shared buses and dedicated links, packet-switched on-chip interconnection networks are fast emerging as the pervasive communication...
A 4.6Tbits/s 3.6GHz Single-cycle NoC Router with a Novel Switch Allocator (2007)
Amit Kumar, Partha Kundu, Arvind P. Singh, Li-shiuan Peh, Niraj K. Jha
As chip multiprocessors (CMPs) become the only viable way to scale up and utilize the abundant transistors made available in current microprocessors, the design of on-chip networks is becoming...
All-norms and all-Lp-norms approximation algorithms (2007)
Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan
work was done while the author was at Max-Planck-Institut für Informatik, Saarbrücken, Germany.
All-norms and all-Lp-norms approximation algorithms (2007)
Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan
ABSTRACT. In many optimization problems, a solution can be viewed as ascribing a “cost ” to each client, and the goal is to optimize some aggregation of the per-client costs. We often optimize...
Textural evolution during accumulative roll bonding of an Al–Li alloy (2006)
Ghosh Chowdhury, S, Dutta, Abhijit, Ravi Kumar, B, Kumar, Amit
Texture evolution during accumulative roll bonding (ARB) of Al–Li alloy has been investigated up to three passes. The grain size after third pass is 450 nm. It has been seen that the textural...
Biomethanation of sugar industry wastewater by using down-flow anaerobic filter (2006)
Kumar, Amit, Sercu, Bram, Kumar, V., Sapkal, DB, Gunjal, BB, Van Langenhove, Herman
CONTROL FLOW OBFUSCATION COMPLEXITY (2005)
Obfuscation of code is used to make platform independent languages like JAVA, which can be easily decompiled, difficult to reverse engineer. Control flow obfuscation has been suggested to obfuscate...
Thesis (Ph.D.) - - - Medical College of Wisconsin, 2005
Control flow obfuscation complexity / (2005)
Thesis (M.S.)--University of Cincinnati 2005.
Amit Kumar, Richa Kaushik, Ekta Varshney, Anjana Kashyap, Manoj Kumar Kashyap
The present study was designed to a systematic screening for the potential isolates of P. chrysogenum from Indian soils (Haridwar and Dehradun districts of Uttaranchal state) and their antibacterial...
Amit Kumar, Richa Kaushik, Anjana Kashyap, Manoj Kumar Kashyap
The present study designed to investigate the antibacterial activity of honey obtained from different state of India. A total of 10 honey samples (five from Uttaranchal state and five from Uttar...
Minimizing Average Flow Time on Related Machines (2005)
Abstract We give the first on-line poly-logarithmic competitve algorithm for minimizing average flowtime with preemption on related machines, i.e., when machines can have different speeds. This also...
XML stream processing using tree-edit distance embeddings (2005)
We propose the first known solution to the problem of correlating, in small space, continuous streams of XML data through approximate (structure and content) matching, as defined by a general...
Linear time algorithms for clustering problems in any dimensions (2005)
Amit Kumar, Yogish Sabharwal, Eep Sen
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certain properties...
: A Repository Management System for TEI Documents (2005)
Kumar, Amit, Schreibman, Susan, Arneil, Stewart, Holmes, Martin, Bia, Alejandro, Walsh, John
Digital Humanities (DH) and Digital Library (DL) projects are complex systems that require specialized programming skills. Many encoders cannot take their work to the next level by transforming their...
: A Repository Management System for TEI Documents (2005)
Kumar, Amit, Schreibman, Susan, Arneil, Stewart, Holmes, Martin, Bia, Alejandro, Walsh, John
Digital Humanities (DH) and Digital Library (DL) projects are complex systems that require specialized programming skills. Many encoders cannot take their work to the next level by transforming their...
: A Repository Management System for TEI Documents (2005)
Kumar, Amit, Schreibman, Susan, Arneil, Stewart, Holmes, Martin, Bia, Alejandro, Walsh, John
Digital Humanities (DH) and Digital Library (DL) projects are complex systems that require specialized programming skills. Many encoders cannot take their work to the next level by transforming their...
Multi-processor Scheduling to Minimize Flow Time with epsilon Resource Augmentation (2004)
Chekuri, Chandra, Goel, Ashish, Khanna, Sanjeev, Kumar, Amit
We investigate the problem of online scheduling of jobs to minimize flow time and stretch on m identical machines. We consider the case where the algorithm is given either (1 + ε)m machines or m...
Thermal Modeling, Characterization and Management of On-chip Networks (2004)
Li Shang, Li-shiuan Peh, Amit Kumar, Niraj K. Jha
Due to the wire delay constraints in deep submicron technology and increasing demand for on-chip bandwidth, networks are becoming the pervasive interconnect fabric to connect processing elements on...
Thermal Modeling, Characterization and Management of On-Chip Networks (2004)
Li Shang, Li-shiuan Peh, Amit Kumar, Niraj K. Jha
Due to the wire delay constraints in deep submicron technology and increasing demand for on-chip bandwidth, networks are becoming the pervasive interconnect fabric to connect processing elements on...
Maximum coverage problem with group budget constraints and applications (2004)
Abstract. We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2,..., Sm}...
A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions (2004)
We present the first linear time (1+ε)-approximation algorithm for the k-means problem for fixed k and ε. Our algorithm runs in O(nd) time, which is linear in the size of the input. Another feature...
Design and Evaluation of a Metropolitan Area Multitier Wireless Ad Hoc Network Architecture (2003)
Jorjeta G. Jetcheva, Yih-chun Hu, Santashil Palchaudhuri, Amit Kumar, Saha David, B. Johnson
Few real-world applications of mobile ad hoc networks have been developed or deployed outside the military environment, and no traces of actual node movement in a real ad hoc network have been...
Design and Evaluation of a Metropolitan Area Multitier Wireless Ad Hoc Network Architecture (2003)
Jorjeta G. Jetcheva, Yih-chun Hu, Santashil Palchaudhuri, Amit Kumar, Saha David, B. Johnson
Few real-world applications of mobile ad hoc networks have been developed or deployed outside the military environment, and no traces of actual node movement in a real ad hoc network have been...
Design and Evaluation of a Metropolitan Area Multitier Wireless Ad Hoc Network Architecture (2003)
Jorjeta G. Jetcheva, Yih-chun Hu, Santashil Palchaudhuri, Amit Kumar, Saha David, B. Johnson
Few real-world applications of mobile ad hoc networks have been developed or deployed outside the military environment, and no traces of actual node movement in a real ad hoc network have been...
Anupam Gupta, Amit Kumar, Martin Pal, Tim Roughgarden
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of...
Simpler and Better Approximation Algorithms for Network Design (2003)
Anupam Gupta, Amit Kumar, Tim Roughgarden
We give simple and easy-to-analyze randomized approximation algorithms for several well-studied NP-hard network design problems. Our algorithms improve over the previously best known approximation...
Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of...
Optimal Configuration of OSPF Aggregates (2003)
Rajeev Rastogi, Yuri Breitbart, Minos Garofalakis, Associate Member, Amit Kumar
Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands of subnets, OSPF...
Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
We study the multicommodity rent-or-buy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a per-unit of...
Simpler and better approximation algorithms for network design (2003)
Anupam Gupta, Amit Kumar, Tim Roughgarden
We give simple and easy-to-analyze randomized approximation algorithms for several well-studied NP-hard network design problems. Our algorithms improve over the previously best known approximation...
Schreibman, Susan, Kumar, Amit, McDonald, Jarom
This article describes the background and architecture of The Versioning Machine, a software tool designed to display and compare multiple versions of texts. The display environment provides for...
Algorithms for network management / (2002)
Thesis (Ph. D.)--Cornell University, Aug. 2002.
Optimal configuration of OSPF aggregates (2002)
Rajeev Rastogi, Yuri Breitbart, Minos Garofalakis, Amit Kumar
Abstract—Open Shortest Path First (OSPF) is a popular protocol for routing within an Autonomous System (AS) domain. In order to scale for large networks containing hundreds and thousands of...
Primal-dual algorithms for connected facility location problems (2002)
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F ⊆ V, and a set of clients D ⊆ V. Facility i has a facility...
Optimal configuration of OSPF aggregates (2002)
Rajeev Rastogi, Yuri Breitbart, Minos Garofalakis, Amit Kumar
Abstract—Open Shortest Path First (OSPF) is a popular protocol for routing within an Autonomous System (AS) domain. In order to scale for large networks containing hundreds and thousands of...
A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem (2002)
Amit Kumar, Anupam Gupta, Tim Roughgarden
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity...
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem (2002)
Amit Kumar, Anupam Gupta, Tim Roughgarden
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity...
Primal-dual algorithms for connected facility location problems (2002)
Abstract. We consider the Connected Facility Location problem. We are given a graph G = (V, E) with cost ce on edge e, a set of facilities F ⊆ V, and a set of demands D ⊆ V. We are also given a...
A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem (2002)
Amit Kumar, Anupam Gupta, Tim Roughgarden
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity...
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem (2002)
Amit Kumar, Anupam Gupta, Tim Roughgarden
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of multicommodity...
Primal-dual algorithms for connected facility location problems (2002)
Abstract We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs { ce} on the edges, a set of facilities F ` V, and a set of clients D ` V. Facility i has a...
In this thesis, the morphology, crystallization and melting behavior of polypropylene copolymers (propylene/ethylene, propylene/1-butene, propylene/1-hexene and propylene/1-octene) has been examined....
In this thesis, the morphology, crystallization and melting behavior of polypropylene copolymers (propylene/ethylene, propylene/1-butene, propylene/1-hexene and propylene/1-octene) has been examined....
Algorithms for provisioning virtual private networks in the hose model (2001)
Amit Kumar, Rajeev Rastogi, Avi Silberschatz, Bulent Yener
with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for greater flexibility since it permits traffic to and from a hose endpoint to...
Provisioning a virtual private network: A network design problem for multicommodity flow (2001)
Anupam Gupta, Jon Kleinberg, Amit Kumar, Rajeev Rastogi, Bulent Yener
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs) are services that...
Provisioning a Virtual Private Network: A network design problem for multicommodity flow (2001)
Anupam Gupta, Jon Kleinberg, Amit Kumar, Rajeev Rastogi, Bulent Yener
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs) are services that...
Connectivity and Inference Problems for Temporal Networks (2000)
David Kempe, Jon Kleinberg, Amit Kumar
Many network problems are based on fundamental relationships involving time. Consider, for example, the problems of modeling the flow of information through a distributed network, studying the spread...
Fairness Measures for Resource Allocation (2000)
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate...
Fairness measures for resource allocation (2000)
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, with one coordinate...
Wavelength Conversion in Optical Networks (1999)
Jon Kleinberg Amit, Amit Kumar
In many models of optical routing, we are given a set of communication paths in a network, and we must assign a wavelength to each path so that paths sharing an edge receive di#erent wavelengths. The...
Wavelength Conversion in Optical Networks (1998)
In many models of optical routing, we are given a set of communication paths in a network, and we must assign a wavelength to each path so that paths sharing an edge receive different wavelengths....
Modification of polymer interfaces by block copolymers / (1996)
Thesis (M.S.)--University of Minnesota, 1996.
Fang Feng, Wei Zhao, Amit Kumar
The development of high-speed networks makes multimedia communication services possible [13, 15, 21]. Such services include teleconferencing, video telephony, video-on-demand, distant learning,...
Fang Feng, Amit Kumar, Wei Zhao
The Fiber Distributed Data Interface (FDDI) is recommended as a candidate for many hard real-time local-area communication systems. The Timed-Token Medium Access Control (MAC) Protocol of FDDI is...
Real-time communication in FDDI-based reconfigurable networks (1994)
Wei Zhao, Amit Kumar, Gopal Agrawal, Sanjay Kamat, Nicholas Malcolm, Biao Chen
We report our ongoing research in real-time communication with FDDI-based reconfigurable networks. The original FDDI architecture was enhanced in order to improve its fault-tolerance capability while...
Real-time communication in FDDI-based reconfigurable networks (1994)
Wei Zhao, Amit Kumar, Gopal Agrawal, Sanjay Kamat, Nicholas Malcolm, Biao Chen
We report our ongoing research in real-iime com-munication with FDDI-based reconfigumble networks. The original FDDI archiieciure was enhanced in or-der to improve tis fauli-iolemnce capability while...
Charge transfer studies of semiconductor interfaces / (1992)
Thesis (Ph. D.)--California Institute of Technology, 1992.
M.S.
Studies of silicon photoelectrochemical cells under high injection conditions (1990)
The behavior of Si/CH3OH-dimethylferrocene+/0 junctions has been investigated under high injection conditions. Open circuit voltages of (626±5) mV were obtained at short circuit photocurrent...
Fabrication of minority-carrier-limited n-Si/insulator/metal diodes (1990)
Kumar, Amit, Rosenblum, Mark D., Gilmore, Delwyn L., Tufts, Bruce J., Rosenbluth, Mary L., Lewis, Nathan S.
A photoelectrochemical anodization technique has been used to fabricate n-Si/insulator/metal (MIS) diodes with improved electrical properties. MIS structures fabricated with Au have provided the...
CONTROL FLOW OBFUSCATION COMPLEXITY
Obfuscation of code is used to make platform independent languages like JAVA, which can be easily decompiled, difficult to reverse engineer. Control flow obfuscation has been suggested to obfuscate...
Phosphoinositide 3–kinase γ participates in T cell receptor–induced T cell activation
Alcázar, Isabela, Marqués, Miriam, Kumar, Amit, Hirsch, Emilio, Wymann, Matthias, Carrera, Ana C., ...
Class I phosphoinositide 3–kinases (PI3Ks) constitute a family of enzymes that generates 3-phosphorylated polyphosphoinositides at the cell membrane after stimulation of protein tyrosine (Tyr)...
Marqués, Miriam, Kumar, Amit, Cortés, Isabel, Gonzalez-García, Ana, Hernández, Carmen, Moreno-Ortiz, M. Carmen, ...
Phosphoinositide 3-kinase (PI3K) is an early signaling molecule that regulates cell growth and cell cycle entry. PI3K is activated immediately after growth factor receptor stimulation (at the G0/G1...
Detection of Cancer with Serum miRNAs on an Oligonucleotide Microarray
Lodes, Michael J., Caraballo, Marcelo, Suciu, Dominic, Munro, Sandra, Kumar, Amit, Anderson, Brooke
Micro RNAs (miRNAs) are a class of small, non-coding RNA species that play critical roles throughout cellular development and regulation. miRNA expression patterns taken from various tissue types...
Specific function of phosphoinositide 3-kinase beta in the control of DNA replication
Marqués, Miriam, Kumar, Amit, Poveda, Ana M., Zuluaga, Susana, Hernández, Carmen, Jackson, Shaun, ...
Class IA phosphoinositide 3-kinase (PI3K) are enzymes comprised of a p85 regulatory and a p110 catalytic subunit that induce formation of 3-polyphosphoinositides, which activate numerous downstream...