Patent application number | Description | Published |
20110029354 | METHOD AND SYSTEM FOR PROVIDING INFORMATION ABOUT BRAND PROFILING OF CELEBRITIES BY USING ONLINE PROCESSING SYSTEM - A method of online providing brand profiling information of a celebrity, the method including the operations of having a brand selected for each product category by a plurality of connectors who connect to a website, and having a person selected, wherein the person is approved to match well with the brand; increasing a number indicating how many times the person is selected whenever the person is selected by the plurality of connectors, and when the number exceeds a predetermined reference, changing data indicating whether the person needs to be requested to open his/her brand profiling into an open status, and extracting the person the data of whom is changed to the open status; requesting the person for performing brand profiling; having the person select a brand for the each product category; and opening the brand selected by the person. | 02-03-2011 |
20110161359 | METHOD AND APPARATUS FOR SEARCHING FOR SUBJECTIVE ANALYSIS ACCORDING TO MENTAL STATUS - A method and system for writing and searching for subjective definitions, opinions, and feelings about a predetermined issue such as a word and a phrase. The method includes receiving from a first user who access a server system a selection about a predetermined issue, receiving a selection about at least one layer from among a plurality of layers that are generated with regard to the predetermined issue, and receiving a subjective analysis about the predetermined issue that belongs to the selected layer, wherein the selections and subjective analysis are performed by the server system; storing in the server system the subjective analysis with regard to the issue according to a layer; storing information for determining whether second users accessing the server system have an access right to a layer assigned by the first user; searching the analysis storage unit accessing the server system so as to determine whether the subjective analysis about an issue requested by the second user is stored in the analysis storage unit; and outputting a subjective analysis that belongs to a layer to which is allowed to be accessed by the access information determination unit from among searched subjective analyses, wherein the plurality of layers are divided according to information including an access right to the subjective analysis. | 06-30-2011 |
20130144664 | METHOD FOR SELLING TICKET BY AUCTION AND SYSTEM THEREOF - Provided are a system and a method for selling a ticket by auction. The system includes: a bidding price input unit which receives the number of tickets sold in the auction and bidding prices from accessed bidders; an auctioned rank calculator which calculates auctioned ranks estimated when the auction is ended, by using the bidding prices of the bidders and calculating an expected lowest successful bidding price which is a bidding price to be input by the bidder so that the bidder is a successful bidder, by using a total number of tickets sold; and an auctioned price calculator which calculates an auctioned price of each successful bidder of the auction when the auction is ended, wherein if the bidder bids at a price lower than the expected lowest successful bidding price, the bidding price input unit does not accept bidding of the bidder. | 06-06-2013 |
20140032367 | SYSTEM AND METHOD OF PROVIDING RECOMMENDED ARTICLE CORRESPONDING TO USER'S CRITERIA - Provided are a system and method of providing a recommended article corresponding to a user's criteria. The system includes a recommender information storing unit that stores information of recommenders recommending articles; a recommended article registering unit where the articles recommended by the recommenders are registered; a recommendation criteria storing unit that receives recommendation criteria from users wanting to receive recommended articles, the recommendation criteria including recommender selection criteria for recommenders from whom the users want to receive the recommended articles; a recommended article extracting unit that extracts articles recommended by the recommender corresponding to the recommender selection criteria, as the recommended articles, according to criteria registered in the recommendation criteria storing unit; and a recommended article providing unit that provides the extracted recommended articles to the users. | 01-30-2014 |
Patent application number | Description | Published |
20140083859 | BIOFUNCTIONAL NANOFIBERS FOR ANALYTE SEPARATION IN MICROCHANNELS - A method is provided for producing, in a substrate, an enclosed channel or enclosed cavity comprising at least one functional nanofiber, the method comprising the steps of providing a first substrate and a second substrate; forming a channel or cavity on the first substrate or the second substrate; electrospinning at least one functional nanofiber on the first substrate; assembling the first and second substrates, wherein the first substrate is placed over the second substrate, or the second substrate is placed over the first substrate; and bonding the first substrate and the second substrate to form the substrate, thereby forming an enclosed channel or enclosed cavity comprising the at least one functional nanofiber in the substrate. An enclosed channel or cavity comprising at least one functional electrospun nanofiber is also provided. A microfluidic device is also provided comprising an enclosed channel or cavity comprising at least one functional electrospun nanofiber. | 03-27-2014 |
20150044464 | CHARGED NANOFIBERS AND METHODS FOR MAKING - Described herein are nanofibers and methods for making nanofibers that include any one or more of (a) a non-homogeneous charge density; (b) a plurality of regions of high charge density; and/or (c) charged nanoparticles or chargeable nanoparticles. In one aspect, the present invention fulfills a need for filtration media that are capable of both high performance (e.g., removal of particle sizes between 0.1 and 0.5 ?m) with a low pressure drop, however the invention is not limited in this regard. | 02-12-2015 |
20150287967 | CERAMIC NANOFIBER SEPARATORS - Provided herein are ceramic nanofibers and processes for preparing the same. In specific examples, provided herein are ceramic nanofiber mats for use as separators in batteries, particularly lithium ion batteries. | 10-08-2015 |
Patent application number | Description | Published |
20090055132 | DETERMINING SITUATIONAL PATTERNS OF USE FOR COMPUTING SYSTEMS - Techniques for determining situational patterns of use of computing systems are disclosed. A situational pattern of use can be determined based on the situations encountered by the computing system as the situations occur without having to predefine a set of situations. Generally, a situation can be determined and/or defined based on the context of use of the computing system when the use occurs. The context of use can, for example, be determined based on internal and external variables including the physical environment where a device is used and biological data associated with a person who uses the device. The state of use of the computing system can, for example, be determined based on the state (or status) of one or more components of the computing system (e.g., the state of one or more active applications that are being used by person). Similar to the context of use, the state of use can be determined as the use occurs without having to predefine potential uses of the computing system (e.g., there is no need to predefine or know the applications that will be used on a device). Moreover, the state of use can be connected to context of use defining a situation in which the state of use has occurred to allow determining a pattern of use of the computing system at least based on the association of the state of use with the situation effectively defined by the contextual usage data which can be obtained as and when the use occurs. | 02-26-2009 |
20090307262 | SITUATION-DEPENDENT RECOMMENDATION BASED ON CLUSTERING - Data relating to usage patterns of the user is stored, wherein the data includes an application portion having information as to items which were used and a context portion having information as to the context in which the items were used. The data is clustered into clusters of data points and centroid are computed, wherein the centroid includes an application portion and a context portion. Clusters similar to a current context of the user are selected by comparing a data point representing the current context of the user to the context portions of one or more of the centroids. For each of one or more items, a expectation value that the user wishes to use the corresponding item is computed, based on the application portions of the selected similar clusters, wherein the expectation values are used to recommend one or more of the items. | 12-10-2009 |
Patent application number | Description | Published |
20090031275 | Method and System for Performing Global Routing on an Integrated Circuit Design - A method for performing global routing on an integrated circuit design is disclosed. The integrated circuit design is initially divided into multiple G-cells. The G-cells are interconnected by a set of nets. The set of nets is then decomposed into corresponding wires. The wires are prerouted to interconnect the G-cells. BoxRouting is performed on the wires until all the wires are routed. Finally, postrouting is performed on the wires. | 01-29-2009 |
20130055176 | SOFT HIERARCHY-BASED PHYSICAL SYNTHESIS FOR LARGE-SCALE, HIGH-PERFORMANCE CIRCUITS - In one embodiment, the invention is a method and apparatus for soft hierarchy-based synthesis for large-scale, high-performance circuits. One embodiment of a method for physically synthesizing a design of an integrated circuit includes compiling a logical description of the design into a flattened netlist, extracting a soft hierarchy from the flattened netlist, wherein the soft hierarchy defines a boundary on a die across which cells of the integrated circuit are permitted to move, and placing a cell of the integrated circuit on the die in accordance with the soft hierarchy. | 02-28-2013 |
20130132915 | NETWORK FLOW BASED DATAPATH BIT SLICING - The present disclosure relates to a computer-based method and apparatus for determining datapath bit slices. A first two-way search is performed between an input vector and an output vector to identify gates in a datapath. A network flow is then constructed including the gates identified, and a min-cost max-flow algorithm is applied to the network flow to derive matching bit pairs between the input vector and the output vector. Next, the datapath bit slices are determined by performing a second two-way search between each of a starting bit in the input vector and an ending bit in the output vector of each of the matching bit pairs. | 05-23-2013 |
20130263068 | RELATIVE ORDERING CIRCUIT SYNTHESIS - Systems and methods for relative ordering circuit synthesis are provided herein. One aspect provides for generating at least one circuit design via at least one processor accessible by a computing device; wherein generating at least one circuit design comprises: generating at least one relative order structure based on at least one circuit design layout, the at least one relative order structure comprising at least one placement constraint associated with at least one circuit element; placing the at least one circuit element associated with the at least one placement constraint within a circuit design according to the at least one placement constraint; and placing circuit elements not associated with the at least one placement constraint within the circuit design. Other embodiments and aspects are also described herein. | 10-03-2013 |
20130326451 | Structured Latch and Local-Clock-Buffer Planning - Latches and local-clock-buffers are automatically placed during integrated circuit physical synthesis. Prior to physically laying out the datapath, locations are assigned for the latches based on a logical representation of the datapath and on the fixed placements of pins. The computed latch locations optimize the datapath according to some predetermined criteria. Local-clock-buffers are also preplaced together with the latches further improving datapath performance. | 12-05-2013 |
20150052298 | MAPPING A LOOKUP TABLE TO PREFABRICATED TCAMS - Access is obtained to a truth table having a plurality of rows, each including a plurality of input bits and a plurality of output bits. At least some rows include don't-care inputs. At least some of the rows are clustered into a plurality of multi-row clusters. At least some of the multi-row clusters are assigned to ternary content-addressable memory modules of a prefabricated programmable memory array. Instructions for interconnecting the ternary content-addressable memory modules with a plurality of input pins of the prefabricated programmable memory array and a plurality of output pins of the prefabricated programmable memory array are specified in a data structure, in order to implement the truth table. | 02-19-2015 |
20150212797 | RADIX SORT ACCELERATION USING CUSTOM ASIC - An information processing system, computer readable storage medium, and method for accelerated radix sort processing of data elements in an array in memory. The information processing system stores an array of data elements in a buffer memory in an application specific integrated circuit radix sort accelerator. The array has a head end and a tail end. The system radix sort processing, with a head processor, data elements starting at the head end of the array and progressively advancing radix sort processing data elements toward the tail end of the array. The system radix sort processing, with a tail processor, data elements starting at the tail end of the array and progressively advancing radix sort processing data elements toward the head end of the array, the tail processor radix sort processing data elements in the array contemporaneously with the head processor radix sort processing data elements in the array. | 07-30-2015 |
20150213076 | PARALLELIZED IN-PLACE RADIX SORTING - Systems and methods for sorting a data set. Data items each having a first portion and a second portion is stored. The first and second portions are stored separately and each has a separate set of keys. The first portion has a pointer indicating the second portion. At least some of the first set of keys for each data item is stored in a local memory of a first processor. At least one data stripe set is defined with one stripe within each bucket. An in-place partial bucket radix sort is performed on data items within one data stripe set with a first processor using an initial key. Incorrectly sorted data items are grouped into respective incorrect data item groups within each bucket. A radix sort is then performed using the initial radix on the incorrect data item groups. A first level sorted output is produced. | 07-30-2015 |
20150213114 | PARALLELIZED IN-PLACE RADIX SORTING - Systems and methods for sorting a data set. A data storage is divided into a plurality of buckets that is each associated with a respective key value. A plurality of stripes is identified in each bucket. At least one data stripe set is defined that has one stripe within each respective bucket. An in-place partial bucket radix sort is performed on data items contained within one data stripe set with a first processor using an initial radix. Incorrectly sorted data items are then grouped in each bucket into a respective incorrect data item group within each bucket. A radix sort is then performed using the initial radix on the items within the respective incorrect data item group. A first level sorted output is produced. | 07-30-2015 |
20150293957 | RADIX SORT ACCELERATION USING CUSTOM ASIC - An information processing system, computer readable storage medium, and method for accelerated radix sort processing of data elements in an array in memory. The information processing system stores an array of data elements in a buffer memory in an application specific integrated circuit radix sort accelerator. The array has a head end and a tail end. The system radix sort processing, with a head processor, data elements starting at the head end of the array and progressively advancing radix sort processing data elements toward the tail end of the array. The system radix sort processing, with a tail processor, data elements starting at the tail end of the array and progressively advancing radix sort processing data elements toward the head end of the array, the tail processor radix sort processing data elements in the array contemporaneously with the head processor radix sort processing data elements in the array. | 10-15-2015 |
20150301799 | PARALLELIZED IN-PLACE RADIX SORTING - Methods for sorting a data set. Data items each having a first portion and a second portion is stored. The first and second portions are stored separately and each has a separate set of keys. The first portion has a pointer indicating the second portion. At least some of the first set of keys for each data item is stored in a local memory of a first processor. At least one data stripe set is defined with one stripe within each bucket. An in-place partial bucket radix sort is performed on data items within one data stripe set with a first processor using an initial key. Incorrectly sorted data items are grouped into respective incorrect data item groups within each bucket. A radix sort is then performed using the initial radix on the incorrect data item groups. A first level sorted output is produced. | 10-22-2015 |
20150302038 | PARALLELIZED IN-PLACE RADIX SORTING - Methods for sorting a data set. A data storage is divided into a plurality of buckets that is each associated with a respective key value. A plurality of stripes is identified in each bucket. At least one data stripe set is defined that has one stripe within each respective bucket. An in-place partial bucket radix sort is performed on data items contained within one data stripe set with a first processor using an initial radix. Incorrectly sorted data items are then grouped in each bucket into a respective incorrect data item group within each bucket. A radix sort is then performed using the initial radix on the items within the respective incorrect data item group. A first level sorted output is produced. | 10-22-2015 |
Patent application number | Description | Published |
20140141375 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a composition comprising a graft block copolymer comprising a copolymer comprising a backbone polymer; and a first graft polymer that comprises a surface energy reducing moiety; the first graft polymer being grafted onto the backbone polymer; where the surface energy reducing moiety comprises a fluorine atom, a silicon atom, or a combination of a fluorine atom and a silicon atom; a photoacid generator; and a crosslinking agent. | 05-22-2014 |
20140141376 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a composition comprising a graft block copolymer comprising a first block polymer; the first block polymer comprising a backbone polymer and a first graft polymer; where the first graft polymer comprises a surface energy reducing moiety; and a second block polymer; the second block polymer being covalently bonded to the first block; wherein the second block comprises the backbone polymer and a second graft polymer; where the second graft polymer comprises a functional group that is operative to crosslink the graft block copolymer; a photoacid generator; and a crosslinking agent. | 05-22-2014 |
20140142249 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a graft block copolymer comprising a first block polymer; the first block polymer comprising a backbone polymer and a first graft polymer; where the first graft polymer comprises a surface energy reducing moiety; and a second block polymer; the second block polymer being covalently bonded to the first block; wherein the second block comprises the backbone polymer and a second graft polymer; where the second graft polymer comprises a functional group that is operative to crosslink the graft block copolymer. | 05-22-2014 |
20140142252 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a copolymer comprising a backbone polymer; and a first graft polymer that comprises a surface energy reducing moiety; the first graft polymer being grafted onto the backbone polymer; where the surface energy reducing moiety comprises a fluorine atom, a silicon atom, or a combination of a fluorine atom and a silicon atom. | 05-22-2014 |
20150072291 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a graft block copolymer comprising a first block polymer; the first block polymer comprising a backbone polymer and a first graft polymer; where the first graft polymer comprises a surface energy reducing moiety that comprises a halocarbon moiety, a silicon containing moiety, or a combination of a halocarbon moiety and a silicon containing moiety; a second block polymer; the second block polymer being covalently bonded to the first block; wherein the second block comprises the backbone polymer and a second graft polymer; where the second graft polymer comprises a functional group that is operative to undergo acid-catalyzed deprotection causing a change of solubility of the graft block copolymer in a developer solvent. | 03-12-2015 |
20150072292 | SELF-ASSEMBLED STRUCTURES, METHOD OF MANUFACTURE THEREOF AND ARTICLES COMPRISING THE SAME - Disclosed herein is a photoresist composition comprising a graft block copolymer; a solvent and a photoacid generator; where the graft block copolymer comprises a first block polymer; the first block polymer comprising a backbone polymer and a first graft polymer; where the first graft polymer comprises a surface energy reducing moiety that comprises a halocarbon moiety or a silicon containing moiety; and a second block polymer; the second block polymer being covalently bonded to the first block; wherein the second block comprises the backbone polymer and a second graft polymer; where the second graft polymer comprises a functional group that is operative to undergo deprotection and alter the solubility of the graft block copolymer; where the graft block copolymer has a bottle brush topology. | 03-12-2015 |
Patent application number | Description | Published |
20090052448 | METHODS AND SYSTEMS TO STORE STATE USED TO FORWARD MULTICAST TRAFFIC - Methods and systems are described to store state used to forward multicast traffic. The system includes a receiving module to receive request to add a first node to a membership tree. The membership tree includes a first plurality of nodes associated with a multicast group. The system further includes a processing module to identify a second node in the first plurality of nodes and to communicate a node identifier that identifies the first node over a network to the second node. The node identifier is to be stored at the second node to add the first node to the membership tree. The node identifier is further to be stored in the membership tree exclusively at the second node to enable the second node to forward the multicast traffic to the first node. | 02-26-2009 |
20090052449 | MULTICAST WITH ADAPTIVE DUAL-STATE - A method and system are described to multicast with an adaptive dual state. The system receives multicast traffic over a membership tree including a first plurality of nodes connected in a first topology destined for a plurality of multicast members of a first multicast group. Next, the system determines a rate of multicast traffic that exceeds a predetermined threshold based on the receiving the multicast traffic. Next, the system generates a dissemination tree including a second plurality of nodes connected in a second topology to reduce a number of hops to communicate the multicast traffic to the plurality of multicast members of the first multicast group. Finally, the system forwards the multicast traffic to the plurality of multicast members of the first multicast group over the dissemination tree. | 02-26-2009 |
20090063681 | Systems and methods for distributing video on demand - A method of providing content comprises making the content available on a central server, and surveying a plurality of peers for a portion of the content. The portion of the content from one of the peers is obtained when the portion of the content is available from the one of the peers, and obtained from the central server when the portion of the content is not available from the plurality of peers. | 03-05-2009 |
20100138443 | User-Powered Recommendation System - Recommendation systems are widely used in Internet applications. In current recommendation systems, users only play a passive role and have limited control over the recommendation generation process. As a result, there is often considerable mismatch between the recommendations made by these systems and the actual user interests, which are fine-grained and constantly evolving. With a user-powered distributed recommendation architecture, individual users can flexibly define fine-grained communities of interest in a declarative fashion and obtain recommendations accurately tailored to their interests by aggregating opinions of users in such communities. By combining a progressive sampling technique with data perturbation methods, the recommendation system is both scalable and privacy-preserving. | 06-03-2010 |
20120033582 | METHODS AND SYSTEMS TO STORE STATE USED TO FORWARD MULTICAST TRAFFIC - A method and system are described to multicast with an adaptive dual state. The system receives multicast traffic over a membership tree including a first plurality of nodes connected in a first topology destined for a plurality of multicast members of a first multicast group. Next, the system determines a rate of multicast traffic that exceeds a predetermined threshold based on the receiving the multicast traffic. Next, the system generates a dissemination tree including a second plurality of nodes connected in a second topology to reduce a number of hops to communicate the multicast traffic to the plurality of multicast members of the first multicast group. Finally, the system forwards the multicast traffic to the plurality of multicast members of the first multicast group over the dissemination tree. | 02-09-2012 |