Patent application number | Description | Published |
20150112755 | Automated Identification and Evaluation of Business Opportunity Prospects - Embodiments identify and evaluate business opportunity prospects in an automated fashion. An engine receives one or more inputs used to identify business opportunities. These input(s) can comprise recent events gathered from external sources, for example feeds from news websites, and/or publicly-available business information (e.g. compiled by third parties). Other inputs can comprise information from internal sources, such as Enterprise Resource Planning (ERM) and/or Customer Relationship Management (CRM) applications. Still other inputs can comprise personalized user preferences, for example an industry and/or territory assigned to a particular user. From these input(s), the engine automatically generates a business lead, together with a score reflecting a strength of that lead. To this existing lead information (e.g. score, lead name, lead contact information, etc.), a user can manually add further information, for example monetary value and/or an closing date, in order to create a deal pipeline for visualization. | 04-23-2015 |
20150112756 | Automated Software Tools for Improving Sales - A sales application is described that includes multiple automated sales tools that can be combined to help improve sales within a sales team. A deal finder sales tool is described to help identify sales opportunities. A deal playbook sales tool is also described to help structure the sales opportunity into a sales play by recommending products to sale in conjunction and also constructing a sales team. An influencer sales tool is also described to help identify business relationships that can be utilized to influence members of the sales team. | 04-23-2015 |
20150112764 | Automated Evaluation of Transaction Plays - In one embodiment, a computer-implemented method comprises generating, using a computer, recommendations of a first group of products of a plurality of products based on past transactions between a plurality of persons and a plurality of entities for the plurality of products, relationships between the persons, relationships between the entities, and relationships between the persons and the entities; generating, using the computer, a score for each recommendation of the plurality of recommendations; and generating, using the computer, a first success indicator of a first selected recommendation based on the score associated with the first selected recommendation. | 04-23-2015 |
20150112893 | Predicting Levels of Influence - Systems and method for identifying individuals who may be potentially influential on a particular identified contact for a particular sales opportunity are disclosed. The individuals identified as potential influencers are then ranked according to a predicted level of influence and displayed in a graphic representation. In one embodiment, the ranked potential influencers are displayed as icons in a spiral formation relative to an icon representing the identified contact. The closer an icon representing a particular potential influencer is to the icon representing the identified contact, the greater the level influence is that that influencer might have on the identified contact. | 04-23-2015 |
20150348073 | Predictive Tool for Defining Target Group - Embodiments relate to methods and apparatuses creating and analyzing target groups, for example as relied upon in conducting marketing campaigns. Certain embodiments allow predictive definition of a target group based upon an underlying complex mathematical model, which may reference large data volumes regarding individual targets in an underlying database. An interface affords simplified visualizations of the target group, for example circles of varying diameter representing target group size. Adjustable graphic elements (e.g., sliders) in dashboard views may allow predictive definition of the target group based upon inputs such as marketing cost, target group size, and/or expected revenue, etc. Once defined and stored, target groups may be explored in an interactive manner through application of filter criteria, thereby promoting familiarity with target group characteristics. Embodiments allow users who are not modeling experts, to nevertheless interact efficiently with large data volumes in order to intuitively define and/or explore a target group. | 12-03-2015 |
20150348124 | Interactive Tool for Exploring Target Group - Embodiments relate to methods and apparatuses creating and analyzing target groups, for example as relied upon in conducting marketing campaigns. Certain embodiments allow predictive definition of a target group based upon an underlying complex mathematical model, which may reference large data volumes regarding individual targets in an underlying database. An interface affords simplified visualizations of the target group, for example circles of varying diameter representing target group size. Adjustable graphic elements (e.g., sliders) in dashboard views may allow predictive definition of the target group based upon inputs such as marketing cost, target group size, and/or expected revenue, etc. Once defined and stored, target groups may be explored in an interactive manner through application of filter criteria, thereby promoting familiarity with target group characteristics. Embodiments allow users who are not modeling experts, to nevertheless interact efficiently with large data volumes in order to intuitively define and/or explore a target group. | 12-03-2015 |
Patent application number | Description | Published |
20130091303 | SYSTEMS AND METHODS FOR DATA PACKET PROCESSING - Systems and methods for performing efficient network address (NAT) translation are described herein. In some aspects, partial NAT entries are created for data packets before all the IP fragments of the data packets are received. Further, the IP fragments are transmitted before all the IP fragments of the data packets are received. In some aspects, unique IP-IDs are generated for IP fragments and/or data packets at a NAT device. | 04-11-2013 |
20130156041 | APPARATUS AND METHODS FOR EFFICIENT NETWORK ADDRESS TRANSLATION AND APPLICATION LEVEL GATEWAY PROCESSING - Apparatus and methods for efficient NAT and ALG processing is disclosed. An exemplary method includes the operations of deep scanning a packet received over a connection to determine an application level gateway (ALG) process to be performed on the packet, associating the connection with the ALG process, and forwarding additional packets received over the connection to receive the ALG process based on said associating so that deep scanning of the additional packets is bypassed. An exemplary apparatus includes a processor to deep scan a packet received over a connection to determine an ALG process to be performed on the packet, a database to associate the connection with the ALG process, and a packet transmitter to forward additional packets received over the connection to receive the ALG process based on said associating so that deep scanning of the additional packets is bypassed. | 06-20-2013 |
20140016550 | METHODS AND APPARATUS FOR OFFLOADING CHECKSUM PROCESSING - Aspects of the present disclosure provide methods and apparatus for offloading checksum processing in a user equipment (UE) (e.g., from an application processor to a modem processor). Such offloading may speed up packet processing, increase data rate, and/or free up resources of the application processor for other tasks. | 01-16-2014 |
20150373566 | METHOD TO REDUCE THE TRANSMISSION DELAY FOR DATA PACKETS - A method, an apparatus, and a computer program product for wireless communication are provided. The apparatus may be a modem. The apparatus detects reception of a low latency data packet. The apparatus starts a data activity timer determined based on the detection of the reception of the low latency data packet. The apparatus sends a disable low power message from the apparatus to a host device to disable a low power state of a link between the apparatus and the host device based on a duration of the data activity timer. | 12-24-2015 |
Patent application number | Description | Published |
20090079466 | Soft-reconfigurable massively parallel architecture and programming system - The present disclosure provides an architecture that enables massive parallel processing on an IC while alleviating control congestion, memory access congestion and wiring congestion, together with high flexibility where the processing units are soft-arranged to perform different tasks. In an embodiment, the present architecture includes a functional block with a GO component to start the functional block, and a DONE component to identifying the completion status. The GO and DONE components can be linked together, preferably by a linkage component, to chain the functional blocks. The linkage is preferably soft configurable. In another embodiment, the present architecture includes an integrated circuit comprises a plurality of functional blocks chained together for serial processing, parallel processing, or any combination thereof. | 03-26-2009 |
20090083460 | Re-configurable bus fabric for integrated circuits - The present invention relates to a flexible and reconfigurable bus fabric for microelectronic processing units, which can offer efficient memory data management, together with efficient data transfer and relieving data transfer congestion in an integrated circuit. In an embodiment, the present reconfigurable bus fabric comprises a multistate intersection between two data buses. Preferably, the multistate intersection comprises at least two states, a connecting state connecting the two data buses, and a disconnecting state disconnecting the two data buses. The multistate intersection provides a reconfigurable bus fabric, allowing different connection configuration for the data buses. This reconfigurable bus fabric offers soft-configurability and soft-reconfigurability, using software programming to arrange the circuits' interconnections. Other configurations are also disclosed in exemplary embodiments. | 03-26-2009 |
20090083461 | Soft-reconfigurable massively parallel architecture and programming system - The present disclosure provides a methodology for reducing congestion of a processing unit, preferably by configuring a plurality of functional blocks to run in parallel or in series without the influence or input from the processing unit. In an embodiment, the present method chains a plurality of functional blocks together by software so that one functional block starts after the completion of another functional block. The configuration of the chain can be series, parallel, and any combination thereof, arranged to meet the circuit's objective. The chaining can be configured and re-configured, preferably by software input. The chaining can also be performed at design time or at run time. The chaining can also be modified, preferably at design time, but can also be modified at run time. | 03-26-2009 |
20090083515 | Soft-reconfigurable massively parallel architecture and programming system - In an embodiment, the present invention discloses a flexible and reconfigurable architecture with efficient memory data management, together with efficient data transfer and relieving data transfer congestion in an integrated circuit. In an embodiment, the output of a first functional component is stored to an input memory of a next functional component. Thus when the first functional component completes its processing, its output is ready to be accessed as input to the next functional component. In an embodiment, the memory device further comprises a partition mechanism for simultaneously accepting output writing from the first functional component and accepting input reading from the second functional component. In another embodiment, the present integrated circuit comprises at least two functional components and at least two memory devices, together with a controller for switching the connections between the functional components and the memory devices. The controller can comprise a multiplexer or a switching matrix. | 03-26-2009 |
20100287244 | Data communication using disposable contact information - Methods and apparatuses for establishing a trusted group of users to prevent undesirable communication by employing authenticated contact information. In an embodiment, the present invention embeds authenticated contact information to data communication composed by members of the trusted group. Authenticated contact information is preferably disposable contact information, changeable as desired, at a regular interval, or one-time contact information. In another embodiment, the present invention discloses a process of expanding an existing trusted group of users to an outsider, comprising embedding authenticated contact information of a member within the trusted group to a data communication composed by the outsider to a member of the trusted group. | 11-11-2010 |
Patent application number | Description | Published |
20130145530 | IRON MAN SUIT - A suit apparatus constructed from a strong material, such as steel, which is capable of protecting its wearer from projectiles, such as bullets, and including a hydraulic mechanism and a power source, which enables the suit wearer to do mechanical work, such as pushing or lifting heavy objects, using the hydraulic mechanism. | 06-13-2013 |
20150305132 | BASIC ELECTROMAGNETIC FORCE FIELD - An electromagnetic force field configured to protect designated assets against incoming objects, comprising a plurality of layers, wherein the layers are a member of a group consisting of a supercharged plasma window, a curtain of high-energy laser beams arranged in a lattice-like configuration, and a carbon nanotube (CNT) layer, wherein the laser beams are positioned at equal distance between each other and as such as to ensure that at least four laser beams are in the path of the smallest object, and wherein, the CNT layer comprises a plurality of CNT sheets. | 10-22-2015 |
Patent application number | Description | Published |
20090326318 | MEDICAL ROBOTIC SYSTEM PROVIDING AN AUXILARY VIEW INCLUDING RANGE OF MOTION LIMITATIONS FOR ARTICULATABLE INSTRUMENTS EXTENDING OUT OF A DISTAL END OF AN ENTRY GUIDE - A medical robotic system includes an entry guide with surgical tools and a camera extending out of its distal end. To supplement the view provided by an image captured by the camera, an auxiliary view including articulatable arms of the surgical tools and/or camera is generated from sensed or otherwise determined information about their positions and orientations are displayed along with indications of range of motion limitations on a display screen from the perspective of a specified viewing point. | 12-31-2009 |
20110040305 | CONTROLLER ASSISTED RECONFIGURATION OF AN ARTICULATED INSTRUMENT DURING MOVEMENT INTO AND OUT OF AN ENTRY GUIDE - To perform a tool exchange in a medical robotic system, tool is retracted back into an entry guide from a deployed position and pose so that an assistant in the operating room may replace it with a different tool. While the tool is being retracted back towards the entry guide by user action, its configuration is changed to an entry pose while avoiding collisions with other objects so that it may fit in the entry guide. After the tool exchange is completed, a new tool is inserted in the entry guide and extended out of the guide by user action to the original position of the old tool prior to its retraction into the entry guide while the tool's controller assists the user by reconfiguring the new tool so as to resemble the original deployed pose of the old tool prior to its retraction into the entry guide. | 02-17-2011 |
20130197672 | Pass-Through Controller for Cascaded Proportional-Integral-Derivative Control Loops - A cascade control system includes pass-through controller and a Proportional-Integral-Derivative (PID) controller, wherein the PID controller controls a first output of a device to generate an input to drive the device. The pass-through controller provides a setpoint to the PID controller and controls a second output of the device. The first output and optionally also a derivative of the first output is passed to the pass-through controller so that a pass-through control algorithm can be implemented that results in the input to the device only having terms of the second output, thereby avoiding dynamic interaction between the control loops of the pass-through controller and the PID controller. | 08-01-2013 |
20130211590 | USER SELECTION OF ROBOTIC SYSTEM OPERATING MODES USING MODE DISTINGUISHING OPERATOR ACTIONS - A robotic system has a plurality of user selectable operating modes. To select one of the operating modes, a user performs a distinguishing action which uniquely identifies a desired operating mode among the plurality of user selectable operating modes. A method implemented by a processor in the robotic system identifies the distinguishing action and places the robotic system in the user selected operating mode. | 08-15-2013 |
20150297300 | CONTROLLER ASSISTED RECONFIGURATION OF AN ARTICULATED INSTRUMENT DURING MOVEMENT INTO AND OUT OF AN ENTRY GUIDE - To perform a tool exchange in a medical robotic system, tool is retracted back into an entry guide from a deployed position and pose so that an assistant in the operating room may replace it with a different tool. While the tool is being retracted back towards the entry guide by user action, its configuration is changed to an entry pose while avoiding collisions with other objects so that it may fit in the entry guide. After the tool exchange is completed, a new tool is inserted in the entry guide and extended out of the guide by user action to the original position of the old tool prior to its retraction into the entry guide while the tool's controller assists the user by reconfiguring the new tool so as to resemble the original deployed pose of the old tool prior to its retraction into the entry guide. | 10-22-2015 |
20150366625 | MEDICAL ROBOTIC SYSTEM PROVIDING AN AUXILARY VIEW INCLUDING RANGE OF MOTION LIMITATIONS FOR ARTICULATABLE INSTRUMENTS EXTENDING OUT OF A DISTAL END OF AN ENTRY GUIDE - A medical robotic system includes an entry guide with surgical tools and a camera extending out of its distal end. To supplement the view provided by an image captured by the camera, an auxiliary view including articulatable arms of the surgical tools and/or camera is generated from sensed or otherwise determined information about their positions and orientations are displayed along with indications of range of motion limitations on a display screen from the perspective of a specified viewing point. | 12-24-2015 |
Patent application number | Description | Published |
20130129079 | System And Method For Decryption Of Content Including Disconnected Encryption Chains - Embodiments may include receiving a protected version of content including different encryption chains including encrypted blocks of content. The protected version of content may include decryption information for decrypting the encrypted chains; the decryption information may include initialization vectors that are distinct from the content. Embodiments may also include performing chained decryption on a particular sequence of data blocks including multiple encryption chains from the protected version of the content and at least some of the initialization vectors. Some of the initialization vectors may be positioned between the encryption chains within the particular sequence such that during the chained decryption the initialization vectors are decrypted in sequence with the data blocks of the encryption chains. The chained decryption may result in a sequence of decrypted data blocks including decrypted initialization vectors. Embodiments may include generating a decrypted version of the content by excluding the decrypted initialization vectors from that sequence. | 05-23-2013 |
20130129085 | System And Method For Decryption Of Content Including Partial-Block Discard - Embodiments may include receiving a protected version of content that includes multiple encryption chains each including encrypted blocks of content. The protected version of content may include one or more initialization vectors for decrypting the encrypted blocks of content and discard information that specifies non-content portions of one or more data blocks to be discarded after decryption. Embodiments may also include performing chained decryption on the multiple encryption chains using the initialization vectors specified by the decryption information. The chained decryption may result in a sequence of decrypted data blocks. Embodiments may also include, based on the discard information, locating and removing the non-content portions of one or more data blocks in the sequence of decrypted data blocks. Embodiments may also include generating the protected version of content. Embodiments may also include performing any of the aforesaid techniques on one or more computers. | 05-23-2013 |
20130191489 | Media Content Streaming Using Stream Message Fragments - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for media content streaming can include transacting access information associated with a media stream and transacting one or more fragments associated with the media stream to facilitate a delivery of media content associated with the media stream. Access information can include fragment sequencing information to facilitate individual retrieval of fragments associated with the media stream using a uniform resource identifier via a processing device configured to cache content. A fragment can include one or more stream messages. A stream message can include a message header and a corresponding media data sample. The message header can include a message stream identifier, a message type identifier, a timestamp, and a message length value. | 07-25-2013 |
20130262694 | Buffering in HTTP Streaming Client - A buffer model in an HTTP streaming client may include receiving a first content fragment of a first content stream in response to a first HTTP request. It may also include receiving a second content fragment of a second content stream in response to a second HTTP request. The buffer model may further include storing the first and second content fragments in first and second buffers of a plurality of configurable buffers. The first and second content fragments may be multiplexed into a third buffer of the plurality of buffers. The multiplexed first and second content fragments may be stored in a fourth buffer of the plurality of buffers for playback. The buffer model may be implemented by an application. The buffers may be designed based on one or more constraints. | 10-03-2013 |
20140245001 | Decryption of Content Including Partial-Block Discard - Embodiments may include receiving a protected version of content that includes multiple encryption chains each including encrypted blocks of content. The protected version of content may include one or more initialization vectors for decrypting the encrypted blocks of content and discard information that specifies non-content portions of one or more data blocks to be discarded after decryption. Embodiments may also include performing chained decryption on the multiple encryption chains using the initialization vectors specified by the decryption information. The chained decryption may result in a sequence of decrypted data blocks. Embodiments may also include, based on the discard information, locating and removing the non-content portions of one or more data blocks in the sequence of decrypted data blocks. Embodiments may also include generating the protected version of content. Embodiments may also include performing any of the aforesaid techniques on one or more computers. | 08-28-2014 |
20140280789 | Media Content Streaming Using Stream Message Fragments - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for media content streaming can include transacting access information associated with a media stream and transacting one or more fragments associated with the media stream to facilitate a delivery of media content associated with the media stream. Access information can include fragment sequencing information to facilitate individual retrieval of fragments associated with the media stream using a uniform resource identifier via a processing device configured to cache content. A fragment can include one or more stream messages. A stream message can include a message header and a corresponding media data sample. The message header can include a message stream identifier, a message type identifier, a timestamp, and a message length value. | 09-18-2014 |
20150256578 | Media Content Streaming Using Stream Message Fragments - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for media content streaming can include transacting access information associated with a media stream and transacting one or more fragments associated with the media stream to facilitate a delivery of media content associated with the media stream. Access information can include fragment sequencing information to facilitate individual retrieval of fragments associated with the media stream using a uniform resource identifier via a processing device configured to cache content. A fragment can include one or more stream messages. A stream message can include a message header and a corresponding media data sample. The message header can include a message stream identifier, a message type identifier, a timestamp, and a message length value. | 09-10-2015 |
20150281298 | Buffering in HTTP Streaming Client - A buffer model in an HTTP streaming client may include receiving a first content fragment of a first content stream in response to a first HTTP request. It may also include receiving a second content fragment of a second content stream in response to a second HTTP request. The buffer model may further include storing the first and second content fragments in first and second buffers of a plurality of configurable buffers. The first and second content fragments may be multiplexed into a third buffer of the plurality of buffers. The multiplexed first and second content fragments may be stored in a fourth buffer of the plurality of buffers for playback. The buffer model may be implemented by an application. The buffers may be designed based on one or more constraints. | 10-01-2015 |
Patent application number | Description | Published |
20110047127 | APPLICATION NETWORK COMMUNICATION METHOD AND APPARATUS - A method and apparatus is provided to discover and integrate applications in an application router framework. The discovery operation includes receiving a registration notification for an application on a network, adding information describing the application to a repository into a data structure and publishing the data structure onto an application router. The association operations include querying one or more application routers on an application network for meta-data and other information on applications, exchanging the meta-data and other information between the application routers and associating the applications together automatically using their respective application protocols. Routing operations include receiving application information in an application protocol format, converting the application information in the application protocol format into a neutral protocol format and forwarding the application information in the neutral protocol format along with state information to other application router devices on the network. | 02-24-2011 |
20110047293 | APPLICATION NETWORK COMMUNICATION METHOD AND APPARATUS - A method and apparatus is provided to discover and integrate applications in an application router framework. The discovery operation includes receiving a registration notification for an application on a network, adding information describing the application to a repository into a data structure and publishing the data structure onto an application router. The association operations include querying one or more application routers on an application network for meta-data and other information on applications, exchanging the meta-data and other information between the application routers and associating the applications together automatically using their respective application protocols. Routing operations include receiving application information in an application protocol format, converting the application information in the application protocol format into a neutral protocol format and forwarding the application information in the neutral protocol format along with state information to other application router devices on the network. | 02-24-2011 |
20110047591 | APPLICATION NETWORK COMMUNICATION METHOD AND APPARATUS - A method and apparatus is provided to discover and integrate applications in an application router framework. The discovery operation includes receiving a registration notification for an application on a network, adding information describing the application to a repository into a data structure and publishing the data structure onto an application router. The association operations include querying one or more application routers on an application network for meta-data and other information on applications, exchanging the meta-data and other information between the application routers and associating the applications together automatically using their respective application protocols. Routing operations include receiving application information in an application protocol format, converting the application information in the application protocol format into a neutral protocol format and forwarding the application information in the neutral protocol format along with state information to other application router devices on the network. | 02-24-2011 |
20130073740 | APPLICATION NETWORK COMMUNICATION - A method and apparatus is provided to discover and integrate applications in an application router framework. The discovery operation includes receiving a registration notification for an application on a network, adding information describing the application to a repository into a data structure and publishing the data structure onto an application router. The association operations include querying one or more application routers on an application network for meta-data and other information on applications, exchanging the meta-data and other information between the application routers and associating the applications together automatically using their respective application protocols. Routing operations include receiving application information in an application protocol format, converting the application information in the application protocol format into a neutral protocol format and forwarding the application information in the neutral protocol format along with state information to other application router devices on the network. | 03-21-2013 |
Patent application number | Description | Published |
20130088511 | E-BOOK READER WITH OVERLAYS - An e-book reader application for the desktop, laptop, tablet, or other mobile computing device configurations, and web/cloud environments provides user interactions with overlays that present the reader with immediate access to assets including equations, figures, references, index, source code, equation variables, and other parameters (including but not limited to graphical plots, videos, slide presentations, etc.) referenced in a given page using a pop-up window or a tool-tip to display the desired asset. The e-book reader application also provides additional tools such as sharing code and review materials, setting access restrictions, and tagging audio/video presentations for authors as well as highlighting, bookmarking, and notes-taking capabilities for readers. | 04-11-2013 |
Patent application number | Description | Published |
20110305695 | Wnt Antagonists and Methods of Treatment and Screening - The present invention relates to compositions comprising Wnt antagonists and methods of treating Wnt-associated diseases and disorders, such as cancer, inducing differentiation, and reducing the frequency of cancer stem cells, as well as novel methods of screening for such Wnt antagonists. In particular, the invention discloses soluble FZD, SFRP and Ror receptors and their use. | 12-15-2011 |
20110318341 | FRIZZLED-BINDING AGENTS AND USES THEREOF - Novel anti-cancer agents, including, but not limited to, antibodies, that bind to human frizzled receptors are provided. Novel epitopes within the human frizzled receptors which are suitable as targets for anti-cancer agents are also identified. Methods of using the agents or antibodies, such as methods of using the agents or antibodies to inhibit Wnt signaling and/or inhibit tumor growth are further provided. | 12-29-2011 |
20130252326 | FRIZZLED-BINDING AGENTS AND USES THEREOF - Novel anti-cancer agents, including, but not limited to, antibodies, that bind to human frizzled receptors are provided. Novel epitopes within the human frizzled receptors which are suitable as targets for anti-cancer agents are also identified. Methods of using the agents or antibodies, such as methods of using the agents or antibodies to inhibit Wnt signaling and/or inhibit tumor growth are further provided. | 09-26-2013 |
20130295105 | FRIZZLED-BINDING AGENTS AND USES THEREOF - Novel anti-cancer agents, including, but not limited to, antibodies, that bind to human frizzled receptors are provided. Novel epitopes within the human frizzled receptors which are suitable as targets for anti-cancer agents are also identified. Methods of using the agents or antibodies, such as methods of using the agents or antibodies to inhibit Wnt signaling and/or inhibit tumor growth are further provided. | 11-07-2013 |
20130295106 | Frizzled-Binding Agents And Uses Thereof - Novel anti-cancer agents, including, but not limited to, antibodies and other polypeptides, that bind to human frizzled receptors are provided. Novel epitopes within the human frizzled receptors which are suitable as targets for anti-cancer agents are also identified. Methods of using the agents or antibodies, such as methods of using the agents or antibodies to inhibit Wnt signaling and/or inhibit tumor growth are further provided. Screening methods are also provided. | 11-07-2013 |
20150232554 | FRIZZLED-BINDING AGENTS AND USES THEREOF - Novel anti-cancer agents, including, but not limited to, antibodies, that bind to human frizzled receptors are provided. Novel epitopes within the human frizzled receptors which are suitable as targets for anti-cancer agents are also identified. Methods of using the agents or antibodies, such as methods of using the agents or antibodies to inhibit Wnt signaling and/or inhibit tumor growth are further provided. | 08-20-2015 |
Patent application number | Description | Published |
20150133360 | MESITYLENE SULFONATE COMPOSITIONS AND METHODS THEREOF - The invention relates to compositions including a hypohalite or hypochlorous acid and a soluble salt of 2,4,6 mesitylene sulfonate. The compositions may include a surfactant, a buffer, or combinations thereof. Other adjuvants may also be present. Such compositions do not require the inclusion of high concentrations of sodium hydroxide or other soluble hydroxide salts to drastically increase pH (and thus stability), although such hydroxides may be present if desired. | 05-14-2015 |
20150133361 | MESITYLENE SULFONATE COMPOSITIONS AND METHODS FOR CLEANING A SURFACE - The invention relates to compositions including a hypohalite or hypochlorous acid and a soluble salt of 2,4,6 mesitylene sulfonate. The compositions may include a surfactant, a buffer, or combinations thereof. Other adjuvants may also be present. Such compositions do not require the inclusion of high concentrations of sodium hydroxide or other soluble hydroxide salts to drastically increase pH (and thus stability), although such hydroxides may be present if desired. | 05-14-2015 |
20150184113 | LIQUID MESITYLENE SULFONATE COMPOSITIONS AND METHODS THEREOF - The invention relates to compositions including a hypohalite or hypochlorous acid and a soluble salt of 2,4,6 mesitylene sulfonate. The compositions may include a surfactant, a buffer, or combinations thereof. Other adjuvants may also be present. Such compositions do not require the inclusion of high concentrations of sodium hydroxide or other soluble hydroxide salts to drastically increase pH (and thus stability), although such hydroxides may be present if desired. | 07-02-2015 |
20150184114 | METHOD FOR BLEACHING A SURFACE WITH A MESITYLENE SULFONATE COMPOSITION - The invention relates to compositions including a hypohalite or hypochlorous acid and a soluble salt of 2,4,6 mesitylene sulfonate. The compositions may include a surfactant, a buffer, or combinations thereof. Other adjuvants may also be present. Such compositions do not require the inclusion of high concentrations of sodium hydroxide or other soluble hydroxide salts to drastically increase pH (and thus stability), although such hydroxides may be present if desired. | 07-02-2015 |
Patent application number | Description | Published |
20120254126 | SYSTEM AND METHOD FOR VERIFYING CONSISTENT POINTS IN FILE SYSTEMS - According to one embodiment, in response to a request for verifying a first prime representing a consistent point of a file system of a storage system having a plurality of storage units, each of a plurality of prime segments collectively representing the first prime is examined to determine whether the corresponding prime segment has been previously verified. Each of the prime segments is stored in one of the storage units, respectively. At least a first of the prime segments that has not been previously verified is verified, without verifying a second of the prime segments that has been previously verified. The first prime, when at least the first prime segment has been successfully verified, can be used to construct the consistent point of the file system. | 10-04-2012 |
20120254130 | SYSTEM AND METHOD FOR MAINTAINING CONSISTENT POINTS IN FILE SYSTEMS USING A PRIME DEPENDENCY LIST - According to one embodiment, a request is received for obtaining a consistent point of data stored in a file system of a storage system having a plurality of storage units. In response to the request, retrieving a prime dependency list from a first prime segment stored in a first of the storage units, where the prime dependency list includes information identifying at least a second prime segment stored in a second of the storage units. The first and second prime segments collectively form a prime segment representing a consistent view of the file system. Each of the prime segments listed in the prime dependency list is ascertained in an attempt to generate the consistent point of data. | 10-04-2012 |
20120254174 | TIME-BASED DATA PARTITIONING - According to one embodiment, a file system (FS) of a storage system is partitioned into a plurality of FS partitions, where each FS partition stores segments of data files. In response to a request for writing a file to the storage system, the file is stored in a first of the FS partitions that is selected based on a time attribute of the file, such that files having similar time attributes are stored in an identical FS partition. | 10-04-2012 |
20120254257 | RESOURCE EFFICIENT SCALE-OUT FILE SYSTEMS - According to one embodiment, a file system (FS) of a storage system is partitioned into a plurality of FS partitions, where each FS partition stores segments of data files. In response to an input and output (IO) request for accessing a first of the FS partitions, a second of the FS partitions is selected that is currently in a ready state for access. The second FS partition is then removed from the ready state for access. The first FS partition is brought into a ready state for access. | 10-04-2012 |
20120254565 | SYSTEM AND METHOD FOR MAINTAINING CONSISTENT POINTS IN FILE SYSTEMS - According to one embodiment, in response to a request to write a prime segment of a file system of a storage system having a plurality of storage units, one or more of the storage units are identified based on a prime segment write-map (PSWM). The PSWM includes information indicating which of the storage units to which a next prime should be written. The prime segment is then written in the one or more storage units identified from the PSWM, without writing the prime segment to a remainder of the storage units. The prime segment represents at least a portion of a prime that contains metadata representing a consistent point of data stored in the file system. | 10-04-2012 |
Patent application number | Description | Published |
20110133284 | MULTIPLE CARBON NANOTUBE TRANSFER AND ITS APPLICATIONS FOR MAKING HIGH-PERFORMANCE CARBON NANOTUBE FIELD-EFFECT TRANSISTOR (CNFET), TRANSPARENT ELECTRODES, AND THREE-DIMENSIONAL INTEGRATION OF CNFETS - A wafer-scale multiple carbon nanotube transfer process is provided. According to one embodiment of the invention, plasma exposure processes are performed at various stages of the fabrication process of a carbon nanotube device or article to improve feasibility and yield for successive transfers of nanotubes. In one such carbon nanotube transfer process, a carrier material is partially etched by a plasma process before removing the carrier material through, for example, a wet etch. By applying the subject plasma exposure processes, fabrication of ultra-high-density nanotubes and ultra-high-density nanotube grids or fabrics is facilitated. The ultra-high-density nanotubes and ultra-high-density nanotube grids or fabrics fabricated utilizing embodiments of the invention can be used, for example, to make high-performance carbon nanotube field effect transistors (CNFETs) and low cost, highly-transparent, and low-resistivity electrodes for solar cell and flat panel display applications. Further, three-dimensional CNFETs can be provided by utilizing the subject plasma exposure processes. | 06-09-2011 |
20150377961 | SYSTEM AND METHOD FOR TESTING A LOGIC-BASED PROCESSING DEVICE - A method of operating a test device for a logic-based processing device includes the steps of providing an original set of test instructions, generating one or more Quick Error Detection (QED) test programs, and causing the one or more QED test programs to be executed on the logic-based processing device. Each one of the QED test programs includes the original test program with additional instructions inserted at strategic locations within the original set, wherein the additional instructions and the strategic locations vary between each of the QED test programs. | 12-31-2015 |
Patent application number | Description | Published |
20140068132 | AUTOMATIC CONSTRUCTION OF DEADLOCK FREE INTERCONNECTS - Systems and methods for automatically building a deadlock free inter-communication network in a multi-core system are described. The example embodiments described herein involve deadlock detection during the mapping of user specified communication pattern amongst blocks of the system. Detected deadlocks are then avoided by re-allocation of channel resources. An example embodiment of the deadlock avoidance scheme is presented on Network-on-chip interconnects for large scale multi-core system-on-chips. | 03-06-2014 |
20140098683 | HETEROGENEOUS CHANNEL CAPACITIES IN AN INTERCONNECT - Systems and methods involving construction of a system interconnect in which different channels have different widths in numbers of bits. Example processes to construct such a heterogeneous channel NoC interconnect are disclosed herein, wherein the channel width may be determined based upon the provided specification of bandwidth and latency between various components of the system. | 04-10-2014 |
20140115218 | ASYMMETRIC MESH NoC TOPOLOGIES - A method of interconnecting blocks of heterogeneous dimensions using a NoC interconnect with sparse mesh topology includes determining a size of a mesh reference grid based on dimensions of the chip, dimensions of the blocks of heterogeneous dimensions, relative placement of the blocks and a number of host ports required for each of the blocks of heterogeneous dimensions, overlaying the blocks of heterogeneous dimensions on the mesh reference grid based on based on a guidance floor plan for placement of the blocks of heterogeneous dimensions, removing ones of a plurality of nodes and corresponding ones of links to the ones of the plurality of nodes which are blocked by the overlaid blocks of heterogeneous dimensions, based on porosity information of the blocks of heterogeneous dimensions, and mapping inter-block communication of the network-on-chip architecture over remaining ones of the nodes and corresponding remaining ones of the links. | 04-24-2014 |
20140115298 | ASYMMETRIC MESH NoC TOPOLOGIES - A method of interconnecting blocks of heterogeneous dimensions using a NoC interconnect with sparse mesh topology includes determining a size of a mesh reference grid based on dimensions of the chip, dimensions of the blocks of heterogeneous dimensions, relative placement of the blocks and a number of host ports required for each of the blocks of heterogeneous dimensions, overlaying the blocks of heterogeneous dimensions on the mesh reference grid based on based on a guidance floor plan for placement of the blocks of heterogeneous dimensions, removing ones of a plurality of nodes and corresponding ones of links to the ones of the plurality of nodes which are blocked by the overlaid blocks of heterogeneous dimensions, based on porosity information of the blocks of heterogeneous dimensions, and mapping inter-block communication of the network-on-chip architecture over remaining ones of the nodes and corresponding remaining ones of the links. | 04-24-2014 |
20140177473 | HIERARCHICAL ASYMMETRIC MESH WITH VIRTUAL ROUTERS - A network-on-chip configuration includes a first plurality of cores arranged in a two-dimensional mesh; a first plurality of routers, each of the first plurality of routers associated with a corresponding local one of the first plurality of cores, each of the first plurality of routers having a plurality of directional ports configured to provide connections to other ones of the first plurality of routers; a second plurality of cores disposed around a periphery of the two-dimensional mesh arrangement; and a second plurality of routers, each of the second plurality of routers associated with a corresponding local one of the second plurality of cores, and having a directional port configured to provide a connection to a neighboring one of the first plurality of routers. | 06-26-2014 |
20140177648 | TAGGING AND SYNCHRONIZATION FOR FAIRNESS IN NOC INTERCONNECTS - Systems and methods described herein are directed to solutions for NoC interconnects that provide end-to-end uniform- and weighted-fair allocation of resource bandwidths among various contenders. The example implementations are fully distributed and involve tagging the messages with meta-information when the messages are injected in the interconnection network. Example implementations may involve routers using various arbitration phases, and making local arbitration decisions based on the meta-information of incoming messages. The meta-information can be of various types based on the number of router arbitration phases, and the desired level of sophistication. | 06-26-2014 |
20140204735 | AUTOMATIC DEADLOCK DETECTION AND AVOIDANCE IN A SYSTEM INTERCONNECT BY CAPTURING INTERNAL DEPENDENCIES OF IP CORES USING HIGH LEVEL SPECIFICATION - Systems and methods for automatically building a deadlock free inter-communication network in a multi-core system are described. The example implementations described herein involve a high level specification to capture the internal dependencies of various cores, and using it along with the user specified system traffic profile to automatically detect protocol level deadlocks in the system. When all detected deadlock are resolved or no such deadlocks are present, messages in the traffic profile between various cores of the system may be automatically mapped to the interconnect channels and detect network level deadlocks. Detected deadlocks then may be avoided by re-allocation of channel resources. An example implementation of the internal dependency specification and using it for deadlock avoidance scheme is presented on Network-on-chip interconnects for large scale multi-core system-on-chips. | 07-24-2014 |
20140204764 | QOS IN HETEROGENEOUS NOC BY ASSIGNING WEIGHTS TO NOC NODE CHANNELS AND USING WEIGHTED ARBITRATION AT NOC NODES - Systems and methods described herein are directed to solutions for NoC interconnects that provide end-to-end uniform- and weighted-fair allocation of resource bandwidths among various contenders. The example implementations are fully distributed and involve computing weights for various channels in a network on chip (NoC) based on the bandwidth requirements of flows at the channels. Example implementations may involve using the weights to perform weighted arbitration between channels in the NoC to provide quality of service (QoS). The weights may be adjusted dynamically by monitoring the activity of flows at the channels. The newly adjusted weights can be used to perform the weighted arbitrations to avoid unfair bandwidth allocations. | 07-24-2014 |
20140211622 | CREATING MULTIPLE NOC LAYERS FOR ISOLATION OR AVOIDING NOC TRAFFIC CONGESTION - Systems and methods described herein are directed to solutions for Network on Chip (NoC) interconnects that automatically and dynamically determines the number of layers needed in a NoC interconnect system based on the bandwidth requirements of the system traffic flows. The number of layers is dynamically allocated and minimized by performing load balancing of the traffic flows between the channels and routes of different NoC layers as they are mapped. Additional layers may be allocated to provide the additional virtual channels that may be needed for deadlock avoidance and to maintain the isolation properties between various system flows. Layer allocation for additional bandwidth and additional virtual channels (VCs) may be performed in tandem. | 07-31-2014 |
20140331027 | ASYMMETRIC MESH NOC TOPOLOGIES - A method of interconnecting blocks of heterogeneous dimensions using a NoC interconnect with sparse mesh topology includes determining a size of a mesh reference grid based on dimensions of the chip, dimensions of the blocks of heterogeneous dimensions, relative placement of the blocks and a number of host ports required for each of the blocks of heterogeneous dimensions, overlaying the blocks of heterogeneous dimensions on the mesh reference grid based on based on a guidance floor plan for placement of the blocks of heterogeneous dimensions, removing ones of a plurality of nodes and corresponding ones of links to the ones of the plurality of nodes which are blocked by the overlaid blocks of heterogeneous dimensions, based on porosity information of the blocks of heterogeneous dimensions, and mapping inter-block communication of the network-on-chip architecture over remaining ones of the nodes and corresponding remaining ones of the links | 11-06-2014 |