Patent application number | Description | Published |
20090319252 | METHOD AND APPARATUS FOR EXTRACTING ASSUME PROPERTIES FROM A CONSTRAINED RANDOM TEST-BENCH - One embodiment of the present invention provides systems and techniques to extract assume properties from a constrained random test-bench. During operation, the system can receive a constrained random test-bench for verifying the design-under-test (DUT), wherein the constrained random test-bench includes a statement which assigns a random value to a random variable according to a constraint. Next, the system can modify the constrained random test-bench by replacing the statement with another statement which assigns a free input variable's value to the random variable. The system can also add a statement to the constrained random test-bench that toggles a marker variable to localize the scope of the statement. The system can then generate an assume property which models the constraint on the free input variable. The assume property can then be used by a formal property verification tool to verify the DUT. | 12-24-2009 |
20120227022 | Technique For Honoring Multi-Cycle Path Semantics In RTL Simulation - An enhanced RTL simulation including information regarding multi-cycle paths is provided. The multi-cycle path information, which is available in the design constraint file, can be used for timing analysis during RTL simulation. This information can advantageously augment the RTL simulation engine to approximate the cycle delays at the destination registers, thereby providing a more realistic approximation of circuit behavior at the RTL level. Notably, RTL simulation is orders of magnitude faster than gate level simulation. Moreover, design bugs associated with multi-cycle paths are more easily corrected during RTL simulation compared to waiting until the gate level simulation. | 09-06-2012 |
20140258954 | RANKING VERIFICATION RESULTS FOR ROOT CAUSE ANALYSIS - Verification-result ranking techniques for root cause analysis are disclosed using violation report analysis and violation weighting. Violation reports are unwieldy and result from a variety of design and process checks. The check coverage can overlap, causing a specific violation to trigger multiple reported violations. High turn around times for violation report analysis increase the risk that selective violation analysis will inadvertently suppress real design bugs. This reduces the odds that static checker reports alone will meet design sign-off criteria. Determining relationships among a plurality of violations for a design permits clustering violations into hot spots. Identification of primary and subsequent contributors to the plurality of violations is based on the relationships among violations. The hot spot with the highest weight is identified, and then subsequent violations are identified to maximize violation coverage. The result is greater efficiency of design violation identification and resolution. | 09-11-2014 |
20150121326 | Functional Verification of a Circuit Description - A method for functional verification of a circuit description comprises generating a first set of crossover paths based on the circuit description, generating a low power information based on a power design description associated with the circuit description, the low power information determining a set of power state combinations, and generating a second set of crossover paths based on the first set of crossover paths and the low power information, the second set of crossover paths being a subset of the first set of crossover paths. Each of the second set of crossover paths is evaluated to identify circuit description errors, in particular functional circuit description errors. | 04-30-2015 |
20150131894 | VERIFICATION OF CIRCUIT STRUCTURES INCLUDING SUB-STRUCTURE VARIANTS - A method for controlling the functional output of a verification tool upon receipt of a circuit description comprises searching for a predetermined base pattern in the circuit description. The method further comprises searching for predetermined sub-patterns that are assigned to the base pattern, in the circuit description. The method further comprises the validation of each found sub-pattern based on a predetermined rule to minimize the set of reported errors that based on verification of the circuit description. | 05-14-2015 |
Patent application number | Description | Published |
20150253967 | AUTOMATIC VARIABLE ZOOMING SYSTEM FOR A PROJECT PLAN TIMELINE - A system is provided that performs automatic variable zooming. The system displays a project plan timeline within a user interface, where a project plan timeline includes one or more tasks and a timeline includes one or more time units. The system further receives an instruction to invoke automatic variable zooming on the displayed project plan timeline. The system further receives a criteria. The system further calculates one or more scores for the one or more time units of the project plan timeline based on the criteria. The system further adjusts a zoom level for one or more portions of the project plan timeline based on the one or more calculated scores. | 09-10-2015 |
20150254373 | GRAPHICAL TOP-DOWN PLANNING SYSTEM - A system is provided that visually represents a planning structure. The system displays a node that represents an element of the planning structure and a value associated with the element within a user interface. The system further receives a first user interaction that is a movement of a cursor over the node in a direction. The system further generates child elements within the planning structure in response to the first user interaction, where the child elements are children of the element. The system further generates values associated with the child elements, where a combination of the values is equal to the original value. The system further displays child nodes that represent the child elements and the values within the user interface. The system further displays lines between the node and the child nodes, where each line represents a parent-child relationship. | 09-10-2015 |
20150317595 | AUTOMATIC TASK ASSIGNMENT SYSTEM - A system is provided that automatically assigns tasks to resources. The system receives a notification that a resource is about to enter an idle period or has entered the idle period. The system further automatically assigns a filler task or a portion of the filler task to the resource, where the filler task is a task that can be split into multiple portions. The system further receives a notification that the resource is about to exit the idle period or has exited the idle period. The system further automatically un-assigns the filler task or the portion of the filler task from the resource. | 11-05-2015 |
20150324728 | DYNAMIC TASK DISTRIBUTION SYSTEM - A system is provided that that dynamically distributes tasks. The system calculates scores for tasks, where each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task. The system further determines an order that the tasks are executed based on the scores. The system further displays the tasks and a project plan timeline within a user interface, where the tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. The system further determines a buffer time distribution for the tasks based on the scores. The system further displays the tasks within the project plan timeline based on the buffer time distribution for the tasks. | 11-12-2015 |
20150347944 | VISUAL RESOURCE ALLOCATION SYSTEM - A system is provided that visualizes an allocation of resources. The system displays a chart, where the chart includes a list of tasks and a timeline including time units. The system further displays task indicators within the timeline of the chart, where a task indicator includes task indicator segments, and where an area of a task indicator segment is proportional to a work scope of a resource allocated to a corresponding task. The system further receives a user interaction that includes a movement of the task indicator segment from a first task indicator that corresponds to a first task to a second task indicator that corresponds to a second task. The system further allocates the resource from the first task to the second task. The system further modifies the display of at least one task indicator within the timeline of the chart based on the allocation of the resource. | 12-03-2015 |
20150356518 | AGGREGATE TASK SYSTEM - A system is provided that manages tasks. The system defines an aggregate task including aggregate parts, where each aggregate part is an individual task that is a part of the aggregate task, and where the aggregate task defines a sequence of the aggregate parts. The system further displays the aggregate task and a project plan timeline within a user interface, where the aggregate task is displayed within the project plan timeline, and where the aggregate task is displayed as an aggregate task indicator including aggregate part indicators separated by dividers. | 12-10-2015 |
Patent application number | Description | Published |
20140244334 | FACILITATING ALLOCATION OF RESOURCES TO TASKS - An aspect of the present invention facilitates allocation of resources to tasks. In an embodiment, a user provides inputs representing tasks, resources, and duration of allocation of each of the resources to respective tasks in respective days. A unified graphical interface (UGI) indicating the tasks, the corresponding resources allocated for each task, and an extent of utilization of each resource in each day, is displayed. According to another aspect, the UGI includes the identifiers and daily capacities of each resource along a first direction, a timeline identifying days along a second direction (perpendicular to the display of the first direction), and vertical columns, with each column corresponding to a respective resource, wherein a width of a column identifies the daily capacity of the corresponding resource. | 08-28-2014 |
20140310047 | SIMPLIFYING SCHEDULING OF DEPENDENT TASKS IN A COLLABORATIVE PROJECT MANAGEMENT ENVIRONMENT - An aspect of the present invention simplifies scheduling of tasks of a project. In an embodiment, a user is provided the ability to specify a rejected list of dependencies, and such rejected dependencies are excluded when inferring dependencies between tasks of the project. The user may continue to add a set of tasks, have the dependencies (with the exclusion of rejected dependencies) inferred, reject more of the inferred dependencies, have the rejected dependencies added to the rejected list, during successive iterations. The output of such iterations may be processed further by a scheduling tool. | 10-16-2014 |
20150058053 | SHIFTING A GROUP OF TASKS ALONG A TIMELINE - An aspect of the present disclosure facilitates the shifting of a group of tasks along a timeline. In one embodiment, multiple tasks are sent for display along a timeline, with each task having a start time and an end time respectively equaling an original start value and an original end value along the timeline. In response to receiving data indicating a group of tasks and an offset, a new start value and a new end value for each of the tasks in the group is computed based on the offset. The start time and end time of each of the tasks in the group is set respectively to the computed new start value and new end value. The display of the timeline is updated (by resending the tasks) with the start time and end time of each task of the group set to the newly computed values. Thus, the received group of tasks is shifted along the timeline by the received offset. | 02-26-2015 |
20150134393 | ENHANCED CONTROL TO USERS IN PLACEMENT OF TASKS ALONG A TIMELINE - An aspect of the present disclosure provides enhanced control to users in the placement of tasks along timelines. In an embodiment, task data specifying details of multiple tasks scheduled along a timeline, is maintained. The tasks are displayed along the timeline. A candidate position is received for a first task along the timeline. In response, the task data is examined to identify a set of tasks scheduled in a time slice covering the candidate position, and data related to identified set of tasks is collected. The collected data is then sent for display, for example, in a viewport associated with the first task. | 05-14-2015 |
20150186824 | FACILITATING DAY-WISE PLANNING OF EFFORT REQUIRED FROM A RESOURCE FOR AN INDIVIDUAL TASK - According to an aspect of the present disclosure, effort parameters for a task to be performed by a resource are maintained, the effort parameters together specifying a sequence of initial component efforts (as a number of base intervals) for the resource in each of a progression of super intervals in relation to performance of the task by the resource. A graph containing graphical elements representing the sequence of component efforts over the progression of super intervals is then sent for display. In response to receiving an input indicating a change of an effort parameter, a sequence of changed component efforts for the progression of super intervals is computed and the graph updated with the sequence of changed component efforts. Thus, a user may make desired changes to the component efforts and view the effect of such changes on all of the component efforts in an interactive manner. | 07-02-2015 |
Patent application number | Description | Published |
20120124173 | CONTENT DELIVERY USING MULTIPLE SOURCES OVER HETEROGENEOUS INTERFACES - Provided is a system for the distribution of data, comprising a data server comprising a processor, a computer-readable storage medium coupled to the data server, a plurality of proxy servers, each with a plurality of network interfaces, a file of digital content, comprising a plurality of chunks, wherein copies of each chunk are stored on two or more of the proxy servers and the digital server; and logic, stored on the computer-readable storage medium and executed on the processor, for receiving a request for the digital file from a client device, for generating a proxy list for each chunk, comprising information identifying the two or more proxy servers on which the copies of the chunks are stored, and information corresponding to network interfaces associated with the two or more proxy servers on which the copies are stored; and for transmitting the proxy list to the client device to enable the client device to select two or more proxy servers on which the copies are stored and simultaneously download the two or more of the chunks utilizing two or more proxy servers and two or more network interfaces. | 05-17-2012 |
20130055241 | Rapid Provisioning of Virtual Machines Based on Multi-Dimensional User Request Patterns in a Cloud - A method, an apparatus and an article of manufacture for pre-provisioning a virtual machine instance. The method includes deriving a weight function for at least one virtual machine request based on historical data of the at least one virtual machine request to create a weighted virtual machine request for each request, capturing at least one inter-arrival pattern of requests, and applying the at least one pattern to the at least one weighted request to create a prioritized ordering of the at least one weighted request, and pre-provisioning at least one instance of a virtual machine image based on the prioritized ordering of the at least one weighted request. | 02-28-2013 |
20130055258 | Rapid Provisioning of Virtual Machines Based on Multi-Dimensional User Request Patterns in a Cloud - A method for pre-provisioning a virtual machine instance includes deriving a weight function for at least one virtual machine request based on historical data of the at least one virtual machine request to create a weighted virtual machine request for each request, capturing at least one inter-arrival pattern of requests, and applying the at least one pattern to the at least one weighted request to create a prioritized ordering of the at least one weighted request, and pre-provisioning at least one instance of a virtual machine image based on the prioritized ordering of the at least one weighted request. | 02-28-2013 |
20130055302 | TRUSTED CONTENT ACCESS MANAGEMENT USING MULTIPLE SOCIAL GRAPHS ACROSS HETEROGENEOUS NETWORKS - A method, system, and computer readable storage device (that stores the method) extract connectivity information from multiple telecommunication services, provided by a single multiple service provider. The method, system, and device merge the separate connectivity information from each service in a unified graph of telephone service users and digital service users (including common users of both services). The method, system, and device assigne trust values based on the connectivity information and shared data content between users. The method, system, and device may also issue a proxy certificate of authority (CA), by a trusted CA residing within the digital service, to provide digital service to a user of the telephone service in the unified graph, when the trusted CA is a nearest trusted CA in the unified graph. | 02-28-2013 |
20130124689 | CONTENT DELIVERY USING MULTIPLE SOURCES OVER HETEROGENEOUS INTERFACES - Provided is a system for the distribution of data, comprising a data server comprising a processor, a computer-readable storage medium coupled to the data server, a plurality of proxy servers, each with a plurality of network interfaces, a file of digital content, comprising a plurality of chunks, wherein copies of each chunk are stored on two or more of the proxy servers and the digital server; and logic, stored on the computer-readable storage medium and executed on the processor, for receiving a request for the digital file from a client device, for generating a proxy list for each chunk, comprising information identifying the two or more proxy servers on which the copies of the chunks are stored, and information corresponding to network interfaces associated with the two or more proxy servers on which the copies are stored; and for transmitting the proxy list to the client device to enable the client device to select two or more proxy servers on which the copies are stored and simultaneously download the two or more of the chunks utilizing two or more proxy servers and two or more network interfaces. | 05-16-2013 |
20130144698 | PERMITTING GRANULAR DISTRIBUTION OF PRIVILEGES TO CONTEXTUAL COMMUNITIES - Methods and arrangements for the granular distribution of privileges to contextual communities. A user request for an active capability is assimilated. A code is generated which permits exercise of the active capability by the user and at least one secondary recipient. Execution of the active capability is permitted responsive to an attempt at executing the active capability by at least one taken from the group consisting of: the user and the at least one secondary recipient, and execution of the active capability is denied responsive to an attempt at executing the active capability by a recipient other than the user and the at least one secondary recipient. | 06-06-2013 |
20130198741 | COMPUTING REUSABLE IMAGE COMPONENTS TO MINIMIZE NETWORK BANDWIDTH USAGE - Methods and arrangements for facilitating virtual appliance image delivery. Virtual appliance image templates are stored at a caching location, based on a historical request pattern. A request is received for a virtual appliance image and there is provided, to a second location, a virtual appliance image responsive to the received request. A difference is determined between the requested virtual appliance image and stored virtual appliance image templates. | 08-01-2013 |
20130198745 | COMPUTING REUSABLE IMAGE COMPONENTS TO MINIMIZE NETWORK BANDWIDTH USAGE - Methods and arrangements for facilitating virtual appliance image delivery. Virtual appliance image templates are stored at a caching location, based on a historical request pattern. A request is received for a virtual appliance image and there is provided, to a second location, a virtual appliance image responsive to the received request. A difference is determined between the requested virtual appliance image and stored virtual appliance image templates. | 08-01-2013 |
20130325969 | DYNAMIC POST-DELIVERY CUSTOMIZATION OF TELECOMMUNICATION MESSAGES - Systems, methods, and products for described herein. One aspect provides for transmitting a message template comprising at least one template element to at least one receiver device, the at least one template element comprising (i) at least one rule and (ii) content having at least one customized element; receiving at least one instantiation request responsive to the message template being opened by at least one receiver device; instantiating the message template as at least one customized message based on the at least one rule and at least one attribute associated with the receiver device, wherein the at least one customized message comprises a specified value for the at least one customized element; and transmitting the at least one customized message to the at least one receiver device. Other embodiments and aspects are also described herein. | 12-05-2013 |
20130326496 | Generating Super Templates to Obtain User-Requested Templates - Techniques for creating a virtual machine super template to create a user-requested virtual machine template. A method includes identifying at least one virtual machine super template to be created via analyzing at least one existing template in a repository and/or a user-defined combination of software, creating the super template by installing software requested by the user to be within the super template, and creating a user-requested virtual machine template by un-installing software from the super template that is not required in the user-requested template and/or adding software to the super template required in the user-requested template that is not present in the super template. | 12-05-2013 |
20130326503 | Generating Super Templates to Obtain User-Requested Templates - A method, an apparatus and an article of manufacture for creating a virtual machine super template to create a user-requested virtual machine template. The method includes identifying at least one virtual machine super template to be created via analyzing at least one existing template in a repository and/or a user-defined combination of software, creating the super template by installing software requested by the user to be within the super template, and creating a user-requested virtual machine template by un-installing software from the super template that is not required in the user-requested template and/or adding software to the super template required in the user-requested template that is not present in the super template. | 12-05-2013 |
20130339470 | Distributed Image Cache For Servicing Virtual Resource Requests in the Cloud - A method of provisioning in a cloud compute environment having a set of cloud hosts associated with one another. The method begins by forming a distributed, cooperative cache across the set of cloud hosts by declaring a portion of a data store associated with a cloud host as a cache, and storing template images and patches in the cache. Caching activity across the distributed, cooperated cache is coordinated by having the caches share information about their respective contents. A control routine at a cache receives requests for template images or patches, responds to the requests if the requested artifacts are available or, upon a cache miss, forwards the request to another one of the caches. Periodically, the composition of the distributed, cooperative cache is computed, and the template images and patches are populated into the caches using the computed cache composition. | 12-19-2013 |
20140067498 | Management of Personalized Advertisements Through the Mass Media - Techniques, an apparatus and an article of manufacture for management of personalized advertisements through the mass media. A method includes capturing content of an advertisement that is displayed publically and/or publically accessible to a plurality of individuals through a mass media mechanism by recording an image of the advertisement using a hand-held device, storing the content of the advertisement in a user-dedicated repository, and managing the content of the advertisement in the user-dedicated repository to facilitate distribution of the advertisement through the user to one or more additional individual users. | 03-06-2014 |
20140115577 | ESTIMATING DEMAND FOR NEWLY REGISTERED IMAGE TEMPLATES - Methods and arrangements for estimating demand for a newly registered virtual machine template. A newly registered virtual machine template is received, and prospective demand for the template is ascertained. Virtual machine instances are preprovisioned from the template. | 04-24-2014 |
20140149285 | EFFECTING PAYMENTS VIA MOBILE PHONES - Methods and systems for effecting mobile payments. A token for a payment is generated generating at a first mobile phone. The token is transferred between the first mobile phone and a second mobile phone, and is encashed at at least one of: the first mobile phone and the second mobile phone. | 05-29-2014 |
Patent application number | Description | Published |
20090122938 | Method and System for Identifying Sources of Operating System Jitter - A method for tuning performance of an operating system, the method comprising identifying all sources of operating system jitter; measuring the impact of each of the operating system jitter source; and tuning performance of the operating system, preferably by use of different approaches/techniques, which could include removing the sources of operating system jitter and/or delaying their execution and/or smoothening their execution over a longer period of time. Computer program code and systems are also provided. | 05-14-2009 |
20090299722 | METHOD FOR EMULATING OPERATING SYSTEM JITTER - Techniques for emulating operating system jitter on a platform using a given trace are provided. The techniques include calculating a scale factor, wherein the scale factor is equal to a maximum of measured overhead of introducing synthetic jitter on the platform and a resolution of one or more timer calls on the platform, scaling up each of one or more jitter values and each of one or more gaps between each of one or more jitter instances in the trace and an execution period of a benchmark parallel application using the scale factor, introducing synthetic jitter using each of the one or more scaled jitter values and each of the one or more scaled gaps from the trace while running the benchmark parallel application for the scaled execution period to emulate operating system jitter on a platform, and scaling down one or more final time measurements from the benchmark parallel application by the scale factor. | 12-03-2009 |
20100185823 | ENABLING HIGH-PERFORMANCE COMPUTING ON NON-DEDICATED CLUSTERS - Techniques for enabling high-performance computing are provided. The techniques include resizing a logical partition in a non-dedicated compute cluster server to enable high-performance computing, wherein a high performance computing application is executed such that the high performance computing application is configured to complete execution of each of one or more application threads at a similar instance as a slowest thread in the cluster, and wherein the non-dedicated compute cluster comprises one or more servers and the logical partition is created by partitioning one or more server resources. | 07-22-2010 |
20100223616 | REMOVING OPERATING SYSTEM JITTER-INDUCED SLOWDOWN IN VIRTUALIZED ENVIRONMENTS - Techniques for eradicating operating system jitter-induced slowdown are provided. The techniques include allocating one or more computing resources to one or more logical partitions of one or more parallel programs in proportion of one or more cycles consumed by one or more sources of operating system jitter in each compute phase in each of the one or more logical partitions. | 09-02-2010 |
20110191461 | SYSTEMS AND METHODS FOR USING WORKLOAD CHARACTERISTICS FOR SIZING AND PLACEMENT FOR POWER-AWARE CONSOLIDATION - Embodiments of the invention provide power savings via performing application workload consolidation to servers using off-peak values for application workload demand. Embodiments of the invention are designed to achieve significant power savings while containing performance risk associated with server consolidation. | 08-04-2011 |
20110238340 | Virtual Machine Placement For Minimizing Total Energy Cost in a Datacenter - Techniques for virtual machine placement in a datacenter are provided. The techniques include using one or more server power characteristics to determine a power cost for any given virtual machine placement in the datacenter, using a heat profile of one or more datacenter components in relation to one or more cooling resources in the datacenter to determine cooling cost for any given virtual machine placement in the datacenter, and using the power cost and cooling cost to apply integrated energy cost minimization at one or more levels of hierarchy in the datacenter to determine placement of a virtual machine in the datacenter such that the integrated energy cost of the datacenter is minimized. | 09-29-2011 |
20120311370 | Virtual Machine Placement For Minimizing Total Energy Cost in a Datacenter - Techniques for virtual machine placement in a datacenter are provided. The techniques include using one or more server power characteristics to determine a power cost for any given virtual machine placement in the datacenter, using a heat profile of one or more datacenter components in relation to one or more cooling resources in the datacenter to determine cooling cost for any given virtual machine placement in the datacenter, and using the power cost and cooling cost to apply integrated energy cost minimization at one or more levels of hierarchy in the datacenter to determine placement of a virtual machine in the datacenter such that the integrated energy cost of the datacenter is minimized. | 12-06-2012 |
20140325026 | INTELLIGENT ADAPTATION OF MOBILE APPLICATIONS BASED ON CONSTRAINTS AND CONTEXTS - Methods and arrangements for download management. A download request is accepted from a mobile device of a user. The download request is adapted relative to at least one of: user context, and at least one user preference. The adapted download request is sent to a content server. Content is downloaded from the content server, and the received download content is modified relative to at least one of: the user context, and the at least one user preference. The modified download content is delivered to the mobile device of the user. Other variants and embodiments are broadly contemplated herein. | 10-30-2014 |
Patent application number | Description | Published |
20110123636 | MICELLIC ASSEMBLIES - Provided herein are micellic assemblies comprising a plurality of copolymers. In certain instances, micellic assemblies provided herein are pH sensitive particles. | 05-26-2011 |
20110129921 | TARGETED POLYMER BIOCONJUGATES - Polymer bioconjugate having a RNAi agent covalently coupled to the alpha or omega end of a pH-dependent membrane-destabilizing polymer. | 06-02-2011 |
20110142951 | MICELLES FOR INTRACELLULAR DELIVERY OF THERAPEUTIC AGENTS - Composition comprising a polymeric micelle and an associated polynucleotide. | 06-16-2011 |
20110143435 | POLYMERIC CARRIER - Provided herein are polymeric carriers suitable for the delivery of polynucleotides (e.g. oligonucleotides) and/or other therapeutic agents into a living cell. | 06-16-2011 |
20120021514 | HETEROGENEOUS POLYMERIC MICELLES FOR INTRACELLULAR DELIVERY - Compositions comprising a heterogeneous polymeric micelle and an agent (e.g., a polynucleotide) associated with the micelle are disclosed, together with methods for intracellular delivery of such agent. | 01-26-2012 |
20130011362 | TARGETING MONOMERS AND POLYMERS HAVING TARGETING BLOCKS - Provided herein are monomers incorporating folate or other targeting agent, polymers prepared therefrom, polymers prepared therefrom having a therapeutic agent covalently coupled thereto, as well as micelles and therapeutic compositions thereof. | 01-10-2013 |
20130017167 | HYDROPHOBIC BLOCK CONJUGATED THERAPEUTIC AGENTS - Provided herein are polymers having a therapeutic agent covalently coupled to a hydrophobic block thereof, as well as micelles and therapeutic compositions thereof. | 01-17-2013 |
20150238619 | POLYMERIC CARRIER - Provided herein are polymeric carriers suitable for the delivery of polynucleotides (e.g., oligonucleotides) and/or other therapeutic agents into a living cell. | 08-27-2015 |